Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
Author:
- 13 August 2013
- journal article
- research article
- Published by Wiley in GAMM-Mitteilungen
- Vol. 36 (1) , 8-31
Abstract
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.Keywords
This publication has 101 references indexed in Scilit:
- A black-box rational Arnoldi variant for Cauchy–Stieltjes matrix functionsBIT Numerical Mathematics, 2013
- On convergence of Krylov subspace approximations of time-invariant self-adjoint dynamical systemsLinear Algebra and its Applications, 2012
- The physics of communicability in complex networksPhysics Reports, 2012
- Numerical methods for the QCDd overlap operator. I. Sign-function and error boundsComputer Physics Communications, 2002
- On Krylov Subspace Approximations to the Matrix Exponential OperatorSIAM Journal on Numerical Analysis, 1997
- Optimal ray sequences of rational functions connected with the Zolotarev problemConstructive Approximation, 1994
- A generalized ADI iterative methodNumerische Mathematik, 1993
- ESTIMATES OF THE SINGULAR NUMBERS OF THE CARLESON IMBEDDING OPERATORMathematics of the USSR-Sbornik, 1988
- ON THE SPEED OF RATIONAL APPROXIMATION OF SOME ANALYTIC FUNCTIONSMathematics of the USSR-Sbornik, 1978
- ZOLOTAREV PROBLEMS CONNECTED WITH RATIONAL FUNCTIONSMathematics of the USSR-Sbornik, 1969