Block SOR methods for rank-deficient least-squares problems
From MaRDI portal
The paper is devoted to the problem of preconditioned block iterative methods for solving full rank least squares problems. A new system of normal equations for the rank-deficient least squares problem is derived. 2 block and 3 block successive overrelaxation (SOR) methods are proposed and their convergence and parameters are studied. The comparison between these methods is investigated and the obtained results show, that the 2-block method outperform the 3-block method for rank-deficient problems as full rank problems.
Recommendations
- Symmetric block-SOR methods for rank-deficient least squares problems
- Study of 2-block AOR iterative method for rank deficient least squares problems
- Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem
- A note on two block-SOR methods for sparse least squares problems
- Block SOR methods for the solution of indefinite least squares problems
Cites work
- A Direct Projection Method for Sparse Linear Systems
- A note on two block-SOR methods for sparse least squares problems
- Block SOR methods for rank-deficient least-squares problems
- Convergence of a direct-iterative method for large-scale least-squares problems
- Convergence of block iterative methods applied to sparse least-squares problems
- scientific article; zbMATH DE number 992627 (Why is no real title available?)
- scientific article; zbMATH DE number 3325215 (Why is no real title available?)
- Preconditioned conjugate gradient method for rank deficient least-squares problems
- Preconditioners for least squares problems by LU factorization
- Successive overrelaxation methods for solving the rank deficient linear least squares problem
- The direct-projection methods
Cited in
(53)- A note on two block-SOR methods for sparse least squares problems
- Extrapolated Gauss-Seidel I and SOR methods for least-squares problems
- Block SOR methods for rank-deficient least-squares problems
- On semi-convergence of a class of relaxation methods for singular saddle point problems
- Block SOR methods for the solution of indefinite least squares problems
- A parameterized shift-splitting preconditioner for saddle point problems
- On quasi shift-splitting iteration method for a class of saddle point problems
- Convergence analysis of modified PGSS methods for singular saddle-point problems
- General constraint preconditioning iteration method for singular saddle-point problems
- Preconditioners for rank deficient least squares problems
- How to compute the minimum norm least squares solution of singular linear system by using the preconditioned HSS method?
- Preconditioned Richardson iteration for augmented linear systems
- A generalized shift-splitting preconditioner for saddle point problems
- The Uzawa-HSS method for saddle-point problems
- On generalized parameterized inexact Uzawa methods for singular saddle-point problems
- A note on the iterative algorithm for large sparse saddle point problems
- Optimal parameters of GSOR-like methods for solving the augmented linear systems
- Application of modified homotopy perturbation method for solving the augmented systems
- Semi-convergence analysis of GMSSOR methods for singular saddle point problems
- A modified generalized shift-splitting method for nonsymmetric saddle point problems
- Convergence of a generalized MSSOR method for augmented systems
- Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems
- Symmetric block-SOR methods for rank-deficient least squares problems
- Symmetric successive overrelaxation methods for rank deficient linear systems
- Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem
- Accelerated SOR-like method for augmented linear systems
- Modified parameterized inexact Uzawa method for singular saddle-point problems
- Study of 2-block AOR iterative method for rank deficient least squares problems
- On semi-convergence of the Uzawa-HSS method for singular saddle-point problems
- Block overrelaxation iterative methods for indefinite least squares problems
- A modified SOR-like method for the augmented systems
- On semi-convergence of generalized skew-Hermitian triangular splitting iteration methods for singular saddle-point problems
- scientific article; zbMATH DE number 1399523 (Why is no real title available?)
- Preconditioned conjugate gradient method for rank deficient least-squares problems
- A class of modified GSS preconditioners for complex symmetric linear systems
- Semi-convergence analysis of Uzawa-AOR method for singular saddle point problems
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- A new Uzawa-type iteration method for non-Hermitian saddle-point problems
- Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem
- Modified upper and lower triangular splitting iterative method for a class of block two-by-two linear systems
- A modified symmetric successive overrelaxation method for augmented systems
- Evaluation of ST preconditioners for saddle point problems
- Minimum residual NDSS iteration method for a class of complex symmetric linear systems
- An Uzawa-SHSS-SS method for solving non-symmetric saddle-point problems
- A new parameterized matrix splitting preconditioner for the saddle point problems
- An Uzawa-DOS method for solving saddle-point problems
- The modified double shift-splitting preconditioner for nonsymmetric generalized saddle point problems from the time-harmonic Maxwell equations
- On the minimum convergence factor of a class of GSOR-like methods for augmented systems
- Symmetric SOR method for augmented systems
- A class of triangular splitting methods for saddle point problems
- Generalization: One technique of computational and applied mathematical methodology
- On generalized symmetric SOR method for augmented systems
- A class of Uzawa-SOR methods for saddle point problems
This page was built for publication: Block SOR methods for rank-deficient least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298664)
