A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs

DOI10.1145/355900.355906MaRDI QIDQ3920537zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1980

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355900.355906

zbMATH Keywords

elimination graphgraph algorithmsminimum degree algorithmordering algorithmsquotient graphssparse linear equations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(7)

• Solution of sparse positive definite systems on a hypercube
• An overlapping domain decomposition preconditioning method for monolithic solution of shear bands
• Parallel preconditioners for monolithic solution of shear bands
• Explicit and implicit methods for shear band modeling at high strain rates
• Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
• A survey of direct methods for sparse linear systems
• A note on matrix reordering for linear system solutions by iterative methods in interior point methods

This page was built for publication: A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs

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