Skip to Main content Skip to Navigation
Reports

Reducing the amount of pivoting in symmetric indefinite systems

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.
Document type :
Reports
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00593694
Contributor : Marc Baboulin <>
Submitted on : Tuesday, May 17, 2011 - 9:45:59 AM
Last modification on : Thursday, July 8, 2021 - 3:48:26 AM
Long-term archiving on: : Thursday, August 18, 2011 - 2:22:10 AM

File

RR-7621.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00593694, version 1

Collections

Citation

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

Share

Metrics

Record views

283

Files downloads

538