Fast Fourier Transforms for Nonequispaced Data: A Tutorial

  • Daniel Potts
  • Gabriele Steidl
  • Manfred Tasche
Chapter
Part of the Applied and Numerical Harmonic Analysis book series (ANHA)

Abstract

In this chapter we consider approximativemethods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the frequency domain. In particularwe are interested in the approximation error as function of the arithmetic complexity of the algorithm. We discuss the robustness of NDFT¡ªalgorithms with respect to roundoff errors and applyNDFTalgorithms for the fast computation of Besseltransforms.

Keywords

Prolate Gridding 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Daniel Potts
  • Gabriele Steidl
  • Manfred Tasche

There are no affiliations available

Personalised recommendations