Heuristic approaches to the solution of very large sparse Lyapunov and algebraic Riccati equations
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2217-2222 vol.3
- https://doi.org/10.1109/cdc.1988.194726
Abstract
The authors present several algorithms that compute approximate solutions to the Lyapunov equation AX+XA/sup T/+BB/sup T/=0 and the algebraic Riccati equation A/sup T/X+XA-XBR/sup -1/ B/sup T/X+C/sup T/C=0, where A is large and sparse and B and C are low rank. In particular, they test the Krylov subspace approximation and reduced rank integration for the Riccati equation. Although the algorithms are heuristically good, no convergence proofs are as yet available.Keywords
This publication has 32 references indexed in Scilit:
- The Sensitivity of the Stable Lyapunov EquationSIAM Journal on Control and Optimization, 1988
- Space structure vibration modes: How many exist? Which ones are important?IEEE Control Systems Magazine, 1987
- The decentralized control of large flexible space structuresIEEE Transactions on Automatic Control, 1984
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1984
- Generalized eigenproblem algorithms and software for algebraic Riccati equationsProceedings of the IEEE, 1984
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov EquationIMA Journal of Numerical Analysis, 1982
- Numerical solution of ATS + SA + Q = 0Information Sciences, 1972
- On Nonnegative Solutions of the Equation $AD + DA' = - C$SIAM Journal on Applied Mathematics, 1970
- Comparison of four numerical algorithms for solving the Liapunov matrix equation†International Journal of Control, 1970
- On a Matrix Riccati Equation of Stochastic ControlSIAM Journal on Control, 1968