Convergence is established for the multi-sweep asynchronous parallel successive overrelaxation (SOR) algorithm for the nonsymmetric linear complementarity problem. The algorithm was originally introduced in [4] for the symmetric linear complementarity problem. Computational tests show the superiority of the multi-sweep asynchronous SOR algorithm over its single-sweep counterpart on both symmetric and nonsymmetric linear complementarity problems. © 1990 J.C. Baltzer AG, Scientific Publishing Company.

Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem

DE LEONE, Renato;
1990

Abstract

Convergence is established for the multi-sweep asynchronous parallel successive overrelaxation (SOR) algorithm for the nonsymmetric linear complementarity problem. The algorithm was originally introduced in [4] for the symmetric linear complementarity problem. Computational tests show the superiority of the multi-sweep asynchronous SOR algorithm over its single-sweep counterpart on both symmetric and nonsymmetric linear complementarity problems. © 1990 J.C. Baltzer AG, Scientific Publishing Company.
Articolo
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11581/241411
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact