Determining the structure of the Jordan normal form of a matrix by symbolic computation (Q676030)

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.