A new theoretical derivation of NFFT and its implementation on GPU
From MaRDI portal
Publication:1690700
DOI10.1016/j.acha.2016.04.009zbMath1432.65206OpenAlexW2345380136MaRDI QIDQ1690700
Zhong-Yuan Lu, Hu-Jun Qian, Sheng-Chun Yang
Publication date: 12 January 2018
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2016.04.009
Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for cardinal interpolation using box splines and radial basis functions
- A note on fast Fourier transforms for nonequispaced grids
- Fast Fourier transforms for nonequispaced data. II
- Efficient numerical methods in non-uniform sampling theory
- Fast spherical Fourier algorithms.
- Approximate factorizations of Fourier matrices with nonequispaced knots
- Non-equispaced fast Fourier transforms with applications to tomography
- On the fast Fourier transform of functions with singularities
- Fast wavelet transforms and numerical algorithms I
- Combined Complex Ridgelet Shrinkage and Total Variation Minimization
- Stability Results for Scattered Data Interpolation by Trigonometric Polynomials
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Fast Fourier Transforms for Nonequispaced Data
- Fast Multiresolution Algorithms for Matrix-Vector Multiplication
- Fast Summation at Nonequispaced Knots by NFFT
- Accelerating the Nonuniform Fast Fourier Transform
- The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
- Rapid Computation of the Discrete Fourier Transform
- Nonuniform fast fourier transforms using min-max interpolation
- Fast Discrete Curvelet Transforms
- Modern sampling theory. Mathematics and applications
This page was built for publication: A new theoretical derivation of NFFT and its implementation on GPU
