A Hypergraph Partitioning Model for Profile Minimization
DOI10.1137/17M1161245zbMath1402.05153MaRDI QIDQ4646452
Cevdet Aykanat, Enver Kayaaslan, Seher Acer
Publication date: 14 January 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
sparse matricesmatrix orderinghypergraph partitioningprofile reductionmatrix profilerecursive bipartitioningprofile minimizationmatrix envelope
Computational methods for sparse matrices (65F50) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- The effect of ordering on preconditioned conjugate gradients
- Profile minimization problem for matrices and graphs
- Two improved algorithms for envelope and wavefront reduction
- Unravelling small world networks
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- A Multilevel Algorithm for Wavefront Reduction
- Minimizing the Profile of a Symmetric Matrix
- The university of Florida sparse matrix collection
- An algorithm for profile and wavefront reduction of sparse matrices
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
- Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- A spectral algorithm for envelope reduction of sparse matrices
- A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
- Implementing Hager's exchange methods for matrix profile reduction
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- A survey of direct methods for sparse linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A Hypergraph Partitioning Model for Profile Minimization
