Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem

DOI10.1080/00207160903456831zbMath1241.65041MaRDI QIDQ5391459

Liying Duan, Bing Zheng, Ke Wang

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903456831

zbMATH Keywords

numerical example; acceleration techniques; eigenvalues of the iteration matrix; rank deficient systems; two-block successive overrelaxation (SOR) method

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F10: Iterative numerical methods for linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Successive overrelaxation methods for solving the rank deficient linear least squares problem
• Accelerated generalized successive overrelaxation method for least squares problems
• Convergence of block iterative methods applied to sparse least-squares problems
• Convergence of a direct-iterative method for large-scale least-squares problems
• The Tchebychev iteration for nonsymmetric linear systems
• Block SOR methods for rank-deficient least-squares problems
• Accelerate overrelaxation methods for rank deficient linear systems
• Symmetric block-SOR methods for rank-deficient least squares problems
• Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem
• Cones and Iterative Methods for Best Least Squares Solutions of Linear Systems