Ballard, Grey; Becker, Dulceneia; Demmel, James; Dongarra, Jack; Druinsky, Alex; Peled, Inon; Schwartz, Oded; Toledo, Sivan; Yamazaki, Ichitaro Communication-avoiding symmetric-indefinite factorization. (English) Zbl 1317.65074 SIAM J. Matrix Anal. Appl. 35, No. 4, 1364-1406 (2014). The authors propose a new symmetric factorization algorithm that minimizes the communication costs: communication between nodes in distributed-memory computers and communication between levels in memory hierarchies. The algorithm performs an asymptotically optimal amount of communication in a two-level memory hierarchy for almost any cache-line size. Reviewer: Constantin Popa (Constanţa) Cited in 2 Documents MSC: 65F05 Direct numerical methods for linear systems and matrix inversion 15A23 Factorization of matrices 65Y20 Complexity and performance of numerical algorithms Keywords:symmetric-indefinite matrices; communication-avoiding algorithms; Aasen’s factorization PDFBibTeX XMLCite \textit{G. Ballard} et al., SIAM J. Matrix Anal. Appl. 35, No. 4, 1364--1406 (2014; Zbl 1317.65074) Full Text: DOI Link