The rank of powers of matrices in a block triangular form
From MaRDI portal
A graph theoretic upper bound for the rank of sufficiently high powers of a complex valued matrix are given. Namely, assuming a lower block triangular form of the matrix, the bound is given in terms of the rank of the powers of its diagonal blocks. An index theorem, which relates the index of the matrix to the indices of its diagonal blocks, is obtained as a corollary.
Recommendations
Cites work
Cited in
(14)- The combinatorial structure of the generalized nullspace of a block triangular matrix
- The symbiotic relationship of combinatorics and matrix theory
- The height characteristic of block triangular matrices
- On the existence of matrices with prescribed height and level characteristics
- A product index theorem with applications to splittings of \(M\)-matrices
- Paths in directed graphs and spectral properties of matrices
- A characterization of Jordan canonical forms which are similar to eventually nonnegative matrices with the properties of nonnegative matrices.
- A majorization relation between the height and the level characteristics
- The combinatorial structure of generalized eigenspaces -- from nonnegative matrices to general matrices
- Predecessor property, full combinatorial column rank, and the height characteristic of an M-matrix
- A solution to an inverse height and level characteristics problem
- Principal components of minusM-matrices∗
- On the Index of Block Upper Triangular Matrices
- A Unifying Framework for Higher Order Derivatives of Matrix Functions
This page was built for publication: The rank of powers of matrices in a block triangular form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109097)