How Does the Lyapunov Equation Determine Matrix Stability?

  • Thread starter Thread starter jarvisyang
  • Start date Start date
  • Tags Tags
    Lyapunov
jarvisyang
Messages
4
Reaction score
0
The matrix \mathbf{B}satifies the following Lyapunov equation
\begin{gathered}\mathbf{A}^{T}\mathbf{B}\end{gathered}+\mathbf{BA}=-\mathbf{I}
prove that necessary and sufficient condition generating a symmetric and positive determined \mathbf{B}is that all of the eigen values of \mathbf{A}should be negative.
(Hints: rewritten \mathbf{A}in the Jordan normal form, one can easily prove the proposition)
But I still cannnot figure it out with the hints!Waiting for your excellent proof!
 
Physics news on Phys.org
The sufficiency can be obtained by considering
B=\int_{0}^{∞} e^{A^τ t} Q e^{A t} dt

Inserting into the Lyapunov equation gives
AB + BA^{T} = A \int_{0}^{∞} e^{A^τ t} Q e^{A t} dt + \int_{0}^{∞} e^{A^τ t} Q e^{A t} dt A^{T} = \int_{0}^{∞} \frac{d}{dt} (e^{A^τ t} Q e^{A t}) dt = [e^{A^τ t} Q e^{A t}]_{0}^{∞} = -Q
since the eigenvalues of A are negative. Now just let Q=I.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
55
Views
10K
Replies
39
Views
12K
Replies
1
Views
2K
Replies
2
Views
3K
Replies
16
Views
6K
Back
Top