#include<stdlib.h>
|
#include<stdio.h>
|
#include<math.h>
|
//#include "io.h"
|
#include "general.h"
|
#include "timestep.h"
|
#include "vertexmove.h"
|
#include "bondflip.h"
|
#include "frame.h"
|
#include "io.h"
|
|
ts_bool run_simulation(ts_vesicle *vesicle, ts_uint mcsweeps, ts_uint inititer, ts_uint iterations, ts_uint start_iteration){
|
ts_uint i, j;
|
|
centermass(vesicle);
|
cell_occupation(vesicle);
|
if(start_iteration<inititer) ts_fprintf(stdout, "Starting simulation (first %d x %d MC sweeps will not be recorded on disk)\n", inititer, mcsweeps);
|
for(i=start_iteration;i<inititer+iterations;i++){
|
for(j=0;j<mcsweeps;j++){
|
single_timestep(vesicle);
|
}
|
centermass(vesicle);
|
cell_occupation(vesicle);
|
ts_fprintf(stdout,"Done %d out of %d iterations (x %d MC sweeps).\n",i+1,inititer+iterations,mcsweeps);
|
dump_state(vesicle,i);
|
if(i>inititer){
|
write_vertex_xml_file(vesicle,i-inititer);
|
}
|
}
|
return TS_SUCCESS;
|
}
|
|
ts_bool single_timestep(ts_vesicle *vesicle){
|
ts_bool retval;
|
ts_double rnvec[3];
|
ts_uint i,j,b;
|
for(i=0;i<vesicle->vlist->n;i++){
|
rnvec[0]=drand48();
|
rnvec[1]=drand48();
|
rnvec[2]=drand48();
|
retval=single_verticle_timestep(vesicle,vesicle->vlist->vtx[i],rnvec);
|
}
|
|
// ts_int cnt=0;
|
for(i=0;i<3*vesicle->vlist->n;i++){
|
//why is rnvec needed in bondflip?
|
/* rnvec[0]=drand48();
|
rnvec[1]=drand48();
|
rnvec[2]=drand48();
|
*/
|
b=rand() % vesicle->blist->n;
|
//find a bond and return a pointer to a bond...
|
//call single_bondflip_timestep...
|
retval=single_bondflip_timestep(vesicle,vesicle->blist->bond[b],rnvec);
|
// if(retval==TS_SUCCESS) cnt++;
|
}
|
|
for(i=0;i<vesicle->poly_list->n;i++){
|
for(j=0;j<vesicle->poly_list->poly[i]->vlist->n;j++){
|
rnvec[0]=drand48();
|
rnvec[1]=drand48();
|
rnvec[2]=drand48();
|
retval=single_poly_vertex_move(vesicle,vesicle->poly_list->poly[i],vesicle->poly_list->poly[i]->vlist->vtx[j],rnvec);
|
}
|
|
}
|
|
// printf("Bondflip success rate in one sweep: %d/%d=%e\n", cnt,3*vesicle->blist->n,(double)cnt/(double)vesicle->blist->n/3.0);
|
if(retval);
|
return TS_SUCCESS;
|
}
|