A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
DOI10.1137/120861242zbMATH Open1263.05059OpenAlexW2029976675MaRDI QIDQ4917166FDOQ4917166
Authors: Seher Acer, Enver Kayaaslan, Cevdet Aykanat
Publication date: 29 April 2013
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/21000
Recommendations
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Direct methods for solving large sparse systems of equations based on the two by two block decomposition of the matrix
- scientific article; zbMATH DE number 1264490
- Multilevel algorithm for graph partitioning
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
recursive bipartitioningcombinatorial scientific computinggraph partitioning by vertex separatorblock diagonal form with overlappartitioning with fixed verticessparse square matrices
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (7)
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- A Hypergraph Partitioning Model for Profile Minimization
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
- A multilevel bilinear programming algorithm for the vertex separator problem
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Uses Software
This page was built for publication: A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917166)