A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap

DOI10.1137/120861242zbMath1263.05059OpenAlexW2029976675MaRDI QIDQ4917166

Enver Kayaaslan, Seher Acer, 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

zbMATH Keywords

recursive bipartitioningcombinatorial scientific computinggraph partitioning by vertex separatorblock diagonal form with overlappartitioning with fixed verticessparse square matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ A Hypergraph Partitioning Model for Profile Minimization ⋮ A multilevel bilinear programming algorithm for the vertex separator problem ⋮ \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers ⋮ Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs

Uses Software

• METIS
• SparseMatrix
• PaToH

This page was built for publication: A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap