An improved guided random walk algorithm for quantum field theory computations |
| |
| Affiliation: | 1. Theory Group, HEP Division, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire, OX11 0QX, England;1. Dipartimento di Fisica, Università di Cagliari Cittadella Universitaria, 09042 Monserrato, Italy;2. INFN, Sezione di Cagliari, Italy;3. Department of Physics, Indian Institute of Technology Kanpur, Kanpur 208016, India;1. School of Information Engineering, Southwest University of Science and Technology, Mianyang 621010, China;2. Institute of Nuclear Physics and Chemistry, China Academy of Engineering Physics, Mianyang 621900, China;3. Research Center of Laser Fusion, China Academy of Engineering Physics, Mianyang 621900, China;1. Department of Higher Mathematics, Belarusian State University, Minsk 220030, Belarus;2. Mechanics and Mathematics Faculty, Belarusian State University, Minsk 220030, Belarus |
| |
| Abstract: | We introduce an improved guided random walk algorithm for evaluating vacuum matrix elements in hamiltonian field theories. This algorithm does not require the creation of absorption of walks, unlike related random walk techniques which have appeared in the literature. Applications to a scalar field theory in (1 + 1) dimensions and to an abelian gauge theory in (3 + 1) dimensions are described. The algorithm appears to be very fast; we have used it to generate independent abelian gauge field configurations on an 83 spatial lattice at a rate of about one per IBM 3081 CPU second. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
