A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>

A. Barraud

IEEE Transactions on Automatic Control · 1977 · 92 citations · 5 references

Concepts

Abstract

Two kinds of algorithms are usually resorted to in order to solve the well-known Lyapounov discrete equation <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A^{T}XA - X = Q</tex> : transformation of the original linear system in a classical one with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n(n + 1)/2</tex> unknowns, and iterative scheme [1]. The first requires <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n^{4}/4</tex> storage words and a cost of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n^{6}/3</tex> multiplications, which is impractical with a large system, and the second applies only if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</tex> is a stable matrix. The solution proposed requires no stability assumption and operates in only some n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> words and n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> multiplications.

References

5