Upper triangularization of matrices by permutations and lower triangular similarity transformations (Q1109521): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(83)90139-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085033065 / rank | |||
Normal rank | |||
Revision as of 01:37, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper triangularization of matrices by permutations and lower triangular similarity transformations |
scientific article |
Statements
Upper triangularization of matrices by permutations and lower triangular similarity transformations (English)
0 references
1988
0 references
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.
0 references
lower triangular similarity transformations
0 references
similarities
0 references
triangularization of matrices
0 references
rational matrix functions
0 references
