Fast Computation of Minimal Fill Inside A Given Elimination Ordering
DOI10.1137/070680680zbMath1176.65027OpenAlexW2058141892MaRDI QIDQ3642841
Pinar Heggernes, Barry W. Peyton
Publication date: 6 November 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070680680
minimal triangulationminimal fillelimination treessparse matrix computationscomposite tree rotationsmaximum cardinality search (MCS)
Computational methods for sparse matrices (65F50) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (3)
This page was built for publication: Fast Computation of Minimal Fill Inside A Given Elimination Ordering