-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathpySpin.c
367 lines (333 loc) · 12.6 KB
/
pySpin.c
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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include "pySpin.h"
#include "random.h"
double set_energy(struct SimData *SD){
int i;
int model_number = SD->model_number;
double energy = 0.0;
if(model_number<2){ // FA or East
for(i=0;i<SD->nsites;i++) energy+=(double)SD->configuration[i];
}
else if(SD->model_number==10){ // Plaquette
for(i=0;i<SD->nsites;i++) energy+=(double)SD->dual_configuration[i];
}
else{
printf("pySpin.c: Model number not yet supported by set_energy\n");
}
SD->total_energy = energy;
return energy;
}
int get_event_type(int site_idx, struct SimData *SD){
int j;
int event_type = -1;
int nneighbors_per_site = SD->nneighbors_per_site;
if(SD->model_number < 2){ // FA or East
double constraint = 0.0;
int state_i = SD->configuration[site_idx];
//note this depends on the lattice being properly declared such that
// all neighbors are those that actually affect the given spin
for(j=0;j<nneighbors_per_site;j++){
constraint+=SD->configuration[SD->neighbors[nneighbors_per_site*site_idx+j]];
}
event_type = 2*constraint+state_i;
}
else if(SD->model_number==10){ // Plaquette
int excitations_created = 0;
excitations_created += ( 1-2*SD->dual_configuration[site_idx] ); // changes 0 -> 1 and 1-> -1
for(j=0;j<SD->nneighbors_update_per_site;j++){
int neighbor_site = SD->neighbors_update[SD->nneighbors_update_per_site*site_idx+j];
excitations_created += ( 1 - 2*SD->dual_configuration[neighbor_site] );
}
//WARNING, next works for square and triangular plaquette model. would need to check for future plaquette interactions, if any
event_type = (excitations_created+SD->n_event_types-1)/2;
//printf("\t\t\tSite: %i Event_type: %i\n",site_idx,event_type);
}
else{
printf("pySpin.c: Model number not yet supported by get_event_type\n");
}
return event_type;
}
int switch_state( int state, int model_number ){
if(model_number<MAXZEROONEMODEL){ // models with 0's and 1's
return 1 - state;
}
else if(model_number<MAXPLUSMINUSMODEL){ // models with -1's and 1's
return -1*state;
}
else{
printf("pySpin.c: When updating event, model number out of acceptable range\n");
return -1;
}
}
int all_events( struct SimData *SD){
int i,j,activeidx;
int n_possible_events = 0;
for(activeidx=0;activeidx<SD->nactive;activeidx++){
i = SD->activelist[activeidx];
SD->events[i] = 0;
SD->event_types[i] = -1;
SD->event_refs[i] = -1;
for(j=0;j<SD->n_event_types;j++){
SD->events_by_type[j*SD->nsites+i]=-1;
}
}
for(i=0;i<SD->n_event_types;i++){
SD->events_per_type[i] = 0;
SD->cumulative_rates[i] = 0.0;
}
for(activeidx=0;activeidx<SD->nactive;activeidx++){
i = SD->activelist[activeidx];
int event_type = get_event_type(i,SD);
SD->events[i] = switch_state(SD->configuration[i],SD->model_number);
SD->event_types[i] = event_type;
if(event_type>-1){
int nevents_type_i = SD->events_per_type[event_type];
SD->events_by_type[event_type*SD->nsites+nevents_type_i] = i;
SD->event_refs[i] = nevents_type_i;
SD->events_per_type[event_type]++;
n_possible_events++;
}
}
SD->n_possible_events = n_possible_events;
return n_possible_events;
}
void print_event_type( int event_type, struct SimData *SD){
int i;
printf("%i %i) ",event_type,SD->events_per_type[event_type]);
for(i=0;i<SD->events_per_type[event_type]+1;i++){
printf("%i ",SD->events_by_type[event_type*SD->nsites+i]);
}
printf("\n");
}
void print_all_event_types( struct SimData *SD ){
int i;
for(i=0;i<SD->n_event_types;i++){
print_event_type(i,SD);
}
}
int change_event_type( int i, int old_event_type, int new_event_type, struct SimData *SD){
//first check if old and new event types are the same
if(old_event_type == new_event_type) return 0;
//first remove it from the old list (note, this hopefully should work even if last event in list)
int nsites = SD->nsites;
int old_final_event_ref = SD->events_per_type[old_event_type]-1;
int old_event_ref = SD->event_refs[i];
// replace this event with event from end of list (may be same if this was last event). must also replace its event ref
int site_to_move = SD->events_by_type[old_event_type*nsites+old_final_event_ref];
SD->events_by_type[old_event_type*nsites+old_event_ref] = site_to_move;
SD->event_refs[site_to_move] = old_event_ref;
// now negate final event
SD->events_by_type[old_event_type*nsites+old_final_event_ref] = -1;
// and decrement number of events
SD->events_per_type[old_event_type]--;
// insert this site at end of new_event_type list
int new_event_ref = SD->events_per_type[new_event_type];
SD->events_by_type[new_event_type*nsites+new_event_ref] = i;
SD->event_types[i] = new_event_type;
SD->event_refs[i] = new_event_ref;
SD->events_per_type[new_event_type]++;
return 0;
}
// note this function should only be called if move_site is active
int update_events_i( int move_site, struct SimData *SD){
int i,j,k,ii,state_i,state_ii;
//int n_possible_events = 0;
//float event_rate = 0.0;
int model_number = SD->model_number;
int nneighbors_per_site= SD->nneighbors_per_site;
int nneighbors_update_per_site = SD->nneighbors_update_per_site;
//first do it for this site
i = move_site;
state_i = SD->configuration[i];
int old_event_type = SD->event_types[i];
int new_event_type = get_event_type(i,SD);
SD->events[i] = switch_state( state_i, model_number );
//now change where it is in the list of events for that type
change_event_type( i, old_event_type, new_event_type, SD );
// now do it for neighbors of this site
for(j=0;j<nneighbors_per_site;j++){
i = SD->neighbors[nneighbors_per_site*move_site+j];
if(SD->isactivelist[i]){
state_i = SD->configuration[i];
old_event_type = SD->event_types[i];
new_event_type = get_event_type(i,SD);
SD->events[i] = switch_state( state_i, model_number );
change_event_type( i, old_event_type, new_event_type, SD );
}
}
// now do it for neighbors this site affects
for(j=0;j<nneighbors_update_per_site;j++){
i = SD->neighbors_update[nneighbors_update_per_site*move_site+j];
if(SD->isactivelist[i]){
state_i = SD->configuration[i];
old_event_type = SD->event_types[i];
new_event_type = get_event_type(i,SD);
SD->events[i] = switch_state( state_i, model_number );
change_event_type( i, old_event_type, new_event_type, SD );
}
// and update neighbors of these sites as well
for(k=0;k<nneighbors_per_site;k++){
ii = SD->neighbors[nneighbors_per_site*i+k];
if( ii == move_site ) continue;
if(SD->isactivelist[ii]){
state_ii = SD->configuration[ii];
old_event_type = SD->event_types[ii];
new_event_type = get_event_type(ii,SD);
SD->events[ii] = switch_state( state_ii, model_number );
change_event_type( ii, old_event_type, new_event_type, SD );
}
}
}
return 0;
}
int update_configuration( int change_idx, struct SimData *SD){
int j;
int result = SD->events[change_idx];
SD->configuration[change_idx] = result;
if(SD->model_number<MAXZEROONEMODEL) SD->persistence_array[change_idx] = 0;
//also update dual representation and energy
if(SD->model_number==10){
//change this site
int dual_result = 1 - SD->dual_configuration[change_idx];
SD->dual_configuration[change_idx] = dual_result;
SD->total_energy=SD->total_energy+(2*dual_result-1) ;
//now find subset of affected neigbhors which have this spin in their plaquette
for(j=0;j<SD->nneighbors_update_per_site;j++){
int affected_neighbor_idx = SD->neighbors_update[SD->nneighbors_update_per_site*change_idx+j];
dual_result = 1 - SD->dual_configuration[affected_neighbor_idx];
SD->dual_configuration[affected_neighbor_idx] = dual_result;
SD->total_energy=SD->total_energy+(2*dual_result-1) ;
}
}
else{
SD->total_energy=SD->total_energy+(2*result-1) ;
}
return 0;
}
double sum_rates( struct SimData *SD ){
int i;
double total_rate = 0.0;
int n_possible_events = 0;
if(SD->n_event_types>0){
total_rate = SD->events_per_type[0]*SD->event_rates[0];
SD->cumulative_rates[0] = total_rate;
n_possible_events = SD->events_per_type[0];
}
for(i=1;i<SD->n_event_types;i++){
double rate_type_i = SD->events_per_type[i]*SD->event_rates[i];
total_rate = total_rate + rate_type_i;
SD->cumulative_rates[i] = SD->cumulative_rates[i-1] + rate_type_i;
n_possible_events += SD->events_per_type[i];
}
SD->total_rate = total_rate;
SD->n_possible_events = n_possible_events;
return total_rate;
}
//linear search through cumulative event probabilities. may be faster than binary search since num event types so small
int l_find_event( double searchval, struct SimData *SD){
int i=0;
while(SD->cumulative_rates[i]<searchval && i<SD->n_event_types) i++;
return i;
}
//binary search through cumulative event probabilities
int b_find_event( double searchval, struct SimData *SD){
int final_event = SD->n_event_types - 1;
int idx0 = 0;
int idx1 = final_event;
if ( SD->n_event_types < 1 ){
return -1;
}
if ( SD->cumulative_rates[0] > searchval ){
return 0;
}
if ( SD->cumulative_rates[final_event] < searchval ) {
return final_event;
}
while ( (idx1-idx0) > 1 ){
int halfidx = (idx1+idx0)/2;
double half_prob = SD->cumulative_rates[halfidx];
if ( half_prob > searchval ){
idx1 = halfidx;
}
else if ( half_prob < searchval ){
idx0 = halfidx;
}
else{
return halfidx;
}
}
return idx1;
}
/*
int copy_configuration_prev(struct SimData *SD){
int i;
for(i=0;i<SD->nsites;i++){
SD->prev_configuration[i] = SD->configuration[i];
}
//Note: memcopy solution like below possible but found to be a bit slower (not tested fully for correctness)
//memcpy( SD->prev_configuration, SD->configuration, SD->nsites*sizeof(int) );
return 0;
}
*/
int run_kmc_spin(double stop_time,struct SimData *SD){
long step = 0;
SD->current_step = 0;
int n_possible_events = SD->n_possible_events;
int return_val = 0;
double elapsed_time = 0;
double max_time = stop_time - SD->time;
double dt = 0;
//print_all_event_types( SD );
while(elapsed_time<max_time){
if(n_possible_events<1){
return_val = -1;
break;
}
//double prob = get_prob();
double time_prob = get_frandom_2();
double total_rate = sum_rates(SD);
dt = -log(time_prob)/total_rate;
elapsed_time += dt;
/*
if(elapsed_time >= max_time ){
copy_configuration_prev(SD);
}
*/
// note, if there are zero events of type 0, and get_frandom were used and returned prob=0.000000, then event type 0 will be selected anyway, and will cause a segfault
double prob = get_frandom_2();
int event_type_i = b_find_event( prob*total_rate, SD);
//int event_type_i = l_find_event( prob*total_rate, SD);
int rand_event = get_irandomx( 0, SD->events_per_type[event_type_i]-1 );
int move_site = SD->events_by_type[event_type_i*SD->nsites+rand_event];
SD->move_site = move_site;
/*
if(event_type_i==4) {
printf("Rare event. Flipping site %i\n",move_site);
printf("State %i event %i\n",SD->configuration[move_site],SD->events[move_site]);
print_all_event_types( SD );
}
*/
update_configuration( move_site, SD );
update_events_i( move_site, SD );
// if(event_type_i==4) printf("State %i event %i\n",SD->configuration[move_site],SD->events[move_site]);
step++;
}
sum_rates(SD);
SD->time += elapsed_time;
SD->current_step = step;
return return_val;
}
int setup_spin_system(struct SimData *SD){
set_seed(SD->seed);
all_events(SD);
sum_rates(SD);
set_energy(SD);
return 0;
}
int cleanup_spin_system(struct SimData *SD){
return 0;
}