 Figure: The probability P(x) and the test function f(x) for various algorithms.
FLA=Fast Linear Algorithm
Cr =Creutz
Me =Metropolis
P_{2}=P(x) with h=2


 Figure: comparison of the time of simulation for various algorithms
for the stacked triangular antiferromagnetic lattices.
The critical temperature is shown by the squares
 FLA=Fast Linear Algorithm
 Cr =Creutz
 Fa =Fabricius
 Ke =Kennedy
 Me_{G} =Metropolis standard using 4 Gaussian random numbers.
 Me_{S} =Metropolis, the first angle, sin^{2}(theta)is chosen from
a sinus distribution and the rejection method
 Me_{d} =like Me_{S} but the first angle is constrained
to be around the old spin (0 < first angle < d).


 Figure: comparison of the rate of simulation for various algorithms
for the stacked triangular antiferromagnetic lattices.
The critical temperature is shown by the squares
 FLA=Fast Linear Algorithm
 Cr =Creutz
 Fa =Fabricius
 Ke =Kennedy
 Me_{} =Metropolis .
 Me_{d} = Metropolis but the first angle is constrained
to be around the old spin (0 < first angle < d).

