Uniform error estimates for nonequispaced fast Fourier transforms
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- A differential equation for the zeros of bessel functions
- A nonuniform fast Fourier transform based on low rank approximation
- A note on fast Fourier transforms for nonequispaced grids
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel
- Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform
- Approximations for the Bessel and Airy functions with an explicit error term
- Automated parameter tuning based on RMS errors for nonequispaced FFTs
- Bounds for modified Bessel functions of the first and second kinds
- Continuous window functions for NFFT
- Fast Fourier Transforms for Nonequispaced Data
- Fast Fourier transforms for nonequispaced data. II
- Fast Summation at Nonequispaced Knots by NFFT
- scientific article; zbMATH DE number 1683274 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 46964 (Why is no real title available?)
- scientific article; zbMATH DE number 3016199 (Why is no real title available?)
- scientific article; zbMATH DE number 1881986 (Why is no real title available?)
- scientific article; zbMATH DE number 819734 (Why is no real title available?)
- Numerical Fourier analysis
- On approximating the modified Bessel function of the first kind and Toader-Qi mean
- On the fast Fourier transform of functions with singularities
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
Cited in
(13)- On regularized Shannon sampling formulas with localized sampling
- Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
- On the stability of unevenly spaced samples for interpolation and quadrature
- Automated parameter tuning based on RMS errors for nonequispaced FFTs
- A sharp error estimate for numerical Fourier fransform of band-limited functions based on windowed samples
- A New Error Estimate of the Fast Gauss Transform
- A Frame Theoretic Approach to the Nonuniform Fast Fourier Transform
- Fast Ewald summation for Stokes flow with arbitrary periodicity
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform
- On numerical realizations of Shannon's sampling theorem
- Some remarks on regularized Shannon sampling formulas
- A sharp error estimate for the fast Gauss transform
This page was built for publication: Uniform error estimates for nonequispaced fast Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2073138)
