/
near2far.cpp
265 lines (231 loc) · 9.66 KB
/
near2far.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
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
/* Copyright (C) 2005-2022 Massachusetts Institute of Technology
%
% This program is free software; you can redistribute it and/or modify
% it under the terms of the GNU General Public License as published by
% the Free Software Foundation; either version 2, or (at your option)
% any later version.
%
% This program is distributed in the hope that it will be useful,
% but WITHOUT ANY WARRANTY; without even the implied warranty of
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
% GNU General Public License for more details.
%
% You should have received a copy of the GNU General Public License
% along with this program; if not, write to the Free Software Foundation,
% Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/* Check of Green's functions (analytical vs. numerical)
and near-to-far-field transformation. */
#include <stdio.h>
#include <stdlib.h>
#include "meep_internals.hpp"
using namespace meep;
using std::complex;
using std::polar;
double two(const vec &) { return 2.0; }
const int EHcomp[10] = {0, 1, 0, 1, 2, 3, 4, 3, 4, 5};
int check_cyl(double sr, double sz, double a) {
const double dpml = 1.0;
grid_volume gv = volcyl(sr + dpml, dpml + sz + dpml, a);
gv.center_origin();
component c0 = Ep;
master_printf("TESTING CYLINDRICAL AT RESOLUTION %g FOR %s SOURCE...\n", a, component_name(c0));
structure s(gv, two, pml(dpml));
double m = 0;
fields f(&s, m);
double w = 0.5;
continuous_src_time src(w);
vec x0 = veccyl(0.5 * sr, 0);
f.add_point_source(c0, src, x0);
f.solve_cw(sizeof(realnum) == sizeof(float) ? 1e-5 : 1e-6);
component c = Ep;
const int N = 20;
double dr = sr / N;
complex<double> F[N], F0[N], EH[6];
double diff = 0.0, dot0 = 0.0;
complex<double> phase = polar(1.0, (4 * w * f.dt) * pi);
for (int i = 0; i < N; ++i) {
double rr = dr * i;
vec x = veccyl(rr, 0.5 * sz);
F[i] = f.get_field(c, x) * phase;
greencyl(EH, x, w, 2.0, 1.0, x0, c0, 1.0, m, 1e-6);
F0[i] = EH[EHcomp[c]] * 2.0 * pi * x0.r(); // Ey = Ep for \phi = 0 (rz = xz) plane
double d = abs(F0[i] - F[i]);
double f0 = abs(F0[i]);
diff += d * d;
dot0 += f0 * f0;
}
double relerr = sqrt(diff) / sqrt(dot0);
master_printf(" GREEN: %s -> %s, resolution %g: relerr = %g\n", component_name(c0),
component_name(c), a, relerr);
if (relerr > 0.05 * 30 / a) {
for (int i = 0; i < N; ++i)
master_printf("%g, %g,%g, %g,%g\n", dr * i, real(F[i]), imag(F[i]), real(F0[i]), imag(F0[i]));
return 0;
}
volume_list vl = volume_list(
volume(veccyl(0, 0.5 * sz), veccyl(sr, 0.5 * sz)), Sz, 1.0,
new volume_list(
volume(veccyl(sr, 0.5 * sz), veccyl(sr, -0.5 * sz)), Sr, 1.0,
new volume_list(volume(veccyl(0, -0.5 * sz), veccyl(sr, -0.5 * sz)), Sz, -1.0)));
dft_near2far n2f = f.add_dft_near2far(&vl, w, w, 1);
f.update_dfts();
n2f.scale_dfts(sqrt(2 * pi) / f.dt); // cancel time-integration factor
complex<double> EH_[6];
diff = 0.0, dot0 = 0.0;
for (int i = 0; i < N; ++i) {
double rr = dr * i;
vec x = veccyl(rr, 10.0 / w);
n2f.farfield_lowlevel(EH_, x);
sum_to_all(EH_, EH, 6);
F[i] = EH[EHcomp[c]] * phase;
greencyl(EH, x, w, 2.0, 1.0, x0, c0, 1.0, m, 1e-6);
F0[i] = EH[EHcomp[c]] * 2.0 * pi * x0.r();
double d = abs(F0[i] - F[i]);
double f0 = abs(F0[i]);
diff += d * d;
dot0 += f0 * f0;
}
relerr = sqrt(diff) / sqrt(dot0);
master_printf(" NEAR2FAR: %s -> %s, resolution %g: relerr = %g\n", component_name(c0),
component_name(c), a, relerr);
if (relerr > 0.05 * 30 / a) {
for (int i = 0; i < N; ++i)
master_printf("%g, %g,%g, %g,%g\n", dr * i, real(F[i]), imag(F[i]), real(F0[i]), imag(F0[i]));
return 0;
}
return 1;
}
int check_2d_3d(ndim dim, const double xmax, double a, component c0, component c1 = NO_COMPONENT,
bool evenz = true) {
const double dpml = 1;
if (dim != D2 && dim != D3) meep::abort("2d or 3d required");
grid_volume gv = dim == D2 ? vol2d(xmax + 2 * dpml, xmax + 2 * dpml, a)
: vol3d(xmax + 2 * dpml, xmax + 2 * dpml, xmax + 2 * dpml, a);
gv.center_origin();
if (!gv.has_field(c0)) return 1;
if (c1 != NO_COMPONENT && !gv.has_field(c1)) return 1;
master_printf("TESTING %s AT RESOLUTION %g FOR %s SOURCE...\n", dim == D2 ? "2D" : "3D", a,
component_name(c0));
if (c1 != NO_COMPONENT) master_printf(" (and %s SOURCE)\n", component_name(c1));
// HACK: to speed up tests, we assume c0 and c1 have these symmetries
symmetry S = dim == D3 ? (evenz ? mirror(Z, gv) - mirror(X, gv) : mirror(X, gv) - mirror(Z, gv))
: (evenz ? -mirror(X, gv) : mirror(X, gv)); // 2d
structure s(gv, two, pml(dpml), S);
fields f(&s);
double w = 0.30;
continuous_src_time src(w);
f.add_point_source(c0, src, zero_vec(dim));
if (c1 != NO_COMPONENT) f.add_point_source(c1, src, zero_vec(dim), 0.7654321);
f.solve_cw(sizeof(realnum) == sizeof(float) ? 1e-5 : 1e-6);
FOR_E_AND_H(c) {
if (gv.has_field(c)) {
const int N = 20;
double dx = 0.75 * (xmax / 4) / N;
complex<double> F[N], F0[N], EH[6];
double diff = 0.0, dot0 = 0.0, dot = 0.0;
complex<double> phase = polar(1.0, (4 * w * f.dt) * pi);
vec x0 = zero_vec(dim);
for (int i = 0; i < N; ++i) {
double s = xmax / 4 + dx * i;
vec x = dim == D2 ? vec(s, 0.5 * s) : vec(s, 0.5 * s, 0.3 * s);
F[i] = f.get_field(c, x) * phase;
(dim == D2 ? green2d : green3d)(EH, x, w, 2.0, 1.0, x0, c0, 1.0);
F0[i] = EH[EHcomp[c]];
if (c1 != NO_COMPONENT) {
(dim == D2 ? green2d : green3d)(EH, x, w, 2.0, 1.0, x0, c1, 0.7654321);
F0[i] += EH[EHcomp[c]];
}
double d = abs(F0[i] - F[i]);
double f = abs(F[i]);
double f0 = abs(F0[i]);
diff += d * d;
dot += f * f;
dot0 += f0 * f0;
}
if (dot0 == 0) continue; /* zero field component */
double relerr = sqrt(diff) / sqrt(dot0);
master_printf(" GREEN: %s -> %s, resolution %g: relerr = %g\n", component_name(c0),
component_name(c), a, relerr);
if (relerr > 0.05 * 30 / a) {
for (int i = 0; i < N; ++i)
master_printf("%g, %g,%g, %g,%g\n", xmax / 4 + dx * i, real(F[i]), imag(F[i]),
real(F0[i]), imag(F0[i]));
return 0;
}
}
}
const double L = xmax / 4;
volume_list vl =
dim == D2
? volume_list(
volume(vec(-L, +L), vec(+L, +L)), Sy, 1.0,
new volume_list(
volume(vec(+L, +L), vec(+L, -L)), Sx, 1.0,
new volume_list(volume(vec(-L, -L), vec(+L, -L)), Sy, -1.0,
new volume_list(volume(vec(-L, -L), vec(-L, +L)), Sx, -1.0))))
: volume_list(volume(vec(+L, -L, -L), vec(+L, +L, +L)), Sx, +1.,
new volume_list(
volume(vec(-L, -L, -L), vec(-L, +L, +L)), Sx, -1.,
new volume_list(
volume(vec(-L, +L, -L), vec(+L, +L, +L)), Sy, +1.,
new volume_list(
volume(vec(-L, -L, -L), vec(+L, -L, +L)), Sy, -1.,
new volume_list(
volume(vec(-L, -L, +L), vec(+L, +L, +L)), Sz, +1.,
new volume_list(volume(vec(-L, -L, -L), vec(+L, +L, -L)),
Sz, -1.))))));
dft_near2far n2f = f.add_dft_near2far(&vl, w, w, 1);
f.update_dfts();
n2f.scale_dfts(sqrt(2 * pi) / f.dt); // cancel time-integration factor
FOR_E_AND_H(c) {
if (gv.has_field(c)) {
const int N = 20;
double dx = 0.75 * (xmax / 4) / N;
complex<double> F[N], F0[N], EH_[6], EH[6];
double diff = 0.0, dot = 0.0;
complex<double> phase = polar(1.0, (4 * w * f.dt) * pi);
vec x0 = zero_vec(dim);
for (int i = 0; i < N; ++i) {
double s = xmax + dx * i;
vec x = dim == D2 ? vec(s, 0.5 * s) : vec(s, 0.5 * s, 0.3 * s);
n2f.farfield_lowlevel(EH_, x);
sum_to_all(EH_, EH, 6);
F[i] = EH[EHcomp[c]] * phase;
(dim == D2 ? green2d : green3d)(EH, x, w, 2.0, 1.0, x0, c0, 1.0);
F0[i] = EH[EHcomp[c]];
if (c1 != NO_COMPONENT) {
(dim == D2 ? green2d : green3d)(EH, x, w, 2.0, 1.0, x0, c1, 0.7654321);
F0[i] += EH[EHcomp[c]];
}
double d = abs(F0[i] - F[i]);
double f0 = abs(F0[i]);
diff += d * d;
dot += f0 * f0;
}
if (dot == 0) continue; /* zero field component */
double relerr = sqrt(diff) / sqrt(dot);
master_printf(" NEAR2FAR: %s -> %s, resolution %g: relerr = %g\n", component_name(c0),
component_name(c), a, relerr);
if (relerr > 0.05 * 30 / a) {
for (int i = 0; i < N; ++i)
master_printf("%g, %g,%g, %g,%g\n", xmax + dx * i, real(F[i]), imag(F[i]), real(F0[i]),
imag(F0[i]));
return 0;
}
}
}
return 1;
}
int main(int argc, char **argv) {
initialize mpi(argc, argv);
const double a2d = argc > 1 ? atof(argv[1]) : 20, a3d = argc > 1 ? a2d : 10;
if ((sizeof(realnum) == sizeof(double)) && !check_cyl(5.0, 10.0, 20.0)) return 1;
// NOTE: see hack above -- we require sources to be odd in Z and even in X or vice-versa
if (!check_2d_3d(D3, 4, a3d, Ez, Hx, false)) return 1;
#if defined(HAVE_JN) || defined(HAVE_LIBGSL) // required for Hankel functions in 2d near2far
if (!check_2d_3d(D2, 8, a2d, Ez, Hx, false)) return 1;
if (!check_2d_3d(D2, 8, a2d, Ex, Hz, true)) return 1;
#endif
return 0;
}