2019/12/20 by Daniel Potts, Potts, Daniel, Manfred Tasche +1
Computer Science · Mathematics · #42A10 #65T50 #94A12 #FOS: Mathematics #Numerical Analysis (math.NA) #cs.NA #math.NA #msc:42A10 #msc:65T50 #msc:94A12
paper · pdf · doi:10.48550/arxiv.1912.09746
arxiv created 2021/08/24 · arxiv updated 2021/08/25
In this paper, we study the error behavior of the nonequispaced fast Fourier transform (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 error estimates for NFFT with compactly supported, continuous window functions and derive rules for convenient choice from the parameters involved in NFFT. The error constant of a window function depends mainly on the oversampling factor and the truncation parameter.