Determining the structure of the Jordan normal form of a matrix by symbolic computation (Q676030)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Determining the structure of the Jordan normal form of a matrix by symbolic computation |
scientific article; zbMATH DE number 991124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the structure of the Jordan normal form of a matrix by symbolic computation |
scientific article; zbMATH DE number 991124 |
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
