Fast ewald summation based on NFFT with mixed periodicity
From MaRDI portal
Publication:729086
DOI10.1016/j.jcp.2014.12.052zbMath1351.78066OpenAlexW2080664146MaRDI QIDQ729086
Franziska Nestler, Michael Pippig, Daniel Potts
Publication date: 20 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2014.12.052
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions ⋮ Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform ⋮ NFFT based Ewald summation for electrostatic systems with charges and dipoles ⋮ About improving efficiency of the \(P^3 M\) algorithms when computing the inter-particle forces in beam dynamics ⋮ A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions ⋮ Fast Ewald summation for Stokes flow with arbitrary periodicity ⋮ A regularization method for solving the Poisson equation for mixed unbounded-periodic domains ⋮ Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method ⋮ Ensemble average and nearest particle statistics in disperse multiphase flows ⋮ The spectral Ewald method for singly periodic domains ⋮ Universal image systems for non-periodic and periodic Stokes flows above a no-slip wall ⋮ The Ewald sums for singly, doubly and triply periodic electrostatic systems ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel ⋮ Stress from Long-Range Interactions in Particulate Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral accuracy in fast Ewald-based methods for particle simulations
- A recursive algorithm for the \(G\) transformation and accurate computation of incomplete Bessel functions
- A note on fast Fourier transforms for nonequispaced grids
- Explicit error estimates for quintic and biquintic spline interpolation. II
- Fast convolution with radial kernels at nonequispaced knots
- On the fast Fourier transform of functions with singularities
- A comparison of Ewald summation techniques for planar surfaces
- Incomplete Bessel, generalized incomplete gamma, or leaky aquifer functions
- PFFT: An Extension of FFTW to Massively Parallel Architectures
- Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Fast Fourier Transforms for Nonequispaced Data
- Fast Summation at Nonequispaced Knots by NFFT
- Ewald summation of electrostatic interactions of systems with finite extent in two of three dimensions
- Accelerating the Nonuniform Fast Fourier Transform
This page was built for publication: Fast ewald summation based on NFFT with mixed periodicity
