Skip to main navigation Skip to search Skip to main content

Nested-dissection orderings for sparse LU with partial pivoting

  • Igor Brainman*
  • , Sivan Toledo
  • *Corresponding author for this work
  • School of Computer Science
  • Tel Aviv University

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

Abstract

We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilbert and Schreiber in 1980 but never implemented and tested. Like other techniques for ordering sparse matrices for LU with partial pivoting, our new method preorders the columns of the matrix (the row permutation is chosen by the pivoting sequence during the numerical factorization). Also like other methods, the column permutation Q that we select is a permutation that attempts to reduce the fill in the Cholesky factor of QTATAQ. Unlike existing column-ordering techniques, which all rely on minimum-degree heuristics, our new method is based on a nested-dissection ordering of ATA. Our algorithm, however, never computes a representation of ATA, which can be expensive. We only work with a representation of A itself. Our experiments demonstrate that the method is efficient and that it can reduce fill significantly relative to the best existing methods. The method reduces the LU running time on some very large matrices (tens of millions of nonzeros in the factors) by more than a factor of 2.

Original languageEnglish
Pages (from-to)998-1012
Number of pages15
JournalSIAM Journal on Matrix Analysis and Applications
Volume23
Issue number4
DOIs
StatePublished - 2002

Keywords

  • Gaussian elimination
  • LU factorization
  • Nested-dissection
  • Partial pivoting
  • Vertex separators
  • Wide separators

Fingerprint

Dive into the research topics of 'Nested-dissection orderings for sparse LU with partial pivoting'. Together they form a unique fingerprint.

Cite this