Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
GAMM-Mitteilungen · 2013-08 · 36 (1) · 8-31
DOI: 10.1002/gamm.201310002 ↗Kurz gefasst
Fachartikel in der Zeitschrift GAMM-Mitteilungen, online erschienen am 13.08.2013. Verfasst von Stefan Güttel. Die Arbeit wurde bisher 134-mal zitiert (Crossref) und nennt 117 Literaturangaben.
Abstract (Originalsprache)
Matrix functions are a central topic of linear algebra, and problems of their numerical approximation appear increasingly often in scientific computing. We review various rational Krylov methods for the computation of large‐scale matrix functions. Emphasis is put on the rational Arnoldi method and variants thereof, namely, the extended Krylov subspace method and the shift‐and‐invert Arnoldi method, but we also discuss the nonorthogonal generalized Leja point (or PAIN) method. The issue of optimal pole selection for rational Krylov methods applied for approximating the resolvent and exponential function, and functions of Markov type, is treated in some detail. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Zitieren
APA
Güttel, S. (2013). Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection. GAMM-Mitteilungen, 36(1), 8-31. https://doi.org/10.1002/gamm.201310002
Vancouver
Güttel S. Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection. GAMM-Mitteilungen. 2013;36(1):8-31. doi:10.1002/gamm.201310002
BibTeX
@article{Gttel2013,
author = {Güttel, Stefan},
title = {Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection},
journal = {GAMM-Mitteilungen},
year = {2013},
volume = {36},
number = {1},
pages = {8--31},
doi = {10.1002/gamm.201310002}
}
EUVIMED