Related papers: The Tree-Particle-Mesh N-body Gravity Solver
We describe an efficient Particle-Mesh algorithm for the Connection Machine CM-5. Our particular method parallelizes well and the computation time per time step decreases as the particles become more clustered. We achieve floating-point…
This work presents a data-driven reduced-order modeling framework to accelerate the computations of $N$-body dynamical systems and their pair-wise interactions. The proposed framework differs from traditional acceleration methods, like the…
This paper presents an accurate density computation approach for large dark matter simulations, based on a recently introduced phase-space tessellation technique and designed for massively parallel, heterogeneous cluster architectures. We…
Due to the variety and importance of applications of treecodes and FMM, the combination of algorithmic acceleration with hardware acceleration can have tremendous impact. Alas, programming these algorithms efficiently is no piece of cake.…
In this paper, we investigate adaptive nonlinear regression and introduce tree based piecewise linear regression algorithms that are highly efficient and provide significantly improved performance with guaranteed upper bounds in an…
Finding the exact close neighbors of each fluid element in mesh-free computational hydrodynamical methods, such as the Smoothed Particle Hydrodynamics (SPH), often becomes a main bottleneck for scaling their performance beyond a few million…
Aims: we propose a gravitational potential method (GPM) as a supercluster finder based on the analysis of the local gravitational potential distribution measured by fast and simple algorithm applied to a spatial distribution of mass…
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of multipole moments is carried out on the host CPU, while the force…
(Abridged) We describe a new iterative approach for the realization of equilibrium N-body systems for given density distributions. Our method uses elements of Schwarzschild's technique and of the made-to-measure method, but is based on a…
Cosmological large scale structure $N$-body simulations are computation-light, memory-heavy problems in supercomputing. The considerable amount of memory is usually dominated by an inefficient way of storing more than sufficient phase space…
Electromagnetic scattering and absorption by material particles is a fundamental physical problem with a broad range of applications, going from laboratory experiments, biology and material sciences, all the way up to environmental studies…
We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…
We present $\texttt{Abacus}$, a fast and accurate cosmological $N$-body code based on a new method for calculating the gravitational potential from a static multipole mesh. The method analytically separates the near- and far-field forces,…
In the present paper, a fluid-particle coupling method is directly derived from the Navier-Stokes equations (NSE) by applying the concept of volume-filtering, yielding a physically consistent methodology to incorporate solid wall boundary…
We study the accumulation of errors in cosmological N-body algorithms that are caused by representing the continuous distribution of matter by massive particles, comparing the PPPM and Adaptive Multigrid codes. We use for this a new measure…
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical…
In this letter we describe the pseudoparticle multipole method (P2M2), a new method to express multipole expansion by a distribution of pseudoparticles. We can use this distribution of particles to calculate high order terms in both the…
This article describes a new, fully adaptive Particle-Multiple-Mesh numerical simulation code developed primarily for simulations of small regions (such as a group of galaxies) in a cosmological context. It integrates the equations of…
The time-symmetric block time--step (TSBTS) algorithm is a newly developed efficient scheme for $N$--body integrations. It is constructed on an era-based iteration. In this work, we re-designed the TSBTS integration scheme with dynamically…
We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code…