Testing the event-chain algorithm in asymptotically free models

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We apply the event-chain algorithm proposed by Bernard et al. in 2009 to toy models of lattice QCD. We give a formal proof of stability of the algorithm. We study its performance at the example of the massive Gaussian model on the square and the simple cubic lattice, the O(3)-invariant nonlinear σ-model on the square lattice, and the SU(3)×SU(3) principal chiral model on the square lattice. In all these cases we find that critical slowing down is essentially eliminated.

Cite

CITATION STYLE

APA

Hasenbusch, M., & Schaefer, S. (2018). Testing the event-chain algorithm in asymptotically free models. Physical Review D, 98(5). https://doi.org/10.1103/PhysRevD.98.054502

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free