Search NASA⌕ Search

Engineering topics

Greengard, Leslie

Publications and source records attributed to Greengard, Leslie.

An Adaptive Fast Gauss Transform in Two Dimensions

A variety of problems in computational physics and engineering require the convolution of the heat kernel (a Gaussian) with either discrete sources, densities supported on boundaries, or continuous volume distributions. We present a unified fast Gauss transform for this purpose in two dimensions, making use of an adaptive quad-tree discretization on a unit square which is assumed to contain all sources. Our implementation permits either free-space or periodic boundary conditions to be imposed, and is efficient for any choice of variance in the Gaussian.

97 MATHEMATICS AND COMPUTING↗

Pseudo-Spectral Methods for the Laplace-Beltrami Equation and the Hodge Decomposition on Surfaces of Genus One

The inversion of the Laplace-Beltrami operator and the computation of the Hodge decomposition of a tangential vector field on smooth surfaces arise as computational tasks in many areas of science, from computer graphics to machine learning to computational physics. In this work, we present a high-order accurate pseudo-spectral approach, applicable to closed surfaces of genus one in three-dimensional space, with a view toward applications in plasma physics and fluid dynamics.

97 MATHEMATICS AND COMPUTING↗

An integral equation formulation for rigid bodies in Stokes flow in three dimensions

Here we present a new derivation of a boundary integral equation (BIE) for simulating the three-dimensional dynamics of arbitrarily-shaped rigid particles of genus zero immersed in a Stokes fluid, on which are prescribed forces and torques. Our method is based on a single-layer representation and leads to a simple second-kind integral equation. It avoids the use of auxiliary sources within each particle that play a role in some classical formulations. We use a spectrally accurate quadrature scheme to evaluate the corresponding layer potentials, so that only a small number of spatial discretization points per particle are required. The resulting discrete sums are computed in $\mathscr{O}(n)$ time, where n denotes the number of particles, using the fast multipole method (FMM). The particle positions and orientations are updated by a high-order time-stepping scheme. We illustrate the accuracy, conditioning and scaling of our solvers with several numerical examples.

97 MATHEMATICS AND COMPUTING↗