On prescribing the convergence behavior of the conjugate gradient algorithm

DOI10.1007/S11075-019-00851-2MaRDI QIDQ780394zbMATH OpenOpenAlexWikidataFDO

Authors G. 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 algorithm\(A\)-norm error estimatesresidual norm

Mathematics Subject Classification ID

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

Recommendations

• On the real convergence rate of the conjugate gradient method
• Publication:3471625
• scientific article; zbMATH DE number 4092656
• New results on the convergence of the conjugate gradient method
• On Meinardus' examples for the conjugate gradient method

Cites work

• scientific article; zbMATH DE number 663835 (Why is no real title available?)
• scientific article; zbMATH DE number 3365438 (Why is no real title available?)
• A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices
• Any Nonincreasing Convergence Curve is Possible for GMRES
• Any Ritz value behavior is possible for Arnoldi and for GMRES
• Any finite convergence curve is possible in the initial iterations of restarted FOM
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Krylov sequences of maximal length and convergence of GMRES
• Krylov subspace methods. Principles and analysis.
• Matrices, moments and quadrature with applications
• Methods of conjugate gradients for solving linear systems
• Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
• On error estimation in the conjugate gradient method and why it works in finite precision computations
• On inverses of Hessenberg matrices
• On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
• Polynomials and Hankel matrices
• Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
• Prescribing the behavior of early terminating GMRES and Arnoldi iterations
• Solution of Sparse Indefinite Systems of Linear Equations
• The Lanczos and Conjugate Gradient Algorithms
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

Cited in

(12)

• The behavior of the Gauss-Radau upper bound of the error norm in CG
• On the discrete dynamic nature of the conjugate gradient method
• Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
• On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
• When does the Lanczos algorithm compute exactly?
• The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deterministic
• On the convergence rate of the conjugate gradients in presence of rounding errors
• On Meinardus' examples for the conjugate gradient method
• Towards understanding CG and GMRES through examples
• Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems
• New results on the convergence of the conjugate gradient method

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

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