Lecture 10: The Fast Fourier Transform (FFT)

Background Material



  1. Review of evaluation, pointwise product, interpolation algorithm for polynomial multiplication.
  2. Review of matrix interpretation of evaluation and interpolation.
  3. Horner's method for polynomial evaluation.
  4. Evaluating a polynomial at a point and its negative.
  5. Review of complex numbers
  6. Roots of unity.
  7. Discrete Fourier Transform as a Vandermonde matrix.
  8. Evaluating the Vandermonde matrix with even/odd symmetry
  9. Fast Fourier Transform

Lecture Slides

  1. fft.ppt - power point slides containing lecture notes on the FFT.

Maple worksheets and programs


Created: May 18, 2004 by jjohnson@mcs.drexel.edu