Minimal orderings revisited

SIAM Journal on Matrix Analysis and Applications

Volumn 23, Issue 1, 2002, Pages 271-294

  Peyton, Barry W ^a  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

LEX M algorithm; Minimal fill; Minimal orderings; Minimum degree; Multisection; Nested dissection; Sparse matrix computations; Supernodes

Indexed keywords

EID: 0036056005     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089547989936443X     Document Type: Article

References (22)

1. An approximate minimum degree ordering algorithm
2. Robust ordering of sparse matrices using multisection
3. A wide-range efficient algorithm for minimal triangulation
4. Making an arbitrary filled graph minimal by removing fill edges
5. A practical algorithm for making filled graphs minimal
6. Minimal elimination ordering inside a given chordal graph
7. The evolution of the minimum degree ordering algorithm
8. An efficient algorithm to compute row and column counts for sparse Cholesky factorization
9. Improving the run time and quality of nested dissection ordering
10. A fast and high quality multilevel scheme for partitioning irregular graphs
11. On finding supernodes for sparse matrix computations
12. Modification of the minimum degree algorithm by multiple elimination
13. The minimum degree ordering with constraints. Sparse matrix algorithms on supercomputers
14. The role of elimination trees in sparse factorization
15. A fast algorithm for finding an optimal ordering in the vertex elimination on a graph
16. Triangulated graphs and the elimination process
17. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations
18. Algorithmic aspects of vertex elimination on graphs
19. Robust ordering of sparse matrices: A minimum degree nested dissection hybrid
20. A new implementation of sparse Gaussian elimination
21. Computing the minimum fill-in is NP-complete