The FFT - An Algorithm the Whole Family Can Use
Daniel Rockmore
Dartmouth College
The Fast Fourier Transform of "FFT" is one of the most ubiquitous algorithms in all of computational mathematics. In this talk we'll explore the FFT from its astronimcal origins in the prediction of celestial orbits to its modern instantiation as the primary tool of digital signal processing, and then move on to its generalizations as a basic scheme for data analysis in the presence of symmetry - i.e., group theory. We'll see how this more general framework has proved useful in a variety of areas, from electronic music to robotics, and even...tomato growing.
Tuesday, May 1, 2007
3:15 p.m.
Warner 202
Refreshments at 3:00 p.m.
All are welcome to attend!