A column approximate minimum degree ordering algorithm
Publication:5461205
DOI10.1145/1024074.1024079zbMath1073.65039OpenAlexW2167797964WikidataQ113310742 ScholiaQ113310742MaRDI QIDQ5461205
Stefan I. Larimore, John R. Gilbert, Timothy A. Davis, Esmond G. Ng
Publication date: 22 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1024074.1024079
Cholesky factorizationsparse Gaussian eliminationpartial pivotingminimum degree ordering algorithmcolumn preordering
Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (22)
Uses Software
This page was built for publication: A column approximate minimum degree ordering algorithm