English

Nonequispaced fast Fourier transforms for bandlimited functions

Numerical Analysis 2025-04-17 v2 Numerical Analysis

Abstract

In this paper we consider the problem of approximating function evaluations f(xj)f(\boldsymbol x_j) at given nonequispaced points xj\boldsymbol x_j, j=1,Nj=1,\dots N, of a bandlimited function from given values f^(k)\hat{f}(\boldsymbol k), kIM\boldsymbol k\in \mathcal I_{\boldsymbol M}, of its Fourier transform. Note that if a trigonometric polynomial is given, it is already known that this problem can be solved by means of the nonequispaced fast Fourier transform (NFFT). In other words, we introduce a new NFFT-like procedure for bandlimited functions, which is based on regularized Shannon sampling formulas.

Keywords

Cite

@article{arxiv.2502.07155,
  title  = {Nonequispaced fast Fourier transforms for bandlimited functions},
  author = {Melanie Kircheis and Daniel Potts},
  journal= {arXiv preprint arXiv:2502.07155},
  year   = {2025}
}
R2 v1 2026-06-28T21:39:35.265Z