Numerical stability of nonequispaced fast Fourier transforms

DOI10.1016/J.CAM.2007.12.025MaRDI QIDQ955087zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical examplesalgorithmnumerical stabilityfast Fourier transformroundoff errornonequispaced datasampling of trigonometric polynomials

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 1421270
• scientific article; zbMATH DE number 2141510
• scientific article; zbMATH DE number 1284007
• Fast Fourier Transforms for Nonequispaced Data
• A note on fast Fourier transforms for nonequispaced grids

Cites work

• scientific article; zbMATH DE number 1284007 (Why is no real title available?)
• scientific article; zbMATH DE number 1971052 (Why is no real title available?)
• scientific article; zbMATH DE number 2141510 (Why is no real title available?)
• A new linogram algorithm for computerized tomography
• A note on fast Fourier transforms for nonequispaced grids
• A probability argument in favor of ignoring small singular values
• Accelerating the Nonuniform Fast Fourier Transform
• Accuracy and Stability of Numerical Algorithms
• Efficient numerical methods in non-uniform sampling theory
• Fast Fourier Transforms for Nonequispaced Data
• Fast and accurate polar Fourier transform
• Non-equispaced fast Fourier transforms with applications to tomography
• On the computation of the polar FFT
• On the fast Fourier transform of functions with singularities
• Random Sampling of Multivariate Trigonometric Polynomials
• Reconstruction Algorithms in Irregular Sampling
• Roundoff error analysis for fast trigonometric transforms
• Stability Results for Scattered Data Interpolation by Trigonometric Polynomials
• Worst and average case roundoff error analysis for FFT

Cited in

(16)

• Nonequispaced fast Fourier transforms without oversampling
• Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples
• Continuous window functions for NFFT
• ADMM based Fourier phase retrieval with untrained generative prior
• scientific article; zbMATH DE number 2125495 (Why is no real title available?)
• Computing reconstructions from nonuniform Fourier samples: universality of stability barriers and stable sampling rates
• Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements
• The computational efficiency of nonlinear frequency domain methods
• Automated parameter tuning based on RMS errors for nonequispaced FFTs
• The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
• scientific article; zbMATH DE number 2127851 (Why is no real title available?)
• scientific article; zbMATH DE number 2141510 (Why is no real title available?)
• scientific article; zbMATH DE number 1421270 (Why is no real title available?)
• Uniform error estimates for nonequispaced fast Fourier transforms
• Parameter estimation for exponential sums by approximate prony method
• Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling

Describes a project that uses

Uses Software

• mctoolbox

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)