 Figure: The probability P(x) and the test function f(x) for various algorithms.
 AWH = Alias Walker Hasting algorithm




 Figure: comparison of the time of simulation for various algorithms
for the three dimensional cubic ferromagnetic lattices.
The drop of efficiently at low temperature (high h) is due
to the too small number of points. We should use the trick (dividing
the interval [x_{ini},x_{fin}]
between [x_{ini},x_{H}] and [x_{H},x_{fin}])
introduced for infinite
Ising spins O1_Alias_Walker.html.
The critical temperature is shown by the squares
 AWH = Alias Walker Hasting algorithm
 FLA_{2}=Fast Linear Algorithm for x then for
y.
 Me_{d} = Metropolis restricted to an interval d
 Me_{2d} = Metropolis restricted to an interval d first for
x then for y.


 Figure: comparison of the rate of simulation for various algorithms
for the three dimensional cubic ferromagnetic lattices.
The critical temperature is shown by the squares
 AWH = Alias Walker Hasting algorithm
 FLA_{2}=Fast Linear Algorithm for x then for
y.
 Me_{d} = Metropolis restricted to an interval d
 Me_{2d} = Metropolis restricted to an interval d first for
x then for y.

