Robust Ordering of Sparse Matrices using Multisection

In this paper we provide a robust reordering scheme for sparse matrices. The scheme relies on the notion of multisection, a generalization of bisection. The reordering strategy is demonstrated to have consistently good performance in terms of fill reduction when compared with multiple minimum degree and generalized nested dissection. Experimental results show that by using multisection, we obtain an ordering which is consistently as good as or better than both for a wide spectrum of sparse problems.

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

[2]  N. S. Mendelsohn,et al.  Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.

[3]  J. W. Walker,et al.  Direct solutions of sparse network equations by optimally ordered triangular factorization , 1967 .

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

[5]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[6]  D. Rose,et al.  Complexity Bounds for Regular Finite Difference and Finite Element Grids , 1973 .

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

[8]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

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

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

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

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

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

[14]  Alan George,et al.  The Evolution of the Minimum Degree Ordering Algorithm , 1989, SIAM Rev..

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

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

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

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

[19]  Bruce Hendrickson,et al.  The Chaco user`s guide. Version 1.0 , 1993 .

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

[21]  Wagdi G. Habashi,et al.  A note on nested dissection for rectangular grids , 1993 .

[22]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[23]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

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

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

[26]  Padma Raghavan,et al.  Parallel Ordering Using Edge Contraction , 1997, Parallel Comput..

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

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

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

[30]  John G. Lewis,et al.  Accurate Symmetric Indefinite Linear Equation Solvers , 1999, SIAM J. Matrix Anal. Appl..

[31]  Bruce Hendrickson,et al.  Improving the Run Time and Quality of Nested Dissection Ordering , 1998, SIAM J. Sci. Comput..

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