Related papers: A fast multipole method for stellar dynamics
We describe a technique to analytically compute the multipole moments of a charge distribution confined to a planar triangle, which may be useful in solving the Laplace equation using the fast multipole boundary element method (FMBEM) and…
Perhaps the most powerful method for deriving the Newtonian gravitational interaction between two masses is the multipole expansion. Once inner multipoles are calculated for a particular shape this shape can be rotated, translated, and even…
In dislocation dynamics (DD) simulations, the most computationally intensive step is the evaluation of the elastic interaction forces among dislocation ensembles. Because the pair-wise interaction between dislocations is long-range, this…
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…
The direct and indirect boundary element methods, accelerated via the fast multipole method, are applied to numerical simulation of room acoustics for large rooms of volume $\sim 150$ $m^{3}$ and frequencies up to 5 kHz on a workstation. As…
Gaussian process (GP) emulator has been used as a surrogate model for predicting force field and molecular potential, to overcome the computational bottleneck of molecular dynamics simulation. Integrating both atomic force and energy in…
Special high-accuracy direct force summation N-body algorithms and their relevance for the simulation of the dynamical evolution of star clusters and other gravitating N-body systems in astrophysics are presented, explained and compared…
To evaluate electrostatics interactions, Molecular dynamics (MD) simulations rely on Particle Mesh Ewald (PME), an O(Nlog(N)) algorithm that uses Fast Fourier Transforms (FFTs) or, alternatively, on O(N) Fast Multipole Methods (FMM)…
In this work we propose an efficient and accurate multi-scale optical simulation algorithm by applying a numerical version of slowly varying envelope approximation in FEM. Specifically, we employ the fast iterative method to quickly compute…
Quasi-N-body simulations, such as FastPM, provide a fast way to simulate cosmological structure formation, but have yet to adequately include the effects of massive neutrinos. We present a method to include neutrino particles in FastPM,…
A number of problems arise when long-range forces, such as those governed by Bessel functions, are used in particle-particle simulations. If a simple cut-off for the interaction is used, the system may find an equilibrium configuration at…
We discuss the performance of direct summation codes used in the simulation of astrophysical stellar systems on highly distributed architectures. These codes compute the gravitational interaction among stars in an exact way and have an…
In this paper, we present a fast multipole method (FMM) for solving the two-dimensional Laplace equation in a half-plane with Robin boundary conditions. The method is based on a novel expansion theory for the reaction component of the…
We describe source code level parallelization for the {\tt kira} direct gravitational $N$-body integrator, the workhorse of the {\tt starlab} production environment for simulating dense stellar systems. The parallelization strategy, called…
In the multi-cell multiuser multi-input multi-output (MU-MIMO) systems, fractional programming (FP) has demonstrated considerable effectiveness in optimizing beamforming vectors, yet it suffers from high computational complexity. Recent…
The present study addresses the challenge of enhancing computational efficiency without compromising accuracy in numerical simulations of vacuum gas dynamics using the direct simulation Monte Carlo (DSMC) method. A technique termed "fixed…
We present a novel approach for accelerating convolutions during inference for CPU-based architectures. The most common method of computation involves packing the image into the columns of a matrix (im2col) and performing general matrix…
Fast multipole methods (FMM) on distributed mem- ory have traditionally used a bulk-synchronous model of com- municating the local essential tree (LET) and overlapping it with computation of the local data. This could be perceived as an…
The Fast Multipole Method (FMM) is well known to possess a bottleneck arising from decreasing workload on higher levels of the FMM tree [Greengard and Gropp, Comp. Math. Appl., 20(7), 1990]. We show that this potential bottleneck can be…
A direct integration algorithm is described to compute the magnetostatic field and energy for given magnetization distributions on not necessarily uniform tensor grids. We use an analytically-based tensor approximation approach for…