论文标题
放松加速的两扫模矩阵分裂迭代方法，用于解决线性互补性问题
A relaxation accelerated two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
论文作者
论文摘要
对于线性互补性问题，我们提出了一个宽松的辅助式两扫镜拆分迭代方法。收敛分析表明，当系统矩阵为$ h _+$ - 矩阵并给出了收敛条件时，提出的方法会收敛到线性互补问题的精确解决方案。数值实验表明，所提出的方法比现有方法更有效。
For a linear complementarity problem, we present a relaxaiton accelerated two-sweep matrix splitting iteration method. The convergence analysis illustrates that the proposed method converges to the exact solution of the linear complementarity problem when the system matrix is an $H_+$-matrix and the convergence conditions are given. Numerical experiments show that the proposed method is more efficient than the existing ones.
