A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems (Q503358): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11075-016-0142-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11075-016-0142-7 / rank | |||
Normal rank | |||
Latest revision as of 19:39, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems |
scientific article |
Statements
A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems (English)
0 references
12 January 2017
0 references
By combining a relaxation technique with the fixed-point iteration formula for updating the iteration vector, the authors propose a relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems. The convergence of the proposed method is established. The efficiency of the method is illustrated by two numerical examples.
0 references
linear complementarity problems
0 references
relaxation method
0 references
convergence
0 references
fixed-point iteration
0 references
matrix splitting iteration method
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
