Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (Q1116899)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem |
scientific article |
Statements
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (English)
0 references
1988
0 references
Convergence is established for asynchronous parallel successive overrelaxation (SOR) algorithms for the symmetric linear complementarity problem. For the case of a strictly diagonally dominant matrix convergence is achieved for a relaxation factor interval of (0,2] with line search, and (0,1] without line search. Computational tests on the Sequent Symmetry S81 multiprocessor give speedup efficiency in the 43 \%- 91 \% range for the cases for which convergence is established. The tests also show superiority of the asynchronous SOR algorithms over their synchronous counterparts.
0 references
convergence analysis
0 references
parallel algorithms
0 references
asynchronous parallel successive overrelaxation
0 references
symmetric linear complementarity
0 references
strictly diagonally dominant matrix
0 references
line search
0 references
Computational tests
0 references
0 references