The Minimum Degree Ordering with Constraints

A hybrid scheme for ordering sparse symmetric matrices is considered. It is based on a combined use of the top-down nested dissection and the bottom-up minimum degree ordering schemes. A separator set is first determined by some form of incomplete nested dissection. The minimum degree ordering is then applied subject to the constraint that the separator nodes must be ordered last. It is shown experimentally that the quality of the resulting ordering from this constrained scheme exhibits less sensitivity to the initial matrix ordering than that of the original minimum degree ordering. An important application of this approach to find orderings suitable for parallel elimination is also illustrated.

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

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

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

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

[5]  I. Duff,et al.  On George’s Nested Dissection Method , 1976 .

[6]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

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

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

[9]  Jochen A. G. Jess,et al.  A Data Structure for Parallel L/U Decomposition , 1982, IEEE Transactions on Computers.

[10]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

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

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

[13]  Joseph W. H. Liu,et al.  Computational models and task scheduling for parallel sparse Cholesky factorization , 1986, Parallel Comput..

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

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

[16]  Joseph W. H. Liu,et al.  A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs , 1989, SIAM J. Discret. Math..

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

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