摘要
针对一类双边障碍问题,提出了一类模系矩阵分裂迭代方法。该方法采用模系矩阵分裂迭代算法逐次子线性互补问题,最终求解的线性互补问题的解,即为双边障碍问题的解。通过分析方法的收敛性,数值结果表明了方法的有效性。
A modulus-based matrix splitting method is presented for solving a two-side obstacle problem,which solves some sub-linear complementarity problems by using the matrix splitting method.The solution of the final sub-linear complementarity problems is the solution of the two-side obstacle problem.The convergence is given,and the numerical results show that the proposed method is effective.
作者
方贵炳
李郴良
FANG Guibing;LI Chenliang(School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China;Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004, China)
出处
《桂林电子科技大学学报》
2018年第2期154-157,共4页
Journal of Guilin University of Electronic Technology
基金
国家自然科学基金(11661027)
广西自然科学基金(2015GXNSFAA139014)
关键词
双边障碍问题
模系矩阵分裂
线性互补问题
收敛
two-side obstacle problem
modulus-based matrix splitting
linear complementarity problem
convergence
