✦ LIBER ✦

A compact algorithm for the implementation of Monte Carlo kinematics in computer simulations of d-dimensional lattice gauge theories

✍ Scribed by Glauco Di Genova; Marco Matone

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 655 KB
Volume: 47
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(87)90110-x

No coin nor oath required. For personal study only.

✦ Synopsis

We describe a compact, optimized algorithm for analyzing the mutual geometric relations between links and elementary squares in a d-dimensional lattice. The algorithm is used to compute plaquettes in Monte Carlo simulations of gauge field dynamics. In such kind of applications our algorithm, due to its recursive nature, allows one to compute all the plaquettes in a model by means of a technique which is the same for any number of dimensions d. Finally, we indicate how the actual Fortran implementation would be made.

📜 SIMILAR VOLUMES

A fast algorithm for Monte Carlo simulat

A fast algorithm for Monte Carlo simulations of 4-d lattice gauge theories with finite groups

✍ Gyan Bhanot; Christian B. Lang; Claudio Rebbi 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 968 KB

Nature of the physical problem the next one. With NUPG=6, the running time is ~5O References ~ss/variable per MC iteration on a CDC 7600.

A highly optimized vectorized code for M

A highly optimized vectorized code for Monte Carlo simulations of Su(3) lattice gauge theories

✍ D. Barkai; K.J.M. Moriarty; C. Rebbi 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 824 KB