Nonequispaced FFT. Generalisation and inversion.
zbMATH Open1111.65116MaRDI QIDQ3427344FDOQ3427344
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
Recommendations
interpolationconvergenceleast squaressingular value decompositionalgorithmnumerical experimentserror estimatesfast Fourier transformapproximate inversefast Gauss transformdiscrete Fourier transformsfast matrix vector arithmetic
Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (12)
- Time and memory requirements of the nonequispaced FFT
- The smooth extension embedding method
- On the application of pseudospectral FFT techniques to non‐periodic problems
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Automated parameter tuning based on RMS errors for nonequispaced FFTs
- Tight framelets and fast framelet filter bank transforms on manifolds
- Vandermonde matrices with nodes in the unit disk and the large sieve
- Fast approximation of the discrete Gauss transform in higher dimensions
- INFFTM: fast evaluation of 3d Fourier series in MATLAB with an application to quantum vortex reconnections
- Fast Fourier methods for trigonometric polynomials and bandlimited functions
- Fast SGL Fourier transforms for scattered data
- A nonuniform fast Fourier transform based on low rank approximation
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)
