A Supernodal Approach to Sparse Partial Pivoting

We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve unsymmetric linear systems. We introduce the notion of unsymmetric supernodes to perform most of the numerical computation in dense matrix kernels. We introduce unsymmetric supernode-panel updates and two-dimensional data partitioning to better exploit the memory hierarchy. We use Gilbert and Peierls's depth-first search with Eisenstat and Liu's symmetric structural reductions to speed up symbolic factorization. We have developed a sparse LU code using all these ideas. We present experiments demonstrating that it is significantly faster than earlier partial pivoting codes. We also compare its performance with UMFPACK, which uses a multifrontal approach; our code is very competitive in time and storage requirements, especially for large problems.

[1]  Andrew Harry Sherman,et al.  On the efficient solution of sparse systems of linear and nonlinear equations. , 1975 .

[2]  Andrew H. Sherman,et al.  Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4] , 1978, TOMS.

[3]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[4]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

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

[6]  David S. Dodson,et al.  Issues relating to extension of the Basic Linear Algebra Subprograms , 1985, SGNM.

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

[8]  J. Gilbert,et al.  Sparse Partial Pivoting in Time Proportional to Arithmetic Operations , 1986 .

[9]  A. George,et al.  Symbolic factorization for sparse Gaussian elimination with partial pivoting , 1987 .

[10]  Barry W. Peyton,et al.  Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers , 1987 .

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

[12]  Roger Grimes,et al.  The influence of relaxed supernode partitions on the multifrontal method , 1989, TOMS.

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

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

[15]  Barry W. Peyton,et al.  Block sparse Cholesky algorithms on advanced uniprocessor computers , 1991 .

[16]  Anoop Gupta,et al.  Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy , 1991, TOMS.

[17]  Joseph W. H. Liu,et al.  Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization , 1992, SIAM J. Matrix Anal. Appl..

[18]  John R. Gilbert,et al.  Sparse Matrices in MATLAB: Design and Implementation , 1992, SIAM J. Matrix Anal. Appl..

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

[20]  Anoop Gupta,et al.  An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines , 1991, Int. J. High Speed Comput..

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

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

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

[24]  Anoop Gupta,et al.  An efficient block-oriented approach to parallel sparse Cholesky factorization , 1993, Supercomputing '93. Proceedings.

[25]  A. Gupta,et al.  An efficient block-oriented approach to parallel sparse Cholesky factorization , 1993, Supercomputing '93.

[26]  E. Ng,et al.  An E cient Algorithm to Compute Row andColumn Counts for Sparse Cholesky Factorization , 1994 .

[27]  J. Gilbert.  Predicting Structure in Sparse Matrix Computations , 1994 .

[28]  Vipin Kumar,et al.  Optimally Scalable Parallel Sparse Cholesky Factorization , 1995, PPSC.

[29]  Xiaoye Sherry Li,et al.  Sparse Gaussian Elimination on High Performance Computers , 1996 .

[30]  John K. Reid,et al.  The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations , 1996, TOMS.

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

[32]  S. Vavasis.  Stable finite elements for problems with wild coefficients , 1996 .

[33]  J. Demmel,et al.  Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology , 1997 .

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

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

[36]  Sivan Toledo,et al.  An Assessment of Incomplete-LU Preconditioners for Nonsymmetric Linear Systems , 2000, Informatica.