MONTE CARLO METHODS IN SEQUENTIAL AND PARALLEL COMPUTING OF 2D AND 3D ISING MODEL

M. Diaconu, R. Puscasu, Alexandru Stancu, I. Cuza

Published Jan 1, 2003• 0 citations

Abstract

Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic quantities, such as specific heat and magnetic susceptibility. We studied the differences between these methods. Local MC algorithms (such as Metropolis) perform poorly for large lattices because they update only one spin at a time, so it takes many iterations to get a statistically independent configuration. More recent spin cluster algorithms use clever ways of finding clusters of sites that can be updated at once. The single cluster method is probably the best sequential cluster algorithm. We also used the entropic sampling method to simulate the density of states. This method takes into account all possible configurations, not only the most probable. The entropic method also gives good results in the 3D case. We studied the usefulness of distributed computing for Ising model. We established a parallelization strategy to explore Metropolis Monte Carlo simulation and Swendsen-Wang Monte Carlo simulation of this spin model using the data parallel languages on different platform. After building a computer cluster we made a Monte Carlo estimation of 2D and 3D Ising thermodynamic properties and compare the results with the sequential computing. In the same time we made quantitative analysis such as speed up and efficiency for different sets of combined parameters (e.g. lattice size, parallel algorithms, chosen model).

Related papers

Computational Analysis of 3D Ising Model Using Metropolis Algorithms

Artur Falqueto Sonsin, M R Cortes, D.R.M. Nunes +2 more

We simulate the Ising Model with the Monte Carlo method and use the algorithms of Metropolis to update the distribution of spins. We found that, in the specific case of the three-dimensional Ising Model, methods of Metropolis are efficient. Studying the system near the point of phase transition, we observe that the magnetization goes to zero. In our simulations we analyzed the behavior of the magnetization and magnetic susceptibility to verify the phase transition in a paramagnetic to ferromagnetic material. The behavior of the magnetization and of the magnetic susceptibility as a function of the temperature suggest a phase transition around KT/J ≈ 4.5 and was evidenced the problem of finite size of the lattice to work with large lattice.

Journal of Physics Conference SeriesJul 15, 20159 citations

Monte Carlo-Based Modeling of 2-D Ising Systems Using Metropolis Algorithm, Simulation Techniques, Thermodynamic Behavior and Magnetization Patterns

Adama Gaye, Omolola Dorcas Atanda

This study presents a comprehensive Monte Carlo simulation of the two-dimensional (2-D) Ising model using the Metropolis algorithm to investigate critical phenomena and thermodynamic behavior in spin-lattice systems. The model, implemented in MATLAB with periodic boundary conditions, explores equilibrium properties such as magnetization, internal energy, specific heat, and susceptibility across a range of temperatures. By employing various initial spin configurations—ordered and random—the simulations demonstrate the system's ergodicity and convergence to thermal equilibrium. Key results include a sharp decline in magnetization and a pronounced peak in specific heat near the critical temperature, consistent with second-order phase transition behavior. The simulation captures microscopic domain evolution, highlighting the transition from ferromagnetic to paramagnetic phases as thermal fluctuations increase. The study further evaluates algorithmic efficiency, discusses the impact of lattice size on statistical accuracy, and proposes improvements using advanced cluster algorithms and parallel computing frameworks. The findings validate theoretical predictions from Onsager's solution and underscore the versatility of Monte Carlo techniques in modeling collective behavior in magnetic systems. The simulation framework offers a robust foundation for analyzing critical dynamics and extends its relevance to broader applications in material science, computational physics, and complex systems modeling.

May 20, 20251 citation

Monte Carlo Investigation of Magnetic Phase Transitions in the Two-Dimensional Ising Model

Satyendra Lohar, Neha Srivas, Akhilesh Dwivedi

Many problems in statistical physics resist exact solution once the number of interacting particles becomes large, and the two-dimensional Ising model is a classic case where numerical simulation fills that gap. This paper reports a Monte Carlo study of the two-dimensional Ising model using the Metropolis algorithm, undertaken to examine how magnetization, internal energy, specific heat, and magnetic susceptibility change with temperature. Spin configurations were generated on a square lattice under periodic boundary conditions, with each proposed spin flip accepted or rejected according to the Boltzmann weight of the resulting energy change. The simulation reproduces the expected transition from an ordered ferromagnetic state at low temperature to a disordered paramagnetic state at high temperature, with magnetization falling sharply and both specific heat and susceptibility peaking near a critical temperature of Tc ≈ 2.3–2.4 (in units of J/kB), consistent with the exact value obtained analytically for this system. These results confirm that the Metropolis algorithm, despite its simplicity, remains a dependable tool for locating second-order phase transitions and extracting thermodynamic quantities in lattice spin systems, and the same computational framework can be adapted to more elaborate models used in condensed matter and materials research.

Aug 14, 20260 citations

Cluster Algorithms for Spin Models on MIMD Parallel Computers

Paul David Coddington, CLIVE F. BAILLIE

Parallel computers are ideally suited to the Monte Carlo simulation of spin models using the standard Metropolis algorithm, since it is regular and local. However local algorithms have the major drawback that near a phase transition the number of sweeps needed to generate a statistically independent configuration increases as the square of the lattice size. New algorithms have recently been developed which dramatically reduce this `critical slowing down' by updating clusters of spins at a time. The highly irregular and non-local nature of these algorithms means that they are much more difficult to parallelize efficiently. Here we introduce the new cluster algorithms, explain some sequential algorithms for identifying and labelling connected clusters of spins, and then outline some parallel algorithms which have been implemented on MIMD machines. 1. Introduction Computer simulations are extremely useful in the study of spin models in condensed matter physics. In these models the spins ...

Distributed Memory Computing ConferenceAug 24, 20057 citations

Monte Carlo simulation of classical Heisenberg model in three dimensions

Ville Jantunen

We study the efficiency and theory behind various Markov chain Monte Carlo update methods (later MCMC) in the classical Heisenberg model in three dimensions. Classical Heisenberg model is a model in statistical physics that describes ferromagnetic phenomena. Classical Heisenberg model is a generalization of the Ising model where the spin is three dimensional unit vector instead of scalar -1 or 1. Both models show a second order phase transition which is the main reason we are interested in these models. The transition in our case describes the loss of magnetization of a ferromagnet as it is heated to its Curie temperature. Monte Carlo simulating the Classical Heisenberg model uses the same MCMC update methods as the Ising model. We introduce the theoretical background of Metropolis, Overrelaxation, and Wolff single cluster updates and study the dynamic critical exponents of Metropolis and Wolff updates. Results of this study are as expected: metropolis suffers from critical slowing down near the phase transition temperature and the autocorrelation time scales to L^5.08 , where L^3 is the size of the lattice. Wolff single cluster update avoids critical slowing down and scales very well with autocorrelation time scaling to L^3.28 . Even though Wolff update scales much better it has its downsides. Parallelization is a very important factor in modern scientific computing and Wolff update is very tricky to parallelize where as Metropolis parallelizes very well. Usually we can avoid this problem by running multiple instances of the simulation at the same time as varying simulation parameters such as the temperature. For large lattices the problems is that getting moderate results requires a lot of time.

Työväentutkimus VuosikirjaJan 1, 20170 citations

A new MCRG (Monte Carlo Renormalization Group) calculation of the critical behavior of the 3d ising model - preliminary results

CLIVE F. BAILLIE, Kenneth N. Barish, Rajan Gupta +1 more

We have undertaken a large-scale computer simulation of the 3d Ising model using the Monte Carlo Renormalization Group (MCRG) method. Our calculation improves on past calculations in three ways. Firstly, larger lattices are used -- we have run on 128{sup 3} as well as 64{sup 3}. Secondly, many more spin operators -- 53 even and 46 odd -- are measured. Lastly, we have incorporated more efficient ways of spin update -- Wolff's single-cluster variant of the Swendsen and Wang algorithm. In addition to calculating the critical temperature the thermal and magnetic exponents, and improving the estimate of the correction-to-scaling exponent, we are aiming to verify the presence of redundant operators. We do not yet have sufficient statistics to give final results so here we describe our calculation and present preliminary results which demonstrate that we have control over both finite size effects and systematic errors arising from truncation. 16 refs., 7 figs.

Oct 5, 19890 citations