On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems (Q931069)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems |
scientific article |
Statements
On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems (English)
0 references
24 June 2008
0 references
The authors discuss iterative methods for solving consistent systems of linear equations \(Ax = b\), where \(A\) is a \(m \times n\) complex matrix. At first a necessary and sufficient condition for the convergence of the stationary iterative process \(x^{(k+1)} = M^+Nx^{(k)} + M^+b\) is derived, where \(A = M-N\) is a subproper splitting of the matrix \(A\) and \(M^+\) denotes the Moore-Penrose inverse of \(M\). Additionally, conditions for the equivalence of the convergence and quotient convergence for the stationary iterative process are given. Finally, the convergence of multi-splitting algorithms for rectangular systems is proved.
0 references
Rectangular linear systems
0 references
Iterative method
0 references
Proper splitting
0 references
Subproper splitting
0 references
Regularity
0 references
Hermitian positive semi-definite matrix
0 references
Multisplitting
0 references
Quotient convergence
0 references
0 references
0 references
0 references
0 references