>
|
|
>
|
|
Define a ring of polynomials.
>
|
|
Randomly generating (dense) regular chain and polynomial
>
|
|
Compute the iterated resultant of pol w.r.t. tc
>
|
|
Compare with the generic algorithm (non-fast and non-modular algorithm) of the command IteratedResultant.
>
|
|
The results computed IteratedResultantDim0 and IteratedResultant are equivalent.
Define another ring of polynomials.
>
|
|
>
|
|
Generate a regular chain and a random polynomial.
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
Compute the normal form of f.
>
|
|
| (5) |
Compare with the generic algorithm (non-fast and non-modular algorithm) of the command NormalForm.
>
|
|
| (6) |
The results computed by NormalFormDim0 and NormalForm are equivalent.