Abstract
We present the approximate power iteration (API) algorithm for the computation of the dominant invariant subspace of the solution X of large-order Lyapunov equations AX + XA T + Q = 0 without first computing the matrix X itself. The API algorithm is an iterative procedure that uses Krylov subspace bases in computing estimates of matrix-vector products X v in a power iteration sequence. Application of the API algorithm requires that A + A T < 0; numberical experiments indicate that, if the matrix X admits a good low-rank solution, then API provides an orthogonal basis of a subspace that closely approximates the dominant X-invariant subspace of corresponding dimension. Analytical convergence results are also presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
