Compressed Graphs and the Minimum Degree Algorithm

DOI10.1137/0916081zbMath0837.65015OpenAlexW1989689661MaRDI QIDQ4859542

Cleve Ashcraft

Publication date: 21 May 1996

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0916081

zbMATH Keywords

minimum degree algorithmordering algorithmcompressed graphsparse symmetric positive definite matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A Block Compression Algorithm for Computing Preconditioners, Using domain decomposition to find graph bisectors, Two improved algorithms for envelope and wavefront reduction, Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices, A supernodal block factorized sparse approximate inverse for non-symmetric linear systems, A survey of direct methods for sparse linear systems, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, Preconditioning techniques for large linear systems: A survey

Uses Software

• Harwell-Boeing sparse matrix collection