Argonne National Laboratory

A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions

TitleA Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions
Publication TypeReport
Year of Publication2017
AuthorsXu, K, Austin, AP, Wei, K
Report NumberANL/MCS-P7006-0117
Abstract

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.
 

PDFhttp://www.mcs.anl.gov/papers/P7006-0117.pdf