Determining the structure of the Jordan normal form of a matrix by symbolic computation (Q676030): 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(95)00669-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086574746 / rank | |||
Normal rank | |||
Revision as of 20:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the structure of the Jordan normal form of a matrix by symbolic computation |
scientific article |
Statements
Determining the structure of the Jordan normal form of a matrix by symbolic computation (English)
0 references
13 March 1997
0 references
The algorithm presented in this paper aims at discovering the structure of the Jordan normal form. It relies on constructing a squarefree relatively prime basis for a sequence of minimal polynomials associated with the matrix. For matrices with rational entries, this may be performed without any numerical error by symbolic computation. This step then reveals the structure of Jordan blocks. The main part of the paper is concerned with implementation details. Finally, a difficult numerical example is solved and the routine compared with other approaches.
0 references
algorithm
0 references
Jordan normal form
0 references
squarefree relatively prime basis
0 references
minimal polynomials
0 references
symbolic computation
0 references
numerical example
0 references
