Convergence of block iterative methods applied to sparse least-squares problems
The paper is dealing with the problems of accurately computing the least squares solutions of overdetermined systems (1) \(Ax=b\) of linear equations, such as those arising in geodetical network problems. In (1) A is a large sparse \(m\times n\) matrix with \(m\geq n\), b is a vector in \(R^ m\) and x a vector in \(R^ n\). It turns out that an equivalent problem to find the least squares solution of (1) is to solve a linear system (2) \(Cz=d\) of \(m+n\) equations in \(m+n\) unknowns. In (2) C is a nonsingular \((m+n)\times (m+n)\) matrix, \(z=(x,w,v)^ T\in {\mathbb{R}}^{m+n}\) a vector with \(x\in {\mathbb{R}}^ n\), \(w\in {\mathbb{R}}^{m-n}\), \(v\in {\mathbb{R}}^ n\) and \(d=(b_ 1,b_ 2,0)^ T\in {\mathbb{R}}^{m+n}\) a vector with \((b_ 1,b_ 2)^ T=b,\) \(b_ 1\in {\mathbb{R}}^ n\), \(b_ 2\in {\mathbb{R}}^{m-n}\). As was observed by Chen in 1975 the block-SOR (successive overrelaxation) iterative method is in particular convenient to solve this special type (2) of linear systems. In the present paper several new results are obtained in case the block-Jacobi matrix J associated with the matrix C is a consistently ordered matrix, weakly cyclic of index 3. Theorem 1 gives the exact convergence domain of the block-SOR iterative method as well as the optimal relaxation factor, when the eigenvalues of \(J^ 3\) as assumed to be nonpositive. Theorem 2 answers the same questions when the eigenvalues of \(J^ 3\) are non-negative. In addition, Theorem 1 gives a new result that applications of the block-SOR method can be made even in some cases where the associated block-Jacobi iterative method is divergent. Furthermore, Theorem 1 corrects some erroneous results occuring in the literature.
- scientific article; zbMATH DE number 3992794
- Convergence of a direct-iterative method for large-scale least-squares problems
- Extrapolated Gauss-Seidel I and SOR methods for least-squares problems
- A note on two block-SOR methods for sparse least squares problems
- Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
- p-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
- scientific article; zbMATH DE number 3703880 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- The analysis of k-step iterative methods for linear systems from summability theory
- Convergence of a direct-iterative method for large-scale least-squares problems
- k-step iterative methods for solving nonlinear systems of equations
- A note on two block-SOR methods for sparse least squares problems
- Extrapolated Gauss-Seidel I and SOR methods for least-squares problems
- Stepsize restrictions for stability in the numerical solution of ordinary and partial differential equations
- A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- On the equivalence of the k-step iterative Euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices
- An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems
- Precise domains of convergence for the block SSOR method associated with p-cyclic matrices
- Block cyclic SOR for Markov chains with p-cyclic infinitesimal generator
- A parallelizable SOR-like method: Systems with plus-shaped and linear spectra
- On the optimum relaxation factor associated with \(p\)-cyclic matrices
- The convergence of the two-block SAOR method for least-squares problems
- Optimality relationships for p-cyclic SOR
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- Block SOR methods for rank-deficient least-squares problems
- A Young-Eidson's type algorithm for complex \(p\)-cyclic SOR spectra
- Evaluation model and its iterative algorithm by alternating projection
- Optimal \(p\)-cyclic SOR for complex spectra
- Towards the determination of the optimal \(p\)-cyclic SSOR
- Successive overrelaxation (SOR) and related methods
- Optimum first and second order extrapolations of successive overrelaxation type methods for certain classes of matrices
- Superior convergence domains for a \(p\)-cyclic SSOR majorizer
- Exact SOR convergence regions for a general class of \(p\)-cyclic matrices
- On the convergence domains of the \(p\)-cyclic SOR
- Block SOR methods for the solution of indefinite least squares problems
- The Block Successive Relaxation Additive Tterative method for least squares problems
- On the convergence of USSOR iterative methods for solving least squares problems
- Aor type iterative methods for solving least squares problems
- A Spectrum Enveloping Technique for Iterative Solution of Central Difference Approximations of Convection-Diffusion Equations
- Sor method andp-cyclic matrices (I)
- A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis
- On the convergence of monoparametrick-step iterative euler methods for the solution of linear systems
- Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
- Sor and related methods forp-cyclic systems
- Fast iterative computation of optimal two-block H/sup infinity /-norm
- scientific article; zbMATH DE number 1305269 (Why is no real title available?)
- Convergence analysis of a block iterative version of the loping Landweber-Kaczmarz iteration
- Methodes iteratives de type sor pour resoudre les problemes des moindres carres∗
- scientific article; zbMATH DE number 3992794 (Why is no real title available?)
- Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
- scientific article; zbMATH DE number 827954 (Why is no real title available?)
- scientific article; zbMATH DE number 1399523 (Why is no real title available?)
- scientific article; zbMATH DE number 279601 (Why is no real title available?)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem
- The SOR-k method for linear systems with p-cyclic matrices
- Over- and underrelaxation for linear systems with weakly cyclic Jacobi matrices of index p
- Successive overrelaxation methods for solving the rank deficient linear least squares problem
- Application of the Schur-Cohn theorem to the precise convergence domain for a p-cyclic SOR iteration matrix
- Convergence domains of the SSOR method for a class of generalized consistently ordered matrices
- Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices
- An iterative substructuring algorithm for equilibrium equations
- \(p\)-cyclic SOR for BVPs with periodic boundary conditions
This page was built for publication: Convergence of block iterative methods applied to sparse least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058819)
