A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems

In this paper, a general accelerated modulus-based matrix splitting iteration method is established, which covers the known general modulus-based matrix splitting iteration methods and the accelerated modulus-based matrix splitting iteration methods. The convergence analysis is given when the system matrix is an H+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_+$$\end{document}-matrix. Numerical examples show that the proposed methods are efficient and accelerate the convergence performance with less iteration steps and CPU times.