-
Notifications
You must be signed in to change notification settings - Fork 12
/
Schedule.C
183 lines (162 loc) · 8.09 KB
/
Schedule.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
#include <iostream>
#include <fstream>
#include <string.h>
#include <boost/algorithm/string.hpp>
#include <ctype.h>
#include "global.h"
#include "input.h"
#include "pario.h"
using namespace std;
void SpinAdapted::Input::generateDefaultSchedule(){
#ifndef SERIAL
if (mpigetrank() == 0) {
#endif
if (m_sweep_tol <= 0.0) {
pout << "Using the default tolerance sweep tolerance of 1.0e-5."<<endl;
m_sweep_tol = 1.0e-5;
}
if (m_schedule_type_default && !m_schedule_type_backward) {
int nentry = 0;
m_sweep_iter_schedule.resize(nentry);
m_sweep_state_schedule.resize(nentry);
m_sweep_qstate_schedule.resize(nentry,0);
m_sweep_tol_schedule.resize(nentry);
m_sweep_noise_schedule.resize(nentry);
m_sweep_additional_noise_schedule.resize(nentry,0);
double sweeptol = m_sweep_tol;
int lastiter = 0;
int firstSched = 0;
int sweepCount = 0;
int nSched=14;
int defM [] = {50, 100, 250, 500, 1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 10000};
int defIter [] = {8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4};
double defNoise [] = {1.0e-4, 1.0e-4, 1e-4, 1e-4, 5e-5, 5e-5, 5e-5, 5e-5, 5e-5, 5e-5, 5e-5, 5e-5, 5e-5, 5e-5};
double defTol [] = {1.0e-5, 1.0e-5, 1e-5, 1e-5, 5e-5, 5e-6, 5e-6, 5e-6, 5e-6, 5e-6, 5e-6, 5e-6, 5e-6, 5e-6};
for (int i=0; i<nSched;++i){
if (firstSched==0){
if (m_startM == m_maxM){
//pout << sweepCount << " " << m_startM << " " << defTol[i] << " " << defNoise[i] << endl;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(m_startM); m_sweep_tol_schedule.push_back(1E-5); m_sweep_noise_schedule.push_back(1E-4);
sweepCount += 8;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(m_startM); m_sweep_tol_schedule.push_back(5E-6); m_sweep_noise_schedule.push_back(5E-5);
break;
}
else if (m_startM == defM[i]){
//pout << sweepCount << " " << defM[i] << " " << defTol[i] << " " << defNoise[i] << endl;
firstSched = 1;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(defM[i]); m_sweep_tol_schedule.push_back(defTol[i]); m_sweep_noise_schedule.push_back(defNoise[i]);
sweepCount += defIter[i];
}
else if (m_startM < defM[i]){
firstSched = 1;
//pout << sweepCount << " " << m_startM << " " << defTol[i-1] << " " << defNoise[i-1] << endl;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(m_startM); m_sweep_tol_schedule.push_back(defTol[i-1]); m_sweep_noise_schedule.push_back(defNoise[i-1]);
sweepCount += defIter[i-1];
//pout << sweepCount << " " << defM[i] << " " << defTol[i] << " " << defNoise[i] << endl;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(defM[i]); m_sweep_tol_schedule.push_back(defTol[i]); m_sweep_noise_schedule.push_back(defNoise[i]);
sweepCount += defIter[i];
}
}
else{//After first iteration
if (defM[i]>=m_maxM){
//pout << sweepCount << " " << m_maxM << " " << defTol[i] << " " << defNoise[i] << endl;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(m_maxM); m_sweep_tol_schedule.push_back(defTol[i]); m_sweep_noise_schedule.push_back(defNoise[i]);
sweepCount += defIter[i];
break;
}
else{
//pout << sweepCount << " " << defM[i] << " " << defTol[i] << " " << defNoise[i] << endl;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(defM[i]); m_sweep_tol_schedule.push_back(defTol[i]); m_sweep_noise_schedule.push_back(defNoise[i]);
sweepCount += defIter[i];
}
}
}
lastiter = m_sweep_iter_schedule.back();
//lastiter = sweepCount;
m_sweep_iter_schedule.push_back(lastiter+2); m_sweep_state_schedule.push_back(m_maxM); m_sweep_tol_schedule.push_back(sweeptol/10.0); m_sweep_noise_schedule.push_back(0.0e-5);
if (m_twodot_to_onedot_iter < 18 && m_algorithm_type == TWODOT_TO_ONEDOT) {
if (m_twodot_to_onedot_iter <= 0)
pout << "Sweep at which the switch from twodot to onedot will happen -> "<<lastiter+4<<endl;
m_twodot_to_onedot_iter = lastiter+4;
}
if (m_maxiter <= m_sweep_iter_schedule.back()) {
//pout << "With the default schedule and maxM specified, maxiter has to be at least "<<lastiter+6<<endl;
//pout << "changing maxiter to "<<lastiter+6<<endl;
m_maxiter = lastiter+6;
}
}
else if (m_schedule_type_backward) {
int nentry = 0;
m_sweep_iter_schedule.resize(nentry);
m_sweep_state_schedule.resize(nentry);
m_sweep_qstate_schedule.resize(nentry,0);
m_sweep_tol_schedule.resize(nentry);
m_sweep_noise_schedule.resize(nentry);
m_sweep_additional_noise_schedule.resize(nentry,0);
double sweeptol = m_sweep_tol;
int lastiter = 0;
int firstSched = 0;
int sweepCount = 0;
int nSched=17;
int lastM=0; //To be changed to a variable
lastM = m_lastM;
if (lastM==0) lastM=50;
if (lastM > m_startM) {
pout << "lastM is larger than startM" << endl;
pout << "Make sure you specify a lastM larger than " << lastM << endl;
pout << "or specify a larger startM " << endl;
abort();
}
double bNoise = 0.0;
double bTol = 5e-6;
int defIter [] = {3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3};
int defM [] = {10000, 9000, 8000, 7000, 6000, 5000, 4000, 3000, 2000, 1000, 500, 250, 100, 50, 25, 10, 1};
for (int i=0; i<nSched;++i){
if (firstSched==0){
if (lastM == m_startM){
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(m_startM); m_sweep_tol_schedule.push_back(bTol); m_sweep_noise_schedule.push_back(bNoise);
sweepCount += 3;
break;
}
else if(m_startM==defM[i]){
firstSched = 1;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(defM[i]); m_sweep_tol_schedule.push_back(bTol); m_sweep_noise_schedule.push_back(bNoise);
sweepCount += defIter[i];
}
else if ((m_startM > defM[i])){
firstSched = 1;
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(m_startM); m_sweep_tol_schedule.push_back(bTol); m_sweep_noise_schedule.push_back(bNoise);
sweepCount += defIter[i-1];
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(defM[i]); m_sweep_tol_schedule.push_back(bTol); m_sweep_noise_schedule.push_back(bNoise);
sweepCount += defIter[i];
}
}
else{//After first iteration
if (defM[i]<=lastM){
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(lastM); m_sweep_tol_schedule.push_back(bTol); m_sweep_noise_schedule.push_back(bNoise);
sweepCount += defIter[i];
break;
}
else{
m_sweep_iter_schedule.push_back(sweepCount); m_sweep_state_schedule.push_back(defM[i]); m_sweep_tol_schedule.push_back(bTol); m_sweep_noise_schedule.push_back(bNoise);
sweepCount += defIter[i];
}
}
}
lastiter = m_sweep_iter_schedule.back();
m_maxiter = lastiter+3;
pout << "maxiter " << m_maxiter << endl;
}
// Questions... What happens to twodottoonedot?
if(m_algorithm_type == TWODOT_TO_ONEDOT && m_twodot_to_onedot_iter == 0)
m_twodot_to_onedot_iter = min(m_sweep_iter_schedule.back()+2, m_maxiter-1);
if (m_maxiter < m_sweep_iter_schedule.back()) {
pout << "maximum iterations allowed is less than the last sweep iteration in your schedule."<<endl;
pout << m_maxiter <<" < "<< (m_sweep_iter_schedule.back())<<endl;
pout << "either increase the max_iter or reduce the number of sweeps"<<endl;
abort();
}
#ifndef SERIAL
}
#endif
}