SuperLU_DIST
Xiaoye Sherry Li, James Weldon Demmel · ACM Transactions on Mathematical Software · 2003
We present the main algorithmic features in the software package SuperLU_DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with a focus on scalability issues, and demonstrate the software's parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication patterns, which lets us exploit techniques used in parallel sparse Cholesky algorithms to better parallelize both LU decomposition and triangular solution on large-scale distributed machines.
Cited by 628 works. doi:10.1145/779359.779361
Authors
References
- Lecture Notes in Computer Science 1205
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Matrix computations (3rd ed.)
- Computer Solution of Large Sparse Positive Definite Systems.
- Direct Methods for Sparse Matrices
- Nested Dissection of a Regular Finite Element Mesh
- The Elimination form of the Inverse and its Application to Linear Programming
- Introduction to parallel computing: design and analysis of algorithms
- Applied numerical linear algebra
- The university of Florida sparse matrix collection