Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4645567 | Applied Numerical Mathematics | 2012 | 16 Pages |
Abstract
We consider the numerical solution of projected Lyapunov equations using Krylov subspace iterative methods. Such equations play a fundamental role in balanced truncation model reduction of descriptor systems. We present generalizations of the extended block and global Arnoldi methods to projected Lyapunov equations and compare these methods with the alternating direction implicit method with respect to performance on different examples. A deflation strategy is also proposed to overcome possible breakdown in the recurrence.
Related Topics
Physical Sciences and Engineering
Mathematics
Computational Mathematics