Permuting Sparse Rectangular Matrices into Block-Diagonal Form
From MaRDI portal
linear programmingnumerical experimentsparallel computationhypergraph partitioningsparse rectangular matricesbordered block diagonal form
Numerical mathematical programming methods (65K05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Hypergraphs (05C65)
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
(31)- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- A survey of direct methods for sparse linear systems
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
- A Matrix Partitioning Interface to PaToH in MATLAB
- Parallel multilevel algorithms for hypergraph partitioning
- High-multiplicity \(N\)-fold IP via configuration LP
- A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Reconstructing permutation matrices from diagonal sums
- Structure Detection in Mixed-Integer Programs
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Split cuts from sparse disjunctions
- Towards a practical parallelisation of the simplex method
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Computing sparse and dense realizations of reaction kinetic systems
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- A novel framework for detecting maximally banded matrices in binary data
- Optimal block-tridiagonalization of matrices for coherent charge transport
- A hypergraph partitioning model for profile minimization
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Relational data factorization
- On the (co)girth of a connected matroid
- Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms
- Minimizing fleet operating costs for a container transportation company
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
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)
