A class of generalized multisplitting relaxation methods for linear complementarity problems (Q1129813): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11766-998-0040-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2313847590 / rank | |||
Normal rank | |||
Revision as of 21:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of generalized multisplitting relaxation methods for linear complementarity problems |
scientific article |
Statements
A class of generalized multisplitting relaxation methods for linear complementarity problems (English)
0 references
9 April 1999
0 references
Two generalized parallel multisplitting relaxation methods for solving a linear complementarity problem (LCP) \(x^+=Mx^-+q\) are described. The sequences generated by the methods are proved to converge to the unique solution of the LCP provided \(M\) is a \(H\)-matrix with positive diagonal elements.
0 references
linear complementarity problem
0 references
multisplitting
0 references
relaxation method
0 references
parallel computation
0 references
convergence
0 references
