Fast Fourier Transforms for Nonequispaced Data
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Fast convolution with the free space Helmholtz Green's function
- Efficient thermal field computation in phase-field models
- The black-box fast multipole method
- A fast algorithm for nonequispaced Fourier transforms on the rotation group
- A note on fast Fourier transforms for nonequispaced grids
- Efficient algorithms for diffusion-generated motion by mean curvature
- On the implementation of the Dirichlet-to-Neumann radiation condition for iterative solution of the Helmholtz equation
- In-place self-sorting fast Fourier transform algorithm with local memory references
- Two dimensional fast Fourier transform for large data matrices
- Fast Fourier transforms for nonequispaced data. II
- A fast spherical filter with uniform resolution
- Fast spherical Fourier algorithms.
- An exploratory data analysis (EDA) of the paths of moving animals.
- Computational strategies for the Riemann zeta function
- The ubiquitous Kronecker product
- Reducing the computational cost of the ECF using a nuFFT: a fast and objective probability density estimation method
- Accurate and efficient computation of nonlocal potentials based on Gaussian-sum approximation
- Huygens-Fresnel wavefront tracing
- A new theoretical derivation of NFFT and its implementation on GPU
- An efficient boundary integral scheme for the MBO threshold dynamics method via the NUFFT
- Fast Laplace transforms for the exponential Radon transform
- The type 3 nonuniform FFT and its applications
- On generalized Gaussian quadratures for exponentials and their applications
- Fourier series approximation of separable models
- Approximate factorizations of Fourier matrices with nonequispaced knots
- Fast algorithms for discrete polynomial transforms on arbitrary grids
- Non-equispaced fast Fourier transforms with applications to tomography
- Fast convolution with radial kernels at nonequispaced knots
- A penalty method for American options with jump diffusion processes
- On the fast Fourier transform of functions with singularities
- Fast memory efficient evaluation of spherical polynomials at scattered points
- Continuous window functions for NFFT
- Uniform error estimates for nonequispaced fast Fourier transforms
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
- Efficient long-range convolutions for point clouds
- A fast method for imposing periodic boundary conditions on arbitrarily-shaped lattices in two dimensions
- An exact solution to the Fourier transform of band-limited periodic functions with nonequispaced data and application to non-periodic functions
- A general and fast convolution-based method for peridynamics: applications to elasticity and brittle fracture
- Minimizing aliasing in multiple frequency harmonic balance computations
- Fast SGL Fourier transforms for scattered data
- Correcting the side effects of ADC filtering in MR image reconstruction
- Error bounds for cumulative distribution functions of convolutions via the discrete Fourier transform
- Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method
- An improved threshold dynamics method for wetting dynamics
- Efficient Fourier basis particle simulation
- Algorithms for unequally spaced fast Laplace transforms
- An algorithm for the rapid evaluation of special function transforms
- Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies
- An efficient boundary integral scheme for the threshold dynamics method. II. Applications to wetting dynamics
- Fast Fourier transforms of piecewise polynomials
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- NFFT based Ewald summation for electrostatic systems with charges and dipoles
- Direct inversion of the nonequispaced fast Fourier transform
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- On the numerical solution of the heat equation. I: Fast solvers in free space
- On approximation of functions by exponential sums
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
- Preconditioners based on fundamental solutions
- Highly effective stable evaluation of bandlimited functions on the sphere
- Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform
- Integer multiplication in time \(O(n\log n)\)
- An extra-component method for evaluating fast matrix-vector multiplication with special functions
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
- On the stability of unevenly spaced samples for interpolation and quadrature
- Nonuniform fast cosine transform and Chebyshev PSTD algorithms. (Abstract)
- An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions
- Direct inversion of the three-dimensional pseudo-polar Fourier transform
- A high-order, analytically divergence-free approximation method for the time-dependent Stokes problem
- Fast and accurate propagation of coherent light
- Adaptive integral method with fast Gaussian gridding for solving combined field integral equations
- Fast wave computation via Fourier integral operators
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
- Automated parameter tuning based on RMS errors for nonequispaced FFTs
- Sampling for approximating R-limited functions
- An improved semi-Lagrangian time splitting spectral method for the semi-classical Schrödinger equation with vector potentials using NUFFT
- Nonequispaced fast Fourier transform on parallel hexagon
- Nonequispaced FFT. Generalisation and inversion.
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- An efficient spectral method for computing dynamics of rotating two-component Bose-Einstein condensates via coordinate transformation
- scientific article; zbMATH DE number 4164118 (Why is no real title available?)
- Non-uniform FFT for the finite element computation of the micromagnetic scalar potential
- Fast algorithms for Helmholtz Green's functions
- Computing the Hilbert transform using biorthogonal spline wavelets
- Fast summation based on fast trigonometric transforms at non‐equispaced nodes
- An efficient Fourier transform algorithm for frequency domains of several decades using logarithmically spaced time samples
- scientific article; zbMATH DE number 4066293 (Why is no real title available?)
- Fast computation of real discrete Fourier transform for any number of data points
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon
- On the representation of functions with Gaussian wave packets
- Spectral accuracy in fast Ewald-based methods for particle simulations
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- scientific article; zbMATH DE number 1284007 (Why is no real title available?)
- scientific article; zbMATH DE number 1329498 (Why is no real title available?)
- Efficient calculations of 3-D FFTs on spiral contours
- scientific article; zbMATH DE number 540180 (Why is no real title available?)
- scientific article; zbMATH DE number 713867 (Why is no real title available?)
- The Anisotropic Truncated Kernel Method for Convolution with Free-Space Green's Functions
- Variational Fourier features for Gaussian processes
- Nonequispaced fast Fourier transforms without oversampling
This page was built for publication: Fast Fourier Transforms for Nonequispaced Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277775)
