Numerical aspects of the generalized CG-method applied to least squares problems

DOI10.1007/BF02238742zbMath0662.65034OpenAlexW402460180MaRDI QIDQ1114333

Chang-jun Li, David J. Evans

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238742

zbMATH Keywords

numerical experimentssuccessive overrelaxationgeneralized conjugate gradient methodlinear least squares problems

Mathematics Subject Classification ID

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

Related Items (4)

The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems ⋮ A note on preconditioned iterative methods for least squares problems ⋮ A note to the gmres method ⋮ D^1/2-Norms of the sor and related methods for a class of nonsymmetric matrices

Cites Work

• Convergence of a direct-iterative method for large-scale least-squares problems
• A note on two block-SOR methods for sparse least squares problems
• The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems
• A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
• The least squares problem and pseudo-inverses
• Unnamed Item

This page was built for publication: Numerical aspects of the generalized CG-method applied to least squares problems