Krylov subspace methods for solving large Lyapunov equations

This paper considers several methods for calculating low-rank approximate solutions to large-scale Lyapunov equations of the form $AP + PA' + BB' = 0$. The interest in this problem stems from model reduction where the task is to approximate high-dimensional models by ones of lower order. The two recently developed Krylov subspace methods exploited in this paper are the Arnoldi method [Saad, Math. Comput., 37 (1981), pp. 105–126] and the Generalised Minimum Residual method (GMRES) [Saad and Schultz, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856–869]. Exact expressions for the approximation errors incurred are derived in both cases. The numerical solution of the low-dimensional linear matrix equation arising from the GMRES method is discussed and an algorithm for its solution is proposed. Low rank solutions of discrete time Lyapunov equations and continuous time algebraic Riccati equations are also considered. Throughout this paper, the authors tackle problems in which B has more than one column with the...

[1]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[2]  Michael Athans,et al.  The Matrix Minimum Principle , 1967, Inf. Control..

[3]  J. L. Howland,et al.  A constructive method for the solution of the stability problem , 1970 .

[4]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[5]  A. Laub.  A schur method for solving algebraic Riccati equations , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[6]  B. Moore.  Principal component analysis in linear systems: Controllability, observability, and model reduction , 1981 .

[7]  Y. Saad.  Krylov subspace methods for solving large unsymmetric linear systems , 1981 .

[8]  C. W. Gear,et al.  Iterative Solution of Linear Equations in ODE Codes , 1983 .

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  Y. Saad,et al.  Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems , 1984 .

[11]  K. Glover.  All optimal Hankel-norm approximations of linear multivariable systems and their L, ∞ -error bounds† , 1984 .

[12]  Gene H. Golub,et al.  The Lanczos-Arnoldi algorithm and controllability , 1984 .

[13]  Solution of the matrix equation AX−XB=C , 1986 .

[14]  P. Brown,et al.  Matrix-free methods for stiff systems of ODE's , 1986 .

[15]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[16]  Y. Saad,et al.  A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations , 1986 .

[17]  G. Hewer,et al.  The sensitivity of the stable Lyapunov equation , 1987, 26th IEEE Conference on Decision and Control.

[18]  A. Laub,et al.  Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms , 1987 .

[19]  M. Safonov,et al.  A Schur Method for Balanced Model Reduction , 1988, 1988 American Control Conference.

[20]  E. Wachspress.  Iterative solution of the Lyapunov matrix equation , 1988 .

[21]  Imad M. Jaimoukha,et al.  All solutions to the four block general distance problem , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[22]  Y. Saad,et al.  Numerical solution of large Lyapunov equations , 1989 .

[23]  Y. Saad,et al.  Krylov Subspace Methods on Supercomputers , 1989 .

[24]  K. Poolla,et al.  Numerical solution of very large, sparse Lyapunov equations through approximate power iteration , 1990, 29th IEEE Conference on Decision and Control.

[25]  Yousef Saad,et al.  Hybrid Krylov Methods for Nonlinear Systems of Equations , 1990, SIAM J. Sci. Comput..

[26]  A. Hodel,et al.  Least squares approximate solution of the Lyapunov equation , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[27]  A. Portone,et al.  Vertical stabilisation of Tokamak plasmas , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[28]  Peter N. Brown,et al.  A Theoretical Comparison of the Arnoldi and GMRES Algorithms , 1991, SIAM J. Sci. Comput..

[29]  K. Glover,et al.  A characterization of all solutions to the four block general distance problem , 1991 .

[30]  W. Niethammer,et al.  SOR for AX−XB=C , 1991 .

[31]  L. Reichel,et al.  Krylov-subspace methods for the Sylvester equation , 1992 .

[32]  Y. Saad.  Analysis of some Krylov subspace approximations to the matrix exponential operator , 1992 .

[33]  Nicholas J. Higham,et al.  Perturbation theory and backward error forAX−XB=C , 1993 .

[34]  J. Rodriguez,et al.  Problem (2) , 1994 .