Skip to Main Content
Loading Events


Your source for campus events
  • This event has passed.

Feb. 2: Guest Seminar, Fast Algorithms Based on Asymptotic Expansions of Special Functions

Graphic of Boise State "B" logo.

3 p.m. Math/Geosciences building, room 124. A great success of the 20th century was the development of fast algorithms such as the fast Fourier transform, the fast multipole method and butterfly algorithms. In this talk, guest lecturer Alex Townsend, MIT, carefully employs asymptotic expansions of special functions, that were a 19th century curiosity, to develop a new family of fast algorithms for computing a billion Gauss-quadrature nodes and weights, the circularly symmetric FFT and the convolution of complicated probability distributions.

This talk is free and open to the public.


February 2, 2016
3:00 pm - 4:00 pm
Event Categories:
, ,
Event Tags: