求解一类隐式互补问题的加速模系矩阵分裂迭代法

Accelerated Modulus-Based Matrix Splitting Iteration Methods for a Class of Implicit Complementarity Problems

构造了求解一类隐式互补问题的加速模系矩阵分裂迭代法。理论分析建立了新方法在系数矩阵为H+-矩阵时的收敛性质。数值实验结果表明新方法是行之有效的,并且加速模系矩阵分裂迭代法在迭代步数和时间上均优于传统的模系矩阵分裂迭代法。

To solve a class of implicit complementarity problems,the accelerated modulus-based matrix splitting iteration methods are presented and analyzed.The convergence theory is established when the system matrix is an H+-matrix.The numerical experiments show that the proposed methods are efficient and better than the modulus-based matrix splitting iteration methods in aspects of iteration steps and CPU time.