The Minimum Degree Ordering with Constraints

DOI10.1137/0910069MaRDI QIDQ4733299zbMATH OpenOpenAlexFDO

Authors Joseph W. H. Liu

Publication date 1989

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

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

zbMATH Keywords

sensitivityGaussian eliminationmatrix orderingsymmetric sparse matricesreorderingminimum degree algorithmparallel eliminationconstrained minimum degree ordering scheme

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Recommendations

• Modification of the minimum-degree algorithm by multiple elimination
• The Evolution of the Minimum Degree Ordering Algorithm
• Reordering for parallelism
• An Approximate Minimum Degree Ordering Algorithm
• Reordering sparse matrices for parallel elimination

Cited in

(6)

• Efficient Covariance Approximations for Large Sparse Precision Matrices
• Modification of the minimum-degree algorithm by multiple elimination
• A survey of direct methods for sparse linear systems
• Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
• Minimum Degree Orderings
• The Evolution of the Minimum Degree Ordering Algorithm

This page was built for publication: The Minimum Degree Ordering with Constraints

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