Phys. Rev. Lett. 74, 1–5 (1995)Monte Carlo Algorithms with Absorbing Markov Chains: Fast Local Algorithms for Slow DynamicsSee Also: Erratum Received 3 June 1994; published in the issue dated 2 January 1995 A class of Monte Carlo algorithms which incorporate absorbing Markov chains is presented. In a particular limit, the lowest order of these algorithms reduces to the n-fold way algorithm. These algorithms are applied to study the escape from the metastable state in the two-dimensional square-lattice nearest-neighbor Ising ferromagnet in an unfavorable applied field, and the agreement with theoretical predictions is very good. It is demonstrated that the higher-order algorithms can be many orders of magnitude faster than either the traditional Monte Carlo or n-fold way algorithms. © 1994 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.74.1
DOI:
10.1103/PhysRevLett.74.1
PACS:
02.70.Lq, 05.50.+q, 64.60.My, 75.40.Mg
See AlsoErratum: M. A. Novotny, Monte Carlo Algorithms with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics, Phys. Rev. Lett. 75, 1424 (1995). |
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.