RUS  ENG
Full version
JOURNALS // Dal'nevostochnyi Matematicheskii Zhurnal // Archive

Dal'nevost. Mat. Zh., 2019 Volume 19, Number 2, Pages 235–244 (Mi dvmg411)

An accelerated exhaustive enumeration algorithm in the Ising model

M. A. Padalkoab, P. D. Andriushchenkoa, K. S. Soldatova, K. V. Nefedevab

a Far Eastern Federal University, Vladivostok
b Institute for Applied Mathematics, Far Eastern Branch, Russian Academy of Sciences, Vladivostok

Abstract: An accelerated algorithm for the precise calculation of the lattice Ising model is presented. The algorithm makes it possible to calculate two-dimensional 8$\times$8 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.

Key words: Izing model, complete enumeration, Monte-Carlo method.

UDC: 517.5

MSC: Primary 30A10; Secondary 30C10, 30C15

Received: 17.07.2019



© Steklov Math. Inst. of RAS, 2025