Parallel unsymmetric-pattern multifrontal sparse LU with column preordering

Haim Avron*, Gil Shklarski, Sivan Toledo

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We present a new parallel sparse LU factorization algorithm and code. The algorithm uses a column-preordering partial-pivoting unsymmetric-pattern multifrontal approach. Our baseline sequential algorithm is based on UMFPACK 4, but is somewhat simpler and is often somewhat faster than UMFPACK version 4.0. Our parallel algorithm is designed for shared-memory machines with a small or moderate number of processors (we tested it on up to 32 processors). We experimentally compare our algorithm with SuperLU_MT, an existing shared-memory sparse LU factorization with partial pivoting. SuperLU_MT scales better than our new algorithm, but our algorithm is more reliable and is usually faster. More specifically, on matrices that are costly to factor, our algorithm is usually faster on up to 4 processors, and is usually faster on 8 and 16. We were not able to run SuperLU_MT on 32. The main contribution of this article is showing that the column-preordering partial-pivoting unsymmetric-pattern multifrontal approach, developed as a sequential algorithm by Davis in several recent versions of UMFPACK, can be effectively parallelized.

Original languageEnglish
Article number8
JournalACM Transactions on Mathematical Software
Volume34
Issue number2
DOIs
StatePublished - 1 Mar 2008

Keywords

  • Gaussian elimination
  • Multifrontal
  • Unsymmetric

Fingerprint

Dive into the research topics of 'Parallel unsymmetric-pattern multifrontal sparse LU with column preordering'. Together they form a unique fingerprint.

Cite this