Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
DOI10.1137/090757575zbMATH Open1410.65077OpenAlexW2147507978MaRDI QIDQ3103553FDOQ3103553
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
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
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)
Cited In (6)
- A survey of direct methods for sparse linear systems
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- Known Algorithms for Edge Clique Cover are Probably Optimal
- Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization
- Hypergraph Cuts with General Splitting Functions
- A hypergraph partitioning model for profile minimization
Uses Software
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)
