4.5 Article

Relaxed Modulus-Based Matrix Splitting Methods for the Linear Complementarity Problem

Journal

SYMMETRY-BASEL
Volume 13, Issue 3, Pages -

Publisher

MDPI
DOI: 10.3390/sym13030503

Keywords

linear complementarity problem; matrix splitting; iteration method; convergence

Funding

  1. National Natural Science Foundation of China [11961082]

Ask authors/readers for more resources

In this paper, a new equivalent fixed-point form of the linear complementarity problem is obtained by introducing a relaxed matrix, and a class of relaxed modulus-based matrix splitting iteration methods is established to solve the problem. Sufficient conditions for ensuring the convergence of relaxed modulus-based matrix splitting iteration methods are provided, and numerical examples are used to demonstrate the effectiveness of the proposed methods.
In this paper, we obtain a new equivalent fixed-point form of the linear complementarity problem by introducing a relaxed matrix and establish a class of relaxed modulus-based matrix splitting iteration methods for solving the linear complementarity problem. Some sufficient conditions for guaranteeing the convergence of relaxed modulus-based matrix splitting iteration methods are presented. Numerical examples are offered to show the efficacy of the proposed methods.

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

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available