A Generalization of the Passivity Theorem and the Small Gain Theorem Based on $\rho $-Stability, with Application to a Parameter Adaptation Algorithm for Recursive Identification
Henri Bourl\`es

TL;DR
This paper extends classical passivity and small gain theorems using $ ho$-stability, allowing for broader stability conditions and applying these results to a parameter adaptation algorithm in recursive identification.
Contribution
It introduces a generalized stability framework based on $ ho$-passivity, broadening the applicability of passivity and small gain theorems in control theory.
Findings
The closed-loop remains stable under $ ho$-passivity conditions.
The approach generalizes classical passivity and small gain theorems.
Application demonstrated in a parameter adaptation algorithm for recursive identification.
Abstract
The usual passivity theorem considers a closed-loop, the direct chain of which consists of a strictly passive stable operator , and the feedback chain of which consists of a passive operator . Then the closed-loop is stable. Let . We show here that the closed-loop is still stable when the direct chain consists of a strictly -passive -stable operator (a weaker condition than above) and the feedback chain consists of a -passive operator (a stronger condition than above). Variations on the theme of the small gain theorem (incremental or not) can be made similarly. This approach explains the results obtained in a paper on identification which was recently published.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStability and Controllability of Differential Equations · Control Systems and Identification
A Generalization of the Passivity Theorem and the Small Gain Theorem
Based on -Stability, with Application to a Parameter Adaptation Algorithm for Recursive Identification
Henri Bourlès SATIE, CNAM-ENS Paris-Saclay, 61 avenue du Président Wilson, 94230 Cachan. E-mail address: [email protected]
Abstract
The usual passivity theorem considers a closed-loop, the direct chain of which consists of a strictly passive stable operator , and the feedback chain of which consists of a passive operator . Then the closed-loop is stable. Let and let us adopt the terminology introduced in [4]. We show here that the closed-loop is still stable when the direct chain consists of a strictly -passive -stable operator (a weaker condition than above) and the feedback chain consists of a -passive operator (a stronger condition than above). Variations on the theme of the small gain theorem (incremental or not) can be made similarly. This approach explains the results obtained in a paper on identification which was recently published [6].
1 Introduction and preliminaries
Many stability theorems were derived for a standard closed-loop system (as depicted in, e.g., Figure III.1 of ([5], p. 37)), the direct chain of which consists of an operator , with input and output and the feedback chain of which consists of an operator with input and output . The interconnection equations are where are external signals.
Let in the discrete-time case and in the continuous-time case. In addition, let be the subspace of in the former case, of in the latter, consisting of those signals which have a left-bounded support; is a Hilbert space. Let , let be the truncation operator, such that if and otherwise ([7], Sect. 2.3), and let be the extended space consisting of all signals such that for all . If , the inner product is denoted by and Let be an operator. Its gain is defined to be ([5], Sect. 3.1)
[TABLE]
We put
[TABLE]
and is said to be -stable if ([5], Sect. 3.7).
Let be the multiplicative Abelian group of all positive real numbers. This group acts on as follows: if then In the continuous-time case, let then the concept of -stability as defined in [4] is equivalent to -stability as introduced in [1] and developped in [2], [3].
The following is assumed in this paper (with the above notation): if then there are solutions (”well-posedness” of the closed-loop).
The classical passivity (resp. small gain) theorem states that if is strictly passive and such that (resp. is such that ) and is passive (resp. is such that and ) then the operator is -stable. This result has variants which will be mentioned below.
In what follows, using the action of , we relax the assumption on and strengthen the assumption on or vice-versa.
2 Extension of stability results
2.1 Extended passivity stability theorem
Consider again the closed-loop system as specified in Section 1, assumed to be well-posed, with replaced by and replaced by so that
[TABLE]
One passes from the original closed-loop to the new one by introducing multipliers and
Theorem 1
Assume that and that there are constants such that
[TABLE]
for all and all . If
[TABLE]
then whenever
Proof. For any , we have that
[TABLE]
In addition,
[TABLE]
Therefore, setting
[TABLE]
which implies
[TABLE]
This is the same equality as in ([5], section 6.5, (23)) (correcting an obvious misprint) and the result follows as in this reference.
Corollary 2
(Extended passivity theorem) Assume that and that there exists such that
[TABLE]
for all and all . (In this case, we will say that is -stable and is -passive, and that is -passive.) Then the operator is -stable.
Proof. This follows from Theorem 1 by the same rationale as in the proof of Corollary 27 of ([5], Sect. 6.5).
The proof of the following is elementary:
Proposition 3
In the discrete-time case, let be the linear operator such that for any
[TABLE]
Then
[TABLE]
In particular, if is LTI, then (where is the impulse response), so that the transfer matrix of is where is the transfer matrix of
Remark 4
Likewise, in the continuous LTI case, the transfer matrix of with is where is the transfer matrix of
The proof of the following is easy:
Corollary 5
*Let be an LTI operator with rational transfer matrix . Then the conditions on in Corollary 2 are satisfied provided that:
- In the discrete-time case, the transfer matrix is analytic and bounded in and for all *
[TABLE]
- In the continuous-time case, the transfer matrix is analytic and bounded in and for all
[TABLE]
2.2 Extended small gain theorem
Consider again the closed-loop system, assumed to be well-posed and defined by equations
Theorem 6
*(i) Assume that and that Then, the operator has finite gain.
(ii) Assume that and that Then, the operator is -stable.*
Proof. The proof is similar to that of ([5], section 3.2, Theorem 1).
Remark 7
(1) As in the usual case , the extended small gain theorem and the extended passivity theorem are closely related. Indeed, let be such that is a well-defined operator As easily seen, thus is well-defined. In addition,
[TABLE]
*Therefore, putting
(a) Condition is satisfied if and only if
(b) The following conditions (i), (ii) are equivalent: (i) there exists such that Condition is satisfied and (ii) (see [5], section 6.10, lemma 7 for the details). Thus, one passes from Corollary 2 to statement (ii) of Theorem 6 via the usual loop transformation described in ([5], section 6.10).
(2) A generalized version of the incremental small gain theorem ([5], section 3.3) can be obtained following the same line, and its statement is left to the reader. The pattern of noncausal multiplier technique, as described in ([5], section 9.2), can also be extended in a similar way.*
3 Application to a parameter adaptation algorithm
We consider now the parameter adaptation algorithm (PAA) in [6]. The aim of the algorithm is to identify a discrete-time system with poles on or outside the unit circle. The simulations in Section 4 of [6] show that this is indeed possible since the PAA is -stable with However, although the theorems of [6] are correct mathematically, they do not explain this result. In the two theorems of [6], the condition that be strictly positive real is indeed more restrictive than the condition that be strictly positive real. Thus, this condition must be replaced by: is strictly positive real. By Corollary 2 and Proposition 3 here above, with this change the identification algorithm of [6] converges (with degree of stability 1, not ). This observation was the first motivatio of this paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B.D.O Anderson, J.B. Moore, Optimal Control , Prentice-Hall, 1971.
- 2[2] H. Bourlès, ”Stabilité de degré α 𝛼 \alpha des systèmes régis par une équation différentielle fonctionnelle”, APII , 19 , 1986, 455-473.
- 3[3] H. Bourlès, ” α 𝛼 \alpha -Stability and robustness of large-scale interconnected systems”, International Journal of Control , 45 , 1987, 2221-2232.
- 4[4] H. Bourlès, Y Joannic, O. Mercier, ” ρ 𝜌 \rho -Stability and robustness: discrete-time case”, International Journal of Control , 52 (5), 1990, 1217-1239.
- 5[5] C.A. Desoer, M. Vidyasagar, Feedback Systems: Input-Output Properties , Academic Press, 1975.
- 6[6] B. Vau, H. Bourlès, ”Generalized convergence conditions of the parameter adaptation algorithm in discrete-time recursive identification and adaptive control”, Automatica , 92 , 2018, 109-114.
- 7[7] J.C. Willems, The Analysis of Feedback Systems , MIT Press, 1971.
