Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
- 1 October 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 15 (4) , 1226-1255
- https://doi.org/10.1137/s0895479892235599
Abstract
A partitioned matrix, of which the column- and row-sets are divided into certain numbers of groups, arises from a mathematical formulation of discrete physical or engineering systems. This paper addresses the problem of the block-triangularization of a partitioned matrix under similarity/equivalence transformation with respect to its partitions of the column- and row-sets. Such block-triangularization affords a mathematical representation of the hierarchical decomposition of a physical system into subsystems if the transformation used is of physical significance. A module is defined from a partitioned matrix, and the simplicity of the module is proved to be equivalent to the nonexistence of a nontrivial block-triangular decomposition. Moreover, the existence and the uniqueness of the block-triangular forms are deduced from the Jordan–Hölder theorem for modules. The results cover many block-triangularization methods hitherto discussed in the literature such as the Jordan normal form and the strongly connec...Keywords
This publication has 14 references indexed in Scilit:
- Hierarchical decomposition of symmetric discrete systems by matroid and group theoriesMathematical Programming, 1993
- Identifiability of hidden Markov information sources and their minimum degrees of freedomIEEE Transactions on Information Theory, 1992
- Combinatorial Matrix TheoryPublished by Cambridge University Press (CUP) ,1991
- Systems Analysis by Graphs and MatroidsPublished by Springer Nature ,1987
- Structural Theory for the Combinatorial Systems Characterized by Submodular FunctionsPublished by Elsevier ,1984
- Applications of Matroid TheoryPublished by Springer Nature ,1983
- Combinatorial TheoryPublished by Springer Nature ,1979
- Probabilistic automata and stochastic transformationsTheory of Computing Systems, 1967
- On Stochastic Processes Derived From Markov ChainsThe Annals of Mathematical Statistics, 1965
- On the Identifiability Problem for Functions of Finite Markov ChainsThe Annals of Mathematical Statistics, 1957