Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
- 1 April 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (2), 671-679
- https://doi.org/10.1137/0613042
Abstract
Two-stage and multisplitting methods for the parallel solution of linear systems are studied. A two-stage multisplitting method is presented that reduces to each of the others in particular cases. Conditions for its convergence are given. In the particular case of a multisplitting method related to block Jacobi, it is shown that it is equivalent to a two-stage method with only one inner iteration per outer iteration. A fixed number of iterations of this method, say, p, is compared with a two-stage method with p inner iterations. The asymptotic rate of convergence of the first method is faster, but, depending on the structure of the matrix and the parallel architecture, it takes more time to converge. This is illustrated with numerical experiments.Keywords
This publication has 8 references indexed in Scilit:
- Convergence of nested classical iterative methods for linear systemsNumerische Mathematik, 1990
- Comparison theorems for weak splittings of bounded operatorsNumerische Mathematik, 1990
- Some Domain Decomposition Algorithms for Elliptic ProblemsPublished by Elsevier ,1990
- Multisplitting of a Symmetric Positive Definite MatrixSIAM Journal on Matrix Analysis and Applications, 1990
- Models of parallel chaotic iteration methodsLinear Algebra and its Applications, 1988
- Multisplittings and parallel iterative methodsComputer Methods in Applied Mechanics and Engineering, 1987
- Convergence of parallel multisplitting iterative methods for M-matricesLinear Algebra and its Applications, 1987
- Multi-Splittings of Matrices and Parallel Solution of Linear SystemsSIAM Journal on Algebraic Discrete Methods, 1985