Polynomial multiplication using the fast Fourier transform - Maple Application Center
Application Center Applications Polynomial multiplication using the fast Fourier transform

Polynomial multiplication using the fast Fourier transform

Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
We will be multiplying polynomials using two different ways, (traditional and FFT), and see whether one method is consistently faster than the other one. We will let the polynomials and be of the same degree for simplicity and we will generate the polynomials coefficients randomly. Again, for simplicity, the coefficients are integers chosen in [-50..50]. For a more detailed explanation of what follows, please consult [1] in the Reference section.

Application Details

Publish Date: June 18, 2001
Created In: Maple 6
Language: English

More Like This

Comparison of Multivariate Optimization Methods

Portfolio Optimization under Nonconvex Transaction Costs with the Global Optimization Toolbox

Lie algebra package

Fitting vapor pressure data with regression

Grobner Basis Package, original version

Terminal velocity of falling particles

Steady state material balances on a separation train

Binary batch distillation

ASCII padding

Diffusion and reaction in a 1-D slab

Reaction equilibrium for multiple gas phase reactions

Iterative solution to changing problem