2,062 research outputs found

    A Continuum,O(N) Monte-Carlo algorithm for charged particles

    Full text link
    We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric field on an interpolating lattice. We discuss the theoretical justifications of the algorithm and show that it efficiently equilibrates model polyelectrolytes and polar fluids. In order to reduce lattice artifacts that arise from the interpolation of charges to the grid we implement a local, dynamic subtraction algorithm. This dynamic scheme is completely general and can also be used with other Coulomb codes, such as multigrid based methods

    Error analysis of coarse-grained kinetic Monte Carlo method

    Get PDF
    In this paper we investigate the approximation properties of the coarse-graining procedure applied to kinetic Monte Carlo simulations of lattice stochastic dynamics. We provide both analytical and numerical evidence that the hierarchy of the coarse models is built in a systematic way that allows for error control in both transient and long-time simulations. We demonstrate that the numerical accuracy of the CGMC algorithm as an approximation of stochastic lattice spin flip dynamics is of order two in terms of the coarse-graining ratio and that the natural small parameter is the coarse-graining ratio over the range of particle/particle interactions. The error estimate is shown to hold in the weak convergence sense. We employ the derived analytical results to guide CGMC algorithms and we demonstrate a CPU speed-up in demanding computational regimes that involve nucleation, phase transitions and metastability.Comment: 30 page
    • …
    corecore