Fast Fourier transforms for nonequispaced data: A tutorial

  • Potts D
  • Steidl G
  • Tasche M
  • 75


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


In this section, we consider approximate methods
for the fast computiation of multivariate discrete
Fourier transforms for nonequispaced data (NDFT) in
the time domain and in the frequency domain. In
particular, we are interested in the approximation
error as function of arithmetic complexity of the
algorithm. We discuss the robustness of
NDFT-algorithms with respect to roundoff errors and
apply NDFT-algorithms for the fast computation of
Bessel transforms.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Daniel Potts

  • Gabriele Steidl

  • Manfred Tasche

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free