The Fast Linear Algorithm for O(1) Phi4 spin model

Spins with one components: S=x local field : hlocal=h Energy=-h.x+x2+ landa.(x2-1)2 P(x)=e-Energy/T.dx        =eh.x-x2- landa.(x2-1)2.dx

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 :
		O1_Phi4.c   (in C)
	2.	AND you must have the tables in the file "O1_Phi4.res". Two choices: . You can choose to download the file O1_Phi4.res already done or make one with create_O1_Phi4.out (.exe for windows), run it, and follow the instructions.
		O1_Phi4.res   (380 Ko) h → [0,100[ with rate=85% or For LINUX, only one executable create_O1_Phi4.out   (For LINUX, 450 Ko) For WINDOWS copy these two programs in the same directory 1. create_O1_Phi4.exe   (For WINDOWS, 34 Ko) 2. cygwin1.dll   (For WINDOWS, 950 Ko)

Download the Article:

Article.pdf (440 Ko)

Probabilities and Performances :

Figure: comparison of the time of simulation for various algorithms for the three dimensional antiferromagnetic triangular lattices. The critical temperature is shown by the squares The Fast Linear Algorithm (FLA) is the fastest of all algorithms proposed We can show more generally that another algorithm cannot be faster (see article). More...

Other Algorithms in C

• Other algorithms for O(1) Phi⁴ model
  • Metropolis_d

---

• go to ~loison/fast_algorithms/
• go to ~loison/
• mail to D. Loison