Although Monte Carlo and molecular dynamics are the primary methods used for free energy simulations of molecular systems, their application to molecules that have multiple conformations separated by energy barriers of 2 3 kcal/mol is problematic because of slow rates of convergence. In this article
A stochastic coupling method for atomic-to-continuum Monte-Carlo simulations
β Scribed by Ludovic Chamoin; J.T. Oden; Serge Prudhomme
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 832 KB
- Volume
- 197
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we propose a multiscale coupling approach to perform Monte-Carlo simulations on systems described at the atomic scale and subjected to random phenomena. The method is based on the Arlequin framework, developed to date for deterministic models involving coupling a region of interest described at a particle scale with a coarser model (continuum model). The new method can result in a dramatic reduction in the number of degrees of freedom necessary to perform Monte-Carlo simulations on the fully atomistic structure. The focus here is on the construction of an equivalent stochastic continuum model and its coupling with a discrete particle model through a stochastic version of the Arlequin Method. Concepts from the Stochastic Finite Element Method, such as the KarhΓΌnen-Loeve expansion and Polynomial Chaos, are extended to multiscale problems so that Monte-Carlo simulations are only performed locally in subregions of the domain occupied by particles. Preliminary results are given for a 1D structure with harmonic interatomic potentials.
π SIMILAR VOLUMES
A Monte Carlo method is presented for simulating rough surfaces with the fractal behavior. The simulation is based on power-law size distribution of asperity diameter and self-affine property of roughness on surfaces. A probability model based on random number for asperity sizes is developed to gene
An algorithm is presented, which gathers neighbors for n-dimensional lattices with periodic boundary conditions. The method used does not need the usual GATHER instructions. With the exception of a few bit-vectors no additional storage is needed. The algorithm can be easily extended to more than nea