The rapid development of parallel computing systems made it possible to recreate and
predict physical processes on computers. Nowadays, computer simulations complement …

We report on an eficient adaptive N-body method which u~ e have recently designed and
implemented. The algorithm computes the forces on an arbitrary distribution of bodies in a …

BSPlib is a small communications library for bulk synchronous parallel (BSP) programming
which consists of only 20 basic operations. This paper presents the full definition of BSPlib in …

Computational fluid dynamics combined with discrete element method (CFD–DEM) is widely
adopted to study particle–fluid multiphase systems. However, due to the global dynamical …

We consider treecodes (N-body programs which use a tree data structure) from the
standpoint of their worst-case behavior. That is, we derive upper bounds on the largest …

In this article, we propose new parallel algorithms for the construction and 2: 1 balance
refinement of large linear octrees on distributed memory machines. Such octrees are used in …

We describe our implementation of the parallel hashed oct-tree (HOT) code, and in
particular its application to neighbor finding in a smoothed particle hydrodynamics (SPH) …

We develop a weak-form sparse identification method for interacting particle systems (IPS)
with the primary goals of reducing computational complexity for large particle number N and …

1. INTRODUCTION Tree-based algorithms have had a ma-jor impact on the study of the
evolution of gravitating systems as they provide a method of computing the mu-tual …

We describe our implementation of a parallel fast multipole method for evaluating potentials
for discrete and continuous source distributions. The first requires summation over the …