Towards a fast implementation of spectral nested dissection

The authors describe the novel spectral nested dissection (SND) algorithm, a novel algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to compute separators. The authors evaluate the quality of the spectral orderings with respect to several measures: fill, elimination tree height, height and weight balances of elimination trees, and clique tree heights. They use some very large structural analysis problems as test cases and demonstrate on these real applications that spectral orderings compare quite favorably with commonly used orderings, outperforming them by a wide margin for some of these measures. The only disadvantage of SND is its relatively long execution time. >

[1]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

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

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

[4]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

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

[6]  J. Gilbert.  Graph separator theorems and sparse Gaussian elimination , 1980 .

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

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

[9]  B. Parlett,et al.  On estimating the largest eigenvalue with the Lanczos algorithm , 1982 .

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

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

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

[13]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[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]  Timothy J. Barth,et al.  The design and application of upwind schemes on unstructured meshes , 1989 .

[17]  J. G. Lewis,et al.  A fast algorithm for reordering sparse matrices for parallel factorization , 1989 .

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

[19]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[20]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[22]  S. Hammond,et al.  On a massively parallel Euler solver for unstructured grids , 1992 .

[23]  Philip N. Klein,et al.  Cutting down on Fill Using Nested Dissection: Provably Good Elimination Orderings , 1993 .

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

[25]  Barry W. Peyton,et al.  On Finding Minimum-Diameter Clique Trees , 1994, Nord. J. Comput..