Transfer-Matrix Monte Carlo Estimates of Critical Points in the Simple Cubic Ising, Planar and Heisenberg Models
M. P. Nightingale, H. W. J. Bloete
Abstract
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the statistical noise can be reduced considerably by a similarity transformation of the transfer matrix using a variational estimate of its leading eigenvector, in analogy with a common practice in various quantum Monte Carlo techniques. Here we take the two-dimensional coupled XY-Ising model as an example. Furthermore, we calculate interface free energies of finite three-dimensional O(n) models, for the three cases n=1, 2 and 3. Application of finite-size scaling to the numerical results yields estimates of the critical points of these three models. The statistical precision of the estimates is satisfactory for the modest amount of computer time spent.
Create a lesson
Related papers
Knots in Condensed Matters
Y. M. Cho
Bouchaud's model exhibits two different aging regimes in dimension one
Gerard Ben Arous, Jiri Cerny
Periodic diffraction patterns for 1D quasicrystals
Pawel Buczek, Lorenzo Sadun, Janusz Wolny
Adiabatic association of ultracold molecules via magnetic field tunable interactions
Krzysztof Goral, Thorsten Koehler, Simon A. Gardiner et al.
High-Temperature Atomic Superfluidity in Lattice Boson-Fermion Mixtures
F. Illuminati, A. Albus
Constructive Methods of Invariant Manifolds for Kinetic Problems
A. N. Gorban, I. V. Karlin, A. Yu. Zinovyev