An out-of-core sparse symmetric-indefinite factorization method

Omer Meshar, Dror Irony, Sivan Toledo

Research output: Contribution to journalArticlepeer-review

Abstract

We present a new out-of-core sparse symmetric-indefinite factorization algorithm. The most significant innovation of the new algorithm is a dynamic partitioning method for the sparse factor. This partitioning method results in very low I/O traffic and allows the algorithm to run at high computational rates, even though the factor is stored on a slow disk. Our implementation of the new code compares well with both high-performance in-core sparse symmetric-indefinite codes and a high-performance out-of-core sparse Cholesky code.

Original languageEnglish
Pages (from-to)445-471
Number of pages27
JournalACM Transactions on Mathematical Software
Volume32
Issue number3
DOIs
StatePublished - 2006

Keywords

  • Out-of-Core
  • Symmetric-indefinite

Fingerprint

Dive into the research topics of 'An out-of-core sparse symmetric-indefinite factorization method'. Together they form a unique fingerprint.

Cite this