4.7 Article

A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems

Journal

Publisher

ELSEVIER
DOI: 10.1016/j.cam.2022.114140

Keywords

Linear complementarity problem; Relaxation; Modulus-based matrix splitting iteration; method; Convergence

Funding

  1. National Natural Science Foundation of China [41571380, 10971102, 16KJA110001]
  2. Natural Science Foundation of the Jiangsu Higher Education Institution, PR China

Ask authors/readers for more resources

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.

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.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available