Roundoff-error analysis of a new class of conjugate-gradient algorithms

DOI10.1016/0024-3795(80)90259-1zbMath0431.65015OpenAlexW2170198330MaRDI QIDQ1138343

Henryk Woźniakowski

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(80)90259-1

zbMATH Keywords

numerical testssteepest descentrounding errorsconjugate gradient algorithmsdominating eigenvectorpositive definite symmetric coefficient matrix

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Iterative numerical methods for linear systems (65F10) Roundoff error (65G50)

Related Items (6)

Numerical stability of GMRES ⋮ Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems ⋮ General solution of full row rank linear systems of equations using a new compression ABS model ⋮ Analysis of error propagation in the ABS class for linear systems ⋮ Why does information-based complexity use the real number model? ⋮ On the real convergence rate of the conjugate gradient method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Round-off error analysis of iterations for large linear systems
• Numerical stability of the Chebyshev method for the solution of large linear systems
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• Iterative refinement implies numerical stability
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Roundoff-error analysis of a new class of conjugate-gradient algorithms