Abstract

In this method, we propose computational technique of Screw-Antisymmetric Periodic Boundary Condition (SAPBC Method) on local, non-cluster update algorithms of Isotropic square lattice Ising model of Monte Carlo simulations, as well. The SAPBC Method, actually, is an extended mixed method of Screw (helical) and Antisymmetric periodic boundary conditions beyond connection from of nearest neighbor spin of the main lattice to even far away block of the outer (foreign) neighbor spin arrays. Here, meanwhile of description of geometry exact details of method and way of spin interaction, have applied to critical slowing down in order to achieve more convergence of spin correlation at critical temperature. Actually, in general, at critical temperature algorithms performed by using SAPBC Method have faster correlation and much shorter autocorrelation time than algorithms performed by using PBC Method. We will also see that autocorrelation function for the typewriter Metropolis algorithm was found to be zero at high temperatures. For low temperatures it fell to zero and stayed there. The SAPBC Method also confirms and consists with the law of the spatial correlation length with its dynamical critical exponent. Therefore, it can be used as a trenchant method applied to boundary conditions of Monte Carlo simulation problems extending on a variety of other models such as XY-Pots-Heisenberg model and also cluster algorithms such as Wolf, Swendsen-Wangas, Hoshen-Koppelman as well.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.