4.6 Article

Two-step modulus-based matrix splitting iteration methods for implicit complementarity problems

Journal

NUMERICAL ALGORITHMS
Volume 82, Issue 4, Pages 1377-1394

Publisher

SPRINGER
DOI: 10.1007/s11075-019-00660-7

Keywords

Implicit complementarity problem; Modulus method; Matrix splitting; Convergence

Funding

  1. National Natural Science Foundation of China [11771225]
  2. Postgraduate Research & Practice Innovation Program of Jiangsu Province [KYCX17_1905]

Ask authors/readers for more resources

In this paper, a class of two-step modulus-based matrix splitting (TMMS) iteration methods are proposed to solve the implicit complementarity problems. It is proved that the TMMS iteration methods are convergent under certain conditions when the system matrix is either a positive definite matrix or an H+-matrix. Two numerical examples are given to illustrate the effectiveness of the new proposed iteration methods. Numerical results show that the new proposed TMMS iteration methods have better performance than the existing modulus-based relaxation iteration methods for solving the implicit complementarity problems.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available