Reducing the amount of pivoting in symmetric indefinite systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Reducing the amount of pivoting in symmetric indefinite systems

Marc Baboulin
Jack Dongarra
  • Function : Author
  • PersonId : 863940

Abstract

This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite linear systems can be reduced by considering innovative approaches that are different from pivoting strategies implemented in current linear algebra libraries. First a tiled algorithm where pivoting is performed within a tile is described and then an alternative to pivoting is proposed. The latter considers a symmetric randomization of the original matrix using the so-called recursive butterfly matrices. In numerical experiments, we compare the accuracy of tile-wise pivoting and of the randomization approach with the accuracy of the Bunch-Kaufman algorithm.
Fichier principal
Vignette du fichier
RR-7621.pdf (431.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00593694 , version 1 (17-05-2011)

Identifiers

  • HAL Id : inria-00593694 , version 1

Cite

Dulceneia Becker, Marc Baboulin, Jack Dongarra. Reducing the amount of pivoting in symmetric indefinite systems. [Research Report] RR-7621, INRIA. 2011. ⟨inria-00593694⟩
111 View
365 Download

Share

Gmail Facebook X LinkedIn More