Improving the Runtime and Quality of Nested Dissection Ordering

Improving the Runtime and Quality of Nested Dissection Ordering (1997)

Cached

Download Links

[www.sandia.gov]

by Bruce Hendrickson, et al.

Citations:

43 - 4 self

BibTeX

@MISC{Hendrickson97improvingthe,
    author = {Bruce Hendrickson and et al.},
    title = {Improving the Runtime and Quality of Nested Dissection Ordering },
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

864	An Efficient Heuristic Procedure for Partitioning Graphs - Kernighan, Lin - 1970
616	A fast and high quality multilevel scheme for partitioning irregular graphs - Karypis, Kumar - 1999
428	Computer Solution of Large Sparse Positive Definite Systems - George, Liu - 1981
367	A multi-level algorithm for partitioning graphs - Hendrickson, Leland - 1995
268	Mattheyses, “A Linear Time Heuristic for Improving Network Partitions”, DAC - Fiduccia, M - 1982
263	J.Lewis. Sparse matrix test problems - Duff
202	A column approximate minimum degree ordering algorithm - Davis, Gilbert, et al.
154	Nested dissection of a regular finite element mesh - George - 1973
118	Modification of the minimum degree algorithm by multiple elimination - Liu - 1985
75	The elimination form of the inverse and its application to linear programming, Management Sci 3: 255–269 - Markowitz - 1957
74	Direct solutions of sparse network equations by optimally ordered triangular factorization - Tinney, Walker - 1967
60	A heuristic for reducing fill in sparse matrix factorization - Bui, Jones - 1993
57	Computing the block triangular form of a sparse matrix - POTHEN, FAN - 1990
45	Fast and effective algorithms for graph partitioning and sparse matrix ordering - Gupta - 1996
44	Robust ordering of sparse matrices using multisection - Ashcraft, JWH - 1995
41	Compressed graphs and the minimum degree algorithm - Ashcraft - 1995
33	Towards a fast implementation of spectral nested dissection - Pothen, Simon, et al. - 1992
31	Orderings for parallel sparse symmetric factorisation - Leiserson, Lewis - 1987
20	Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems - Duff, Reid - 1996
17	A Partition Improvement Algorithm for Generalized Nested - Ashcraft, Liu - 1994
13	Applications of the dulmage-mendelsohn decomposition and network flow to graph bisection improvement - Ashcraft, Liu - 1996
13	Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0 - METIS - 1995
6	Robust ordering of sparse matrices: a minimum degree, nested dissection hybrid, Silicon Graphics manuscript - Rothberg - 1995
4	On the performance of the minimum degree algorithm for Gaussian elimination - Berman, Schnitger - 1990
4	k-way partitioning scheme for irregular graphs - Multilevel - 1995
3	Damhaug, Sparse Solution of Finite Element Equations - C - 1992
2	nested dissection: some recent progress. Minisymposium presentation at the Fifth - Generalized - 1994