Recent advances in direct methods for solving unsymmetric sparse systems of linear equations

During the past few years, algorithmic improvements alone have reduced the time required for the direct solution of unsymmetric sparse systems of linear equations by almost an order of magnitude. This paper compares the performance of some well-known software packages for solving general sparse systems. In particular, it demonstrates the consistently high level of performance achieved by WSMP---the most recent of such solvers. It compares the various algorithmic components of these solvers and discusses their impact on solver performance. Our experiments show that the algorithmic choices made in WSMP enable it to run more than twice as fast as the best among similar solvers and that WSMP can factor some of the largest sparse matrices available from real applications in only a few seconds on a 4-CPU workstation. Thus, the combination of advances in hardware and algorithms makes it possible to solve those general sparse linear systems quickly and easily that might have been considered too large until recently.

[1]  Joseph W. H. Liu,et al.  Exploiting Structural Symmetry in a Sparse Partial Pivoting Code , 1993, SIAM J. Sci. Comput..

[2]  Laura Grigori,et al.  Using postordering and static symbolic factorization for parallel sparse LU , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[3]  Iain S. Duff,et al.  The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .

[4]  Timothy A. Davis,et al.  A combined unifrontal/multifrontal method for unsymmetric sparse matrices , 1999, TOMS.

[5]  GuptaAnshul.  Fast and effective algorithms for graph partitioning and sparse-matrix ordering , 1997 .

[6]  Iain S. Duff,et al.  On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix , 2000, SIAM J. Matrix Anal. Appl..

[7]  Patrick Amestoy,et al.  Memory Management Issues in Sparse Multifrontal Methods On Multiprocessors , 1993, Int. J. High Perform. Comput. Appl..

[8]  E. Ng,et al.  Predicting structure in nonsymmetric sparse matrix factorizations , 1993 .

[9]  Friedrich Grund.  Direct Linear Solvers for Vector and Parallel Computers , 1998, VECPAR.

[10]  Patrick Amestoy,et al.  An Unsymmetrized Multifrontal LU Factorization , 2000, SIAM J. Matrix Anal. Appl..

[11]  Anshul Gupta,et al.  Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices , 2002, SIAM J. Matrix Anal. Appl..

[12]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[13]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

[14]  Timothy A. Davis,et al.  A column approximate minimum degree ordering algorithm , 2000, TOMS.

[15]  Iain S. Duff,et al.  The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices , 1999, SIAM J. Matrix Anal. Appl..

[16]  M. SIAMJ.,et al.  IMPROVED SYMBOLIC AND NUMERICAL FACTORIZATION ALGORITHMS FOR UNSYMMETRIC SPARSE MATRICES , 2002 .

[17]  James Demmel,et al.  An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination , 1997, SIAM J. Matrix Anal. Appl..

[18]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[19]  Anshul Gupta.  A HIGH-PERFORMANCE GEPP-BASED SPARSE SOLVER , 2002 .

[20]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[21]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[22]  D. Rose,et al.  Generalized nested dissection , 1977 .

[23]  Steven M. Hadfield.  On The LU Factorization Of Sequences Of Identically Structured Sparse Matrices Within A Distributed , 1994 .

[24]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[25]  A. George,et al.  An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems , 1985 .

[26]  James Demmel,et al.  Making Sparse Gaussian Elimination Scalable by Static Pivoting , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[27]  Jean-Yves L'Excellent,et al.  Analysis, tuning and comparison of two general sparse solvers for distributed memory computers , 2000 .

[28]  Patrick R. Amestoy,et al.  Analysis and comparison of two general sparse solvers for distributed memory computers , 2001, TOMS.

[29]  Wolfgang Fichtner,et al.  PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation , 2001, Future Gener. Comput. Syst..

[30]  Patrick R. Amestoy,et al.  Multifrontal parallel distributed symmetric and unsymmetric solvers , 2000 .

[31]  Wolfgang Fichtner,et al.  Scalable Parallel Sparse LU Factorization with a Dynamical Supernode Pivoting Approach in Semiconductor Device , 2000 .

[32]  Joseph W. H. Liu.  The role of elimination trees in sparse factorization , 1990 .

[33]  Cleve Ashcraft,et al.  SPOOLES: An Object-Oriented Sparse Matrix Library , 1999, PPSC.

[34]  Tao Yang,et al.  S+: Efficient 2D Sparse LU Factorization on Parallel Machines , 2000, SIAM J. Matrix Anal. Appl..

[35]  Patrick Amestoy,et al.  Vectorization of a Multiprocessor Multifrontal Code , 1989, Int. J. High Perform. Comput. Appl..

[36]  Joseph W. H. Liu,et al.  Elimination Structures for Unsymmetric Sparse $LU$ Factors , 1993, SIAM J. Matrix Anal. Appl..

[37]  James Demmel,et al.  A Scalable Sparse Direct Solver Using Static Pivoting , 1999, PPSC.

[38]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[39]  Timothy A. Davis,et al.  An Unsymmetric-pattern Multifrontal Method for Sparse Lu Factorization , 1993 .

[40]  Joseph W. H. Liu,et al.  Robust Ordering of Sparse Matrices using Multisection , 1998 .

[41]  Anshul Gupta,et al.  An experimental comparison of some direct sparse solver packages , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[42]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[43]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[44]  J. K. Reid,et al.  MA48: A FORTRAN code for direct solution of sparse unsymmetric linear systems of equations , 1993 .

[45]  Joseph W. H. Liu,et al.  Robust Ordering of Sparse Matrices using Multisection , 1998, SIAM J. Matrix Anal. Appl..

[46]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[47]  Anshul Gupta,et al.  Fast and effective algorithms for graph partitioning and sparse-matrix ordering , 1997, IBM J. Res. Dev..