A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs

DOI10.1145/355900.355906zbMath0467.65011OpenAlexW2083287906WikidataQ111898180 ScholiaQ111898180MaRDI QIDQ3920537

No author found.

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

graph algorithmsquotient graphsminimum degree algorithmsparse linear equationsordering algorithmselimination graph

Mathematics Subject Classification ID

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

Related Items (6)

Parallel preconditioners for monolithic solution of shear bands ⋮ Solution of sparse positive definite systems on a hypercube ⋮ 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 ⋮ An overlapping domain decomposition preconditioning method for monolithic solution of shear bands

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