A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions
|Title||A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions|
|Year of Publication||2017|
|Authors||Xu, K, Austin, AP, Wei, K|
We present a new algorithm for computing the convolution of two compactly supported functions. The algorithm approximates the functions to be convolved using Fourier extensions and then uses the fast Fourier transform to efficiently compute Fourier extension approximations to the pieces of the result.