Generalized Fast Fourier Transforms -
Applications and Algorithms
Abstract: Generalized Fast Fourier Transforms (FFTs) are a family of algorithms for the efficient computation of harmonic analysis on groups. In this talk I will survey some recent progress in the area, both in terms of applications in areas such as robotics, astronomy and data analysis, as well as the mathematical techniques used to effect these applications.
|Here are some directions to Northeastern University. Lake Hall and Nightingale Hall can be best accessed from the entrance on the corner of Greenleaf Street and Leon Street. The two halls are connected, with no well-defined boundary in between. In particular, 509 Lake Hall is on the same corridor as 544 Nightingale Hall.|
|There is free parking available for people coming to the colloquium at Northeastern's visitor parking. The entrance is from Columbus Avenue, right next to the parking garage.|
|Web page: Alexandru I. Suciu||Comments to: firstname.lastname@example.org|
|Created: April 14, 2000||URL: http://www.math.neu.edu/bhmn/rockmore.html|