Upper triangularization of matrices by permutations and lower triangular similarity transformations
From MaRDI portal
Let A be a complex \(m\times m\) matrix and let \(\alpha_ 1,...,\alpha_ m\) be an ordering of the eigenvalues of A. Then there exist a permutation matrix P and a lower triangular matrix L such that \((PL)^{-1}APL\) is upper triangular with diagonal \((\alpha_ 1,...,\alpha_ m)\). The proof is constructive, two examples are given. The result can be applied in systems theory.
Recommendations
Cites work
- Complementary triangular forms of pairs of matrices, realizations with prescribed main matrices, and complete factorization of rational matrix functions
- Factorizations of Transfer Functions
- scientific article; zbMATH DE number 3983386 (Why is no real title available?)
- scientific article; zbMATH DE number 4078066 (Why is no real title available?)
- scientific article; zbMATH DE number 3534350 (Why is no real title available?)
- Inertia characteristics of self-adjoint matrix polynomials
- Minimal factorization of matrix and operator functions
- Transfer functions and operator theory
- Upper triangularization of matrices by lower triangular similarities
Cited in
(5)- Upper triangularization of matrices by lower triangular similarities
- Spectral criteria for complementary triangular forms
- scientific article; zbMATH DE number 5635797 (Why is no real title available?)
- Similarity invariants for pairs of upper triangular Toeplitz matrices
- Upper triangular matrices and billiard arrays
This page was built for publication: Upper triangularization of matrices by permutations and lower triangular similarity transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109521)