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

DOI10.1002/nla.647zbMath1240.65140OpenAlexW2118457221MaRDI QIDQ3090780

No author found.

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

Related Items (1)

A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows

Uses Software

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

Cites Work

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

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