Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices

DOI10.1137/090757575MaRDI QIDQ3103553zbMATH OpenOpenAlexFDO

Authors Cevdet Aykanat, Enver Kayaaslan, Ümit V. Çatalyürek

Publication date 7 December 2011

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

Full work available at URL http://hdl.handle.net/11693/21776

zbMATH Keywords

hypergraph partitioningfill-reducing orderingcombinatorial scientific computing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 3974734
• A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
• Partitioning ordered hypergraphs
• scientific article; zbMATH DE number 219241
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
• Evaluation of Orderings for Unsymmetric Sparse Matrices

Cited in

(5)

• Hypergraph Cuts with General Splitting Functions
• A survey of direct methods for sparse linear systems
• A hypergraph partitioning model for profile minimization
• The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
• Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization

Describes a project that uses

Uses Software

• METIS
• SparseMatrix
• SPOOLES
• PT-Scotch
• PaToH
• SMOOTH

This page was built for publication: Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices

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