Abstract
We present an algorithm to approximate the solution Z of a stable Lyapunov equation AZ + ZA* + BB* = 0 using proper orthogonal decomposition (POD). This algorithm is applicable to large-scale problems and certain infinite dimensional problems as long as the rank of B is relatively small. In the infinite dimensional case, the algorithm does not require matrix approximations of the operators A and B. POD is used in a systematic way to provide convergence theory and simple a priori error bounds.
| Original language | American English |
|---|---|
| Journal | Proceedings of the 2008 American Control Conference |
| DOIs | |
| State | Published - Jun 1 2008 |
Keywords
- Approximation Theory
- Infinite Dimensional Problems
- Lyapunov Methods
- Matrix Algebra
- Matrix Approximations
- Proper Orthogonal Decomposition
Disciplines
- Mathematics
- Statistics and Probability
Fingerprint
Dive into the research topics of 'Approximate Low Rank Solutions of Lyapunov Equations Via Proper Orthogonal Decomposition'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS