Nonequispaced FFT. Generalisation and inversion.

MaRDI QIDQ3427344zbMATH OpenFDO

Authors Stefan Kunis

Publication date 19 March 2007

Full work available at URL http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-5878-8

zbMATH Keywords

algorithmapproximate inverseconvergencediscrete Fourier transformserror estimatesfast Fourier transformfast Gauss transformfast matrix vector arithmeticinterpolationleast squaresnumerical experimentssingular value decomposition

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 1284007
• Fast Fourier transforms for nonequispaced data. II
• Fast Fourier Transforms for Nonequispaced Data
• Nonequispaced fast Fourier transforms without oversampling
• Fast Summation at Nonequispaced Knots by NFFT

Cited in

(12)

• INFFTM: fast evaluation of 3d Fourier series in MATLAB with an application to quantum vortex reconnections
• Fast SGL Fourier transforms for scattered data
• Tight framelets and fast framelet filter bank transforms on manifolds
• Fast approximation of the discrete Gauss transform in higher dimensions
• Vandermonde matrices with nodes in the unit disk and the large sieve
• Nonequispaced Hyperbolic Cross Fast Fourier Transform
• Automated parameter tuning based on RMS errors for nonequispaced FFTs
• A nonuniform fast Fourier transform based on low rank approximation
• On the application of pseudospectral FFT techniques to non‐periodic problems
• Time and memory requirements of the nonequispaced FFT
• The smooth extension embedding method
• Fast Fourier methods for trigonometric polynomials and bandlimited functions

This page was built for publication: Nonequispaced FFT. Generalisation and inversion.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3427344)