Preprint
Article

This version is not peer-reviewed.

Exact Exponential Convergence and Perturbation Bounds for Higher-Order Serial Differentiators: A Strict Lyapunov Analysis

Submitted:

01 November 2026

Posted:

04 November 2026

You are already at the latest version

Abstract
This paper establishes exponential convergence to zero, rather than to a residual neighborhood, for a first-order serial differentiator and its higher-order cascade. If the acceleration of the input is locally absolutely continuous with known acceleration and jerk bounds, appropriate gain conditions yield an exponential estimate that is uniform on every prescribed initial energy sublevel. The Lyapunov function is the energy of the error system plus a quadratic correction that makes it strict. For a nominal input observed through a continuous perturbation with a persistent amplitude, a practical exponential estimate with residual holds, without any smallness condition, and exact exponential convergence is retained without perturbation. This amplitude-only transfer applies to the nonsmooth interstage error of a serial differentiator. With an exact first input it closes an exact exponential induction over any fixed finite number of stages under stagewise rate conditions.
Keywords: 
;  ;  ;  ;  

MSC:  93D05; 93D23; 93B12; 93C10; 34A36

1. Introduction

The higher-order serial differentiator (HOSD) reconstructs the derivatives of a measured signal with a cascade of identical first-order stages. It was introduced as a first-order switching differentiator in [1] and extended to the serial cascade in [2]. Each stage contains a stable linear filter and an integral relay: the filter state tracks the stage input, and the relay, acting through an integrator, drives the stage output toward the derivative of that input. A derivative of any order is therefore obtained by appending stages with the same two-gain structure. Robust exact differentiators based on sliding modes, by contrast, attain finite-time exactness under suitable signal regularity through fractional-power output-injection terms [3,4], and arbitrary-order constructions with convergence uniform in the initial differentiation error are also available [5]. The convergence of the HOSD has since been analyzed with increasing strength [6,7], as reviewed below, and a forward-Euler discretization with an explicit steady-state error bound has been given for digital implementation [8].
A differentiator usually appears inside a control scheme rather than as an end in itself, so its accuracy and convergence rate enter the closed-loop guarantee directly. The HOSD has served in this role in a line of controllers for uncertain nonlinear systems: a differentiator-based adaptive feedback linearization scheme [9] and differentiator-based uncertainty cancelling (DBUC) controllers in continuous time with output feedback [10] and in discrete time with state and output feedback [11], in which HOSD stages estimate the lumped uncertainty and, under output feedback, the unmeasured derivatives of the tracking error. It has also been adopted outside this line of work, in observer-based anti-swing controllers for crane systems [12,13], observer-based trajectory-tracking controllers for wheeled mobile robots [14,15], a finite-time sliding-mode controller for perturbed second-order systems [16], and online stiffness estimation for variable-stiffness actuators [17].
This paper focuses on verifiable sufficient conditions for exponential convergence via Lyapunov method. In addition to an acceleration bound, the analysis uses a jerk budget and relates it explicitly to the two differentiator gains. The resulting nominal contraction is then transferred to perturbed inputs and propagated through serial interconnections. In a serial cascade, every stage after the first is driven by the output of the preceding stage, so its input contains the preceding estimation error. That error is Lipschitz but generally not differentiable, and it is known only through an amplitude bound. The same information pattern arises when a serial differentiator reconstructs unmeasured derivatives inside a control loop, as in the differentiator-based adaptive feedback linearization scheme of [9] and the differentiator-based uncertainty cancelling scheme of [10]. Both certify quasi-exponential convergence of the tracking error, and in both the tolerance is inherited from the estimator rather than from the control law; Remark 6 returns to this point.
The contributions are threefold. First, under bounds on the acceleration of the input and on its rate, a self-contained Lyapunov condition on the two gains certifies exponential convergence of the estimation error to zero, with no residual neighborhood, uniformly on prescribed initial energy sublevels. Second, the same Lyapunov function transfers that estimate to a continuous input perturbation known only through its amplitude: a persistent amplitude leaves a residual of the order of its fourth root, an exponentially vanishing one leaves none, and neither a derivative of the perturbation nor a smallness condition on its amplitude is required. Third, because this is exactly the information available about the nonsmooth interstage error, the estimates propagate through any fixed finite serial cascade, exactly when the first input is exact. The cascade results hold for a fixed number of stages whose nominal derivatives satisfy the corresponding bounds, the certified rates and residual exponents are conservative, and the constants are not uniform in the stage index.
The architecture analyzed here has been studied in a sequence of earlier works, against which the present contribution is best stated. The switching differentiator of [1] was shown to be asymptotically convergent for a single stage, and [2] extended the asymptotic analysis to the higher-order serial cascade by successive application of a generalized Barbalat lemma; neither argument certifies a convergence rate. A rate was obtained in [6], where the estimation errors of the cascade were shown to converge exponentially fast to an arbitrarily small neighborhood of zero for an exact input, so a residual neighborhood remained and a corrupted measurement was not covered. The perturbed case was treated in [7] under a uniform amplitude bound d ¯ and a non-accumulation condition on the switching instants, where the estimation error was shown to be quasi-exponentially convergent: for every ε > 0 a bound μ e − λ t + ε holds with μ and λ depending on ε , and the perturbed bound carries a steady-state term proportional to d ¯ . Each of these analyses assumes a bound on the acceleration alone.
The present paper differs in three respects. First, the convergence certified here is exponential in the ordinary sense, with one decay rate and with convergence to zero rather than to a neighborhood: a strict Lyapunov function, the energy of the error system plus a quadratic correction, yields an explicit rate together with a verifiable gain condition. The price is one further regularity requirement, a jerk bound, which that condition ties to both differentiator gains. Second, the analysis is carried out for maximal Filippov solutions throughout, so neither a case distinction on sliding nor a non-accumulation condition on the switching instants is imposed; the thin layer in which the relay sign can be corrupted is bounded directly instead. Third, the perturbation is required only to be continuous and amplitude-bounded. It is never differentiated and its amplitude is not assumed small, which is exactly the information pattern of the nonsmooth interstage error in a serial cascade. The residual exponents certified here are conservative, and no optimality is claimed for them.
The remainder of the paper is organized as follows. Section 2 introduces the Filippov notation. Section 3 treats the first-order estimator without perturbation and under uniformly bounded, mixed, and exponentially vanishing amplitude-only perturbations. Section 4 treats the serial cascade with a bounded and with an exact first input, and Section 5 concludes.

2. Preliminaries

For a vector, | · | denotes the Euclidean norm; for a scalar it denotes absolute value. Discontinuous dynamics are understood in the Filippov sense, with
Sgn ( r ) = { 1 } , r > 0 , [ − 1 , 1 ] , r = 0 , { − 1 } , r < 0 .
The corresponding single-valued sign is
Sgn ( r ) = 1 , r > 0 , 0 , r = 0 , − 1 , r < 0 .

3. First-Order Derivative Estimator

Consider the first-order serial differentiator
α ˙ = κ ( a − α ) + σ ,
σ ˙ ∈ L Sgn ( a − α ) ,
where κ , L > 0 . Define the tracking and derivative-estimation errors by
e = a − α , w = a ˙ − σ .
Whenever a ˙ is locally absolutely continuous, these errors satisfy
e ˙ = − κ e + w , w ˙ ∈ a ¨ − L Sgn ( e ) .
Our first objective is a verifiable rate-dependent condition for exponential convergence. Our second objective is to transfer this estimate to an additive input perturbation without differentiating that perturbation. The same Lyapunov function, combined with an integral bound over the thin layer in which the relay sign can be corrupted, gives a practical exponential estimate for a persistent amplitude of any prescribed size and exact exponential transfer for an exponentially vanishing amplitude.

3.1. No Input Perturbation

We impose bounds on both the acceleration magnitude and its temporal rate. The following condition is sufficient; it is not claimed to be necessary or sharp.
Lemma 1
(Exponential sufficient condition). Suppose a has a locally absolutely continuous second derivative and constants D a , N a ≥ 0 satisfy
| a ¨ ( t ) | ≤ D a , | a ⃛ ( t ) | ≤ N a
almost everywhere. If
L > D a , κ > N a L − D a ,
then every solution of e and w from an arbitrary finite initial state exponentially converges to zero.
Proof. 
Step 1: Lyapunov function. Under L > D a , the second inequality in (6) is equivalent to κ ( L − D a ) > N a , which is the form used in the later results. Put
b = L − D a , μ = 1 2 κ + N a b , q = μ ( κ − μ ) 2 .
By (6), b > 0 and N a / b < κ , so μ is the midpoint of the interval ( N a / b , κ ) and q > 0 . With Δ = κ b − N a > 0 , the midpoint choice gives
κ − μ = Δ 2 b , μ b − N a = Δ 2 .
With A = a ¨ , define
V a = 1 2 p 2 + L | e | − A e + q e 2 , p = w − ( κ − μ ) e .
Expanding p 2 and using 2 q = μ ( κ − μ ) shows that V a = H + Q , where
H = 1 2 w 2 + L | e | − A e , Q = − ( κ − μ ) e w + 1 2 κ ( κ − μ ) e 2 .
Thus V a is the energy H of the error system (4) plus a quadratic correction Q in ( e , w ) .
Step 2: dissipation. Let s be the measurable selection with w ˙ = A − L s and s ∈ Sgn ( e ) . Then d d t | e | = s e ˙ almost everywhere: this is the chain rule where e ≠ 0 , and on every positive-measure subset on which e = 0 , absolute continuity gives e ˙ = 0 almost everywhere. Let ν = w − κ e = e ˙ . Using (4) and s e = | e | , direct differentiation gives
H ˙ = − κ ( L | e | − A e ) − A ˙ e , Q ˙ = − ( κ − μ ) ν 2 + ( κ − μ ) ( L | e | − A e ) ,
and therefore
V ˙ a = − ( κ − μ ) ν 2 − μ ( L | e | − A e ) − A ˙ e .
The energy H alone dissipates only through | e | . The correction Q transfers the part κ − μ of that dissipation to the term − ( κ − μ ) ν 2 , which makes V a a strict Lyapunov function. By (5) and (8),
V ˙ a ≤ − ( κ − μ ) ν 2 − ( μ b − N a ) | e | ≤ − c a ( ν 2 + | e | ) , c a = Δ 2 max { b , 1 } .
In particular, V a is nonincreasing. Since L | e | − A e ≥ b | e | and q > 0 ,
V a ≥ 1 2 p 2 + b | e | .
Step 3: sublevel-uniform estimate. The error inclusion (4) has compact convex values and linear growth, so its maximal Filippov solutions are complete. Fix a level ℓ > 0 and consider a solution with V a ( 0 ) ≤ ℓ . Since V a is nonincreasing, (12) gives | e | ≤ ℓ / b and hence e 2 ≤ ( ℓ / b ) | e | . Since p = ν + μ e gives 1 2 p 2 ≤ ν 2 + μ 2 e 2 ,
V a ≤ C ℓ ( ν 2 + | e | ) , C ℓ = max 1 , L + D a + ( μ 2 + q ) ℓ b .
Combining this estimate with (11) yields
V ˙ a ≤ − ρ ℓ V a , ρ ℓ = c a C ℓ ,
and therefore V a ( t ) ≤ ℓ e − ρ ℓ t . By (12),
| e ( t ) | ≤ ℓ b e − ρ ℓ t , | p ( t ) | ≤ 2 ℓ e − ρ ℓ t / 2 .
Since w = p + ( κ − μ ) e ,
| e ( t ) | + | w ( t ) | ≤ M ℓ e − λ ℓ t , t ≥ 0 ,
with
λ ℓ = ρ ℓ 2 , M ℓ = 2 ℓ + ( 1 + κ − μ ) ℓ b .
The constants M ℓ and λ ℓ depend only on κ , L , D a , N a , and ℓ, so (14) holds with the same constants for every solution in the sublevel V a ( 0 ) ≤ ℓ .
Step 4: conclusion. For an arbitrary finite initial state ( e ( 0 ) , w ( 0 ) ) , V a ( 0 ) is finite. Taking any ℓ > 0 with ℓ ≥ V a ( 0 ) in (14) shows that e and w converge to zero exponentially. □
Remark 1
(Rate budget). Bounds (5) and condition (6) couple the differentiator gains to both the acceleration budget D a and the jerk budget N a . In (10), the term − A ˙ e must be dominated by the restoring margin μ b | e | , while the dissipation of e ˙ 2 requires μ < κ . A constant μ with both properties exists precisely under (6). The midpoint choice (7) splits the margin Δ = κ b − N a equally between the two dissipation terms, as (8) shows. This explains why a jerk budget enters the sufficient condition. The condition need not be necessary or sharp and may therefore be conservative.

3.2. Uniformly Bounded Input Perturbation

We drive the differentiator by f = a + d :
α ˙ = κ ( f − α ) + σ ,
σ ˙ ∈ L Sgn ( f − α ) .
With e = a − α and w = a ˙ − σ , the errors satisfy
e ˙ = − κ e + w − κ d , w ˙ ∈ a ¨ − L Sgn ( e + d ) ,
which reduces to (4) for d ≡ 0 . The perturbation enters the relay argument. It can change the relay sign only where the signs of e and e + d differ, that is, in the thin layer 0 < | e | ≤ | d | . The analysis below bounds the effect of this layer by a time integral and requires no derivative of d. Only an amplitude bound is assumed.
The following lemma is the only place where the layer enters. It bounds the time integral of | w | over the layer by a quantity of order E , although | w | itself need not be small there.
Lemma 2
(Layer integral). Let J be an interval of length T, and let B > 0 and E ≥ 0 . Suppose that, on J, e is C 1 , w is Lipschitz with | w ˙ | ≤ B almost everywhere, and e ˙ = w + ζ with | ζ | ≤ 2 κ E whenever | e | ≤ E . Then
∫ J | w | 1 { | e | ≤ E } d t ≤ 4 W ^ T + W ^ B , W ^ = B E + 4 κ E .
Proof. 
If E = 0 , the integrand vanishes. Otherwise put τ = W ^ / B and split J into at most T / τ + 1 consecutive subintervals I of length at most τ . If | w | ≤ 2 W ^ on I, the contribution of I is at most 2 W ^ τ . Otherwise | w ( t ′ ) | > 2 W ^ for some t ′ ∈ I , and | w ˙ | ≤ B gives | w − w ( t ′ ) | ≤ W ^ on I. Hence w has a fixed sign S and | w | > W ^ on I. Where in addition | e | ≤ E , S e ˙ ≥ | w | − 2 κ E ≥ | w | / 2 > 0 , because W ^ ≥ 4 κ E . Thus S e strictly increases whenever it lies in [ − E , E ] , so it can neither re-enter [ − E , E ] through E nor leave it through − E . The set I ∩ { | e | ≤ E } is therefore an interval on which | w | ≤ 2 S e ˙ , and its contribution is at most 2 · 2 E = 4 E . Since W ^ τ = W ^ 2 / B ≥ E , every subinterval contributes at most 4 W ^ τ , and summing gives (18). □
Theorem 1
(Bounded amplitude-only transfer). Suppose a ¨ is locally absolutely continuous and constants D a , N a ≥ 0 satisfy
| a ¨ ( t ) | ≤ D a , | a ⃛ ( t ) | ≤ N a , κ ( L − D a ) > N a
almost everywhere. Fix D ¯ ≥ 0 . If d is continuous and | d ( t ) | ≤ D for all t ≥ 0 with D ∈ [ 0 , D ¯ ] , then every solution of e and w from an arbitrary finite initial state satisfies
| e ( t ) | + | w ( t ) | ≤ M e − λ t + c 1 D 1 / 4 + c 2 D 1 / 2 , t ≥ 0 ,
where the constants M , λ , c 1 , c 2 > 0 depend on the initial errors but not on D ∈ [ 0 , D ¯ ] .
Proof. 
We prove an estimate that is uniform on prescribed sets of initial errors; the later results use it in this form. Fix D ≥ 0 and R > 0 , let d be continuous with
| d ( t ) | ≤ D , t ≥ 0 ,
and consider solutions with
| a ( 0 ) − α ( 0 ) | + | a ˙ ( 0 ) − σ ( 0 ) | ≤ R .
Steps 1–4 show that every such solution satisfies
| e ( t ) | + | w ( t ) | ≤ M R e − λ R t + c R ( D ) , t ≥ 0 , c R ( D ) = c 1 , R D 1 / 4 + c 2 , R D 1 / 2 , λ R = 1 2 ρ R ,
with the explicit constants M R , ρ R , c 1 , R , c 2 , R > 0 given below. They depend only on κ , L , D a , N a , D , and R, and not on the particular perturbation d or on the nominal input a beyond the bounds ( D a , N a ) . Step 5 shows that these constants are monotone in D, and Step 6 concludes.
The inclusion (17) has compact convex values and linear growth, so every maximal Filippov solution is complete. Let b, μ , and q be given by (7), and set
B = L + D a , c = min 1 2 ( κ − μ ) , μ b − N a ,
which is positive by (8).
Step 1: Lyapunov identity. Let p = w − ( κ − μ ) e , ν = p − μ e = w − κ e , A = a ¨ , and
V = 1 2 p 2 + L | e | − A e + q e 2 .
In the unperturbed case ν = e ˙ , and V coincides with V a in (9). The function V is locally absolutely continuous and satisfies V ≥ 1 2 p 2 + b | e | . Let s be the measurable selection with w ˙ = A − L s and s ∈ Sgn ( e + d ) , and let ς = Sgn ( e ) where e ≠ 0 and ς = s where e = 0 . Then d d t | e | = ς e ˙ almost everywhere, because e ˙ = 0 almost everywhere on { e = 0 } . Moreover, ς ≠ s only where 0 < | e | ≤ | d | , since | e | > | d | implies Sgn ( e + d ) = Sgn ( e ) . Using e ˙ = p − μ e − κ d , direct differentiation gives
V ˙ = − ( κ − μ ) ν 2 − μ ( L | e | − A e ) − A ˙ e + L ( ς − s ) p + κ d ( κ − μ ) ν − L ς + A .
For d ≡ 0 this reduces to (10). Young’s inequality on κ ( κ − μ ) d ν yields
V ˙ ≤ − c ( ν 2 + | e | ) + β + γ ,
with
β = L | ς − s | | p | ≤ 2 L | p | 1 { | e | ≤ | d | } , γ = κ B | d | + 1 2 κ 2 ( κ − μ ) d 2 .
The dissipation in (25) grows with V. Indeed, p = ν + μ e gives 1 2 p 2 ≤ ν 2 + μ 2 e 2 , so
V ≤ ν 2 + B | e | + ( μ 2 + q ) e 2 .
With B 1 = max { 1 , B } , Q = μ 2 + q , and ϱ = ν 2 + | e | , this gives V ≤ B 1 ϱ + Q ϱ 2 , so V ≤ 2 B 1 ϱ or V ≤ 2 Q ϱ 2 . Hence ϱ ≥ ϕ ( V ) , where
ϕ ( v ) = min v 2 B 1 , v 2 Q
is nondecreasing and unbounded, and (25) yields
V ˙ ≤ − c ϕ ( V ) + β + γ .
Step 1 uses only the continuity of d, not the bound (21).
Step 2: window bound. Fix E ¯ ≥ 0 , and let J be an interval of length at most 1 on which | d | ≤ E for some E ∈ [ 0 , E ¯ ] . On the support of β , | p | ≤ | w | + ( κ − μ ) E . Moreover, e ˙ = w + ζ with ζ = − κ ( e + d ) , so | ζ | ≤ 2 κ E wherever | e | ≤ E , and | w ˙ | ≤ B . The right-hand side of e ˙ = − κ e + w − κ d is continuous, because w is Lipschitz and d is continuous, so e is C 1 . Lemma 2, applied with W ^ = B E + 4 κ E ≤ c W E and c W = B + 4 κ E ¯ , therefore gives
∫ J ( β + γ ) d t ≤ K E ,
where
K = 8 L c W 1 + c W E ¯ B + 2 L ( κ − μ ) + κ B E ¯ + 1 2 κ 2 ( κ − μ ) E ¯ 3 / 2 .
Every term of (30) is nondecreasing in E ¯ , so K is nondecreasing in E ¯ . In this proof E ¯ = D , so (29) holds with E = D on every interval of length at most 1.
Step 3: a priori bound. The initial set gives | p ( 0 ) | ≤ ( 1 + κ ) R , hence
V ( 0 ) ≤ V 0 : = 1 2 ( 1 + κ ) 2 R 2 + B R + q R 2 .
Put
I = K D , V * = max 4 B 1 I c , 8 Q I 2 c 2 , R V = max { V 0 , V * } + I .
By (29), β + γ integrates to at most I over every interval of length at most 1, and V ˙ ≤ β + γ by (28). Hence V increases by at most I on such an interval. Moreover, (27) gives c ϕ ( V * ) ≥ 2 I . Put m = max { V 0 , V * } , and suppose that V ( t 2 ) > m + I for some t 2 > 0 . Let t 1 = sup { t ∈ [ 0 , t 2 ] : V ( t ) ≤ m } . Then V ( t 1 ) = m , V > m on ( t 1 , t 2 ] , and t 2 − t 1 > 1 because V ( t 2 ) − V ( t 1 ) > I . On [ t 1 , t 1 + 1 ] we have V ≥ m ≥ V * , so integrating (28) gives
V ( t 1 + 1 ) ≤ m − c ϕ ( V * ) + I ≤ m − I ≤ m ,
which contradicts V ( t 1 + 1 ) > m . Therefore V ≤ R V for all t ≥ 0 . Consequently | e | ≤ R V / b , hence e 2 ≤ ( R V / b ) | e | , and (26) gives V ≤ C V ( ν 2 + | e | ) with
C V = max { 1 , B + Q R V / b } , ρ R = c / C V .
Thus (25) yields
V ˙ ≤ − ρ R V + β + γ for almost every t ≥ 0 .
Step 4: decay. Integrating (34) gives
V ( t ) ≤ e − ρ R t V 0 + ∫ 0 t e − ρ R ( t − s ) ( β + γ ) ( s ) d s .
Split [ 0 , t ] into the windows J k = [ k , k + 1 ] , k = 0 , … , ⌊ t ⌋ − 1 , and the final piece [ ⌊ t ⌋ , t ] of length at most 1. On J k the kernel is at most e − ρ R ( t − k − 1 ) , and on the final piece it is at most 1, so (29) gives
V ( t ) ≤ e − ρ R t V 0 + K D ∑ k = 0 ⌊ t ⌋ ω k , ω k = e − ρ R ( t − k − 1 ) , k < ⌊ t ⌋ , 1 , k = ⌊ t ⌋ .
Since t − k − 1 ≥ ⌊ t ⌋ − k − 1 ≥ 0 for k < ⌊ t ⌋ ,
∑ k < ⌊ t ⌋ ω k ≤ ∑ j = 0 ∞ e − ρ R j = 1 1 − e − ρ R ≤ 1 + 1 ρ R ,
and therefore
V ( t ) ≤ V 0 e − ρ R t + K D D , K D = K 2 + 1 ρ R .
Finally, | e | ≤ V / b and | w | ≤ | p | + ( κ − μ ) | e | ≤ 2 V + ( κ − μ ) V / b . Using x + y ≤ x + y and e − ρ R t ≤ e − ρ R t / 2 , this gives (23) with λ R = ρ R / 2 and
M R = 2 V 0 + ( 1 + κ − μ ) V 0 b , c 1 , R = 2 K D , c 2 , R = ( 1 + κ − μ ) K D b .
Step 5: dependence on D. The constant M R depends on V 0 only and not on D. Since K is nondecreasing in E ¯ = D , the quantity I = K D is nondecreasing in D, and so are V * , R V , and C V . Hence ρ R = c / C V and λ R = ρ R / 2 are nonincreasing in D, and K D = K ( 2 + 1 / ρ R ) , c 1 , R , and c 2 , R are nondecreasing in D. If 0 ≤ D ≤ D ¯ , the constants obtained for D ¯ therefore satisfy λ R ( D ¯ ) ≤ λ R ( D ) and c i , R ( D ¯ ) ≥ c i , R ( D ) , so the right-hand side of (23) for D is bounded by the same expression with the constants for D ¯ . Thus (23) holds with the constants obtained for D ¯ for every D ∈ [ 0 , D ¯ ] .
Step 6: conclusion. For an arbitrary finite initial state, take any R ≥ | e ( 0 ) | + | w ( 0 ) | , so that (22) holds. By Step 5, (23) with the constants obtained for D ¯ gives (20) with M = M R , λ = λ R , c 1 = c 1 , R , and c 2 = c 2 , R , none of which depends on D ∈ [ 0 , D ¯ ] . □
Remark 2
(Amplitude range). No smallness of the persistent amplitude is required, and no derivative of d is used. The a priori bound in Step 3 of the proof of Theorem 1 uses the dissipation c ϕ ( V ) , which grows with V, whereas the perturbation injects at most I into V per unit time. The constants deteriorate as D grows. By the monotonicity in Step 5, the constants obtained for a prescribed bound D ¯ are uniform on [ 0 , D ¯ ] , so with these fixed constants the residual c R ( D ) tends to zero with D. No linear gain is asserted, and no optimality of the exponent 1 / 4 is claimed.

3.3. Mixed Bounded and Exponentially Vanishing Perturbations

In a serial cascade, the input perturbation of every stage after the first contains a decaying transient in addition to a persistent part. We therefore extend Theorem 1 to an amplitude envelope with an exponentially vanishing part.
Theorem 2
(Mixed amplitude-only transfer). Suppose a ¨ is locally absolutely continuous and (19) holds almost everywhere. Fix C e ≥ 0 , γ e > 0 , and D ¯ ≥ 0 . If d is continuous and
| d ( t ) | ≤ D + C e e − γ e t , t ≥ 0 ,
with D ∈ [ 0 , D ¯ ] , then every solution of e and w from an arbitrary finite initial state satisfies
| e ( t ) | + | w ( t ) | ≤ M e − λ t + c 1 D 1 / 4 + c 2 D 1 / 2 , t ≥ 0 ,
where the constants M , λ , c 1 , c 2 > 0 depend on the initial errors but not on D ∈ [ 0 , D ¯ ] .
Proof. 
As in the proof of Theorem 1, fix R > 0 and consider solutions satisfying (22). Steps 2–4 below show that every such solution satisfies
| e ( t ) | + | w ( t ) | ≤ M R e − λ R t + c R ( D ) , t ≥ 0 , λ R = 1 4 min { ρ R , γ e / 2 } ,
with c R ( D ) = c 1 , R D 1 / 4 + c 2 , R D 1 / 2 and the explicit constants M R , ρ R , c 1 , R , c 2 , R > 0 given below. They depend only on κ , L , D a , N a , C e , γ e , D ¯ , and R, and not on the particular value of D ∈ [ 0 , D ¯ ] , on the particular perturbation d, or on the nominal input a beyond the bounds ( D a , N a ) . For an arbitrary finite initial state, taking any R ≥ | e ( 0 ) | + | w ( 0 ) | in (38) then gives (37) with M = M R , λ = λ R , c 1 = c 1 , R , and c 2 = c 2 , R .
Completeness and Step 1 of the proof of Theorem 1 use only the continuity of d, so (25) and (28) hold. Let b, μ , q, B, c, B 1 , and Q be as in that proof, put E ¯ = D ¯ + C e , and let K be given by (30) with this E ¯ .
Step 2: window bounds. Since | d | ≤ E ¯ for all t ≥ 0 , (29) with E = E ¯ shows that β + γ integrates to at most K E ¯ over every interval of length at most 1. Moreover, let J k = [ k , k + 1 ] and E k = D + C e e − γ e k , so that | d | ≤ E k ≤ E ¯ on J k . Hence (29) gives
∫ J k ( β + γ ) d t ≤ K E k ≤ K D + C e e − γ e k / 2 .
Step 3: a priori bound. Step 3 of the proof of Theorem 1, with I = K E ¯ in (32) and the same definitions of V 0 , V * , R V , C V , and ρ R = c / C V , shows that V ≤ R V and that (34) holds for almost every t ≥ 0 .
Step 4: decay. Integrating (34), splitting [ 0 , t ] as in (35), and using (39),
V ( t ) ≤ e − ρ R t V 0 + ∑ k = 0 ⌊ t ⌋ ω k K D + C e e − γ e k / 2 ,
with the weights ω k of (35). Since ω k ≤ e − ρ R ( t − k − 1 ) for every k ≤ ⌊ t ⌋ , with λ * = min { ρ R , γ e / 2 } each vanishing term is at most K C e e ρ R e − λ * t , and 1 + t ≤ ( 1 + 2 / λ * ) e λ * t / 2 . As in the proof of Theorem 1, ∑ k ω k ≤ 2 + 1 / ρ R , so the persistent terms sum to at most K D D with K D = K ( 2 + 1 / ρ R ) . Therefore
V ( t ) ≤ M V e − λ * t / 2 + K D D , M V = V 0 + K C e e ρ R 1 + 2 λ * .
Finally, as in the proof of Theorem 1, | e | ≤ V / b and | w | ≤ 2 V + ( κ − μ ) V / b give (38) with λ R = λ * / 4 and
M R = 2 M V + ( 1 + κ − μ ) M V b , c 1 , R = 2 K D , c 2 , R = ( 1 + κ − μ ) K D b .
For C e = 0 , E ¯ = D ¯ and M V = V 0 , so all constants except λ R coincide with those in (23), from the proof of Theorem 1, for D = D ¯ . □
Remark 3
(Role of the vanishing part). The exponentially vanishing part produces no separate nonzero residual term; the residual vanishes when D = 0 . The certified constants nevertheless depend on C e through E ¯ = D ¯ + C e , and M R also depends on γ e . No smallness of D ¯ or C e and no derivative of d are assumed.

3.4. Exponentially Vanishing Input Perturbation

The case D = 0 of Theorem 2 is the one used in the exact serial cascade of Section 4.2.
Corollary 1
(Exact amplitude-only exponential transfer). Suppose a ¨ is locally absolutely continuous and (19) holds almost everywhere. If d is continuous and, for some C d , γ d > 0 ,
| d ( t ) | ≤ C d e − γ d t , t ≥ 0 ,
then every solution of e and w from an arbitrary finite initial state converges exponentially to zero.
Proof. 
Apply the proof of Theorem 2 with D ¯ = D = 0 and ( C e , γ e ) = ( C d , γ d ) . Since c R ( 0 ) = 0 , (38) shows that, for every R > 0 , every solution satisfying (22) satisfies
| e ( t ) | + | w ( t ) | ≤ M R e − λ R t , t ≥ 0 , λ R = 1 4 min { ρ R , γ d / 2 } ,
where M R and ρ R depend only on κ , L , D a , N a , C d , γ d , and R. Taking any R ≥ | e ( 0 ) | + | w ( 0 ) | gives the claim. □
The rate in (41) satisfies λ R ≤ γ d / 8 . Any rate below 1 2 min { ρ R , γ d / 2 } is also admissible at the cost of a larger gain M R ; the stated form is chosen for explicit constants.

4. Higher-Order Derivative Estimator

For a serial implementation, let σ 0 denote the signal applied to the first stage and write stage j ≥ 1 as
α ˙ j = κ j ( σ j − 1 − α j ) + σ j , σ ˙ j ∈ L j Sgn ( σ j − 1 − α j ) .
Thus its input is σ j − 1 , and σ j is intended to estimate a ( j ) . Relative to the nominal stage input a ( j − 1 ) , define the interstage perturbation and the stage errors
d j = σ j − 1 − a ( j − 1 ) , e j = a ( j − 1 ) − α j , w j = a ( j ) − σ j ,
so that the relay argument is σ j − 1 − α j = e j + d j and d j + 1 = − w j . Stage j is an instance of (15) and (16) under
( κ , L , a , d , α , σ ) ↦ ( κ j , L j , a ( j − 1 ) , d j , α j , σ j ) ,
and its errors ( e , w ) become ( e j , w j ) . In particular, | σ ˙ j | ≤ L j almost everywhere, so σ j is Lipschitz, but it is generally not C 1 : its derivative is relay-driven and may switch between ± L j . The interstage perturbation d j + 1 is therefore continuous but generally not differentiable, and a transfer theorem that differentiates it does not apply. The amplitude-only results of SubSection 3.2, Section 3.3 and Section 3.4 provide the required alternative.
Fix the number of stages n ≥ 1 . For a continuous first input σ 0 , the cascade (42), j = 1 , … , n , is a differential inclusion with compact convex values and linear growth in ( α j , σ j ) j = 1 n , so every maximal Filippov solution is complete. Throughout this section, assume that, for j = 1 , … , n , a ( j + 1 ) is locally absolutely continuous and, almost everywhere,
| a ( j + 1 ) | ≤ D a , j , | a ( j + 2 ) | ≤ N a , j , κ j ( L j − D a , j ) > N a , j ,
The estimates in the proofs of Section 3 are trajectory-wise: they use only the stated bounds along the solution under consideration, and their constants do not depend on the particular nominal input or perturbation beyond these bounds. They therefore apply to the interstage perturbations d j generated by the cascade itself.

4.1. Uniformly Bounded Perturbation at the First Input

Theorem 3
(Practical exponential cascade). Let σ 0 = a + d , where d is continuous and | d ( t ) | ≤ D for t ≥ 0 , and suppose (44) holds for j = 1 , … , n . Fix D ¯ ≥ 0 . If D ∈ [ 0 , D ¯ ] , then every solution of the cascade from an arbitrary finite initial state satisfies, for j = 1 , … , n ,
| a ( j − 1 ) ( t ) − α j ( t ) | + | a ( j ) ( t ) − σ j ( t ) | ≤ M j e − λ j t + P j D 4 − j , t ≥ 0 ,
where the constants M j , λ j , P j > 0 depend on the initial errors but not on D ∈ [ 0 , D ¯ ] .
Proof. 
Completeness was noted above. For an arbitrary finite initial state, fix radii R j > 0 with
| a ( j − 1 ) ( 0 ) − α j ( 0 ) | + | a ( j ) ( 0 ) − σ j ( 0 ) | ≤ R j , j = 1 , … , n .
We show that there exist constants M j , λ j , c 1 , j , c 2 , j > 0 , j = 1 , … , n , that depend on D ¯ and the radii but not on D, such that, for every D ∈ [ 0 , D ¯ ] and j = 1 , … , n ,
| a ( j − 1 ) ( t ) − α j ( t ) | + | a ( j ) ( t ) − σ j ( t ) | ≤ M j e − λ j t + δ j + 1 , t ≥ 0 ,
where δ 1 = D and
δ j + 1 = c j ( δ j ) , c j ( r ) = c 1 , j r 1 / 4 + c 2 , j r 1 / 2 .
The first-stage rate is λ 1 = ρ 1 / 2 , where ρ 1 is the rate ρ R in (33), from the proof of Theorem 1, for stage one with D = D ¯ and R = R 1 , and, for j ≥ 2 ,
λ j = 1 4 min { ρ j , λ j − 1 / 2 } ,
where ρ j is the rate ρ R in (38), from the proof of Theorem 2, for stage j. Consequently,
λ j ≤ 1 8 λ j − 1 , λ n ≤ 8 − ( n − 1 ) λ 1 .
Finally, we bound δ j + 1 by P j D 4 − j , which gives (45).
We first fix all stage constants, before D is chosen. For stage one, apply the estimate (23) in the proof of Theorem 1 with D = D ¯ 1 = D ¯ and radius R 1 . It gives M 1 , ρ 1 , c 1 , 1 , and c 2 , 1 , and the rate λ 1 = ρ 1 / 2 ; by Step 5 of that proof, these constants serve for every amplitude in [ 0 , D ¯ 1 ] . Put D ¯ 2 = c 1 ( D ¯ 1 ) . For j ≥ 2 , put ( C j , γ j ) = ( M j − 1 , λ j − 1 ) and apply the estimate (38) in the proof of Theorem 2 to stage j with ( C e , γ e ) = ( C j , γ j ) , amplitude bound D ¯ j , and radius R j . It gives M j , ρ j , c 1 , j , and c 2 , j , and the rate (49); put D ¯ j + 1 = c j ( D ¯ j ) . None of these constants depends on D.
Fix D ∈ [ 0 , D ¯ ] . Since each c j is increasing, δ j ≤ D ¯ j for j = 1 , … , n . For stage one, d 1 = d satisfies | d 1 | ≤ δ 1 with δ 1 ≤ D ¯ 1 , so (23) with the stage-one constants gives (47) for j = 1 . For j ≥ 2 , suppose the input perturbation of stage j is continuous and satisfies
| d j ( t ) | ≤ δ j + C j e − γ j t , t ≥ 0 .
Since δ j ≤ D ¯ j , (38) with the stage-j constants gives (47) for stage j. In either case, d j + 1 = − w j , so the bound for stage j shows that d j + 1 satisfies (51) with C j + 1 = M j and γ j + 1 = λ j , and d j + 1 is continuous because σ j is Lipschitz and a ( j ) is continuous. This closes the induction. The recursion (49) gives λ j ≤ 1 4 · 1 2 λ j − 1 , and (50) follows.
Finally, put K j = c 1 , j + c 2 , j D ¯ j 1 / 4 . Since r 1 / 2 ≤ D ¯ j 1 / 4 r 1 / 4 for 0 ≤ r ≤ D ¯ j , δ j ≤ D ¯ j gives δ j + 1 = c j ( δ j ) ≤ K j δ j 1 / 4 for j = 1 , … , n . Iterating this inequality from δ 1 = D gives
δ j + 1 ≤ P j D 4 − j , P j = ∏ k = 1 j K k 4 − ( j − k ) , j = 1 , … , n .
Together with (47), this gives (45). The constants M j , λ j , and P j depend on the radii R j , and hence on the initial errors, but not on D ∈ [ 0 , D ¯ ] . □
Remark 4
(Deterioration of the residual exponent). For each fixed n as D ↓ 0 , Theorem 3 shows that the persistent perturbation entering stage n is O ( D 4 − ( n − 1 ) ) , while the persistent part of the stage-n output error is O ( D 4 − n ) . The exponent approaches zero rapidly with the stage number, and the constants depend on the stage index and on D ¯ . No smallness of D ¯ is required. The result is therefore a fixed-finite-stage practical estimate and does not provide stage-uniform robustness.

4.2. Special Case: Exact First Input

If d ≡ 0 , Theorem 3 with D ¯ = D = 0 shows that every stage converges exponentially to zero. The following theorem states this special case directly. Its first stage uses Lemma 1 in place of Theorem 1, and its later stages use Corollary 1.
Theorem 4
(Exact exponential cascade). Let σ 0 = a , and suppose (44) holds for j = 1 , … , n . Then, for j = 1 , … , n , the stage errors a ( j − 1 ) − α j and a ( j ) − σ j of every solution from an arbitrary finite initial state converge exponentially to zero.
Proof. 
Completeness was noted above. For an arbitrary finite initial state, fix radii R j > 0 such that (46) holds. We show by induction that there exist constants M j , λ j > 0 , j = 1 , … , n , such that
| a ( j − 1 ) ( t ) − α j ( t ) | + | a ( j ) ( t ) − σ j ( t ) | ≤ M j e − λ j t , t ≥ 0 .
The first-stage rate is λ 1 = ρ 1 / 2 , where ρ 1 is the rate ρ ℓ in (13), from the proof of Lemma 1, for stage one on the sublevel (54) below. For j ≥ 2 , λ j is given by (49), where ρ j now denotes the rate ρ R in (41), from the proof of Corollary 1, for stage j; hence (50) holds. The constants depend on the stage data ( κ j , L j , D a , j , N a , j , R j ) j = 1 n and are not uniform in the stage index.
Since σ 0 = a , we have d 1 = 0 , and stage one is (2) and (3) with nominal input a. Let μ 1 and q 1 be given by (7) for stage one. The initial bound (46) gives | p ( 0 ) | = | w 1 ( 0 ) − ( κ 1 − μ 1 ) e 1 ( 0 ) | ≤ ( 1 + κ 1 ) R 1 , and therefore
V a , 1 ( 0 ) ≤ ℓ 1 : = 1 2 ( 1 + κ 1 ) 2 R 1 2 + ( L 1 + D a , 1 ) R 1 + q 1 R 1 2 .
The sublevel estimate (14) in the proof of Lemma 1, with ℓ = ℓ 1 , gives (53) for j = 1 with λ 1 = ρ 1 / 2 and ρ 1 = ρ ℓ 1 .
Suppose j ≥ 2 and (53) holds for stage j − 1 . Since d j = − w j − 1 , this bound gives | d j ( t ) | ≤ M j − 1 e − λ j − 1 t , and d j is continuous because σ j − 1 is Lipschitz and a ( j − 1 ) is continuous. Stage j is an instance of (15)–() with nominal input a ( j − 1 ) , whose second derivative a ( j + 1 ) is locally absolutely continuous and satisfies (44). The estimate (41) in the proof of Corollary 1, with ( C d , γ d ) = ( M j − 1 , λ j − 1 ) and radius R j , therefore gives (53) for stage j, with the rate (49). This closes the induction without differentiating d j or σ j − 1 . The rate bounds (50) follow as in the proof of Theorem 3. □
Remark 5
(Regularity and conservatism). Applying Theorems 3 and 4 through stage n requires, at the highest stage, that a ( n + 1 ) be locally absolutely continuous and that a ( n + 2 ) have the required essential bound, together with the corresponding intermediate acceleration, jerk, and gain conditions. The certified rates (50) are conservative. Any rate below 1 2 min { ρ j , λ j − 1 / 2 } is admissible at stage j ≥ 2 at the cost of a larger M j .
Remark 6
(Quasi-exponential closed-loop results). The control schemes of [9,10] use this differentiator and conclude quasi-exponential convergence of the tracking error. There the tolerance enters only through the estimation error, which reaches the tracking error through a bound on an exponentially stable linear system; that bound returns whatever convergence class the estimator supplies. Replacing it by Theorem 4 therefore upgrades those conclusions to exact exponential convergence, provided the differentiated signal admits the bounds of Remark 5 along closed-loop solutions and the gains satisfy (44). Beyond the acceleration bound used there, this asks for one further bounded derivative; checking it is specific to each scheme and is not done here.

5. Conclusions

This paper analyzed a serial differentiator by means of a strict Lyapunov function, the energy of the error system plus a quadratic correction. When the acceleration of the input is locally absolutely continuous and both its magnitude and its rate are bounded, an explicit condition relating the two differentiator gains to those bounds certifies exponential convergence of the estimation error to zero, with no residual neighborhood, uniformly on every prescribed initial energy sublevel. Earlier analyses of this architecture certified asymptotic convergence, or exponential convergence only to an arbitrarily small neighborhood, or a quasi-exponential bound whose rate degrades as that neighborhood is tightened. The condition obtained here is sufficient rather than necessary or sharp, and it is paid for by the additional bound on the rate of the acceleration.
The same Lyapunov function transfers this estimate to a measured input corrupted by a continuous perturbation that is known only through its amplitude. The perturbation is never differentiated and its amplitude is not assumed small; the argument needs only an integral bound over the thin layer in which the relay sign can be corrupted, together with the growth of the dissipation with the Lyapunov level. A persistent amplitude leaves a residual, which vanishes with the perturbation, so exact exponential convergence is recovered in its absence. Because this is precisely the information available about the nonsmooth interstage error of a serial cascade, the estimates propagate through any fixed finite number of stages, exactly when the first input is exact and with a residual otherwise whose certified exponent deteriorates rapidly with the number of stages. The certified exponents and rates are conservative and are not claimed to be optimal, and the constants need not be uniform in the stage index. Sharper residual exponents, less conservative stagewise conditions, and the effects of measurement noise and discretization remain topics for future work.

Author Contributions

Conceptualization, methodology and formal analysis: J.-H.P.; validation, writing—original draft preparation: H.-K.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Glocal University Project of Mokpo National University, in 2026.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Park, J.H.; Kim, S.H.; Park, T.S. Asymptotically convergent switching differentiator. Int. J. Adapt. Control Signal Process. 2019, 33, 557–566. [Google Scholar] [CrossRef]
  2. Park, J.H.; Park, T.S.; Kim, S.H. Asymptotically Convergent Higher-Order Switching Differentiator. Mathematics 2020, 8, 185. [Google Scholar] [CrossRef]
  3. Levant, A. Robust exact differentiation via sliding mode technique. Automatica 1998, 34, 379–384. [Google Scholar] [CrossRef]
  4. Levant, A. Higher-order sliding modes, differentiation and output-feedback control. Int. J. Control 2003, 76, 924–941. [Google Scholar] [CrossRef]
  5. Angulo, M.T.; Moreno, J.A.; Fridman, L. Robust exact uniformly convergent arbitrary order differentiator. Automatica 2013, 49, 2489–2495. [Google Scholar] [CrossRef]
  6. Park, J.H.; Lee, D.H. Exponential Convergence Analysis of Serial Differentiators for Robust and Accurate Estimation of High-Order Derivatives. IEEE Access 2025, 13, 87516–87525. [Google Scholar] [CrossRef]
  7. Park, J.H.; Kim, S.P. Quasi-Exponential Convergence of Higher-Order Serial Differentiators Under Bounded Input Perturbation. IEEE Access 2026, 14, 79365–79379. [Google Scholar] [CrossRef]
  8. Park, J.H.; Lee, D.H.; So, S.Y.; Choi, Y.S. A Simple and Robust Discretization of a Higher-Order Serial Differentiator With Proven Stability and Accuracy. IEEE Access 2025, 13, 160266–160277. [Google Scholar] [CrossRef]
  9. Park, J.H.; Lee, D.H.; Choi, Y.S. A Novel Differentiator-based Adaptive Feedback Linearization Scheme Ensuring Quasi-exponential Stability for Uncertain Nonlinear Systems. Int. J. Control Autom. Syst. 2025, 23, 3769–3780. [Google Scholar] [CrossRef]
  10. Park, J.H.; Lee, J.H.; So, S.Y.; Kim, S.H. Differentiator-Based Uncertainty Cancelling (DBUC) Output-Feedback Control via Feedback Linearization for General Uncertain Nonlinear Systems. Int. J. Control Autom. Syst. 2026, 24, 2604–2615. [Google Scholar] [CrossRef]
  11. Park, J.H.; Kim, S.P. Discrete-Time Differentiator-Based Uncertainty-Compensating (DT-DBUC) Controllers for Uncertain Continuous-Time Nonlinear Systems: State- and Output-Feedback Designs. IEEE Access 2026, 14, 125012–125025. [Google Scholar] [CrossRef]
  12. Miranda-Colorado, R. Robust observer-based anti-swing control of 2D-crane systems with load hoisting-lowering. Nonlinear Dyn. 2021, 104, 3581–3596. [Google Scholar] [CrossRef]
  13. Wang, T.; Wang, Y.; Xu, M.; Tian, J.; Zhang, J.; Hong, Z. Nonlinear Control of Crane Systems Based on Intelligence Computing of Disturbance Observer Under Mismatched Disturbance. In Proceedings of the 2024 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA), Kaifeng, China, 30 October–2 November 2024; pp. 2197–2202. [Google Scholar] [CrossRef]
  14. Rodríguez-Arellano, J.A.; Miranda-Colorado, R.; Aguilar, L.T.; Negrete-Villanueva, M. Trajectory tracking nonlinear H∞ controller for wheeled mobile robots with disturbances observer. ISA Trans. 2023, 142, 372–385. [Google Scholar] [CrossRef]
  15. Miranda-Colorado, R.; Cazarez-Castro, N.R. Observer-based fuzzy trajectory-tracking controller for wheeled mobile robots with kinematic disturbances. Eng. Appl. Artif. Intell. 2024, 133, 108279. [Google Scholar] [CrossRef]
  16. Miranda-Colorado, R. Finite-time sliding mode controller for perturbed second-order systems. ISA Trans. 2019, 95, 82–92. [Google Scholar] [CrossRef]
  17. Liu, Z.; Jin, H.; Liu, Y.; Zhao, J. An Online Stiffness Estimation Approach for Variable Stiffness Actuators Using Lever Mechanism. IEEE Robot. Autom. Lett. 2022, 7, 6709–6717. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.