A class of generalized multisplitting relaxation methods for linear complementarity problems (Q1129813)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1193546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of generalized multisplitting relaxation methods for linear complementarity problems |
scientific article; zbMATH DE number 1193546 |
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
0 references
0.9565794
0 references
0.9356678
0 references
0.93341565
0 references
0.93138474
0 references
0.9309888
0 references
0.9274095
0 references
0.92708766
0 references
0.92566097
0 references
0.92494047
0 references
