On the convergence of the multisplitting methods for the linear complementarity problem

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.