# Convolutions and the Fast Fourier Transform

In mathematics and, in particular, functional analysis, convolution is a mathematical operation on two functions f and g, producing a third function. Using the fast Fourier transform can implement discrete convolutions in $$O(nlogn)$$ time.