Related papers: A new algorithm for electrostatic interactions in …
While lateral interaction models for reactions at surfaces have steadily gained popularity and grown in terms of complexity, their use in chemical kinetics has been impeded by the low performance of current KMC algorithms. The origins of…
In this article, we present an event-driven algorithm that generalizes the recent hard-sphere event-chain Monte Carlo method without introducing discretizations in time or in space. A factorization of the Metropolis filter and the concept…
We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…
Microscopic processes on surfaces such as adsorption, desorption, diffusion and reaction of interacting particles can be simulated using kinetic Monte Carlo (kMC) algorithms. Even though kMC methods are accurate, they are computationally…
A new Monte Carlo method for computing thermodynamical properties of very large polyelectrolytes is presented. It is based on a renormalization group relating the original polymer to a smaller system, where in addition to the naively…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
High-energy physics simulations traditionally rely on classical Monte Carlo methods to model complex particle interactions, often incurring significant computational costs. In this paper, we introduce a novel quantum-enhanced simulation…
We consider the development of Monte Carlo schemes for molecules with Coulomb interactions. We generalize the classic algorithms of Bird and Nanbu-Babovsky for rarefied gas dynamics to the Coulomb case thanks to the approximation introduced…
We propose and analyze a method for computing failure probabilities of systems modeled as numerical deterministic models (e.g., PDEs) with uncertain input data. A failure occurs when a functional of the solution to the model is below (or…
We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid…
Proposed here is a dynamic Monte-Carlo algorithm that is efficient in simulating dense systems of long flexible chain molecules. It expands on the configurational-bias Monte-Carlo method through the simultaneous generation of a large set of…
We propose a new sampling algorithm combining two quite powerful ideas in the Markov chain Monte Carlo literature -- adaptive Metropolis sampler and two-stage Metropolis-Hastings sampler. The proposed sampling method will be particularly…
The evaluation of electrostatic energy for a set of point charges in a periodic lattice is a computationally expensive part of molecular dynamics simulations (and other applications) because of the long-range nature of the Coulomb…
In this paper, we evaluate the performance of the multilevel Monte Carlo method (MLMC) for deterministic and uncertain hyperbolic systems, where randomness is introduced either in the modeling parameters or in the approximation algorithms.…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
A Monte Carlo method is presented to evaluate quantum states with many particles moving in the continuum. The scattering state is generated at each time by a Monte Carlo random sampling algorithm. The same calculation are repeated until the…
A simple and efficient algorithm of the molecular-dynamics simulation of the hard disk system based on the Event-Driven method is developed. From the analysis of algorithm, the complexity is O(log N) per 1 event, and the constant…
In complex systems with many degrees of freedom such as spin glass and biomolecular systems, conventional simulations in canonical ensemble suffer from the quasi-ergodicity problem. A simulation in generalized ensemble performs a random…
Molecular dynamics algorithms are subject to some amount of error dependent on the size of the time step that is used. This error can be corrected by periodically updating the system with a Metropolis criteria, where the integration step is…
We propose a modified coupled cluster Monte Carlo algorithm that stochastically samples connected terms within the truncated Baker--Campbell--Hausdorff expansion of the similarity transformed Hamiltonian by construction of coupled cluster…