Belitskiĭ's canonical form for \(5\times 5\) upper triangular matrices under upper triangular similarity (Q2484488): 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/j.laa.2005.01.028 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091914592 / rank | |||
Normal rank |
Revision as of 03:40, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Belitskiĭ's canonical form for \(5\times 5\) upper triangular matrices under upper triangular similarity |
scientific article |
Statements
Belitskiĭ's canonical form for \(5\times 5\) upper triangular matrices under upper triangular similarity (English)
0 references
1 August 2005
0 references
The canonical form problem for upper triangular similarity has been solved by the Belitskii's algorithm. Beliskikii's algorithm works in a much broader setting, reducing a matrix \(A\) to a canonical form. The set \(T\) of all upper triangular \(n\times n\) matrices is a reduced \(1\times 1\) algebra, and every \(A\) in \(T\) is reduced to \(T\)-canonical form by Beliskii's algorithm. In dimension 6 or more, there are infinitely many upper triangular similarity classes of nilpotent matrices if the underlying field is infinite. Using Belitskii's algorithm, the author explicitly describes canonical forms for \(5\times 5\) upper triangular matrices under upper triangular similarity.
0 references
upper triangular matrices
0 references
Beliskii's slgorithm
0 references
canonical forms
0 references
upper triangular similarity
0 references