Das Suchergebnis hat sich seit Ihrer Suchanfrage verändert. Eventuell werden Dokumente in anderer Reihenfolge angezeigt.
  • Treffer 7 von 75
Zurück zur Trefferliste

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.zeige mehrzeige weniger

Metadaten exportieren

Weitere Dienste

Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Patrick KürschnerORCiDGND, Melina A. FreitagORCiDGND
DOI:https://doi.org/10.1007/s10543-020-00813-4
ISSN:0006-3835
ISSN:1572-9125
Titel des übergeordneten Werks (Englisch):BIT : numerical mathematics ; the leading applied mathematics journal for all computational mathematicians
Verlag:Springer
Verlagsort:Dordrecht
Publikationstyp:Wissenschaftlicher Artikel
Sprache:Englisch
Datum der Erstveröffentlichung:30.09.2019
Erscheinungsjahr:2020
Datum der Freischaltung:11.01.2024
Freies Schlagwort / Tag:Lyapunov equation; alternating direction implicit; low-rank approximations; rational Krylov; subspaces
Band:60
Ausgabe:4
Seitenanzahl:39
Erste Seite:1221
Letzte Seite:1259
Fördernde Institution:Cost Action EU-MORNETEuropean Cooperation in Science and Technology; (COST) [TD1307]; Department of Mathematical Sciences at Bath
Organisationseinheiten:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Mathematik
DDC-Klassifikation:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Peer Review:Referiert
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.