Uniform error estimates for nonequispaced fast Fourier transforms
DOI10.1007/s43670-021-00017-zzbMath1483.65242arXiv1912.09746OpenAlexW3211315168MaRDI QIDQ2073138
Publication date: 27 January 2022
Published in: Sampling Theory, Signal Processing, and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.09746
Paley-Wiener theoremerror estimateWiener algebranonequispaced fast Fourier transformtruncation parameteroversampling factorcompactly supported window function
Trigonometric approximation (42A10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automated parameter tuning based on RMS errors for nonequispaced FFTs
- A note on fast Fourier transforms for nonequispaced grids
- Fast Fourier transforms for nonequispaced data. II
- Numerical Fourier analysis
- On the fast Fourier transform of functions with singularities
- Continuous window functions for NFFT
- Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- A differential equation for the zeros of bessel functions
- Fast Fourier Transforms for Nonequispaced Data
- Fast Summation at Nonequispaced Knots by NFFT
- A Nonuniform Fast Fourier Transform Based on Low Rank Approximation
- Bounds for modified Bessel functions of the first and second kinds
- Approximations for the Bessel and Airy functions with an explicit error term
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel
- On approximating the modified Bessel function of the first kind and Toader-Qi mean
This page was built for publication: Uniform error estimates for nonequispaced fast Fourier transforms