Related papers: A parallel implementation of a new fast algorithm …
We present an algorithm which is designed to allow the efficient identification and preliminary dynamical analysis of thousands of structures and substructures in large N-body simulations. First we utilise a refined density gradient system…
This article introduces a highly parallel algorithm for molecular dynamics simulations with short-range forces on single node multi- and many-core systems. The algorithm is designed to achieve high parallel speedups for strongly…
N-body codes to perform simulations of the origin and evolution of the Large Scale Structure of the Universe have improved significantly over the past decade both in terms of the resolution achieved and of reduction of the CPU time.…
We present a Fortran 95 code for simulating the evolution of astrophysical systems using particles to represent the underlying fluid flow. The code is designed to be versatile, flexible and extensible, with modular options that can be…
A novel approach to parallelize the well-known Hoshen-Kopelman algorithm has been chosen, suitable for simulating huge lattices in high dimensions on massively-parallel computers with distributed memory and message passing. This method…
We present FlowPM, a Particle-Mesh (PM) cosmological N-body code implemented in Mesh-TensorFlow for GPU-accelerated, distributed, and differentiable simulations. We implement and validate the accuracy of a novel multi-grid scheme based on…
Pure N-body high-resolution re-simulations of 13 massive dark matter halos in a Lambda-CDM cosmology are presented. The resulting sample is used to investigate the physical origin of the Fundamental Plane, ``Faber-Jackson'', and…
Analysis of large galaxy surveys requires confidence in the robustness of numerical simulation methods. The simulations are used to construct mock galaxy catalogs to validate data analysis pipelines and identify potential systematics. We…
The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…
Direct $N$-body simulations of star clusters are accurate but expensive, largely due to the numerous $\mathcal{O} (N^2)$ pairwise force calculations. To solve the post-million-body problem, it will be necessary to use approximate force…
Modeling interacting galaxies to reproduce observed systems is still a challenge due to the extended parameter space (among other problems). Orbit and basic galaxy parameters can be tackled by fast simulation techniques like the restricted…
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 novel fast method to solve Poisson equation in an arbitrary two dimensional region with Neumann boundary condition. The basic idea is to solve the original Poisson problem by a two-step procedure: the first one…
We present an efficient variational integrator for multibody systems. Variational integrators reformulate the equations of motion for multibody systems as discrete Euler-Lagrange (DEL) equations, transforming forward integration into a…
The Poisson equation has applications across many areas of physics and engineering, such as the dynamic process simulation of ocean current. Here we present a quantum Fast Poisson Solver, including the algorithm and the complete and modular…
We have developed an effective simulation method and applied it to the problem of the accretion of very dense secondary companions by tenuous primaries. We have studied the accretion of objects of varying luminosity ratios, with sizes and…
We present a hybrid OpenMP/Charm++ framework for solving the $\mathcal{O} (N)$ Self-Consistent-Field eigenvalue problem with parallelism in the strong scaling regime, $P\gg{N}$, where $P$ is the number of cores, and $N$ a measure of system…
We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a "top-down" fashion by "recursive coordinate bisection" where on each tree level we split the…
Diagrammatic expansions are a paradigmatic and powerful tool of quantum many-body theory. Their evaluation to high order, e.g., by the Diagrammatic Monte Carlo technique, can provide unbiased results in strongly correlated and challenging…
Fortran's prominence in scientific computing requires strategies to ensure both that legacy codes are efficient on high-performance computing systems, and that the language remains attractive for the development of new high-performance…