Asynchronous multisplitting relaxation methods for linear complementarity problems
- 1 January 1999
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 70 (3), 519-538
- https://doi.org/10.1080/00207169908804772
Abstract
To solve the linear complementarity problems efficiently on the high-speed multiprocessor systems, we set up a class of asynchronous parallel matrix multisplitting accelerated over-relaxation (AOR) method by technical combination of the matrix multisplitting and the accelerated overrelaxation techniques. The convergence theory of this new method is thoroughly established under the condition that the system matrix of the linear complementarity problem is an H-matrix with positive diagonal elements. At last, we also make multi-parameter extension for this new asynchronous multisplitting AOR method, and investigate the convergence property of the resulted asynchronous multisplitting unsymmetric AOR method. Thereby, an extensive sequence of asynchronous parallel relaxed iteration methods in the sense of multisplitting is presented for solving the large scale linear complementarity problems in the asynchronous parallel computing environments. This not only affords various choices, but also presents systematic convergence theories about the asynchronous parallel relaxation methods for solving the linear complementarity problems.Keywords
This publication has 13 references indexed in Scilit:
- Matrix multisplitting relaxation methods for linear complementarity problemsInternational Journal of Computer Mathematics, 1997
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equationsComputers & Mathematics with Applications, 1996
- The convergence of parallel iteration algorithms for linear complementarity problemsComputers & Mathematics with Applications, 1996
- Models of asynchronous parallel matrix multisplitting relaxed iterationsParallel Computing, 1995
- Parallel Numerical Solution of Variational InequalitiesSIAM Journal on Numerical Analysis, 1994
- Convergence of relaxed parallel multisplitting methodsLinear Algebra and its Applications, 1989
- Models of parallel chaotic iteration methodsLinear Algebra and its Applications, 1988
- Convergence of parallel multisplitting iterative methods for M-matricesLinear Algebra and its Applications, 1987
- Accelerated overrelaxation methodMathematics of Computation, 1978
- Chaotic relaxationLinear Algebra and its Applications, 1969