A note on two block-SOR methods for sparse least squares problems

DOI10.1016/0024-3795(87)90110-8zbMath0621.65060OpenAlexW2003945644MaRDI QIDQ1090078

Roland W. Freund

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90110-8

zbMATH Keywords

conjugate gradient methodblock SOR methodsKrylov sequenceblock overrelaxationlarge least squares problemspreconditioned normal equations

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)

Related Items (16)

Algorithms and experiments for structural mechanics on high-performance architectures ⋮ Extrapolated Gauss-Seidel I and SOR methods for least-squares problems ⋮ An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems ⋮ Numerical aspects of the generalized CG-method applied to least squares problems ⋮ Numerical methods for generalized least squares problems ⋮ Preconditioned conjugate gradient method for generalized least squares problems ⋮ Precise domains of convergence for the block SSOR method associated with p-cyclic matrices ⋮ A note on the SOR and CG methods for large least squares problems ⋮ Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation ⋮ The convergence of the two-block SAOR method for least-squares problems ⋮ Block SOR methods for the solution of indefinite least squares problems ⋮ A generalized successive overrelaxation method for least squares problems ⋮ Convergence domains of the SSOR method for a class of generalized consistently ordered matrices ⋮ Block SOR methods for rank-deficient least-squares problems ⋮ Order-reducing conjugate gradients versus block AOR for constrained least-squares problems ⋮ A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• Convergence of block iterative methods applied to sparse least-squares problems
• Convergence of a direct-iterative method for large-scale least-squares problems
• Jordan-Elimination und Ausgleichung nach kleinsten Quadraten
• Iterative Methods for Equality-Constrained Least Squares Problems
• A Fast Direct Method for the Least Squares Solution of Slightly Overdetermined Sets of Linear Equations
• The least squares problem and pseudo-inverses

This page was built for publication: A note on two block-SOR methods for sparse least squares problems