Projection methods for large Lyapunov matrix equations

From MaRDI portal
Publication:2491702





Krylov subspace methods are proposed for solving large Lyapunov matrix algebraic equations of the form \(AX + XA^T + BB^T = 0\) where \(A\) and \(B\) are real \(n \times n\) and \(n \times s\) matrices, respectively, with \(s << n\). Equations of this kind appear in many problems of control theory such as computation of the Hankel singular values, model reduction and solution of matrix Riccati equations. The methods proposed are based on the Arnoldi process. It is shown how to extract low rank approximate solutions to Lyapunov equations and expressions are derived for the backward error. Two numerical experiments involving solutions of large Lyapunov equations are presented. There is no discussion on the connection between the numerical properties of the methods proposed and the conditioning of the Lyapunov equations solved.




Cited in
(82)


Describes a project that uses

Uses Software






This page was built for publication: Projection methods for large Lyapunov matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491702)