摘要
针对系数矩阵为对称正定Toeplitz矩阵的线性互补问题,本文提出了一类预处理模系矩阵分裂迭代方法.先通过变量替换将线性互补问题转化为一类非线性方程组,然后选取Strang或T.Chan循环矩阵作为预优矩阵,利用共轭梯度法进行求解.我们分析了该方法的收敛性.数值实验表明,该方法是高效可行的.
In this paper,a preconditioned modulus-based matrix splitting iteration method is presented for solving the linear complementarity problem with a symmetric positive-defined Toeplitz matrix.Firstly we transformed the linear complementarity problem into a nonlinear equations,then solve it by using preconditioned conjugate gradient method with Strang precondition matrix or T.Chan precondition matrix.We analyzed the convergence of the new method,and confirmed its efficiency through some numerical examples.
作者
吴敏华
李郴良
Wu Minhua;Li Chenliang(Guangdong University of Finance School of Financial Mathematics&Statistics,Guangzhou 510521,China;School of Mathematics and Computing Science,Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation,Guilin University of Electronic Technology,Guilin 541004,China)
出处
《计算数学》
CSCD
北大核心
2020年第2期223-236,共14页
Mathematica Numerica Sinica
基金
国家自然科学基金项目(11661027)
广西自然科学基金项目资助(2015GXNSFAA139014)
国家重大仪器专项(61627807)资助.
关键词
模系矩阵分裂迭代方法
预优共轭梯度法
TOEPLITZ矩阵
线性互补问题
modulus-based matrix iteration method
preconditioned conjugate gradient method
Toeplitz matrix
linear complementarity problems
