Making Sparse Gaussian Elimination Scalable by Static Pivoting

We propose several techniques as alternatives to partial pivoting to stabilize sparse Gaussian elimination. From numerical experiments we demonstrate that for a wide range of problems the new method is as stable as partial pivoting. The main advantage of the new method over partial pivoting is that it permits a priori determination of data structures and communication pattern for Gaussian elimination, which makes it more scalable on distributed memory machines. Based on this a priori knowledge, we design highly parallel algorithms for both sparse Gaussian elimination and triangular solve and we show that they are suitable for large-scale distributed memory machines.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

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

[3]  Iain S. Duff,et al.  On Algorithms for Obtaining a Maximum Transversal , 1981, TOMS.

[4]  Iain S. Duff,et al.  Algorithm 575: Permutations for a Zero-Free Diagonal [F1] , 1981, TOMS.

[5]  Gene H. Golub,et al.  Matrix computations , 1983 .

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

[7]  Ed Anderson,et al.  LAPACK Users' Guide , 1995 .

[8]  Jack Dongarra,et al.  ScaLAPACK Users' Guide , 1987 .

[9]  Iain S. Duff,et al.  Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .

[10]  Ed Anderson,et al.  LAPACK users' guide - [release 1.0] , 1992 .

[11]  Cleve Ashcraft,et al.  The Fan-Both Family of Column-Based Distributed Cholesky Factorization Algorithms , 1993 .

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

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

[14]  R. Schreiber,et al.  Highly Parallel Sparse Triangular Solution , 1994 .

[15]  Mark T. Jones,et al.  Scalable Iterative Solution of Sparse Linear Systems , 1994, Parallel Comput..

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

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

[18]  Harry A. G. Wijshoff,et al.  Solving Large Nonsymmetric Sparse Linear Systems Using MCSPARSE , 1996, Parallel Comput..

[19]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[20]  Xiaoye S. Li,et al.  SuperLU Users'' Guide , 1997 .

[21]  Tao Yang,et al.  Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures , 1998, IEEE Trans. Parallel Distributed Syst..

[22]  X. Jiao.  Eecient Sparse Lu Factorization with Partial Pivoting on Distributed Memory Architectures , 1998 .

[23]  Padma Raghavan.  Efficient Parallel Sparse Triangular Solution Using Selective Inversion , 1998, Parallel Process. Lett..

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

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

[26]  James Demmel,et al.  A Supernodal Approach to Sparse Partial Pivoting , 1999, SIAM J. Matrix Anal. Appl..

[27]  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..