Pages that link to "Item:Q1272511"
From MaRDI portal
The following pages link to A note on fast Fourier transforms for nonequispaced grids (Q1272511):
Displayed 23 items.
- An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions (Q278771) (← links)
- Automated parameter tuning based on RMS errors for nonequispaced FFTs (Q314458) (← links)
- Efficient calculations of 3-D FFTs on spiral contours (Q427174) (← links)
- Sparsity enforcing edge detection method for blurred and noisy Fourier data (Q427182) (← links)
- Compressive optical deflectometric tomography: a constrained total-variation minimization approach (Q479857) (← links)
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data (Q489772) (← links)
- On reconstruction from non-uniform spectral data (Q618645) (← links)
- Fast ewald summation based on NFFT with mixed periodicity (Q729086) (← links)
- On the computation of the polar FFT (Q869654) (← links)
- Numerical stability of nonequispaced fast Fourier transforms (Q955087) (← links)
- A new theoretical derivation of NFFT and its implementation on GPU (Q1690700) (← links)
- Fourier series approximation of separable models (Q1860392) (← links)
- Approximate factorizations of Fourier matrices with nonequispaced knots (Q1874676) (← links)
- Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677) (← links)
- Fast convolution with radial kernels at nonequispaced knots (Q1882396) (← links)
- NFFT based Ewald summation for electrostatic systems with charges and dipoles (Q2408509) (← links)
- Direct inversion of the nonequispaced fast Fourier transform (Q2419062) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators (Q3188200) (← links)
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel (Q5238750) (← links)
- A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids (Q5741066) (← links)
- Fast Gauss transforms with complex parameters using NFFTs (Q5756846) (← links)