Understanding Krylov methods in finite precision

DOI10.1007/3-540-45262-1_23MaRDI QIDQ2724493zbMATH OpenFDO

Authors F. Chaitin-Chatelin, E. Traviesas, Laurent Plantié

Publication date 7 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45262-1_23

zbMATH Keywords

convergencefinite precisionill-conditionediterative methodsKrylov methodslinear systemsmatrix eigenvalue problems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• How orthogonality is lost in Krylov methods
• scientific article; zbMATH DE number 16954
• Krylov subspace methods. Principles and analysis.
• scientific article; zbMATH DE number 1163758
• Convergence analysis of Krylov subspace methods

Cited in

(5)

• How orthogonality is lost in Krylov methods
• The Idea behind Krylov Methods
• Error Analysis of Krylov Methods In a Nutshell
• scientific article; zbMATH DE number 1163758 (Why is no real title available?)
• Numerical Analysis and Its Applications

This page was built for publication: Understanding Krylov methods in finite precision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724493)