Serial and parallel successive overrelaxation (SOR) solutions of specially structured large-scale quadratic programs with simple bounds are discussed. By taking advantage of the sparsity structure of the problem, the SOR algorithm was successfully implemented on two massively parallel Single-Instruction-Multiple-Data machines: a Connection Machine CM-2 and a MasPar MP-1. Computational results for the well known obstacle problems show the effectiveness of the algorithm. Problems with millions of variables have been solved in a few minutes on these massively parallel machines, and speed-ups of 90% or more were achieved.

Massively parallel solution of quadratic programs via successive overrelaxation

DE LEONE, Renato;
1993-01-01

Abstract

Serial and parallel successive overrelaxation (SOR) solutions of specially structured large-scale quadratic programs with simple bounds are discussed. By taking advantage of the sparsity structure of the problem, the SOR algorithm was successfully implemented on two massively parallel Single-Instruction-Multiple-Data machines: a Connection Machine CM-2 and a MasPar MP-1. Computational results for the well known obstacle problems show the effectiveness of the algorithm. Problems with millions of variables have been solved in a few minutes on these massively parallel machines, and speed-ups of 90% or more were achieved.
1993
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: https://hdl.handle.net/11581/241414
 Attenzione

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

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