Related papers: Comparing the Performance of MC/DC's on-GPU Event-…
We propose a technique to effectively sample initial neutron and delayed neutron precursor particles for Monte Carlo (MC) simulations of typical off-critical reactor transients. The technique can be seen as an improvement, or alternative,…
In the 20+ years of Doppler observations of stars, scientists have uncovered a diverse population of extrasolar multi-planet systems. A common technique for characterizing the orbital elements of these planets is Markov chain Monte Carlo…
The matrix element (ME) calculation in any Monte Carlo physics event generator is an ideal fit for implementing data parallelism with lockstep processing on GPUs and vector CPUs. For complex physics processes where the ME calculation is the…
We present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise…
The kinetic Monte Carlo (kMC) method is used in many scientific fields in applications involving rare-event transitions. Due to its discrete stochastic nature, efforts to parallelize kMC approaches often produce unbalanced time evolutions…
This paper continues our treatment of the Neutron Transport Equation (NTE) building on the work in [arXiv:1809.00827v2], [arXiv:1810.01779v4] and [arXiv:1901.00220v3], which describes the flux of neutrons through inhomogeneous fissile…
For computational fluid dynamics (CFD) applications with a large number of grid points/cells, parallel computing is a common efficient strategy to reduce the computational time. How to achieve the best performance in the modern…
Diffusion Monte Carlo (DMC) based on fixed-node approximation has enjoyed significant developments in the past decades and become one of the go-to methods when accurate ground state energy of molecules and materials is needed. The remaining…
The computational cost of traditional first-principles method quickly becomes prohibitively expensive as the number of atoms increases. This challenge is further amplified by the need to evaluate finite-temperature properties with Monte…
We present in this paper a hybrid, Multi-Level Monte Carlo (MLMC) method for solving the neutral particle transport equation. MLMC methods, originally developed to solve parametric integration problems, work by using a cheap, low fidelity…
This paper presents two novel ensemble domain decomposition methods for fast-solving the Stokes-Darcy coupled models with random hydraulic conductivity and body force. To address such random systems, we employ the Monte Carlo (MC) method to…
Heterogeneous MPSoCs comprise diverse processing units of varying compute capabilities. To date, the mapping strategies of neural networks (NNs) onto such systems are yet to exploit the full potential of processing parallelism, made…
We present our experience of porting the code used in the wave-packet convergent-close-coupling (WP-CCC) approach to run on NVIDIA V100 and AMD MI250X GPUs. The WP-CCC approach is a method used in the field of ion-atom collision physics to…
Markov chain Monte Carlo (MCMC) methods are often used in clustering since they guarantee asymptotically exact expectations in the infinite-time limit. In finite time, though, slow mixing often leads to poor performance. Modern computing…
We describe a hybrid Direct Simulation Monte Carlo (DSMC) code for simultaneously solving the collisional Boltzmann equation for gas and the collisionless Boltzmann equation for stars and dark matter for problems important to galaxy…
We introduce the energy-stepping Monte Carlo (ESMC) method, a Markov chain Monte Carlo (MCMC) algorithm based on the conventional dynamical interpretation of the proposal stage but employing an energy-stepping integrator. The…
We discuss Hamiltonian Monte Carlo (HMC) and event-chain Monte Carlo (ECMC) for the one-dimensional chain of particles with harmonic interactions and benchmark them against local reversible Metropolis algorithms. While HMC achieves…
Markov Chain Monte Carlo (MCMC) algorithms are essential tools in computational statistics for sampling from unnormalised probability distributions, but can be fragile when targeting high-dimensional, multimodal, or complex target…
Monte Carlo Tree Search (MCTS) methods have achieved great success in many Artificial Intelligence (AI) benchmarks. The in-tree operations become a critical performance bottleneck in realizing parallel MCTS on CPUs. In this work, we develop…
The variational quantum Monte Carlo (VQMC) method received significant attention in the recent past because of its ability to overcome the curse of dimensionality inherent in many-body quantum systems. Close parallels exist between VQMC and…