Advanced Dynamic Algorithms for the Decay of Metastable Phases in Discrete Spin Models: Bridging Disparate Time Scales
arXiv:cond-mat/9909158 · doi:10.1142/S0129183199001261
Abstract
An overview of advanced dynamical algorithms capable of spanning the widely disparate time scales that govern the decay of metastable phases in discrete spin models is presented. The algorithms discussed include constrained transfer-matrix, Monte Carlo with Absorbing Markov Chains (MCAMC), and projective dynamics (PD) methods. The strengths and weaknesses of each of these algorithms are discussed, with particular emphasis on identifying the parameter regimes (system size, temperature, and field) in which each algorithm works best.
12 pages, 4 figures, proceedings of the US-Japan bilateral seminar on `Understanding and Conquering Long Time Scales in Computer Simulations', July 1999, to appear in Int. J. Mod. Phys. C
References in corpus (5)
- Transition Matrix Monte Carlo Reweighting and Dynamics
- Test of the Kolmogorov-Johnson-Mehl-Avrami picture of metastable decay in a model with microscopic dynamics
- Parallelization of a Dynamic Monte Carlo Algorithm: a Partially Rejection-Free Conservative Approach
- A projection method for statics and dynamics of lattice spin systems
- Application of the Projected Dynamics Method to an Anisotropic Heisenberg Model