A generalization of the steepest descent method for matrix functions
From MaRDI portal
Publication:836727
zbMath1171.65367MaRDI QIDQ836727
Oliver G. Ernst, Stefan Güttel, Michael Eiermann, Martin Afanasjew
Publication date: 8 September 2009
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130652
steepest descent; asymptotic convergence rate; polynomial interpolation; matrix function; linear system of equations; Krylov subspace approximation; restarted Arnoldi/Lanczos method; restarted Krylov subspace method
65F10: Iterative numerical methods for linear systems
65M20: Method of lines for initial value and initial-boundary value problems involving PDEs
65F99: Numerical linear algebra