Fast algorithms for the computation of Fourier extensions of arbitrary length

DOI10.1137/15M1030923zbMATH Open1337.65181arXiv1509.00206MaRDI QIDQ2797086

Author name not available (Why is that?)

Publication date: 4 April 2016

Published in: (Search for Journal in Brave)

Abstract: Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and 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 has been shown shown to converge geometrically in the truncation parameter $N$. A fast $mathcalO(Nlo{g}^{2}N)$ algorithm has been described to compute Fourier extensions for the case where $T=2$, compared to $mathcalO(N^3)$ for solving the dense discrete least squares problem. We present two $mathcalO(Nlo{g}^{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.

Full work available at URL: https://arxiv.org/abs/1509.00206

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Fast algorithms for the computation of Fourier extensions of arbitrary length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797086)