An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems

DOI10.1016/0377-0427(88)90354-8zbMath0659.65042MaRDI QIDQ1112558

Yiannis G. Saridakis

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90354-8

zbMATH Keywords

iterative methods; successive overrelaxation; converges; acceleration(A); extrapolation(E); Gauss-Seidel-method; large-scale least-squares problems

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F10: Iterative numerical methods for linear systems

Related Items

Methodes iteratives de type sor pour resoudre les problemes des moindres carres^∗

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(p\)-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
• Convergence theory of extrapolated iterative methods for a certain class of non-symmetric linear systems
• Convergence of block iterative methods applied to sparse least-squares problems
• The optimal solution to the problem of complex extrapolation of a first- order scheme
• Convergence of a direct-iterative method for large-scale least-squares problems
• Generalized consistent orderings and the accelerated overrelaxation method
• A note on two block-SOR methods for sparse least squares problems
• Optimal block iterative schemes for certain large, sparse,and nonsymmetric linear systems
• A direct method for the solution of sparse linear least squares problems
• The optimal solution of the extrapolation problem of a first order scheme
• Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
• Iterative Methods with k-Part Splittings
• Accelerated Overrelaxation Method
• Iterative Methods for Solving Partial Difference Equations of Elliptic Type