An enumeration decomposition algorithm for solving the Ising model

DOI10.47910/FEMJ202509MaRDI QIDQ6944873zbMATH OpenFDO

Authors V. O. Trukhin, È. A. Lobanova, A. I. Anisich, X. V. Makarova, A. G. Makarov, K. V. Nefedev

Publication date 11 August 2025

Published in Dal'nevostochnyĭ Matematicheskiĭ Zhurnal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.47910/FEMJ202509

zbMATH Keywords

decomposition algorithmIsing modelparallel computing

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Graph theory (including graph drawing) in computer science (68R10) Statistical thermodynamics (82B30)

Cites work

• Canonical Monte Carlo multispin cluster method
• Computational many-particle physics. Papers presented at the summer school, Greifswald, Germany, September 2006.
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• High performance implementations of the 2D Ising model on GPUs
• Neural Network for Prediction of Curie Temperature of Two-Dimensional Ising Model
• The Euclidean traveling salesman problem is NP-complete
• The mathematics of Egypt, Mesopotamia, China, India, and Islam. A sourcebook

This page was built for publication: An enumeration decomposition algorithm for solving the Ising model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944873)