The convergence of parallel iteration algorithms for linear complementarity problems (Q1352387)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The convergence of parallel iteration algorithms for linear complementarity problems |
scientific article; zbMATH DE number 978113
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The convergence of parallel iteration algorithms for linear complementarity problems |
scientific article; zbMATH DE number 978113 |
Statements
The convergence of parallel iteration algorithms for linear complementarity problems (English)
0 references
30 October 1997
0 references
This paper describes and analyses parallel multisplitting AOR methods for the linear complementarity problem. Convergence for particular schemes is proved in the case that the matrix is an \(H\)-matrix with positive diagonal or a symmetric positive matrix in dissection form compatible with the multisplitting. Iteration counts are compared for various degrees of overlaps and choices of parameters in a numerical example of dimension 105.
0 references
convergence
0 references
\(H\)-matrix
0 references
multisplitting AOR methods
0 references
linear complementarity problem
0 references
numerical example
0 references
0 references
