The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems

DOI10.1080/00207169008803901zbMath0706.65023OpenAlexW2062227061WikidataQ126244425 ScholiaQ126244425MaRDI QIDQ3486735

Chang-jun Li, David J. Evans

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803901

zbMATH Keywords

comparison of methodsstopping criteriaConvergencegeneralized conjugate gradient methodleast- squares problemSOR scheme

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items (2)

Numerical aspects of the generalized CG-method applied to least squares problems ⋮ A note on preconditioned iterative methods for least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of a direct-iterative method for large-scale least-squares problems
• Numerical aspects of the generalized CG-method applied to least squares problems
• A note on the SOR and CG methods for large least squares problems
• Numerical Methods for Large Sparse Linear Least Squares Problems
• Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
• On the Equivalence of Certain Iterative Acceleration Methods
• A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
• The least squares problem and pseudo-inverses
• The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”

This page was built for publication: The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems