Special Thanks for the creation and implementation of this applet goes to JONATHAN
BEAVER of the University of Pittsburgh (copyright 2001). The above applet attempts to explain
how the Fast Fourier Algorithm can be used to do polynomial multiplication in a small amount
of time. The applet also has many other features to further help in understanding the
underlying algorithm. Enjoy!
Any question or comments send to beaver@cs.pitt.edu
Click here to
return to
the main page
Click here to return to list of math related applets