Node Selection Strategies for Bottom-Up Sparse Matrix Ordering

DOI10.1137/S0895479896302692zbMATH Open0924.65036MaRDI QIDQ4389099FDOQ4389099

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)

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

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)

Cited In (8)

• Modification of the minimum-degree algorithm by multiple elimination
• A survey of direct methods for sparse linear systems
• Title not available (Why is that?)
• A column approximate minimum degree ordering algorithm
• Reordering strategy for blocking optimization in sparse linear solvers
• Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
• Title not available (Why is that?)
• Evaluation of Orderings for Unsymmetric Sparse Matrices

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)