The convergence of the two-block SAOR method for least-squares problems

DOI10.1016/0168-9274(93)90064-XzbMath0770.65028OpenAlexW2109109966MaRDI QIDQ1208538

Jin Yun Yuan

Publication date: 16 May 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(93)90064-x

zbMATH Keywords

convergenceiterative methodsleast-squares problemSAOR methodsymmetric accelerated overrelaxation methodoptimal relaxation and extrapolation parameters

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of block iterative methods applied to sparse least-squares problems
• p-cyclic matrices and the symmetric successive overrelaxation method
• Convergence of a direct-iterative method for large-scale least-squares problems
• Non-adaptive and adaptive SAOR-CG algorithms
• A note on two block-SOR methods for sparse least squares problems
• Symmetric accelerated overrelaxation (saor) method
• The accelerated SAOR method for large linear systems
• Jordan-Elimination und Ausgleichung nach kleinsten Quadraten
• The least squares problem and pseudo-inverses

This page was built for publication: The convergence of the two-block SAOR method for least-squares problems