Permuting Sparse Rectangular Matrices into Block-Diagonal Form
From MaRDI portal
bordered block diagonal formhypergraph partitioninglinear programmingnumerical experimentsparallel computationsparse rectangular matrices
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Linear programming (90C05)
Recommendations
- Reordering a sparse matrix to a sparse blocked form
- A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Sparsification of rectangular matrices
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- scientific article; zbMATH DE number 1750323
- Reconstructing permutation matrices from diagonal sums
- Computing the block triangular form of a sparse matrix
- Uncovering block structures in large rectangular matrices
- A Block Ordering Method for Sparse Matrices
Cited in
(33)- Optimal block-tridiagonalization of matrices for coherent charge transport
- Reconstructing permutation matrices from diagonal sums
- Relational data factorization
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- Split cuts from sparse disjunctions
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- On the (co)girth of a connected matroid
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms
- Decomposing Matrices into Blocks
- scientific article; zbMATH DE number 1264490 (Why is no real title available?)
- Parallel multilevel algorithms for hypergraph partitioning
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- A hypergraph partitioning model for profile minimization
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
- A novel framework for detecting maximally banded matrices in binary data
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Structure Detection in Mixed-Integer Programs
- A survey of direct methods for sparse linear systems
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- High-multiplicity \(N\)-fold IP via configuration LP
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Minimizing fleet operating costs for a container transportation company
- Computing sparse and dense realizations of reaction kinetic systems
- Towards a practical parallelisation of the simplex method
- A Matrix Partitioning Interface to PaToH in MATLAB
This page was built for publication: Permuting Sparse Rectangular Matrices into Block-Diagonal Form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652297)
