On prescribing the convergence behavior of the conjugate gradient algorithm

DOI10.1007/s11075-019-00851-2zbMath1451.65033OpenAlexW2995466519WikidataQ126558126 ScholiaQ126558126MaRDI QIDQ780394

Gérard A. Meurant

Publication date: 15 July 2020

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-019-00851-2

zbMATH Keywords

conjugate gradient algorithmresidual norm\(A\)-norm error estimates

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Iterative numerical methods for linear systems (65F10)

Related Items

When does the Lanczos algorithm compute exactly? ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices ⋮ The behavior of the Gauss-Radau upper bound of the error norm in CG ⋮ On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic ⋮ Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
• Any finite convergence curve is possible in the initial iterations of restarted FOM
• Prescribing the behavior of early terminating GMRES and Arnoldi iterations
• Polynomials and Hankel matrices
• On inverses of Hessenberg matrices
• Krylov sequences of maximal length and convergence of GMRES
• On error estimation in the conjugate gradient method and why it works in finite precision computations
• Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
• Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
• Solution of Sparse Indefinite Systems of Linear Equations
• Any Nonincreasing Convergence Curve is Possible for GMRES
• Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
• The Lanczos and Conjugate Gradient Algorithms
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Methods of conjugate gradients for solving linear systems

This page was built for publication: On prescribing the convergence behavior of the conjugate gradient algorithm