Block AOR Iterative Schemes for Large-Scale Least-Squares Problems

DOI10.1137/0726038zbMath0677.65036OpenAlexW2093757562MaRDI QIDQ3833509

Theodore S. Papatheodorou, E. P. Papadopoulou, Yiannis G. Saridakis

Publication date: 1989

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0726038

zbMATH Keywords

numerical examplesuccessive overrelaxationAOR methodoptimal parametersaccelerated overrelaxationlarge sparse overdetermined systemlarge-scale least-squares problemsSOR methodstwo-block partitioning

Mathematics Subject Classification ID

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

Related Items (7)

Extrapolated Gauss-Seidel I and SOR methods for least-squares problems ⋮ Semiconvergence of block AOR method for singular \(p\)-cyclic matrices ⋮ An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems ⋮ The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems ⋮ AOR iterative methods for rank deficient least squares problems ⋮ Methodes iteratives de type sor pour resoudre les problemes des moindres carres^∗ ⋮ Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

This page was built for publication: Block AOR Iterative Schemes for Large-Scale Least-Squares Problems