Matrix multisplitting relaxation methods for linear complementarity problems
- 1 January 1997
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 63 (3), 309-326
- https://doi.org/10.1080/00207169708804569
Abstract
In this paper, a class of synchronous as well as asynchronous matrix multisplitting methods for solving the linear complementarity problem is set up, and its convergence is proved when the coefficient matrix is an H-matrix with positive diagonal elementsKeywords
This publication has 12 references indexed in Scilit:
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity resultsMathematical Programming, 1993
- On the convergence of the parallel multisplitting AOR algorithmLinear Algebra and its Applications, 1991
- Convergence of relaxed parallel multisplitting methodsLinear Algebra and its Applications, 1989
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problemMathematical Programming, 1988
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programsJournal of Optimization Theory and Applications, 1987
- Multi-Splittings of Matrices and Parallel Solution of Linear SystemsSIAM Journal on Algebraic Discrete Methods, 1985
- Sparsity-preserving sor algorithms for separable quadratic and linear programmingComputers & Operations Research, 1984
- On the convergence of a basic iterative method for the implicit complementarity problemJournal of Optimization Theory and Applications, 1982
- Solution of nonsymmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1981
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977