• search hit 17 of 940
Back to Result List

Inexact methods for the low rank solution to large scale Lyapunov equations

  • The rational Krylov subspace method (RKSM) and the low-rank alternating directions implicit (LR-ADI) iteration are established numerical tools for computing low-rank solution factors of large-scale Lyapunov equations. In order to generate the basis vectors for the RKSM, or extend the low-rank factors within the LR-ADI method, the repeated solution to a shifted linear system of equations is necessary. For very large systems this solve is usually implemented using iterative methods, leading to inexact solves within this inner iteration (and therefore to "inexact methods"). We will show that one can terminate this inner iteration before full precision has been reached and still obtain very good accuracy in the final solution to the Lyapunov equation. In particular, for both the RKSM and the LR-ADI method we derive theory for a relaxation strategy (e.g. increasing the solve tolerance of the inner iteration, as the outer iteration proceeds) within the iterative methods for solving the large linear systems. These theoretical choices involveThe rational Krylov subspace method (RKSM) and the low-rank alternating directions implicit (LR-ADI) iteration are established numerical tools for computing low-rank solution factors of large-scale Lyapunov equations. In order to generate the basis vectors for the RKSM, or extend the low-rank factors within the LR-ADI method, the repeated solution to a shifted linear system of equations is necessary. For very large systems this solve is usually implemented using iterative methods, leading to inexact solves within this inner iteration (and therefore to "inexact methods"). We will show that one can terminate this inner iteration before full precision has been reached and still obtain very good accuracy in the final solution to the Lyapunov equation. In particular, for both the RKSM and the LR-ADI method we derive theory for a relaxation strategy (e.g. increasing the solve tolerance of the inner iteration, as the outer iteration proceeds) within the iterative methods for solving the large linear systems. These theoretical choices involve unknown quantities, therefore practical criteria for relaxing the solution tolerance within the inner linear system are then provided. The theory is supported by several numerical examples, which show that the total amount of work for solving Lyapunov equations can be reduced significantly.show moreshow less

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Patrick KürschnerORCiDGND, Melina A. FreitagORCiDGND
DOI:https://doi.org/10.1007/s10543-020-00813-4
ISSN:0006-3835
ISSN:1572-9125
Title of parent work (English):BIT : numerical mathematics ; the leading applied mathematics journal for all computational mathematicians
Publisher:Springer
Place of publishing:Dordrecht
Publication type:Article
Language:English
Date of first publication:2019/09/30
Publication year:2020
Release date:2024/01/11
Tag:Lyapunov equation; alternating direction implicit; low-rank approximations; rational Krylov; subspaces
Volume:60
Issue:4
Number of pages:39
First page:1221
Last Page:1259
Funding institution:Cost Action EU-MORNETEuropean Cooperation in Science and Technology; (COST) [TD1307]; Department of Mathematical Sciences at Bath
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Mathematik
DDC classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Peer review:Referiert
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.