forked from algorithm-archivists/algorithm-archive
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathenergy.cpp
59 lines (42 loc) · 1.58 KB
/
energy.cpp
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
#include <vector>
#include <complex>
#include <fftw3.h>
void fft(std::vector<std::complex<double>> &x, bool inverse) {
std::vector<std::complex<double>> y(x.size(), std::complex<double>(0.0, 0.0));
fftw_plan p;
fftw_complex *in = reinterpret_cast<fftw_complex*>(x.data());
fftw_complex *out = reinterpret_cast<fftw_complex*>(y.data());
p = fftw_plan_dft_1d(x.size(), in, out,
(inverse ? FFTW_BACKWARD : FFTW_FORWARD), FFTW_ESTIMATE);
fftw_execute(p);
fftw_destroy_plan(p);
for (size_t i = 0; i < x.size(); ++i) {
x[i] = y[i] / sqrt(static_cast<double>(x.size()));
}
}
double calculate_energy(std::vector<std::complex<double>> wfc,
std::vector<std::complex<double>> h_r,
std::vector<std::complex<double>> h_k,
double dx, size_t size) {
std::vector<std::complex<double>> wfc_k(wfc);
std::vector<std::complex<double>> wfc_c(size);
fft(wfc_k, false);
for (size_t i = 0; i < size; ++i) {
wfc_c[i] = conj(wfc[i]);
}
std::vector<std::complex<double>> energy_k(size);
std::vector<std::complex<double>> energy_r(size);
for (size_t i = 0; i < size; ++i) {
energy_k[i] = wfc_k[i] * pow(h_k[i], 2);
}
fft(energy_k, true);
for (size_t i = 0; i < size; ++i) {
energy_k[i] *= 0.5 * wfc_c[i];
energy_r[i] = wfc_c[i] * h_r[i] * wfc[i];
}
double energy_final = 0;
for (size_t i = 0; i < size; ++i) {
energy_final += real(energy_k[i] + energy_r[i]);
}
return energy_final * dx;
}