论文信息 - A numerical algorithm to solve AT X A - X = Q

A numerical algorithm to solve AT X A - X = Q

Two kinds of algorithm are usually resorted to in order to solve the well-known Lyapounov discrete equation AT X A - X = Q : transformation of the original linear system in a classical one with n(n+1)/2 unknowns, and iterative scheme [1]. The first requires n4/4 storage words and a cost of n6/3 multiplications, which is impractical with a large system, and the second applies only if A is a stable matrix. The solution proposed requires no stability assumption and operates in only some n2 words and n3 multiplications.

A. Barraud

[1] J. H. Wilkinson,et al. Solution of real and complex systems of linear equations , 1966 .

[2] C. Berger,et al. A numerical solution of the matrix equation P = φ P φ t+ S , 1971 .

[3] Stephen Barnett,et al. Comparison of numerical methods for solving Liapunov matrix equations , 1972 .

[4] Charles L. Lawson,et al. Solving least squares problems , 1976, Classics in applied mathematics.