Mathematics > Optimization and Control
[Submitted on 1 Jun 2021 (v1), last revised 4 Apr 2023 (this version, v2)]
Title:An arbitrary-order predefined-time exact differentiator for signals with exponential growth bound
View PDFAbstract:There is a growing interest in differentiation algorithms that converge in fixed time with a predefined Upper Bound on the Settling Time (UBST). However, existing differentiation algorithms are limited to signals having an $n$-th order Lipschitz derivative. Here, we introduce a general methodology based on time-varying gains to circumvent this limitation, allowing us to design $n$-th order differentiators with a predefined UBST for the broader class of signals whose $(n+1)$-th derivative is bounded by a function with bounded logarithmic derivative. Unlike existing methods whose time-varying gain tends to infinity, our approach yields a time-varying gain that remains bounded at convergence time. We show how this last property maintains exact convergence using bounded gains when considering a compact set of initial conditions and improves the algorithm's performance to measurement noise.
Submission history
From: David Gómez-Gutiérrez [view email][v1] Tue, 1 Jun 2021 22:05:42 UTC (743 KB)
[v2] Tue, 4 Apr 2023 15:37:08 UTC (335 KB)
Current browse context:
math.OC
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.