On the convergence of generalized parallel multisplitting iterative methods for semidefinite linear systems
This paper studies generalized multisplitting methods for large sparse linear systems \(Ax = b\) denoted by \(x^{(k+1)} = (I-RA)^{(k)} + Rb\). Here \(R\) may differ from the classical uses of \(R = M^{-1}\), \(R = M^\dagger\) or \(R\) as the Drazin inverse of \(M\) for an additive splitting \(A = M - N\). The main results are: If \(A\) is positive semidefinite, if all \(R_j^T+R_j-R_j^TAR_j\) are positive semidefinite on the column space of \(A\) in a generalized stationary parallel multisplitting method then the quotient convergence and convergence are equivalent. This is generalized to generalized non-stationary parallel multisplitting methods and under relevant conditions, convergence or quotient convergence is proved. A 2 by 2 example shows the value of this method for a system with singular semidefinite \(A\).
- Semiconvergence of parallel multisplitting methods for symmetric positive semidefinite linear systems.
- On parallel multisplitting iterative methods for singular linear systems
- scientific article; zbMATH DE number 1110507
- scientific article; zbMATH DE number 6501502
- THE PARALLEL MULTISPLITTING GENERALIZED ITERATIVE METHODS
- On parallel multisplitting iterative methods for singular linear systems
- Generalized iterative methods for semidefinite linear systems
- Semiconvergence of parallel multisplitting methods for symmetric positive semidefinite linear systems.
- scientific article; zbMATH DE number 6501502 (Why is no real title available?)
- Convergence analysis of iterative methods for semidefinite systems
- Generalizations of the nonstationary multisplitting iterative method for symmetric positive definite linear systems
This page was built for publication: On the convergence of generalized parallel multisplitting iterative methods for semidefinite linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940970)