We iluustrate below the gap between naive and optimized implementations of the same algorithm.
Next, we show benchmarks between classical and FFT-based univariate polynomial multiplication.
The maple work sheet Bareiss.mw iluustrates the problem of intermediate expression swell. In many situations, this problem is solved by means of modular methods. Here's an example of such method that will study in detail later
a square matrix over
for
.
.
Another example of intermediate expression swell is given below. Consider the polynomials
![]() |
(1) |
.
The successive remainders of the Euclidean Algorithm applied
to
We will study modular methods for the Euclidean Algorithm too.
Marc Moreno Maza