A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap

DOI10.1137/120861242MaRDI QIDQ4917166zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

block diagonal form with overlapcombinatorial scientific computinggraph partitioning by vertex separatorpartitioning with fixed verticesrecursive bipartitioningsparse square matrices

Mathematics Subject Classification ID

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

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

Cited in

(8)

• The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
• scientific article; zbMATH DE number 1264490 (Why is no real title available?)
• A hypergraph partitioning model for profile minimization
• Permuting Sparse Rectangular Matrices into Block-Diagonal Form
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
• A multilevel bilinear programming algorithm for the vertex separator problem
• \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers

Describes a project that uses

Uses Software

• SparseMatrix
• METIS
• PaToH

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)