The Fast Linear Algorithm
for O(2)-U(1) symmetry

Spins with two components: S=(Sx,Sy)
local field : hlocal=(hlocalx,hlocaly)

The Fast Linear Algorithm (FLA) uses the rejection method with a function consisting of n steps (see the figure and article for more details)

Download the Fast Linear Algorithm:
1.  To use the Fast Linear Algorithm you must have :
2.  AND you must have the tables in the file "O2.res". Two choices: . You can choose to download the file O2.res already done or make one with create_O2.out (.exe for windows), run it, and follow the instructions.
  • O2.res   (100 Ko)
    h → [0,100[ with rate=85%
  • For LINUX, only one executable
    create_O2.out   (For LINUX, 450 Ko)
  • For WINDOWS copy these two programs in the same directory
    1. create_O2.exe   (For WINDOWS, 34 Ko)
    2. cygwin1.dll   (For WINDOWS, 950 Ko)

Download the Article:

Probabilities and Performances :
  • Figure: comparison of the time of simulation for various algorithms for the two dimensional antiferromagnetic triangular lattices.
    The critical temperatures are shown by the squares
    The Fast Linear Algorithm (FLA) is the fastest of all algorithms proposed (3 times faster than the Metropolis, Me, at the critical temperature in this case). We can show more generally that another algorithm cannot be faster (see article).

Other Algorithms in C