2019
Padalko, M.; Andriushchenko, P.; Soldatov, K.; Nefedev, K.
Accelearated Algorithm of the Exhaustive Enumeration Algorithm in the Ising Model Journal Article Forthcoming
In: Dal'nevostochnyi Matematicheskii Zhurnal, vol. 19, no. 2, pp. 235-244, Forthcoming, ISBN: 1608-845X.
Abstract | Links | BibTeX | Tags: andriushchenko, monter carlo, nefedev ising, padalko, soldatov
@article{Padalko2019b,
title = {Accelearated Algorithm of the Exhaustive Enumeration Algorithm in the Ising Model},
author = {M. Padalko and P. Andriushchenko and K. Soldatov and K. Nefedev},
editor = {Bykovsky Victor Alekseevich},
url = {http://www.iam.khv.ru/article.php?art=403&iss=34},
isbn = {1608-845X},
year = {2019},
date = {2019-12-09},
journal = {Dal'nevostochnyi Matematicheskii Zhurnal},
volume = {19},
number = {2},
pages = {235-244},
abstract = {An accelearated algorithm for the precise calculation of the lattice Ising model is presented. The algorithm makes it possible to calculate two-dimensional 10x10 lattices for periodic boundary conditions on ordinary personal computers. In turn, the exact solution obtained by the proposed method makes it possible to check the effectiveness of various probabilistic approaches, in particular the Monte Carlo methods. The algorithm is applicable to various types of lattices.},
keywords = {andriushchenko, monter carlo, nefedev ising, padalko, soldatov},
pubstate = {forthcoming},
tppubtype = {article}
}
An accelearated algorithm for the precise calculation of the lattice Ising model is presented. The algorithm makes it possible to calculate two-dimensional 10x10 lattices for periodic boundary conditions on ordinary personal computers. In turn, the exact solution obtained by the proposed method makes it possible to check the effectiveness of various probabilistic approaches, in particular the Monte Carlo methods. The algorithm is applicable to various types of lattices.