Consider the following matrix:
>
|
|
| (1) |
The pole order of this matrix at the point is . The Moser algorithm computes an equivalent matrix of minimal pole order.
>
|
|
| (2) |
Here, the pole order is now . The super reduction algorithm computes a matrix which is Moser-irreducible and moreover the minimum of the valuations of each column (or equivalently, each row) is minimal. This also gives as additional information the integer slopes of the Newton polygon and the associated Newton polynomials.
>
|
|
| (3) |
| (4) |
Check whether the matrix T is the correct transformation matrix:
>
|
|
If p is an irreducible polynomial, the computations are done for all roots of p simultaneously. The transformation matrices and hence the transformed matrix do not involve algebraic extensions over the ground field.
>
|
|
| (6) |
>
|
|
| (7) |