Lyapunov equation

In control theory, the discrete Lyapunov equation is of the form

${\displaystyle AXA^{H}-X+Q=0}$

where ${\displaystyle Q}$ is a Hermitian matrix and ${\displaystyle A^{H}}$ is the conjugate transpose of ${\displaystyle A}$. The continuous Lyapunov equation is of form: ${\displaystyle AX+XA^{H}+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.

Application to stability

In the following theorems ${\displaystyle A,P,Q\in \mathbb {R} ^{n\times n}}$, and ${\displaystyle P}$ and ${\displaystyle Q}$ are symmetric. The notation ${\displaystyle P>0}$ means that the matrix ${\displaystyle P}$ is positive definite.

Theorem (continuous time version). Given any ${\displaystyle Q>0}$, there exists a unique ${\displaystyle P>0}$ satisfying ${\displaystyle A^{T}P+PA+Q=0}$ if and only if the linear system ${\displaystyle {\dot {x}}=Ax}$ is globally asymptotically stable. The quadratic function ${\displaystyle V(x)=x^{T}Px}$ is a Lyapunov function that can be used to verify stability.

Theorem (discrete time version). Given any ${\displaystyle Q>0}$, there exists a unique ${\displaystyle P>0}$ satisfying ${\displaystyle A^{T}PA-P+Q=0}$ if and only if the linear system ${\displaystyle x_{t+1}=Ax_{t}}$ is globally asymptotically stable. As before, ${\displaystyle z^{T}Pz}$ is a Lyapunov function.

Computational aspects of solution

Specialized software is available for solving Lyapunov equations. For the discrete case, the Schur method of Kitagawa is often used.[1] For the continuous Lyapunov equation the method of Bartels and Stewart can be used.[2]

Analytic solution

Defining the ${\displaystyle \operatorname {vec} (A)}$ operator as stacking the columns of a matrix ${\displaystyle A}$ and ${\displaystyle A\otimes B}$ as the Kronecker product of ${\displaystyle A}$ and ${\displaystyle B}$, the continuous time and discrete time Lyapunov equations can be expressed as solutions of a matrix equation. Furthermore, if the matrix ${\displaystyle A}$ is stable, the solution can also be expressed as an integral (continuous time case) or as an infinite sum (discrete time case).

Discrete time

Using the result that ${\displaystyle \operatorname {vec} (ABC)=(C^{T}\otimes A)\operatorname {vec} (B)}$, one has

${\displaystyle (I_{n^{2}}-{\bar {A}}\otimes A)\operatorname {vec} (X)=\operatorname {vec} (Q)}$

where ${\displaystyle I_{n^{2}}}$ is a conformable identity matrix.[3] One may then solve for ${\displaystyle \operatorname {vec} (X)}$ by inverting or solving the linear equations. To get ${\displaystyle X}$, one must just reshape ${\displaystyle \operatorname {vec} (X)}$ appropriately.

Moreover, if ${\displaystyle A}$ is stable, the solution ${\displaystyle X}$ can also be written as

${\displaystyle X=\sum _{k=0}^{\infty }A^{k}Q(A^{H})^{k}}$.

For comparison, consider the one-dimensional case, where this just says that the solution of ${\displaystyle (1-a^{2})\,x=q}$ is ${\displaystyle x={\tfrac {q}{1-a^{2}}}=\sum _{k=0}^{\infty }q\,a^{2k}}$.

Continuous time

Using again the Kronecker product notation and the vectorization operator, one has the matrix equation

${\displaystyle (I_{n}\otimes A+{\bar {A}}\otimes I_{n})\operatorname {vec} X=-\operatorname {vec} Q,}$

where ${\displaystyle {\bar {A}}}$ denotes the matrix obtained by complex conjugating the entries of ${\displaystyle A}$.

Similar to the discrete-time case, if ${\displaystyle A}$ is stable, the solution ${\displaystyle X}$ can also be written as

${\displaystyle X=\int \limits _{0}^{\infty }\mathrm {e} ^{A\,\tau }Q\mathrm {e} ^{A^{H}\,\tau }d\tau }$.

For comparison, consider the one-dimensional case, where this just says that the solution of ${\displaystyle 2\,a\,x=-q}$ is ${\displaystyle x={\tfrac {-q}{2\,a}}=\int _{0}^{\infty }q\,\mathrm {e} ^{2\,a\,\tau }d\tau }$.

Relationship Between Discrete and Continuous Lyapunov Equations

We start with the continuous-time linear dynamics:

${\displaystyle {\dot {\mathbf {x} }}=\mathbf {A} \mathbf {x} }$.

And then discretize it as follows:

${\displaystyle {\dot {\mathbf {x} }}\approx {\frac {\mathbf {x} _{t+1}-\mathbf {x} _{t}}{\delta }}}$

Where ${\displaystyle \delta >0}$ indicates a small forward displacement in time. Substituting the bottom equation into the top and shuffling terms around, we get a discrete-time equation for ${\displaystyle \mathbf {x} _{t+1}}$.

${\displaystyle \mathbf {x} _{t+1}=\mathbf {x} _{t}+\delta \mathbf {A} \mathbf {x} _{t}=(\mathbf {I} +\delta \mathbf {A} )\mathbf {x} _{t}=\mathbf {B} \mathbf {x} _{t}}$

Where we've defined ${\displaystyle \mathbf {B} \equiv \mathbf {I} +\delta \mathbf {A} }$. Now we can use the discrete time Lyapunov equation for ${\displaystyle \mathbf {B} }$ :

${\displaystyle \mathbf {B} ^{T}\mathbf {M} \mathbf {B} -\mathbf {M} =-\delta \mathbf {Q} }$

Plugging in our definition for ${\displaystyle \mathbf {B} }$, we get:

${\displaystyle (\mathbf {I} +\delta \mathbf {A} )^{T}\mathbf {M} (\mathbf {I} +\delta \mathbf {A} )-\mathbf {M} =-\delta \mathbf {Q} }$

Expanding this expression out yields:

${\displaystyle (\mathbf {M} +\delta \mathbf {A} ^{T}\mathbf {M} )(\mathbf {I} +\delta \mathbf {A} )=\delta (\mathbf {A} ^{T}\mathbf {M} +\mathbf {M} \mathbf {A} )+\delta ^{2}\mathbf {A} ^{T}\mathbf {M} \mathbf {A} =-\delta \mathbf {Q} }$

Recall that ${\displaystyle \delta }$ is a small displacement in time. Letting ${\displaystyle \delta }$ go to zero brings us closer and closer to having continuous dynamics--and in the limit we achieve them. It stands to reason that we should also recover the continuous-time Lyapunov equations in the limit as well. Dividing through by ${\displaystyle \delta }$ on both sides, and then letting ${\displaystyle \delta \rightarrow 0}$ we find that:

${\displaystyle \mathbf {A} ^{T}\mathbf {M} +\mathbf {M} \mathbf {A} =-\mathbf {Q} }$

which is the continuous-time Lyapunov equation, as desired.

See also

• Sylvester equation
• Algebraic Riccati equation
• Kalman filter

References

1. Kitagawa, G. (1977). "An Algorithm for Solving the Matrix Equation X = F X F' + S". International Journal of Control. 25 (5): 745–753. doi:10.1080/00207177708922266.
2. Bartels, R. H.; Stewart, G. W. (1972). "Algorithm 432: Solution of the matrix equation AX + XB = C". Comm. ACM. 15 (9): 820–826. doi:10.1145/361573.361582.
3. Hamilton, J. (1994). Time Series Analysis. Princeton University Press. Equations 10.2.13 and 10.2.18. ISBN 0-691-04289-6.