This repository was archived by the owner on Mar 14, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1DPeriodicCrystal.cpp
More file actions
374 lines (321 loc) · 11.4 KB
/
Copy path1DPeriodicCrystal.cpp
File metadata and controls
374 lines (321 loc) · 11.4 KB
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
367
368
369
370
371
372
#include "1DPeriodicCrystal.h"
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
using namespace Eigen;
double kroneckerD(int i, int j);
template <typename T> int sgn(T val) {
return (T(0) < val) - (val < T(0));
}
SpinWaveProblem1D::SpinWaveProblem1D(int N, int baseSplit, int kSteps, int omegaSteps, double H1, double H2, double l1, double l2, double d, double omegaStart,
double omegaEnd, double kStart, double kEnd, bool debug){
this->N = N;
this->baseSplit = baseSplit;
this->kSteps = kSteps;
this->omegaSteps = omegaSteps;
this->omegaStart = omegaStart;
this->omegaEnd = omegaEnd;
this->kStart = kStart;
this->kEnd = kEnd;
this->debug = debug;
//всё в СГС
this->l1 = l1;
this->l2 = l2;
this->d = d;
gamma = 1.76e7;
this->H1 = H1;
this->H2 = H2;
M4pi = 1750;
omegaH1 = gamma * H1;
omegaH2 = gamma * H2;
omegaM = gamma * M4pi;
goThroughGrid();
}
void SpinWaveProblem1D::goThroughGrid() {
omegaDelta = (omegaEnd - omegaStart);
double kDelta = (kEnd - kStart);
vector<double> suspiciousOmega;
vector<complex<double> > determinants;
std::ostringstream filename;
filename << "results N " << N << " H2 " << std::setprecision(3) << H2 << " l1 to d " << l1/d << " k to b_1 "
<< kStart/b(1) << "-" << kEnd/b(1) << " O " << std::setprecision(5) << omegaStart << "-" << omegaEnd;
ofstream fout1;
fout1.open(filename.str());
fout1 << "k/b_1 omega f omegaIdeal1 omegaIdeal2 These are results for grid: k: "
<< kSteps << " points, omega starting: " << omegaSteps << " points" << endl;
ofstream fout2;
if(baseSplit != 0) {
filename.str("");
filename.clear();
filename << "exact results N " << N << " H2 " << std::setprecision(3) << H2 << " l1 to d " << l1/d << " k to b_1 "
<< kStart/b(1) << "-" << kEnd/b(1) << " O " << std::setprecision(5) << omegaStart << "-" << omegaEnd;
fout2.open(filename.str());
fout2 << "k/b_1 omega omegaIdeal1 omegaIdeal2 These are results for grid: k: "
<< kSteps << " points, omega starting: " << omegaSteps << " points" << endl;
}
for(double k = kStart; k < kEnd; k += kDelta/kSteps) {
cout << (k - kStart)/kDelta * 100 << "%: \tCalculating layer k/b_1 = " << k/b(1) << endl;
for(double omega = omegaStart+1; omega < omegaStart + omegaDelta * (1.0 + 1.0/omegaSteps*0.5); omega += omegaDelta/omegaSteps) {
determinants.push_back(findDeterminant(k, omega));
}
for(unsigned int i = 6; i < determinants.size()-6; i++) {
if(isMinimum(determinants, i, 6)) {
if(baseSplit != 0)
suspiciousOmega.push_back(checkNull(k, omegaStart + omegaDelta/omegaSteps*(i-1),omegaStart + omegaDelta/omegaSteps*(i+1)));
fout1 << k/b(1) << " " << omegaStart + omegaDelta/omegaSteps * (i) << " " << (omegaStart + omegaDelta/omegaSteps * (i))/(2.0*M_PI) << " " << omegaIdeal(k, omegaH1, 1)
<< " " << omegaIdeal(k, omegaH2, 1) << endl;
}
}
if(baseSplit != 0) {
for(unsigned int i = 0; i < suspiciousOmega.size(); i++) {
if(suspiciousOmega[i] != 0)
fout2 << k/b(1) << " " << suspiciousOmega[i] << " " << omegaIdeal(k, omegaH1, 1)
<< " " << omegaIdeal(k, omegaH2, 1) << endl;
}
}
determinants.clear();
suspiciousOmega.clear();
}
return;
}
std::complex<double> SpinWaveProblem1D::findDeterminant(double k, double omega) {
fillMatrix1(k, omega);
ces.compute(Matrix1);
fixEigens();
refillMatrix1(k);
return Matrix1.determinant();
}
bool SpinWaveProblem1D::isMinimum(vector<complex<double> >& determinants, int i, int depth) {
if(depth < 1)
return true;
if(abs(determinants[i]) < abs(determinants[i+depth]) && abs(determinants[i]) < abs(determinants[i-depth]))
return isMinimum(determinants, i, depth-1);
else
return false;
}
double SpinWaveProblem1D::mu1(double omega) {
return (omegaH1 * (omegaH1 + omegaM) - omega*omega) / (omegaH1*omegaH1 - omega*omega);
}
double SpinWaveProblem1D::mu2(double omega) {
return (omegaH2 * (omegaH2 + omegaM) - omega*omega) / (omegaH2*omegaH2 - omega*omega);
}
std::complex<double> SpinWaveProblem1D::M(int n, double omega) {
double d2 = 1.0 * d;
if (n == 0)
return (mu1(omega) * (l1+l2-2.0*d - 2.0 * d2) + mu2(omega) * (2.0 * d2)) / (l1+l2-2.0*d);
else {
std::complex<double> exp1 = exp(-1.0i * b(n) * (l1*0.5 - 0.5*d - 0.5*d2)) - 1.0
+ exp(-1.0i * b(n) * (l1*0.5+l2 - 1.5*d - 0.5*d2)) - exp(-1.0i * b(n) * (l1*0.5 - 0.5*d + 0.5*d2))
+ exp(-1.0i * b(n) * (l1+l2-2.0*d)) - exp(-1.0i * b(n) * (l1*0.5+l2 - 1.5*d + 0.5*d2));
std::complex<double> exp2 = exp(-1.0i * b(n) * (l1*0.5 - 0.5*d + 0.5*d2)) - exp(-1.0i * b(n) * (l1*0.5 - 0.5*d - 0.5*d2))
+ exp(-1.0i * b(n) * (l1*0.5+l2 - 1.5*d + 0.5*d2)) - exp(-1.0i * b(n) * (l1*0.5+l2 - 1.5*d - 0.5*d2));
return 1.0i / ((l1+l2-2.0*d)*b(n)) * (mu1(omega)* exp1 + mu2(omega)* exp2);
}
}
double SpinWaveProblem1D::b(int m) {
return m * 2.0 * M_PI / (l1+l2-2.0*d);
}
void SpinWaveProblem1D::fillMatrix1(double k, double omega) {
Matrix1 = MatrixXcd(2*N + 1, 2*N + 1);
for(int p = -N; p <= N; p++) {
for(int n = -N; n <= N; n++) {
Matrix1(p + N, n + N) = -1.0 * M(p - n, omega) * (k + b(p)) * (k + b(n));
}
}
return;
}
void SpinWaveProblem1D::fixEigens() {
eigenValues = ces.eigenvalues();
eigenVectors = ces.eigenvectors();
// lambda squared into lambda
for(int i = 0; i < 2*N+1; i++) {
eigenValues(i) = sqrt(eigenValues(i).real());
}
for(int i = 0; i < 2*N+1; i++) {
for(int j = 0; j < 2*N+1; j++) {
if(abs(eigenVectors(i, j).real()) / abs(eigenVectors(i, j).imag()) > pow(10, 20) )
eigenVectors(i, j) = eigenVectors(i, j).real();
if(abs(eigenVectors(i, j).imag()) / abs(eigenVectors(i, j).real()) > pow(10, 20) )
eigenVectors(i, j) = eigenVectors(i, j).imag();
}
}
return;
}
void SpinWaveProblem1D::refillMatrix1(double k) {
Matrix1 = MatrixXcd(8*N + 4, 8*N + 4);
//A_1
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N, j+N) = eigenVectors(i+N, j+N) * cos(eigenValues(j+N)*d*0.5);
}
}
//B_1
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N, j+N + 2*N+1) = eigenVectors(i+N, j+N) * sin(eigenValues(j+N) * d*0.5);
}
}
//-C_1
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N, j+N + 4*N+2) = -1.0 * kroneckerD(i, j) * std::exp(-1.0 * abs((k + b(i))) * d*0.5);
}
}
//0
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N, j+N + 6*N+3) = 0.0;
}
}
//A_1
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 2*N+1, j+N) = eigenVectors(i+N, j+N) * cos(eigenValues(j+N)*d*0.5);
}
}
//-B_1
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 2*N+1, j+N + 2*N+1) = -1.0 * eigenVectors(i+N, j+N) * sin(eigenValues(j+N)*d*0.5);
}
}
//0
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 2*N+1, j+N + 4*N+2) = 0.0;
}
}
//-D_1
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 2*N+1, j+N + 6*N+3) = -1.0 * kroneckerD(i, j) * std::exp(-1.0 * abs((k + b(i))) * d*0.5);
}
}
//-A_2
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 4*N+2, j+N) = -1.0 * eigenVectors(i+N, j+N) * eigenValues(j+N) * sin(eigenValues(j+N)*d*0.5);
}
}
//B_2
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 4*N+2, j+N + 2*N+1) = eigenVectors(i+N, j+N) * eigenValues(j+N) * cos(eigenValues(j+N)*d*0.5);
}
}
//C_2
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 4*N+2, j+N + 4*N+2) = kroneckerD(i, j) * abs((k + b(i))) * std::exp(-1.0 * abs((k + b(i))) * d*0.5);
}
}
//0
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 4*N+2, j+N + 6*N+3) = 0;
}
}
//A_2
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 6*N+3, j+N) = eigenVectors(i+N, j+N) * eigenValues(j+N) * sin(eigenValues(j+N)*d*0.5);
}
}
//B_2
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 6*N+3, j+N + 2*N+1) = eigenVectors(i+N, j+N) * eigenValues(j+N) * cos(eigenValues(j+N)*d*0.5);
}
}
//0
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 6*N+3, j+N + 4*N+2) = 0;
}
}
//-D_2
for(int i = -N; i <= N; i++) {
for(int j = -N; j <= N; j++) {
Matrix1(i+N + 6*N+3, j+N + 6*N+3) = -1.0 * kroneckerD(i, j) * abs((k + b(i))) * std::exp(-1.0 * abs((k + b(i))) * d*0.5);
}
}
return;
}
double kroneckerD(int i, int j) {
if(i == j)
return 1.0;
else
return 0.0;
}
double SpinWaveProblem1D::checkNull(double& k, double omega1, double omega2, double& startingDet, double& foundOmega) {
// if(Debug == 1)
// cout << "Checking (" << omega1 << ", " << omega2 << ")" << endl;
// if((omega2 - omega1) <= omegaDelta/omegaSteps/(baseSplit*baseSplit + baseSplit)) {
// if(Debug == 1)
// cout << "Found nothing, it's too small" << endl;
// return 0;
// }
//
// if(Debug == 1)
// cout << "It isn't too small, calculating determinants" << endl;
// vector<double> determinants;
// for(double omega = omega1; omega < omega2 + (omega2-omega1) / baseSplit * 0.5; omega += (omega2-omega1) / baseSplit) { //в целях чтобы точно дойти до
// determinants.push_back(abs(findDeterminant(k, omega))); //омеги 2
// }
//
// for(int i = 0; i <= baseSplit; i++) {
// if(Debug == 1)
// cout << "Checking determinant " << determinants[i] << endl;;
// if((startingDet/determinants[i]) > pow(10, N)) {
// if(Debug == 1) {
// cout << "Found omega = " << omega1 + (omega2-omega1) / baseSplit * (i) << " with determinant " << determinants[i] << endl;
// cin.get();
// }
// return omega1 + (omega2-omega1) / baseSplit * (i);
// }
// if(Debug == 1)
// cout << "It didn't fit" << endl;
// }
//
// for(int i = 1; i < baseSplit; i++) {
// if(Debug == 1) {
// cin.get();
// cout << "Checking determinant " << determinants[i] << " again" << endl;
// }
//
// if(determinants[i] < startingDet && determinants[i] <= determinants[0] && determinants[i] <= determinants[baseSplit]) {
// if(Debug == 1)
// cout << "It is interesting" << endl;
// if(determinants[i-1] < determinants[i+1] && determinants[i-1] <= determinants[0] && determinants[i-1] <= determinants[10]) {
// if(Debug == 1)
// cout << "Checking previous interval" << endl;
// foundOmega = checkNull(k, omega1 + (omega2 - omega1) / baseSplit * (i-1), omega1 + (omega2 - omega1) / baseSplit * i, startingDet, foundOmega);
// if(foundOmega != 0)
// return foundOmega;
// }
//
// else if(determinants[i-1] > determinants[i+1] && determinants[i+1] <= determinants[0] && determinants[i+1] <= determinants[10]) {
// if(Debug == 1)
// cout << "Checking further interval" << endl;
// foundOmega = checkNull(k, omega1 + (omega2 - omega1) / baseSplit * i, omega1 + (omega2 - omega1) / baseSplit * (i+1), startingDet, foundOmega);
// if(foundOmega != 0)
// return foundOmega;
// }
// }
// }
//
return 0;
}
double SpinWaveProblem1D::checkNull(double& k, double omega1, double omega2) {
double foundOmega;
complex<double> det1 = findDeterminant(k, omega1);
complex<double> det2 = findDeterminant(k, omega2);
double det = min(abs(det1), abs(det2));
if(Debug == 1)
cout << "Checking (" << omega1 << ", " << omega2 << "), starting determinant = " << det << endl;
return checkNull(k, omega1, omega2, det, foundOmega);
}
double SpinWaveProblem1D::omegaIdeal(double k, double omegaH, int mode) {
return sqrt(omegaH * ( omegaH + omegaM*( 1.0 - (1.0 - exp(-1.0*abs(k*d)))/ abs(k*d) ) ) );
}