FAST ALGORITHMS FOR THE COMPUTATION OF FOURIER EXTENSIONS OF ARBITRARY LENGTH

Fourier series of smooth, nonperiodic functions on [-1, 1] are known to exhibit the Gibbs phenomenon, and they exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say, [-T, T] with T > 1, a technique called Fourier extension or Fourier continuation. When constructed as the discrete least squares minimizer in equidistant points, the Fourier extension for analytic functions has been shown to converge at least superalgebraically in the truncation parameter N. A fast O(N log(2) N) algorithm has been described to compute Fourier extensions for the case where T = 2, compared to O(N-3) for solving the dense discrete least squares problem. We present two O(N log(2) N) algorithms for the computation of these approximations for the case of general T, made possible by exploiting the connection between Fourier extensions and Prolate Spheroidal Wave theory. The first algorithm is based on the explicit computation of so-called periodic discrete prolate spheroidal sequences, while the second algorithm is purely algebraic and only implicitly based on the theory.