Pages that link to "Item:Q4229430"
From MaRDI portal
The following pages link to Fast Approximate Fourier Transforms for Irregularly Spaced Data (Q4229430):
Displaying 28 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)
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data (Q489772) (← links)
- Fast ewald summation based on NFFT with mixed periodicity (Q729086) (← links)
- Fast and accurate polar Fourier transform (Q849677) (← links)
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing (Q861809) (← links)
- On the computation of the polar FFT (Q869654) (← links)
- Numerical solution of two asset jump diffusion models for option valuation (Q928833) (← links)
- Asymptotic properties of discrete Fourier transforms for spatial data (Q987096) (← links)
- On a fast and accurate method for computing Fourier transforms (Q1334992) (← links)
- Fast spherical Fourier algorithms. (Q1412818) (← links)
- A new theoretical derivation of NFFT and its implementation on GPU (Q1690700) (← links)
- Approximate factorizations of Fourier matrices with nonequispaced knots (Q1874676) (← links)
- Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677) (← links)
- A penalty method for American options with jump diffusion processes (Q1889909) (← links)
- Direct operatorial tau method for pantograph-type equations (Q2250245) (← links)
- NFFT based Ewald summation for electrostatic systems with charges and dipoles (Q2408509) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms (Q2691905) (← links)
- Direct inversion of the three-dimensional pseudo-polar Fourier transform (Q2800441) (← links)
- (Q3490924) (← links)
- Fast computation of real discrete Fourier transform for any number of data points (Q3986791) (← links)
- A Nonuniform Fast Fourier Transform Based on Low Rank Approximation (Q4603509) (← links)
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel (Q5238750) (← links)
- Fast evaluation of quadrature formulae on the sphere (Q5429506) (← links)
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform (Q6098516) (← links)
- Finite difference approximations of the spatially homogeneous Fokker-Planck-Landau equation (Q6572433) (← links)