A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in Parallel Algorithms and Applications
- Vol. 2 (3), 173-192
- https://doi.org/10.1080/10637199408915415
Abstract
In this paper, a class of asynchronous parallel matrix multisplitting relaxation methods suitable to the MIMD-systems are constructed. The convergence and the convergence rate of it are discussed in a detailed manner under the condition that the coefficient matrix A is a monotone matrix. Moreover, when the matrix A is an L-matrix, we give sufficient and necessary conditions ensuring the convergence of the methods, too.Keywords
This publication has 8 references indexed in Scilit:
- On the convergence of the parallel multisplitting AOR algorithmLinear Algebra and its Applications, 1991
- The effect of the number of processors on the convergence of the parallel block Jacobi methodLinear Algebra and its Applications, 1991
- An asynchronous parallel algorithm for solving a class of nonlinear simultaneous equationsParallel Computing, 1991
- Convergence of relaxed parallel multisplitting methodsLinear Algebra and its Applications, 1989
- Models of parallel chaotic iteration methodsLinear Algebra and its Applications, 1988
- Multi-Splittings of Matrices and Parallel Solution of Linear SystemsSIAM Journal on Algebraic Discrete Methods, 1985
- Some convergence results for asynchronous algorithmsNumerische Mathematik, 1982
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978