Bernard Krauth Wilson 2009

From Werner KRAUTH

Revision as of 15:43, 29 January 2011 Werner (Talk | contribs) ← Previous diff		Revision as of 23:40, 29 January 2011 Werner (Talk | contribs) Next diff →
Line 17:		Line 17:
	[[Image:Event chain move2.jpg|left|150px|border|Move of the Event-chain algorithm]]		[[Image:Event chain move2.jpg|left|150px|border|Move of the Event-chain algorithm]]
	<br clear="all" />		<br clear="all" />
		+
		+	[[Category:Publication]] [[Category:2010]] [[Category:Algorithm]] [[Category:Hard spheres]]

---

Revision as of 23:40, 29 January 2011

E. P. Bernard, W. Krauth, D. B. Wilson Event-chain algorithms for hard-sphere systems Physical Review E 80 056704 (2009)

Abstract: In this paper we present the event-chain algorithms, which are fast Markov-chain Monte Carlo methods for hard spheres and related systems. In a single move of these rejection-free methods, an arbitrarily long chain of particles is displaced, and long-range coherent motion can be induced. Numerical simulations show that event-chain algorithms clearly outperform the conventional Metropolis method. Irreversible versions of the algorithms, which violate detailed balance, improve the speed of the method even further. We also compare our method with a recent implementations of the molecular dynamics algorithm.

Electronic version (from arXiv)