Lyapunov equation
From Wikipedia, the free encyclopedia
In control theory, the discrete Lyapunov equation is of the form
- AXAH − X + Q = 0
where Q is a hermitian matrix. The continuous Lyapunov equation is of form
- AX + XAH + Q = 0.
The Lyapunov equation occurs in many branches of control theory, such as stability analysis and optimal control. This and related equations are named after the Russian mathematician Aleksandr Lyapunov.
Contents |
[edit] Application to stability
In the following theorems , and P and Q are symmetric. The notation P > 0 means that the matrix P is positive definite
Theorem (continuous time version). If there exist P > 0 and Q > 0 satisfying ATP + PA + Q = 0 then the linear system is globally asymptotically stable. The quadratic function V(z) = zTPz is a Lyapunov function that can be used to verify stability.
Theorem (discrete time version). If there exist P > 0 and Q > 0 satisfying ATPA − P + Q = 0 then the linear system x(t + 1) = Ax(t) is globally asymptotically stable. As before, zTPz is a Lyapunov function.
[edit] Computational aspects of solution
The discrete Lyapunov equations can, by using Schur complements, be written as
or equivalently as
- .
Specialized software is available for solving Lyapunov equations. For the discrete case, the Schur method of Kitagawa (1977) is often used. For the continuous Lyapunov equation the method of Bartels and Stewart (1972) can be used.
[edit] See also
[edit] References
- Kitagawa: An Algorithm for Solving the Matrix Equation X = F X F' + S, International Journal of Control, Vol. 25, No. 5, p745–753 (1977).
- R. H. Bartels and G. W. Stewart: Algorithm 432: Solution of the matrix equation AX + XB = C, Comm. ACM, 15 (1972), p820-826.