Uniform error estimates for the NFFT

12/20/2019 ∙ by Daniel Potts, et al. ∙ 0

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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.