LAUSR

Recently, Bai and Zhang [Numerical Linear Algebra with Applications, 2013, 20, 425–439] constructed modulus-based synchronous multisplitting methods by an equivalent reformulation of the linear complementarity problem into a system of fixed-point equations and studied the convergence of them; Li et al. [Journal of Nanchang University (Natural Science), 2013, 37, 307–312] studied synchronous block multisplitting iteration methods; Zhang and Li [Computers and Mathematics with Application, 2014, 67, 1954–1959] analyzed and obtained the weaker convergence results for linear complementarity problems. In this paper, we generalize their algorithms and further study global relaxed modulus-based synchronous block multisplitting multiparameters methods for linear complementarity problems. Furthermore, we give the weaker convergence results of our new method in this paper when the system matrix is a block H+−matrix. Therefore, new results provide a guarantee for the optimal relaxation parameters, please refer to [A. Hadjidimos, M. Lapidakis and M. Tzoumas, SIAM Journal on Matrix Analysis and Applications, 2012, 33, 97–110, (dx.doi.org/10.1137/100811222)], where optimal parameters are determined.