Related papers: A Parallel Monte Carlo Code for Simulating Collisi…
Markov chain Monte Carlo is an inherently serial algorithm. Although likelihood calculations for individual steps can sometimes be parallelized, the serial evolution of the process is widely viewed as incompatible with parallelization,…
We explore the behaviour of accreting protoclusters with a Monte Carlo dynamical code in order to evaluate the relative roles of accretion, two body relaxation and stellar collisions in the cluster evolution. We corroborate the suggestion…
We present a general scheme for constructing Monte Carlo realizations of equilibrium, collisionless galaxy models with known distribution function (DF) f_0. Our method uses importance sampling to find the sampling DF f_s that minimizes the…
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,…
Advanced algorithms are necessary to obtain faster-than-real-time dynamic simulations in a number of different physical problems that are characterized by widely disparate time scales. Recent advanced dynamic Monte Carlo algorithms that…
We describe a novel N-body code designed for simulations of the central regions of galaxies containing massive black holes. The code incorporates Mikkola's 'algorithmic' chain regularization scheme including post-Newtonian terms up to PN2.5…
This paper presents a fast, economical particle-multiple-mesh N-body code optimized for large-N modelling of collisionless dynamical processes, such as black-hole wandering or bar-halo interactions, occurring within isolated galaxies. The…
In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the problem of minimizing the sum of a partially separable smooth convex function and a simple separable convex…
The numerical simulations of massive collisional stellar systems, such as globular clusters (GCs), are very time-consuming. Until now, only a few realistic million-body simulations of GCs with a small fraction of binaries (5%) have been…
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin-film growth. However, in some cases it is necessary to study systems over extended time and…
We study the dynamical evolution of globular clusters using our 2D Monte Carlo code with the inclusion of primordial binary interactions for equal-mass stars. We use approximate analytical cross sections for energy generation from…
The analysis of cosmological galaxy surveys requires realistic simulations for their interpretation. Forward modelling is a powerful method to simulate galaxy clustering without the need for an underlying complex model. This approach…
Direct-summation N-body algorithms compute the gravitational interaction between stars in an exact way and have a computational complexity of O(N^2). Performance can be greatly enhanced via the use of special-purpose accelerator boards like…
We present a low-scaling diagrammatic Monte Carlo approach to molecular correlation energies. Using combinatorial graph theory to encode many-body Hugenholtz diagrams, we sample the M{\o}ller-Plesset (MPn) perturbation series, obtaining…
We describe a new hybrid N-body/hydrodynamical code based on the particle-mesh (PM) method and the piecewise-parabolic method (PPM) for use in solving problems related to the evolution of large-scale structure, galaxy clusters, and…
We propose a new numerical procedure to simulate a single dark halo of any size and mass in a hierarchical framework coupling the extended Press-Schechter formalism (EPSF) to N-body simulations. The procedure consists of assigning…
We have performed fully self-consistent $N$-body simulations of star clusters near the Galactic center (GC). Such simulations have not been performed because it is difficult to perform fast and accurate simulations of such systems using…
Nucleus decompositions have been shown to be a useful tool for finding dense subgraphs. The coreness value of a clique represents its density based on the number of other cliques it is adjacent to. One useful output of nucleus decomposition…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
The overwhelming evidence that the core collapse supernova mechanism is inherently multidimensional, the complexity of the physical processes involved, and the increasing evidence from simulations that the explosion is marginal presents…