A note on the SOR and CG methods for large least squares problems

DOI10.1016/0024-3795(89)90699-XzbMath0678.65025MaRDI QIDQ1124276

Chang-jun Li, David J. Evans

Publication date: 1989

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

zbMATH Keywords

successive overrelaxationleast squares problemconjugate gradient methodsoverdetermined linear systemslarge scale problem

Mathematics Subject Classification ID

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

Related Items (5)

The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems ⋮ Sor method andp-cyclic matrices (I) ⋮ Optimum sor convergence for complex spectra ⋮ A note to the gmres method ⋮ The Block Successive Relaxation Additive Tterative method for least squares problems

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 least squares problem and pseudo-inverses
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the SOR and CG methods for large least squares problems