Strazdins, Peter E. Issues in the design of scalable out-of-core dense symmetric indefinite factorization algorithms. (English) Zbl 1188.65029 Sloot, Peter M. A. (ed.) et al., Computational science – ICCS 2003. International conference, Melbourne, Australia and St. Petersburg, Russia, June 2–4, 2003. Proceedings, Part III. Berlin: Springer (ISBN 3-540-40196-2/pbk). Lecture Notes in Computer Science 2659, 715-724 (2003). Summary: In the factorization of indefinite symmetric linear systems, symmetric pivoting is required to maintain numerical stability, while attaining a reduced floating point operation count. However, symmetric pivoting presents many challenges in the design of efficient algorithms, and especially in the context of a parallel out-of-core solver for dense systems. Here, the search for a candidate pivot in order to eliminate a single column potentially requires a large number of messages and accesses of disk blocks.For the entire collection see [Zbl 1049.68015]. MSC: 65F05 Direct numerical methods for linear systems and matrix inversion Software:SOLAR; POOCLAPACK PDFBibTeX XMLCite \textit{P. E. Strazdins}, Lect. Notes Comput. Sci. 2659, 715--724 (2003; Zbl 1188.65029) Full Text: DOI