by
Alex Pothen
,
Horst D. Simon
,
Lie Wang

Citations: | 30 - 5 self |

@MISC{Pothen92spectralnested,

author = {Alex Pothen and Horst D. Simon and Lie Wang},

title = {Spectral Nested Dissection},

year = {1992}

}

. We describe a spectral nested dissection 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. We 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. Spectral orderings compare quite favorably with commonly used orderings, outperforming them by a wide margin for some of these measures. These results are confirmed by computing a multifrontal numerical factorization with the different orderings on a Cray Y-MP with eight processors. Keywords. graph partitioning, graph spectra, Laplacian matrix, ordering algorithms, parallel orderings, parallel sparse Cholesky factorization, sparse matrix, vertex separator AMS(MOS) subject classifications. 65F50, 65F05, 65F15, 68R10 1. Introducti...

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2013 The Pennsylvania State University