1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
#include <wolff.h>
int main(int argc, char *argv[]) {
int opt;
bool output_state, use_dual;
lattice_t lat;
uint16_t L;
uint32_t min_runs, lattice_i;
uint64_t N;
double T, H, eps;
L = 128;
N = 1000;
lat = SQUARE_LATTICE;
use_dual = false;
T = 2.3;
H = 0;
eps = 1e30;
output_state = false;
min_runs = 10;
while ((opt = getopt(argc, argv, "N:L:T:H:m:e:oq:D")) != -1) {
switch (opt) {
case 'N':
N = (uint64_t)atof(optarg);
break;
case 'L':
L = atoi(optarg);
break;
case 'T':
T = atof(optarg);
break;
case 'H':
H = atof(optarg);
break;
case 'm':
min_runs = atoi(optarg);
break;
case 'e':
eps = atof(optarg);
break;
case 'o':
output_state = true;
break;
case 'D':
use_dual = true;
break;
case 'q':
lattice_i = atoi(optarg);
switch (lattice_i) {
case 0:
lat = SQUARE_LATTICE;
break;
case 1:
lat = DIAGONAL_LATTICE;
break;
case 2:
lat = TRIANGULAR_LATTICE;
break;
case 3:
lat = VORONOI_HYPERUNIFORM_LATTICE;
break;
case 4:
lat = VORONOI_LATTICE;
break;
default:
printf("lattice specifier must be 0 (VORONOI_LATTICE), 1 "
"(DIAGONAL_LATTICE), or 2 (VORONOI_HYPERUNIFORM_LATTICE).\n");
exit(EXIT_FAILURE);
}
break;
default:
exit(EXIT_FAILURE);
}
}
gsl_rng *r = gsl_rng_alloc(gsl_rng_mt19937);
gsl_rng_set(r, jst_rand_seed());
graph_t *h = graph_create(lat, TORUS_BOUND, L, use_dual);
ising_state_t *s = (ising_state_t *)calloc(1, sizeof(ising_state_t));
s->g = graph_add_ext(h);
s->spins = (bool *)calloc(h->nv + 1, sizeof(bool));
s->M = sign(H) * h->nv;
s->H = -(1.0 * h->ne) - sign (H) * H * h->nv;
double *bond_probs = (double *)malloc(2 * sizeof(double));
bond_probs[0] = 1 - exp(-2 / T);
bond_probs[1] = 1 - exp(-2 * fabs(H) / T);
double diff = 1e31;
uint64_t n_runs = 0;
double E1, E2, dE1, aM1, daM1, M1, M2, dM1, C, dC, aX, daX, X, dX, aMmu2, Mmu2, aMmu4, Mmu4, Emu2, Emu4;
double clust_per_sweep = 0;
E1 = 0;
E2 = 0;
M1 = 0;
aM1 = 0;
M2 = 0;
C = 0;
dC = 0;
X = 0;
aX = 0;
dX = 0;
dE1 = 0;
dM1 = 0;
Mmu2 = 0;
Mmu4 = 0;
aMmu2 = 0;
aMmu4 = 0;
Emu2 = 0;
Emu4 = 0;
printf("\n");
while (diff > eps || diff == 0. || n_runs < min_runs) {
printf("\033[F\033[JWOLFF: sweep %" PRIu64
", dH/H = %.4f, dM/M = %.4f, dC/C = %.4f, dX/X = %.4f, cps: %.1f\n",
n_runs, fabs(dE1 / E1), dM1 / M1, dC / C, dX / X, clust_per_sweep);
uint32_t n_flips = 0;
uint32_t n_clust = 0;
while (n_flips / h->nv < N) {
n_flips += wolff_step(T, H, s, r, bond_probs);
n_clust++;
}
E1 = E1 * (n_runs / (n_runs + 1.)) + s->H * 1. / (n_runs + 1.);
M1 = M1 * (n_runs / (n_runs + 1.)) + s->M * 1. / (n_runs + 1.);
aM1 = aM1 * (n_runs / (n_runs + 1.)) + abs(s->M) * 1. / (n_runs + 1.);
E2 = E2 * (n_runs / (n_runs + 1.)) + pow(s->H, 2) * 1. / (n_runs + 1.);
M2 = M2 * (n_runs / (n_runs + 1.)) + pow(s->M, 2) * 1. / (n_runs + 1.);
Mmu2 = Mmu2 * (n_runs / (n_runs + 1.)) +
pow(s->M - M1, 2) * 1. / (n_runs + 1.);
Mmu4 = Mmu4 * (n_runs / (n_runs + 1.)) +
pow(s->M - M1, 4) * 1. / (n_runs + 1.);
aMmu2 = aMmu2 * (n_runs / (n_runs + 1.)) +
pow(abs(s->M) - aM1, 2) * 1. / (n_runs + 1.);
aMmu4 = aMmu4 * (n_runs / (n_runs + 1.)) +
pow(abs(s->M) - aM1, 4) * 1. / (n_runs + 1.);
Emu2 = Emu2 * (n_runs / (n_runs + 1.)) +
pow(s->H - E1, 2) * 1. / (n_runs + 1.);
Emu4 = Emu4 * (n_runs / (n_runs + 1.)) +
pow(s->H - E1, 4) * 1. / (n_runs + 1.);
if (n_runs > 1) {
double Msigma2 = n_runs / (n_runs - 1) * (M2 - pow(M1, 2));
double aMsigma2 = n_runs / (n_runs - 1) * (M2 - pow(aM1, 2));
X = Msigma2 / T;
aX = aMsigma2 / T;
dX =
sqrt((Mmu4 - (n_runs - 3.) / (n_runs - 1.) * pow(Mmu2, 2)) / n_runs) /
T;
daX =
sqrt((aMmu4 - (n_runs - 3.) / (n_runs - 1.) * pow(aMmu2, 2)) / n_runs) /
T;
double Esigma2 = n_runs / (n_runs - 1) * (E2 - pow(E1, 2));
C = Esigma2 / T;
dC =
sqrt((Emu4 - (n_runs - 3.) / (n_runs - 1.) * pow(Emu2, 2)) / n_runs) /
T;
dE1 = sqrt(Esigma2 / n_runs);
dM1 = sqrt(Msigma2 / n_runs);
daM1 = sqrt(aMsigma2 / n_runs);
diff = fabs(dX / X);
}
clust_per_sweep = clust_per_sweep * (n_runs / (n_runs + 1.)) +
(n_clust * 1. / N) * 1. / (n_runs + 1.);
n_runs++;
}
printf("\033[F\033[JWOLFF: sweep %" PRIu64
", dH/H = %.4f, dM/M = %.4f, dC/C = %.4f, dX/X = %.4f, cps: %.1f\n",
n_runs, fabs(dE1 / E1), dM1 / M1, dC / C, dX / X, clust_per_sweep);
FILE *outfile = fopen("out.dat", "a");
fprintf(outfile,
"%u %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f %.15f\n", L,
T, H, E1 / h->nv, dE1 / h->nv, M1 / h->nv, dM1 / h->nv, C / h->nv,
dC / h->nv, X / h->nv, dX / h->nv, aM1 / h->nv, daM1 / h->nv, aX / h->nv, daX / h->nv);
fclose(outfile);
if (output_state) {
FILE *state_file = fopen("state.dat", "a");
for (uint32_t i = 0; i < h->nv; i++) {
fprintf(state_file, "%d ", s->spins[i]);
}
fprintf(state_file, "\n");
fclose(state_file);
}
gsl_rng_free(r);
graph_free(s->g);
free(s->spins);
free(s);
free(bond_probs);
graph_free(h);
return 0;
}
|
