The convergence of parallel iteration algorithms for linear complementarity problems (Q1352387): 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.1016/0898-1221(96)00172-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052028268 / rank | |||
Normal rank | |||
Revision as of 21:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The convergence of parallel iteration algorithms for linear complementarity problems |
scientific article |
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
