New results on the convergence of the conjugate gradient method

DOI10.1002/nla.618zbMath1224.65082MaRDI QIDQ3011672

L. Smoch, R. Bouyouli, Hassane Sadok, Gérard A. Meurant

Publication date: 29 June 2011

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.618

zbMATH Keywords

error bounds; conjugate gradient method; Lanczos algorithm; symmetric positive-definite matrix; evaluation of convergence

Mathematics Subject Classification ID

15B48: Positive matrices and their generalizations; cones of matrices

15B57: Hermitian, skew-Hermitian, and related matrices

65F10: Iterative numerical methods for linear systems

Related Items

A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation, Regularized preconditioned GMRES and the regularized iteration method

Cites Work

• On error estimation in the conjugate gradient method and why it works in finite precision computations
• Analysis of the convergence of the minimal and the orthogonal residual methods
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• Rank-1 perturbations and the Lanczos method, inverse iteration, and Krylov subspaces
• The Lanczos and Conjugate Gradient Algorithms
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item