Frobenius - inert Frobenius function
|
Calling Sequence
|
|
Frobenius(A)
Frobenius(A, 'P')
|
|
Parameters
|
|
A
|
-
|
square Matrix
|
'P'
|
-
|
(optional) assigned the transformation matrix
|
|
|
|
|
Description
|
|
•
|
The Frobenius function is a placeholder for representing the Frobenius form (or Rational Canonical form) of a square matrix. It is used in conjunction with either mod or evala.
|
•
|
If called in the form Frobenius(A, 'P'), then P will be assigned the transformation matrix corresponding to the Frobenius form, that is, the matrix P such that inverse(P) * A * P = F.
|
•
|
The call Frobenius(A) mod p computes the Frobenius form of A modulo p which is a prime integer. The entries of A must have rational coefficients or coefficients from an algebraic extension of the integers modulo p.
|
•
|
The call evala(Frobenius(A)) computes the Frobenius form of the square matrix A where the entries of A are algebraic numbers (or functions) defined by RootOfs.
|
|
|
Examples
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
Test the result
>
|
|
| (4) |
>
|
|
>
|
|
| (5) |
>
|
|
| (6) |
Test the result
>
|
|
| (7) |
|
|
References
|
|
|
Martin, K., and Olazabal, J.M. "An Algorithm to Compute the Change Basis for the Rational Form of K-endomorphisms." Extracta Mathematicae, (August 1991): 142-144.
|
|
Ozello, Patrick. "Calcul Exact des Formes de Jordan et de Frobenius d'une Matrice." PhD Thesis, Joseph Fourier University, Grenoble, France, 1987.
|
|
|
Download Help Document
Was this information helpful?