Node Selection Strategies for Bottom-Up Sparse Matrix Ordering

DOI10.1137/S0895479896302692MaRDI QIDQ4389099zbMATH OpenFDO

Authors Edward Rothberg, Stanley C. Eisenstat

Publication date 11 May 1998

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

sparse matricesminimum degreefactorizationgraph algorithmsnode selectionminimum deficiencyordering algorithmsminimum local fill

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• The Evolution of the Minimum Degree Ordering Algorithm
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
• A column approximate minimum degree ordering algorithm

Cited in

(10)

• A survey of direct methods for sparse linear systems
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• A column approximate minimum degree ordering algorithm
• Fast and effective reordering of columns within supernodes using partition refinement
• Modification of the minimum-degree algorithm by multiple elimination
• scientific article; zbMATH DE number 2201195 (Why is no real title available?)
• Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
• scientific article; zbMATH DE number 554763 (Why is no real title available?)
• Reordering strategy for blocking optimization in sparse linear solvers
• Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes

This page was built for publication: Node Selection Strategies for Bottom-Up Sparse Matrix Ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389099)