A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows

DOI10.1002/NLA.647MaRDI QIDQ3090780zbMATH OpenOpenAlexFDO

Authors

Publication date 2 September 2011

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL http://purl.org/net/epubs/work/43560

zbMATH Keywords

graph algorithmsparse symmetric matrixordering algorithmapproximate minimum degree ordering algorithmdense row

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50)

Recommendations

• The Evolution of the Minimum Degree Ordering Algorithm
• An Approximate Minimum Degree Ordering Algorithm
• Compressed Graphs and the Minimum Degree Algorithm
• A column approximate minimum degree ordering algorithm
• Algorithm 836

Cites work

• Algorithm 837
• An Approximate Minimum Degree Ordering Algorithm
• Computing the Minimum Fill-In is NP-Complete
• Direct Methods for Sparse Linear Systems
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• Nested Dissection of a Regular Finite Element Mesh
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The University of Florida sparse matrix collection

Cited in

(3)

• Compressed Graphs and the Minimum Degree Algorithm
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
• Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices

Describes a project that uses

Uses Software

• CSparse
• SparseMatrix
• MUMPS
• MA57
• HSL
• AMD

This page was built for publication: A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows

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