Numerical stability of nonequispaced fast Fourier transforms
DOI10.1016/J.CAM.2007.12.025zbMATH Open1210.65208OpenAlexW2044929536MaRDI QIDQ955087FDOQ955087
Authors: Daniel Potts, Manfred Tasche 
Publication date: 18 November 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.12.025
Recommendations
numerical examplesalgorithmnumerical stabilityfast Fourier transformroundoff errornonequispaced datasampling of trigonometric polynomials
Numerical methods for trigonometric approximation and interpolation (65T40) Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Non-equispaced fast Fourier transforms with applications to tomography
- On the fast Fourier transform of functions with singularities
- Title not available (Why is that?)
- Fast Fourier Transforms for Nonequispaced Data
- Accuracy and Stability of Numerical Algorithms
- A note on fast Fourier transforms for nonequispaced grids
- Accelerating the Nonuniform Fast Fourier Transform
- Reconstruction Algorithms in Irregular Sampling
- Fast and accurate polar Fourier transform
- A new linogram algorithm for computerized tomography
- A probability argument in favor of ignoring small singular values
- Efficient numerical methods in non-uniform sampling theory
- On the computation of the polar FFT
- Random Sampling of Multivariate Trigonometric Polynomials
- Title not available (Why is that?)
- Stability Results for Scattered Data Interpolation by Trigonometric Polynomials
- Roundoff error analysis for fast trigonometric transforms
- Title not available (Why is that?)
- Worst and average case roundoff error analysis for FFT
Cited In (14)
- ADMM based Fourier phase retrieval with untrained generative prior
- Nonequispaced fast Fourier transforms without oversampling
- Title not available (Why is that?)
- Parameter estimation for exponential sums by approximate prony method
- Continuous window functions for NFFT
- The computational efficiency of nonlinear frequency domain methods
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples
- Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements
- Title not available (Why is that?)
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Computing reconstructions from nonuniform Fourier samples: universality of stability barriers and stable sampling rates
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Numerical stability of nonequispaced fast Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955087)
