Two-Stage Multisplitting Iteration Methods Using Modulus-Based Matrix Splitting as Inner Iteration for Linear Complementarity Problems

The matrix multisplitting iteration method is an effective tool for solving large sparse linear complementarity problems. However, at each iteration step we have to solve a sequence of linear complementarity sub-problems exactly. In this paper, we present a two-stage multisplitting iteration method, in which the modulus-based matrix splitting iteration and its relaxed variants are employed as inner iterations to solve the linear complementarity sub-problems approximately. The convergence theorems of these two-stage multisplitting iteration methods are established. Numerical experiments show that the two-stage multisplitting relaxation methods are superior to the matrix multisplitting iteration methods in computing time, and can achieve a satisfactory parallel efficiency.

[1]  A. Frommer,et al.  Convergence of relaxed parallel multisplitting methods , 1989 .

[2]  D. Szyld,et al.  H-Splittings and two-stage iterative methods , 1992 .

[3]  Masao Fukushima,et al.  A multisplitting method for symmetric linear complementarity problems , 1995 .

[4]  Zhong-Zhi Bai,et al.  A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations , 1996 .

[5]  Li-Li Zhang,et al.  Two-step modulus-based matrix splitting iteration method for linear complementarity problems , 2011, Numerical Algorithms.

[6]  Daniel B. Szyld,et al.  PARALLEL, SYNCHRONOUS AND ASYNCHRONOUS TWO-STAGE MULTISPLITTING METHODS , 1995 .

[7]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[8]  Zhong-Zhi Bai,et al.  The convergence of parallel iteration algorithms for linear complementarity problems , 1996 .

[9]  白中治 ON THE MONOTONE CONVERGENCE OF THE PROJECTED ITERATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS , 1996 .

[10]  A. Brandt,et al.  Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems , 1983 .

[11]  Zhong-Zhi Bai,et al.  Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations , 1997, Numerical Algorithms.

[12]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[13]  W. Deren On the convergence of the parallel multisplitting AOR algorithm , 1991 .

[14]  Zhong-Zhi Bai,et al.  The monotone convergence of the two-stage iterative method for solving large sparse systems of linear equations , 1997 .

[15]  Mei-Qun Jiang,et al.  On convergence of two-stage splitting methods for linear complementarity problems , 2005 .

[16]  Richard S. Varga,et al.  Matrix Iterative Analysis , 2000, The Mathematical Gazette.

[17]  Zhong-Zhi Bai,et al.  On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem , 1999, SIAM J. Matrix Anal. Appl..

[18]  Li-Li Zhang,et al.  Modulus‐based synchronous multisplitting iteration methods for linear complementarity problems , 2013, Numer. Linear Algebra Appl..

[19]  Zhong-Zhi Bai,et al.  Modulus‐based matrix splitting iteration methods for linear complementarity problems , 2010, Numer. Linear Algebra Appl..

[20]  Zhong-Zhi Bai,et al.  Convergence analysis of the two-stage¶multisplitting method , 1999 .

[21]  Li-Li Zhang,et al.  Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems , 2012, Numerical Algorithms.

[22]  Mei-Qun Jiang,et al.  A modified modulus method for symmetric positive‐definite linear complementarity problems , 2009, Numer. Linear Algebra Appl..

[23]  Jun-Liang Dong,et al.  Inexact multisplitting methods for linear complementarity problems , 2009 .

[24]  Yongzhong Song,et al.  Modified AOR methods for linear complementarity problem , 2003, Appl. Math. Comput..

[25]  C. Cryer The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation , 1971 .

[26]  David J. Evans,et al.  Matrix multisplitting relaxation methods for linear complementarity problems , 1997, Int. J. Comput. Math..