minus plus magnify speech newspaper atomic biology chemistry computer-science earth-science forensic-services globe info math matrix molecule neuroscience pencil physics pin psychology email share atsign clock double-left-chevron double-right-chevron envelope fax phone tumblr googleplus pinterest twitter facebook feed linkedin youtube flickr instagram

Seminar: Applied/Biomath seminars

Speaker: Joel Zirkle Location: LD 002

Fast Fourier Transforms: Algorithm and Application

Fast fourier transforms are frequently used to analyze data, especially signal data. They are interesting because the algorithm used to calculate a transform takes O(n log(n)) operations which is relatively small compared to other traditional algorithms. Joel Zirkle will discuss the mathematics behind this algorithm as well as applications of the algorithm to signalling analysis including, for example, power spectra that help summarize the underlying frequencies that make up a particular signal. (WH Press, BP Flannery, SA Teukolsky, WT Vetterling, Numerical Recipes 12-12.2.3 & 13-13.4.2, Cambridge University Press, New York, 1986.)

Organizer: J. Barber