Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem |
| |
Authors: | R De Leone O L Mangasarian |
| |
Institution: | (1) Computer Sciences Department, University of Wisconsin, 53706 Madison, WI, USA |
| |
Abstract: | 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.This material is based on research supported by National Science Foundation Grants DCR-8420963 and DCR-8521228 and Air Force Office of Scientific Research Grant AFOSR-86-0172. |
| |
Keywords: | Linear complementarity parallel algorithms asynchronous algorithm successive overrelaxation |
本文献已被 SpringerLink 等数据库收录! |