Estimates of the \(l_2\) norm of the error in the conjugate gradient algorithm

DOI10.1007/s11075-005-1528-0zbMath1082.65040OpenAlexW2023891589MaRDI QIDQ2583220

Gérard A. Meurant

Publication date: 13 January 2006

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

Full work available at URL: https://doi.org/10.1007/s11075-005-1528-0

zbMATH Keywords

algorithmnumerical experimentserror estimationconjugate gradient methodlarge sparse symmetric positive definite matrixnorm of the error

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (5)

Unnamed Item ⋮ Sharp 2-Norm Error Bounds for LSQR and the Conjugate Gradient Method ⋮ Interval simulated annealing applied to electrical impedance tomography image reconstruction with fast objective function evaluation ⋮ Euclidean-Norm Error Bounds for SYMMLQ and CG ⋮ LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
• The computation of bounds for the norm of the error in the conjugate gradient algorithm
• Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method

This page was built for publication: Estimates of the \(l_2\) norm of the error in the conjugate gradient algorithm