A new version of the adaptive fast Gauss transform for discrete and continuous sources

by   Leslie Greengard, et al.
NYU college
Tsinghua University
Simons Foundation

We present a new version of the fast Gauss transform (FGT) for discrete and continuous sources. Classical Hermite expansions are avoided entirely, making use only of the plane-wave representation of the Gaussian kernel and a new hierarchical merging scheme. For continuous source distributions sampled on adaptive tensor-product grids, we exploit the separable structure of the Gaussian kernel to accelerate the computation. For discrete sources, the scheme relies on the nonuniform fast Fourier transform (NUFFT) to construct near field plane wave representations. The scheme has been implemented for either free-space or periodic boundary conditions. In many regimes, the speed is comparable to or better than that of the conventional FFT in work per gridpoint, despite being fully adaptive.


Periodic Fast Multipole Method

A new scheme is presented for imposing periodic boundary conditions on u...

A Dual-space Multilevel Kernel-splitting Framework for Discrete and Continuous Convolution

We introduce a new class of multilevel, adaptive, dual-space methods for...

On discrete boundary value problems with nonlocal conditions in a quarter-plane

We consider discrete analogue of model pseudo-differential equations in ...

A fast algorithm for the electromagnetic scattering from a large rectangular cavity in three dimensions

The paper is concerned with the three-dimensional electromagnetic scatte...

Periodic Artifact Reduction in Fourier transforms of Full Field Atomic Resolution Images

The discrete Fourier transform is among the most routine tools used in h...

The Gaussian Wave Packet Transform via Quadrature Rules

We study variants of the Gaussian wave packet transform and investigate ...

Please sign up or login with your details

Forgot password? Click here to reset