Fast Fourier transforms for nonequispaced data: A tutorial

Fast Fourier transforms for nonequispaced data: A tutorial (2000)

by Daniel Potts , Gabriele Steidl , Manfred Tasche

Citations:

93 - 31 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Fast Fourier transforms for nonequispaced data: A tutorial	user correction - Legacy Corrections
AUTHOR NAME	Daniel Potts	user correction - Legacy Corrections
AUTHOR AFFIL	Let \Pi; d	user correction - Legacy Corrections
AUTHOR NAME	Gabriele Steidl	user correction - Legacy Corrections
AUTHOR AFFIL	Let \Pi; d	user correction - Legacy Corrections
AUTHOR NAME	Manfred Tasche	user correction - Legacy Corrections
AUTHOR AFFIL	Let \Pi; d	user correction - Legacy Corrections
ABSTRACT	In this section, we consider approximative methods for the fast computation 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 the 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.	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	26 found	ParsCit 1.0