Generalized single-spin-flip dynamics for the Ising model and thermodynamic properties

1994 ◽  
Vol 49 (5) ◽  
pp. 3576-3579 ◽  
Author(s):  
A. M. Mariz ◽  
F. D. Nobre ◽  
C. Tsallis
Keyword(s):  
Ising Model ◽  
Thermodynamic Properties ◽  
Single Spin ◽  
Spin Flip

scholarly journals Projected single-spin-flip dynamics in the Ising model

2007 ◽  
Vol 76 (1) ◽  
Author(s):  
A. L. C. Ferreira ◽  
Raúl Toral
Keyword(s):  
Ising Model ◽  
Single Spin ◽  
Spin Flip

Markov Chain Analysis of Single Spin Flip Ising Simulations

1997 ◽  
Vol 08 (02) ◽  
pp. 207-227 ◽  
Author(s):  
Michael Hennecke
Keyword(s):  
Monte Carlo ◽  
Markov Chain ◽  
Ising Model ◽  
Markov Chain Analysis ◽  
Transition Matrices ◽  
Single Spin ◽  
Spin Flip ◽  
Chain Analysis ◽  
Dynamical Properties ◽  
Versus Loop

The Markov processes defined by random and loop-based schemes for single spin flip attempts in Monte Carlo simulations of the 2D Ising model are investigated, by explicitly constructing their transition matrices. Their analysis reveals that loops over all lattice sites using a Metropolis-type single spin flip probability often do not define ergodic Markov chains, and have distorted dynamical properties even if they are ergodic. The transition matrices also enable a comparison of the dynamics of random versus loop spin selection and Glauber versus Metropolis probabilities.

SPECIAL-PURPOSE ISING MODEL RANDOM LATTICE PROCESSOR

1991 ◽  
Vol 02 (03) ◽  
pp. 805-816 ◽  
Author(s):  
V.B. ANDREICHENKO ◽  
VL.S. DOTSENKO ◽  
L.N. SHCHUR ◽  
A.L. TALAPOV
Keyword(s):  
Monte Carlo ◽  
Ising Model ◽  
Monte Carlo Step ◽  
Monte Carlo Algorithm ◽  
Price Ratio ◽  
Random Lattice ◽  
Spin Flip ◽  
Different Types ◽  
Memory Cycle Time ◽  
Memory Cycle

We have designed and built a special purpose processor with a very good performance to price ratio, which permits to propose a new way for parallel computing. A simple one spin flip Monte Carlo algorithm is realized in hardware, so the processor is suitable for studies of dynamic as well as thermodynamic properties of the two-dimensional Ising model with different types of inhomogeneities. The speed of the processor is defined completely by the speed of memories used in it: to perform an elementary Monte Carlo step the processor needs a time only several percent larger than one memory cycle time. So it realizes the fastest possible one spin flip Monte Carlo processor architecture.

scholarly journals CLUSTER VS. SINGLE-SPIN ALGORITHMS—WHICH ARE MORE EFFICIENT?

1994 ◽  
Vol 05 (01) ◽  
pp. 1-14 ◽  
Author(s):  
N. ITO ◽  
G.A. KOHRING
Keyword(s):  
Ising Model ◽  
Critical Exponents ◽  
Cluster Algorithm ◽  
Computer Time ◽  
System Size ◽  
Statistical Accuracy ◽  
Single Spin ◽  
Cluster Algorithms ◽  
Vector Computers ◽  
Single Cluster

A comparison between single-cluster and single-spin algorithms is made for the Ising model in 2 and 3 dimensions. We compare the amount of computer time needed to achieve a given level of statistical accuracy, rather than the speed in terms of site updates per second or the dynamical critical exponents. Our main result is that the cluster algorithms become more efficient when the system size, Ld, exceeds, L~70–300 for d=2 and l~80–200 for d=3. The exact value of the crossover is dependent upon the computer being used. The lower end of the crossover range is typical of workstations while the higher end is typical of vector computers. Hence, even for workstations, the system sizes needed for efficient use of the cluster algorithm is relatively large.

Spin flip probabilities in the 3-D diluted Ising model

1994 ◽  
Vol 4 (8) ◽  
pp. 1133-1138
Author(s):  
Uwe Gropengiesser
Keyword(s):  
Ising Model ◽  
Spin Flip
Sign in / Sign up

Export Citation Format

Share Document