期刊
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
卷 409, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.cam.2022.114140
关键词
Linear complementarity problem; Relaxation; Modulus-based matrix splitting iteration; method; Convergence
资金
- National Natural Science Foundation of China [41571380, 10971102, 16KJA110001]
- Natural Science Foundation of the Jiangsu Higher Education Institution, PR China
In this paper, we propose a relaxation general two-sweep matrix splitting iteration method for the linear complementarity problem. Convergence analysis demonstrates that the method converges to the exact solution of the linear complementarity problem when the system matrix is an H+-matrix. Numerical experiments show that the proposed method is more efficient than existing methods.
For the linear complementarity problem, we introduce a relaxation general two-sweep matrix splitting iteration method. Convergence analysis shows that the method converges to the exact solution of the linear complementarity problem when the system matrix is an H+-matrix. Numerical experiments show that the proposed method is more efficient than existing methods. (C) 2022 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据