Fast NFFT based summation of radial functions
From MaRDI portal
Publication:5451826
Recommendations
- Fast Summation at Nonequispaced Knots by NFFT
- Fast discrete convolution in \(\mathbb{R}^2\) with radial kernels using non-uniform fast Fourier transform with nonequispaced frequencies
- Fast convolution with radial kernels at nonequispaced knots
- Fast summation of radial functions on the sphere
- Fast Gauss transforms with complex parameters using NFFTs
Cited in
(10)- Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method
- An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions
- Fast Summation at Nonequispaced Knots by NFFT
- Fast summation based on fast trigonometric transforms at non‐equispaced nodes
- Fast ewald summation based on NFFT with mixed periodicity
- On certain (block) Toeplitz matrices related to radial functions
- Consistency of probability measure quantization by means of power repulsion-attraction potentials
- A high-order, analytically divergence-free approximation method for the time-dependent Stokes problem
- Fast summation of radial functions on the sphere
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication
This page was built for publication: Fast NFFT based summation of radial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451826)
