Improving the Run Time and Quality of Nested Dissection Ordering

When performing sparse matrix factorization, the ordering of matrix rows and columns has a dramatic impact on the factorization time. This paper describes an approach to the reordering problem that produces significantly better orderings than prior methods. The algorithm is a hybrid of nested dissection and minimum degree ordering, and combines an assortment of different algorithmic advances. New or improved algorithms are described for graph compression, multilevel partitioning, and separator improvement. When these techniques are combined, the resulting orderings average 39% better than minimum degree over a suite of test matrices, while requiring roughly 2.7 times the run time of Liu's multiple minimum degree.

[1]  William G. Poole,et al.  Incomplete Nested Dissection for Solving n by n Grid Problems , 1978 .

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

[3]  H. Wilf,et al.  Direct Solutions of Sparse Network Equations by Optimally Ordered Triangular Factorization , 1967 .

[4]  P. Berman,et al.  On the performance of the minimum degree ordering for Gaussian elimination , 1990 .

[5]  John G. Lewis,et al.  Orderings for Parallel Sparse Symmetric Factorization , 1987, PPSC.

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

[7]  Curt Jones,et al.  A Heuristic for Reducing Fill-In in Sparse Matrix Factorization , 1993, PPSC.

[8]  Alex Pothen,et al.  Computing the block triangular form of a sparse matrix , 1990, TOMS.

[9]  Joseph W. H. Liu,et al.  A graph partitioning algorithm by node separators , 1989, TOMS.

[10]  John K. Reid,et al.  Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems , 1996, TOMS.

[11]  Lie Wang,et al.  Towards a fast implementation of spectral nested dissection , 1992, Proceedings Supercomputing '92.

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

[13]  Brian Kernighan,et al.  An efficient heuristic for partitioning graphs , 1970 .

[14]  Joseph W. H. Liu.  The Minimum Degree Ordering with Constraints , 1989 .

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

[16]  Iain S. Duff,et al.  Sparse matrix test problems , 1982 .

[17]  Joseph W. H. Liu,et al.  Using domain decomposition to find graph bisectors , 1997 .

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

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

[20]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[21]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[22]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[23]  Joseph W. H. Liu,et al.  Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement , 1998 .

[24]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[25]  Cleve Ashcraft,et al.  Compressed Graphs and the Minimum Degree Algorithm , 1995, SIAM J. Sci. Comput..

[26]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[28]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..