Accelerating linear system solutions using randomization techniques - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2011

Accelerating linear system solutions using randomization techniques

Résumé

We illustrate how linear algebra calculations can be enhanced by statistical techniques in the case of a square linear system Ax = b. We study a random transformation of A that enables us to avoid pivoting and then to reduce the amount of communication. Numerical experiments show that this randomization can be performed at a very affordable computational price while providing us with a satisfying accuracy when compared to partial pivoting. This random transformation called Partial Random Butter y Transformation (PRBT) is optimized in terms of data storage and flops count. We propose a solver where PRBT and the LU factorization with no pivoting take advantage of the latest generation of hybrid multicore/GPU machines and we compare its Gfl op/s performance with a solver implemented in a current parallel library.
Fichier principal
Vignette du fichier
RR-7616.pdf (464.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00593306 , version 1 (13-05-2011)

Identifiants

  • HAL Id : inria-00593306 , version 1

Citer

Marc Baboulin, Jack Dongarra, Julien Herrmann, Stanimire Tomov. Accelerating linear system solutions using randomization techniques. [Research Report] RR-7616, INRIA. 2011. ⟨inria-00593306⟩
246 Consultations
432 Téléchargements

Partager

Gmail Facebook X LinkedIn More