A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
From MaRDI portal
Publication:4917166
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
(7)- A multilevel bilinear programming algorithm for the vertex separator problem
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- A hypergraph partitioning model for profile minimization
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
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)