Approximate Low Rank Solutions of Lyapunov Equations Via Proper Orthogonal Decomposition

John R. Singler, Missouri University of Science and Technology

This document has been relocated to

There were 8 downloads as of 28 Jun 2016.


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.