Misplaced Pages

Kalman–Yakubovich–Popov lemma

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

The Kalman–Yakubovich–Popov lemma is a result in system analysis and control theory which states: Given a number γ > 0 {\displaystyle \gamma >0} , two n-vectors B, C and an n x n Hurwitz matrix A, if the pair ( A , B ) {\displaystyle (A,B)} is completely controllable, then a symmetric matrix P and a vector Q satisfying

A T P + P A = Q Q T {\displaystyle A^{T}P+PA=-QQ^{T}}
P B C = γ Q {\displaystyle PB-C={\sqrt {\gamma }}Q}

exist if and only if

γ + 2 R e [ C T ( j ω I A ) 1 B ] 0 {\displaystyle \gamma +2Re\geq 0}

Moreover, the set { x : x T P x = 0 } {\displaystyle \{x:x^{T}Px=0\}} is the unobservable subspace for the pair ( C , A ) {\displaystyle (C,A)} .

The lemma can be seen as a generalization of the Lyapunov equation in stability theory. It establishes a relation between a linear matrix inequality involving the state space constructs A, B, C and a condition in the frequency domain.

The Kalman–Popov–Yakubovich lemma which was first formulated and proved in 1962 by Vladimir Andreevich Yakubovich where it was stated that for the strict frequency inequality. The case of nonstrict frequency inequality was published in 1963 by Rudolf E. Kálmán. In that paper the relation to solvability of the Lur’e equations was also established. Both papers considered scalar-input systems. The constraint on the control dimensionality was removed in 1964 by Gantmakher and Yakubovich and independently by Vasile Mihai Popov. Extensive reviews of the topic can be found in and in Chapter 3 of.

Multivariable Kalman–Yakubovich–Popov lemma

Given A R n × n , B R n × m , M = M T R ( n + m ) × ( n + m ) {\displaystyle A\in \mathbb {R} ^{n\times n},B\in \mathbb {R} ^{n\times m},M=M^{T}\in \mathbb {R} ^{(n+m)\times (n+m)}} with det ( j ω I A ) 0 {\displaystyle \det(j\omega I-A)\neq 0} for all ω R {\displaystyle \omega \in \mathbb {R} } and ( A , B ) {\displaystyle (A,B)} controllable, the following are equivalent:

  1. for all ω R { } {\displaystyle \omega \in \mathbb {R} \cup \{\infty \}}
    [ ( j ω I A ) 1 B I ] M [ ( j ω I A ) 1 B I ] 0 {\displaystyle \left^{*}M\left\leq 0}
  2. there exists a matrix P R n × n {\displaystyle P\in \mathbb {R} ^{n\times n}} such that P = P T {\displaystyle P=P^{T}} and
    M + [ A T P + P A P B B T P 0 ] 0. {\displaystyle M+\left\leq 0.}

The corresponding equivalence for strict inequalities holds even if ( A , B ) {\displaystyle (A,B)} is not controllable.


References

  1. Yakubovich, Vladimir Andreevich (1962). "The Solution of Certain Matrix Inequalities in Automatic Control Theory". Dokl. Akad. Nauk SSSR. 143 (6): 1304–1307.
  2. Kalman, Rudolf E. (1963). "Lyapunov functions for the problem of Lur'e in automatic control" (PDF). Proceedings of the National Academy of Sciences. 49 (2): 201–205. Bibcode:1963PNAS...49..201K. doi:10.1073/pnas.49.2.201. PMC 299777. PMID 16591048.
  3. Gantmakher, F.R. and Yakubovich, V.A. (1964). Absolute Stability of the Nonlinear Controllable Systems, Proc. II All-Union Conf. Theoretical Applied Mechanics. Moscow: Nauka.{{cite book}}: CS1 maint: multiple names: authors list (link)
  4. Popov, Vasile M. (1964). "Hyperstability and Optimality of Automatic Systems with Several Control Functions". Rev. Roumaine Sci. Tech. 9 (4): 629–890.
  5. Gusev S. V. and Likhtarnikov A. L. (2006). "Kalman-Popov-Yakubovich lemma and the S-procedure: A historical essay". Automation and Remote Control. 67 (11): 1768–1810. doi:10.1134/s000511790611004x. S2CID 120970123.
  6. Brogliato, B. and Lozano, R. and Maschke, B. and Egeland, O. (2020). Dissipative Systems Analysis and Control (3rd ed.). Switzerland AG: Springer Nature.{{cite book}}: CS1 maint: multiple names: authors list (link)
  7. Anders Rantzer (1996). "On the Kalman–Yakubovich–Popov lemma". Systems & Control Letters. 28 (1): 7–10. doi:10.1016/0167-6911(95)00063-1.
Categories: