On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem

Authors:
Zhong-Zhi Bai
Affiliations:
-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1999

Citing 0
Cited 16

Modified AOR methods for linear complementarity problem

Applied Mathematics and Computation
On convergence of two-stage splitting methods for linear complementarity problems

Journal of Computational and Applied Mathematics
Inexact multisplitting methods for linear complementarity problems

Journal of Computational and Applied Mathematics
On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

Mathematics and Computers in Simulation
A multiplicative multisplitting method for solving the linear complementarity problem

Computers & Mathematics with Applications
On convergence of two-stage splitting methods for linear complementarity problems

Journal of Computational and Applied Mathematics
IGAOR and multisplitting IGAOR methods for linear complementarity problems

Journal of Computational and Applied Mathematics
Two-step modulus-based matrix splitting iteration method for linear complementarity problems

Numerical Algorithms
Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

Journal of Computational and Applied Mathematics
Overlapping restricted additive Schwarz method applied to the linear complementarity problem with an H-matrix

Computational Optimization and Applications
Convergence of SSOR methods for linear complementarity problems

Operations Research Letters
On the equivalence of linear complementarity problems

Operations Research Letters
On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix

SIAM Journal on Matrix Analysis and Applications
Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems

Numerical Algorithms
Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem

Numerical Algorithms
Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H+-matrix

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The convergence properties of a variant of the multisplitting methods for solving the large sparse linear complementarity problems presented by Machida, Fukushima, and Ibaraki [J. Comput. Appl. Math., 62 (1995), pp. 217--227] are further discussed when the system matrices are nonsymmetric and the weighting matrices are nonnegative and diagonal. This directly results in several novel sufficient conditions for guaranteeing the convergence of these multisplitting methods. Moreover, some applicable parallel multisplitting relaxation methods and their corresponding convergence properties are discussed in detail.