Related papers: A Parallel Monte Carlo Code for Simulating Collisi…
We present BEST (Boltzmann Equation Solver for Thermalization), a Python framework for solving the momentum-resolved Boltzmann equation for arbitrary $n_{\rm in} \to n_{\rm out}$ scattering processes. The collision integral is evaluated…
Nucleon-ion and ion-ion collisions at non relativistic bombarding energies can be described by means of Monte Carlo approaches, such as those based on the Quantum Molecular Dynamics (QMD) model. We have developed a QMD code, to simulate the…
We present novel Monte Carlo methods for treating the interacting shell model that allow exact calculations much larger than those heretofore possible. The two-body interaction is linearized by an auxiliary field; Monte Carlo evaluation of…
Monte Carlo approaches to radiation transport have several attractive properties such as simplicity of implementation, high accuracy, and good parallel scaling. Moreover, Monte Carlo methods can handle complicated geometries and are…
We recently developed a Monte-Carlo method (GNC) that can simulate the dynamical evolution of a nuclear stellar cluster (NSC) with a massive black hole (MBH), where the two-body relaxations can be solved by the Fokker-Planck equations in…
We develop a hybrid Monte Carlo method to efficiently compute the physical observables from the samplings of the Laughlin and the Moore-Read wave functions of fractional quantum Hall (FQH) systems. With the advancements in methodology,…
We develop an algorithm to solve tridiagonal systems of linear equations, which appear in implicit finite-difference schemes of partial differential equations (PDEs), being the time-dependent Schr\"{o}dinger equation (TDSE) an ideal…
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our…
Calculating the correlation in a sliding window is a common method of statistical evaluation of the interconnect between two sets of data. And although the calculation of a single correlation coefficient is not resource-intensive and…
The simulation of large ensembles of particles is usually parallelized by partitioning the domain spatially and using message passing to communicate between the processes handling neighboring subdomains. The particles are represented as…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
We describe a version of an algorithm for evolving self-gravitating collections of particles that should be nearly ideal for parallel architectures. Our method is derived from the ``self-consistent field'' (SCF) approach suggested…
A binary-pairing Monte Carlo collision method is presented here for screened Coulomb collisions in plasmas that is valid in the weakly and moderately coupled regimes. The method models the Fokker-Planck collision operator with first order…
Cosmological N-Body simulations are used for a variety of applications. Indeed progress in the study of large scale structures and galaxy formation would have been very limited without this tool. For nearly twenty years the limitations…
Accurate direct $N$-body simulations help to obtain detailed information about the dynamical evolution of star clusters. They also enable comparisons with analytical models and Fokker-Planck or Monte-Carlo methods. NBODY6 is a well-known…
In this study we present a novel Monte-Carlo code, referred to as GNC, which enables the investigation of dynamical relaxation in clusters comprising multiple mass components in the vicinity of supermassive black holes at the centers of…
In this paper, we describe the implementation and performance of GreeM, a massively parallel TreePM code for large-scale cosmological N-body simulations. GreeM uses a recursive multi-section algorithm for domain decomposition. The size of…
We present the first parallel batch-dynamic algorithm for approximating coreness decomposition with worst-case update times. Given any batch of edge insertions and deletions, our algorithm processes all these updates in $ \text{poly}(\log…
We introduce a new code for cosmological simulations, PHoToNs, which has features on performing massive cosmological simulations on heterogeneous high performance Computer (HPC) and threads oriented programming. PHoToNs adopts a hybrid…
We present the implementation of updated stellar evolution recipes in the codes \texttt{Nbody6++GPU, MOCCA} and \texttt{McLuster}. We test them through numerical simulations of star clusters containing $1.1\times 10^5$ stars (with…