On the generation of Krylov subspace bases

DOI10.1016/j.apnum.2010.12.009zbMath1253.65049MaRDI QIDQ436007

Bernard Philippe, Lothar Reichel

Publication date: 13 July 2012

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2010.12.009

zbMATH Keywords

convergence; Chebyshev polynomials; numerical examples; iterative method; generalized minimal residual method; condition numbers; Arnoldi process; eigenvalue computations; evaluation of matrix functions; Krylov subspace basis; Newton polynomials

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

65F60: Numerical computation of matrix exponential and similar matrix functions

Uses Software

• eigs
• ARPACK
• Eigtool