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.<<ETX>>

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

[2]  A. Pothen,et al.  A Distributed Multifrontal Algorithm Using Clique Trees , 1991 .

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

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

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

[6]  Bojan Mohar,et al.  Laplace eigenvalues of graphs - a survey , 1992, Discret. Math..

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

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

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

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

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

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

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

[14]  Alex POTHENy,et al.  SPECTRAL NESTED DISSECTION , 1992 .

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

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

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

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

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

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

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

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

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

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

[25]  Timothy J. Barth,et al.  The design and application of upwind schemes on unstructured meshes , 1989 .

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

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

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