A note on preconditioned iterative methods for least squares problems

DOI10.1080/00207169508804379zbMath0830.65028OpenAlexW1964286625MaRDI QIDQ4847150

Jin Yun Yuan, David J. Evans

Publication date: 10 September 1995

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

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

zbMATH Keywords

conjugate gradient methodsuccessive overrelaxationpreconditionersleast squares problemsreduced systems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (1)

Convergence of the generalized AOR method

Cites Work

• Unnamed Item
• Numerical aspects of the generalized CG-method applied to least squares problems
• The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems
• New Stopping Criteria for Some Iterative Methods for a Class of Unsymmetric Linear Systems
• A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations

This page was built for publication: A note on preconditioned iterative methods for least squares problems