A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS (Q4347261)
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 1045574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS |
scientific article; zbMATH DE number 1045574 |
Statements
A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS (English)
0 references
22 January 1998
0 references
parallel computation
0 references
multisplitting method
0 references
linear complementarity problem
0 references
overrelaxation
0 references
0 references
0 references
0 references
0.9438404
0 references
0.9360199
0 references
0.9309888
0 references
0.9259545
0 references
0.9177024
0 references
0.9156041
0 references
Proposition and theory of a very general multisplitting method that includes several families of special type for the solution of the linear complementarity problem (LCP) that can be reformulated as a fixed point problem. Parallelization on an SIMD computer is over the splittings. The methods are of overrelaxation type. No numerical example is presented. The efficiency will surely depend on the choice of the many parameters of the method.
0 references
