@inproceedings{937977e975474cb39fc8a52d2b4b1104,

title = "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, the accuracy of tile-wise pivoting and of the randomization approach is compared with the accuracy of the Bunch-Kaufman algorithm.",

keywords = "LDL factorization, dense linear algebra, pivoting, randomization, symmetric indefinite systems, tiled algorithms",

author = "Dulceneia Becker and Marc Baboulin and Jack Dongarra",

year = "2012",

doi = "10.1007/978-3-642-31464-3_14",

language = "English",

isbn = "9783642314636",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "133--142",

booktitle = "Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Revised Selected Papers",

edition = "PART 1",

note = "9th International Conference on Parallel Processing and Applied Mathematics, PPAM 2011 ; Conference date: 11-09-2011 Through 14-09-2011",

}