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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Potts, D., Steidl, G., Tasche, M. (2001). Fast Fourier Transforms for Nonequispaced Data: A Tutorial. In: Benedetto, J.J., Ferreira, P.J.S.G. (eds) Modern Sampling Theory. Applied and Numerical Harmonic Analysis. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0143-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0143-4_12
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6632-7
Online ISBN: 978-1-4612-0143-4
eBook Packages: Springer Book Archive