Cutting down on Fill Using Nested Dissection: Provably Good Elimination Orderings
暂无分享,去创建一个
[1] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[2] Fillia Makedon,et al. Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems , 1990, WG.
[3] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[4] Philip N. Klein,et al. Approximating Concurrent Flow with Unit Demands and Capacities: An Implementation , 1991, Network Flows And Matching.
[5] A. H. Sherman,et al. Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices , 1976 .
[6] Michael T. Heath,et al. Parallel Algorithms for Matrix Computations , 1987 .
[7] I. Duff,et al. On George’s Nested Dissection Method , 1976 .
[8] Joseph W. H. Liu. The role of elimination trees in sparse factorization , 1990 .
[9] Joseph W. H. Liu,et al. Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.
[10] Mark Schlack,et al. Digital Equipment Corp. , 1993 .
[11] 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.
[12] D. Rose,et al. A Separator Theorem for Chordal Graphs , 1982 .
[13] Joseph W. H. Liu,et al. A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs , 1989, SIAM J. Discret. Math..
[14] R. Tarjan,et al. The analysis of a nested dissection algorithm , 1987 .
[15] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[16] J. G. Lewis,et al. A fast algorithm for reordering sparse matrices for parallel factorization , 1989 .
[17] Michael R. Leuze,et al. Independent set orderings for parallel matrix factorization by Gaussian elimination , 1989, Parallel Comput..
[18] Joseph W. H. Liu. The Minimum Degree Ordering with Constraints , 1989 .
[19] Joseph W. H. Liu,et al. Reordering sparse matrices for parallel elimination , 1989, Parallel Comput..
[20] John R. Gilbert,et al. Some Nested Dissection Order is Nearly Optimal , 1988, Inf. Process. Lett..
[21] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[22] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.
[23] John G. Lewis,et al. Orderings for Parallel Sparse Symmetric Factorization , 1987, PP.
[24] Philip N. Klein,et al. Network Design and Network Cut Dualities: Approximation Algorithms and Applications , 1991 .
[25] D. Rose. Triangulated graphs and the elimination process , 1970 .
[26] Philip N. Klein,et al. Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.
[27] Frans J. Peters,et al. Parallel pivoting algorithms for sparse symmetric matrices , 1984, Parallel Comput..
[28] Philip N. Klein,et al. A parallel randomized approximation scheme for shortest paths , 1992, STOC '92.
[29] Josef Stoer,et al. Numerische Mathematik 1 , 1989 .
[30] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[31] D. Rose,et al. Generalized nested dissection , 1977 .
[32] S. Parter. The Use of Linear Graphs in Gauss Elimination , 1961 .
[33] D. Rose,et al. Complexity Bounds for Regular Finite Difference and Finite Element Grids , 1973 .
[34] Jochen A. G. Jess,et al. A Data Structure for Parallel L/U Decomposition , 1982, IEEE Transactions on Computers.
[35] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .
[36] J. Alan George. Block Elimination on Finite Element Systems of Equations , 1972 .
[37] D. Rose. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .
[38] A. George. An automatic one-way dissection algorithm for irregular finite element problems , 1978 .
[39] Joseph W. H. Liu,et al. A graph partitioning algorithm by node separators , 1989, TOMS.
[40] John R. Gilbert,et al. Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height , 1991, WG.
[41] John K. Reid,et al. The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.
[42] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[43] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .
[44] Robert Schreiber,et al. A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.
[45] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[46] Iain S. Duff,et al. Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .
[47] Alan George,et al. The Evolution of the Minimum Degree Ordering Algorithm , 1989, SIAM Rev..
[48] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[49] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .