On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem

Abstract

The monotone convergence of the parallel matrix multisplitting relaxation method for linear complementarity problems (see Bai, Z. Z. and Evans, D. J. 1997 Int. J. Comput. Math 63, 309-326) is discussed, and the corresponding comparison theorem about the monotone convergence rate of this method is thoroughly established.