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

page 1

page 2

page 3

page 4

research
10/14/2020

Continuous window functions for NFFT

In this paper, we study the error behavior of the nonequispaced fast Fou...
research
07/06/2021

Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms

In this paper we study the nonuniform fast Fourier transform with nonequ...
research
07/25/2017

An Algorithm for the 2D Radix-2 Sliding Window Fourier Transform

We present a new algorithm for the 2D Radix-2 Sliding Window Fourier Tra...
research
06/12/2012

A Novel Windowing Technique for Efficient Computation of MFCC for Speaker Recognition

In this paper, we propose a novel family of windowing technique to compu...
research
12/22/2020

Zeros of Gaussian Weyl-Heisenberg functions and hyperuniformity of charge

We study Gaussian random functions on the plane whose stochastics are in...
research
10/03/2022

Fast Ewald summation for Stokes flow with arbitrary periodicity

A fast and spectrally accurate Ewald summation method for the evaluation...
research
04/14/2020

Error analysis for filtered back projection reconstructions in Besov spaces

Filtered back projection (FBP) methods are the most widely used reconstr...

Please sign up or login with your details

Forgot password? Click here to reset