Computing DM-decomposition of a partitioned matrix with rank-1 blocks

DOI10.1016/j.laa.2018.02.008zbMath1390.15040arXiv1609.01934OpenAlexW2962787199MaRDI QIDQ1747895

Hiroshi Hirai

Publication date: 27 April 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.01934

zbMATH Keywords

submodular functionmatroidmodular latticepartitioned matrixDulmage-Mendelsohn decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Spectral operators, decomposable operators, well-bounded operators, etc. (47B40) Canonical forms, reductions, classification (15A21)

Related Items (4)

Minimizing submodular functions on diamonds via generalized fractional matroid matchings ⋮ A compact representation for modular semilattices and its applications ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings

Cites Work

• Unnamed Item
• On the complexity of submodular function minimisation on diamonds
• Matching theory
• Coverings of Bipartite Graphs
• Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
• Singular spaces of matrices and their application in combinatorics
• Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
• A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
• The Power of Linear Programming for General-Valued CSPs
• Admissible Mappings between Dependence Spaces
• Matrices and matroids for systems analysis

This page was built for publication: Computing DM-decomposition of a partitioned matrix with rank-1 blocks