Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations

DOI10.1137/S0895479892235599MaRDI QIDQ4313375zbMATH OpenFDO

Authors Hisashi Ito, Satoru Iwata, Kazuo Murota

Publication date 16 November 1994

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895479892235599

zbMATH Keywords

block triangularizationDulmage/Mendelsohn decompositionequivalenceJordan decompositionJordan-Hölder theoremmodular latticespartitioned matrixsimilarity

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Algebraic systems of matrices (15A30)

Recommendations

• The best reduction of matrices to block-triangular form for hierarchical decomposition problems
• Similarity of block diagonal and block triangular matrices
• Rational transformation from Schur to Jordan form
• Block triangularization of skew-symmetric matrices
• Computing the block triangular form of a sparse matrix

Cited in

(17)

• Block triangularization of skew-symmetric matrices
• Computing DM-decomposition of a partitioned matrix with rank-1 blocks
• Similarity of block diagonal and block triangular matrices
• A compact representation for modular semilattices and its applications
• On the use of binary operations for the construction of a multiply transitive class of block transformations
• A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 2 submatrices
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings
• The best reduction of matrices to block-triangular form for hierarchical decomposition problems
• Eigenvalue neutrality in block triangular matrices
• A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
• Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
• A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
• One approach to constructing a multiply transitive class of block transformations
• Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
• A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 2 submatrices
• On the complexity of submodular function minimisation on diamonds
• Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices

This page was built for publication: Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4313375)