Uniform error estimates for the NFFT
share
In this paper, we study the error behavior of the known fast Fourier transform for nonequispaced data (NFFT). This approximate algorithm is mainly based on the convenient choice of a compactly supported window function. So far, various window functions have been used and new window functions have recently been proposed. We present novel uniform error estimates for NFFT and derive rules for the optimal choice from the parameters involved in NFFT.
READ FULL TEXT