Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices

DOI10.1137/090757575zbMath1410.65077OpenAlexW2147507978MaRDI QIDQ3103553

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

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

Related Items (4)

Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Hypergraph Cuts with General Splitting Functions ⋮ The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ A survey of direct methods for sparse linear systems

Uses Software

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

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