-
Notifications
You must be signed in to change notification settings - Fork 634
/
dft.cpp
1378 lines (1218 loc) · 51.5 KB
/
dft.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
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
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright (C) 2005-2021 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 of the License, 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
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include "meep.hpp"
#include "meep_internals.hpp"
using namespace std;
namespace meep {
std::vector<double> linspace(double freq_min, double freq_max, size_t Nfreq) {
double dfreq = Nfreq <= 1 ? 0.0 : (freq_max - freq_min) / (Nfreq - 1);
std::vector<double> freq(Nfreq);
if (Nfreq <= 1)
freq[0] = (freq_min + freq_max) * 0.5;
else
for (size_t i = 0; i < Nfreq; ++i)
freq[i] = freq_min + i * dfreq;
return freq;
}
struct dft_chunk_data { // for passing to field::loop_in_chunks as void*
component c;
int vc;
std::vector<double> omega;
complex<double> stored_weight, extra_weight;
double dt_factor;
bool include_dV_and_interp_weights;
bool sqrt_dV_and_interp_weights;
bool empty_dim[5];
dft_chunk *dft_chunks;
int decimation_factor;
};
dft_chunk::dft_chunk(fields_chunk *fc_, ivec is_, ivec ie_, vec s0_, vec s1_, vec e0_, vec e1_,
double dV0_, double dV1_, component c_, bool use_centered_grid,
complex<double> phase_factor, ivec shift_, const symmetry &S_, int sn_,
const void *data_) {
dft_chunk_data *data = (dft_chunk_data *)data_;
if (!fc_->f[c_][0]) meep::abort("invalid fields_chunk/component combination in dft_chunk");
fc = fc_;
is = is_;
ie = ie_;
s0 = s0_;
s1 = s1_;
e0 = e0_;
e1 = e1_;
dV0 = dV0_;
dV1 = dV1_;
c = c_;
if (use_centered_grid)
fc->gv.yee2cent_offsets(c, avg1, avg2);
else
avg1 = avg2 = 0;
stored_weight = data->stored_weight;
extra_weight = data->extra_weight;
scale = stored_weight * phase_factor * data->dt_factor;
/* this is for e.g. computing E x H, where we don't want to
multiply by the interpolation weights or the grid_volume twice. */
include_dV_and_interp_weights = data->include_dV_and_interp_weights;
/* an alternative way to avoid multipling by interpolation weights twice:
multiply by square root of the weights */
sqrt_dV_and_interp_weights = data->sqrt_dV_and_interp_weights;
shift = shift_;
S = S_;
sn = sn_;
vc = data->vc;
decimation_factor = data->decimation_factor;
const int Nomega = data->omega.size();
omega = data->omega;
dft_phase = new complex<realnum>[Nomega];
N = 1;
LOOP_OVER_DIRECTIONS(is.dim, d) { N *= (ie.in_direction(d) - is.in_direction(d)) / 2 + 1; }
dft = new complex<realnum>[N * Nomega];
for (size_t i = 0; i < N * Nomega; ++i)
dft[i] = 0.0;
for (int i = 0; i < 5; ++i)
empty_dim[i] = data->empty_dim[i];
next_in_chunk = fc->dft_chunks;
fc->dft_chunks = this;
next_in_dft = data->dft_chunks;
}
dft_chunk::~dft_chunk() {
delete[] dft;
delete[] dft_phase;
// delete from fields_chunk list
dft_chunk *cur = fc->dft_chunks;
if (cur == this)
fc->dft_chunks = next_in_chunk;
else {
while (cur && cur->next_in_chunk && cur->next_in_chunk != this)
cur = cur->next_in_chunk;
if (cur && cur->next_in_chunk == this) cur->next_in_chunk = next_in_chunk;
}
}
void dft_flux::remove() {
while (E) {
dft_chunk *nxt = E->next_in_dft;
delete E;
E = nxt;
}
while (H) {
dft_chunk *nxt = H->next_in_dft;
delete H;
H = nxt;
}
}
static void add_dft_chunkloop(fields_chunk *fc, int ichunk, component cgrid, ivec is, ivec ie,
vec s0, vec s1, vec e0, vec e1, double dV0, double dV1, ivec shift,
complex<double> shift_phase, const symmetry &S, int sn,
void *chunkloop_data) {
dft_chunk_data *data = (dft_chunk_data *)chunkloop_data;
(void)ichunk; // unused
component c = S.transform(data->c, -sn);
if (c >= NUM_FIELD_COMPONENTS || !fc->f[c][0]) return; // this chunk doesn't have component c
data->dft_chunks =
new dft_chunk(fc, is, ie, s0, s1, e0, e1, dV0, dV1, c, cgrid == Centered,
shift_phase * S.phase_shift(c, sn), shift, S, sn, chunkloop_data);
}
dft_chunk *fields::add_dft(component c, const volume &where, const double *freq, size_t Nfreq,
bool include_dV_and_interp_weights, complex<double> stored_weight,
dft_chunk *chunk_next, bool sqrt_dV_and_interp_weights,
complex<double> extra_weight, bool use_centered_grid,
int vc, int decimation_factor) {
if (coordinate_mismatch(gv.dim, c)) return NULL;
/* If you call add_dft before adding sources, it will do nothing
since no fields will be found. This is almost certainly not
what the user wants. */
if (!components_allocated)
meep::abort("allocate field components (by adding sources) before adding dft objects");
if (!include_dV_and_interp_weights && sqrt_dV_and_interp_weights)
meep::abort("include_dV_and_interp_weights must be true for sqrt_dV_and_interp_weights=true in "
"add_dft");
dft_chunk_data data;
data.c = c;
data.vc = vc;
if (decimation_factor == 0) {
double src_freq_max = 0;
for (src_time *s = sources; s; s = s->next) {
if (s->get_fwidth() == 0)
decimation_factor = 1;
else
src_freq_max = std::max(src_freq_max, std::abs(s->frequency().real())+0.5*s->get_fwidth());
}
double freq_max = 0;
for (size_t i = 0; i < Nfreq; ++i)
freq_max = std::max(freq_max, std::abs(freq[i]));
if ((freq_max > 0) && (src_freq_max > 0))
decimation_factor = std::max(1, int(std::floor(1/(dt*(freq_max + src_freq_max)))));
else
decimation_factor = 1;
}
data.decimation_factor = decimation_factor;
data.omega.resize(Nfreq);
for (size_t i = 0; i < Nfreq; ++i)
data.omega[i] = 2 * pi * freq[i];
data.stored_weight = stored_weight;
data.extra_weight = extra_weight;
data.dt_factor = dt / sqrt(2.0 * pi) * decimation_factor;
data.include_dV_and_interp_weights = include_dV_and_interp_weights;
data.sqrt_dV_and_interp_weights = sqrt_dV_and_interp_weights;
data.empty_dim[0] = data.empty_dim[1] = data.empty_dim[2] = data.empty_dim[3] =
data.empty_dim[4] = false;
LOOP_OVER_DIRECTIONS(where.dim, d) { data.empty_dim[d] = where.in_direction(d) == 0; }
data.dft_chunks = chunk_next;
loop_in_chunks(add_dft_chunkloop, (void *)&data, where, use_centered_grid ? Centered : c);
return data.dft_chunks;
}
dft_chunk *fields::add_dft(const volume_list *where, const std::vector<double> &freq,
bool include_dV_and_interp_weights) {
dft_chunk *chunks = 0;
while (where) {
if (is_derived(where->c)) meep::abort("derived_component invalid for dft");
complex<double> stored_weight = where->weight;
chunks = add_dft(component(where->c), where->v, freq, include_dV_and_interp_weights,
stored_weight, chunks);
where = where->next;
}
return chunks;
}
void fields::update_dfts() {
am_now_working_on(FourierTransforming);
for (int i = 0; i < num_chunks; i++)
if (chunks[i]->is_mine()) chunks[i]->update_dfts(time(), time() - 0.5 * dt, t);
finished_working();
}
void fields_chunk::update_dfts(double timeE, double timeH, int current_step) {
if (doing_solve_cw) return;
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_chunk) {
if ((current_step % cur->get_decimation_factor()) == 0) {
cur->update_dft(is_magnetic(cur->c) ? timeH : timeE);
}
}
}
void dft_chunk::update_dft(double time) {
if (!fc->f[c][0]) return;
const int Nomega = omega.size();
for (int i = 0; i < Nomega; ++i)
dft_phase[i] = polar(1.0, omega[i] * time) * scale;
int numcmp = fc->f[c][1] ? 2 : 1;
PLOOP_OVER_IVECS(fc->gv, is, ie, idx) {
size_t idx_dft = IVEC_LOOP_COUNTER;
double w;
if (include_dV_and_interp_weights) {
w = IVEC_LOOP_WEIGHT(s0, s1, e0, e1, dV0 + dV1 * loop_i2);
if (sqrt_dV_and_interp_weights) w = sqrt(w);
}
else
w = 1.0;
realnum f[2]; // real/imag field value at epsilon point
if (avg2)
for (int cmp = 0; cmp < numcmp; ++cmp)
f[cmp] = (w * 0.25) * (fc->f[c][cmp][idx] + fc->f[c][cmp][idx + avg1] +
fc->f[c][cmp][idx + avg2] + fc->f[c][cmp][idx + (avg1 + avg2)]);
else if (avg1)
for (int cmp = 0; cmp < numcmp; ++cmp)
f[cmp] = (w * 0.5) * (fc->f[c][cmp][idx] + fc->f[c][cmp][idx + avg1]);
else
for (int cmp = 0; cmp < numcmp; ++cmp)
f[cmp] = w * fc->f[c][cmp][idx];
if (numcmp == 2) {
complex<realnum> fc(f[0], f[1]);
for (int i = 0; i < Nomega; ++i)
dft[Nomega * idx_dft + i] += dft_phase[i] * fc;
}
else {
realnum fr = f[0];
for (int i = 0; i < Nomega; ++i)
dft[Nomega * idx_dft + i] += std::complex<realnum>{fr * dft_phase[i].real(), fr * dft_phase[i].imag()};
}
}
}
/* Return the L2 norm of the DFTs themselves. This is useful
to check whether the simulation is finished (whether all relevant fields have decayed).
(Collective operation.) */
double fields::dft_norm() {
am_now_working_on(Other);
double sum = 0.0;
for (int i = 0; i < num_chunks; i++)
if (chunks[i]->is_mine()) sum += chunks[i]->dft_norm2();
finished_working();
return std::sqrt(sum_to_all(sum));
}
double fields_chunk::dft_norm2() const {
double sum = 0.0;
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_chunk)
sum += cur->norm2();
return sum;
}
static double sqr(std::complex<realnum> x) { return (x*std::conj(x)).real(); }
double dft_chunk::norm2() const {
if (!fc->f[c][0]) return 0.0;
double sum = 0.0;
size_t idx_dft = 0;
const int Nomega = omega.size();
LOOP_OVER_IVECS(fc->gv, is, ie, idx) {
for (int i = 0; i < Nomega; ++i)
sum += sqr(dft[Nomega * idx_dft + i]);
idx_dft++;
}
return sum;
}
// return the maximum decimation factor across
// all dft regions
int fields::max_decimation() const {
int maxdec = 1;
for (int i = 0; i < num_chunks; i++)
if (chunks[i]->is_mine())
maxdec = std::max(maxdec, chunks[i]->max_decimation());
return max_to_all(maxdec);
}
int fields_chunk::max_decimation() const {
int maxdec = std::numeric_limits<int>::min();
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_chunk)
maxdec = std::max(maxdec, cur->get_decimation_factor());
return maxdec;
}
// return the maximum abs(freq) over all DFT chunks
double fields::dft_maxfreq() const {
double maxfreq = 0;
for (int i = 0; i < num_chunks; i++)
if (chunks[i]->is_mine())
maxfreq = std::max(maxfreq, chunks[i]->dft_maxfreq());
return max_to_all(maxfreq);
}
double fields_chunk::dft_maxfreq() const {
double maxomega = 0;
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_chunk)
maxomega = std::max(maxomega, cur->maxomega());
return maxomega / (2*meep::pi);
}
double dft_chunk::maxomega() const {
double maxomega = 0;
for (const auto& o : omega)
maxomega = std::max(maxomega, std::abs(o));
return maxomega;
}
void dft_chunk::scale_dft(complex<double> scale) {
for (size_t i = 0; i < N * omega.size(); ++i)
dft[i] *= scale;
if (next_in_dft) next_in_dft->scale_dft(scale);
}
void dft_chunk::operator-=(const dft_chunk &chunk) {
if (c != chunk.c || N * omega.size() != chunk.N * chunk.omega.size())
meep::abort("Mismatched chunks in dft_chunk::operator-=");
for (size_t i = 0; i < N * omega.size(); ++i)
dft[i] -= chunk.dft[i];
if (next_in_dft) {
if (!chunk.next_in_dft) meep::abort("Mismatched chunk lists in dft_chunk::operator-=");
*next_in_dft -= *chunk.next_in_dft;
}
}
size_t my_dft_chunks_Ntotal(dft_chunk *dft_chunks, size_t *my_start) {
// When writing to a sharded file, we write out only the chunks we own.
size_t n = 0;
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_dft)
n += cur->N * cur->omega.size() * 2;
*my_start = 0;
return n;
}
size_t dft_chunks_Ntotal(dft_chunk *dft_chunks, size_t *my_start) {
// If writing to a single parallel file, we are compute our chunks offset
// into the single-parallel-file that has all the data.
size_t n = my_dft_chunks_Ntotal(dft_chunks, my_start);
*my_start = partial_sum_to_all(n) - n; // sum(n) for processes before this
return sum_to_all(n);
}
size_t dft_chunks_Ntotal(dft_chunk *dft_chunks, size_t *my_start, bool single_parallel_file) {
return single_parallel_file ? dft_chunks_Ntotal(dft_chunks, my_start) :
my_dft_chunks_Ntotal(dft_chunks, my_start);
}
// Note: the file must have been created in parallel mode, typically via fields::open_h5file.
void save_dft_hdf5(dft_chunk *dft_chunks, const char *name, h5file *file, const char *dprefix, bool single_parallel_file) {
size_t istart;
size_t n = dft_chunks_Ntotal(dft_chunks, &istart, single_parallel_file);
char dataname[1024];
snprintf(dataname, 1024,
"%s%s"
"%s_dft",
dprefix ? dprefix : "", dprefix && dprefix[0] ? "_" : "", name);
file->create_data(dataname, 1, &n);
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_dft) {
size_t Nchunk = cur->N * cur->omega.size() * 2;
file->write_chunk(1, &istart, &Nchunk, (realnum *)cur->dft);
istart += Nchunk;
}
file->done_writing_chunks();
}
void save_dft_hdf5(dft_chunk *dft_chunks, component c, h5file *file, const char *dprefix, bool single_parallel_file) {
save_dft_hdf5(dft_chunks, component_name(c), file, dprefix, single_parallel_file);
}
void load_dft_hdf5(dft_chunk *dft_chunks, const char *name, h5file *file, const char *dprefix, bool single_parallel_file) {
size_t istart;
size_t n = dft_chunks_Ntotal(dft_chunks, &istart, single_parallel_file);
char dataname[1024];
snprintf(dataname, 1024,
"%s%s"
"%s_dft",
dprefix ? dprefix : "", dprefix && dprefix[0] ? "_" : "", name);
int file_rank;
size_t file_dims;
file->read_size(dataname, &file_rank, &file_dims, 1);
if (file_rank != 1 || file_dims != n)
meep::abort("incorrect dataset size (%zd vs. %zd) in load_dft_hdf5 %s:%s", file_dims, n,
file->file_name(), dataname);
for (dft_chunk *cur = dft_chunks; cur; cur = cur->next_in_dft) {
size_t Nchunk = cur->N * cur->omega.size() * 2;
file->read_chunk(1, &istart, &Nchunk, (realnum *)cur->dft);
istart += Nchunk;
}
}
void load_dft_hdf5(dft_chunk *dft_chunks, component c, h5file *file, const char *dprefix, bool single_parallel_file) {
load_dft_hdf5(dft_chunks, component_name(c), file, dprefix, single_parallel_file);
}
dft_flux::dft_flux(const component cE_, const component cH_, dft_chunk *E_, dft_chunk *H_,
double fmin, double fmax, int Nf, const volume &where_,
direction normal_direction_, bool use_symmetry_)
: E(E_), H(H_), cE(cE_), cH(cH_), where(where_), normal_direction(normal_direction_),
use_symmetry(use_symmetry_) {
freq = meep::linspace(fmin, fmax, Nf);
}
dft_flux::dft_flux(const component cE_, const component cH_, dft_chunk *E_, dft_chunk *H_,
const std::vector<double> &freq_, const volume &where_,
direction normal_direction_, bool use_symmetry_)
: E(E_), H(H_), cE(cE_), cH(cH_), where(where_), normal_direction(normal_direction_),
use_symmetry(use_symmetry_) {
freq = freq_;
}
dft_flux::dft_flux(const component cE_, const component cH_, dft_chunk *E_, dft_chunk *H_,
const double *freq_, size_t Nfreq, const volume &where_,
direction normal_direction_, bool use_symmetry_)
: freq(Nfreq), E(E_), H(H_), cE(cE_), cH(cH_), where(where_),
normal_direction(normal_direction_), use_symmetry(use_symmetry_) {
for (size_t i = 0; i < Nfreq; ++i)
freq[i] = freq_[i];
}
dft_flux::dft_flux(const dft_flux &f) : where(f.where) {
freq = f.freq;
E = f.E;
H = f.H;
cE = f.cE;
cH = f.cH;
normal_direction = f.normal_direction;
use_symmetry = f.use_symmetry;
}
double *dft_flux::flux() {
const size_t Nfreq = freq.size();
double *F = new double[Nfreq];
for (size_t i = 0; i < Nfreq; ++i)
F[i] = 0;
for (dft_chunk *curE = E, *curH = H; curE && curH;
curE = curE->next_in_dft, curH = curH->next_in_dft)
for (size_t k = 0; k < curE->N; ++k)
for (size_t i = 0; i < Nfreq; ++i)
F[i] += real(curE->dft[k * Nfreq + i] * conj(curH->dft[k * Nfreq + i]));
double *Fsum = new double[Nfreq];
sum_to_all(F, Fsum, int(Nfreq));
delete[] F;
return Fsum;
}
void dft_flux::save_hdf5(h5file *file, const char *dprefix) {
save_dft_hdf5(E, cE, file, dprefix);
file->prevent_deadlock(); // hackery
save_dft_hdf5(H, cH, file, dprefix);
}
void dft_flux::load_hdf5(h5file *file, const char *dprefix) {
load_dft_hdf5(E, cE, file, dprefix);
file->prevent_deadlock(); // hackery
load_dft_hdf5(H, cH, file, dprefix);
}
void dft_flux::save_hdf5(fields &f, const char *fname, const char *dprefix, const char *prefix) {
h5file *ff = f.open_h5file(fname, h5file::WRITE, prefix);
save_hdf5(ff, dprefix);
delete ff;
}
void dft_flux::load_hdf5(fields &f, const char *fname, const char *dprefix, const char *prefix) {
h5file *ff = f.open_h5file(fname, h5file::READONLY, prefix);
load_hdf5(ff, dprefix);
delete ff;
}
void dft_flux::scale_dfts(complex<double> scale) {
if (E) E->scale_dft(scale);
if (H) H->scale_dft(scale);
}
dft_flux fields::add_dft_flux(const volume_list *where_, const double *freq, size_t Nfreq,
bool use_symmetry, bool centered_grid, int decimation_factor) {
if (!where_) // handle empty list of volumes
return dft_flux(Ex, Hy, NULL, NULL, freq, Nfreq, v, NO_DIRECTION, use_symmetry);
dft_chunk *E = 0, *H = 0;
component cE[2] = {Ex, Ey}, cH[2] = {Hy, Hx};
// the dft_flux object needs to store the (unreduced) volume for
// mode-coefficient computation in mpb.cpp, but this only works
// when the volume_list consists of a single volume, so it suffices
// to store the first volume in the list.
volume firstvol(where_->v);
volume_list *where = use_symmetry ? S.reduce(where_) : new volume_list(where_);
volume_list *where_save = where;
while (where) {
derived_component c = derived_component(where->c);
if (coordinate_mismatch(gv.dim, component_direction(c)))
meep::abort("coordinate-type mismatch in add_dft_flux");
switch (c) {
case Sx: cE[0] = Ey, cE[1] = Ez, cH[0] = Hz, cH[1] = Hy; break;
case Sy: cE[0] = Ez, cE[1] = Ex, cH[0] = Hx, cH[1] = Hz; break;
case Sr: cE[0] = Ep, cE[1] = Ez, cH[0] = Hz, cH[1] = Hp; break;
case Sp: cE[0] = Ez, cE[1] = Er, cH[0] = Hr, cH[1] = Hz; break;
case Sz:
if (gv.dim == Dcyl)
cE[0] = Er, cE[1] = Ep, cH[0] = Hp, cH[1] = Hr;
else
cE[0] = Ex, cE[1] = Ey, cH[0] = Hy, cH[1] = Hx;
break;
default: meep::abort("invalid flux component!");
}
for (int i = 0; i < 2; ++i) {
E = add_dft(cE[i], where->v, freq, Nfreq, true,
where->weight * double(1 - 2 * i), E, false, std::complex<double>(1.0,0),
centered_grid, 0, decimation_factor);
H = add_dft(cH[i], where->v, freq, Nfreq, false, 1.0, H, false, std::complex<double>(1.0,0),
centered_grid, 0, decimation_factor);
}
where = where->next;
}
delete where_save;
// if the volume list has only one entry, store its component's direction.
// if the volume list has > 1 entry, store NO_DIRECTION.
direction flux_dir = (where_->next ? NO_DIRECTION : component_direction(where_->c));
return dft_flux(cE[0], cH[0], E, H, freq, Nfreq, firstvol, flux_dir, use_symmetry);
}
dft_energy::dft_energy(dft_chunk *E_, dft_chunk *H_, dft_chunk *D_, dft_chunk *B_, double fmin,
double fmax, int Nf, const volume &where_)
: E(E_), H(H_), D(D_), B(B_), where(where_) {
freq = meep::linspace(fmin, fmax, Nf);
}
dft_energy::dft_energy(dft_chunk *E_, dft_chunk *H_, dft_chunk *D_, dft_chunk *B_,
const std::vector<double> &freq_, const volume &where_)
: E(E_), H(H_), D(D_), B(B_), where(where_) {
freq = freq_;
}
dft_energy::dft_energy(dft_chunk *E_, dft_chunk *H_, dft_chunk *D_, dft_chunk *B_,
const double *freq_, size_t Nfreq, const volume &where_)
: freq(Nfreq), E(E_), H(H_), D(D_), B(B_), where(where_) {
for (size_t i = 0; i < Nfreq; ++i)
freq[i] = freq_[i];
}
dft_energy::dft_energy(const dft_energy &f) : where(f.where) {
freq = f.freq;
E = f.E;
H = f.H;
D = f.D;
B = f.B;
}
double *dft_energy::electric() {
const size_t Nfreq = freq.size();
double *F = new double[Nfreq];
for (size_t i = 0; i < Nfreq; ++i)
F[i] = 0;
for (dft_chunk *curE = E, *curD = D; curE && curD;
curE = curE->next_in_dft, curD = curD->next_in_dft)
for (size_t k = 0; k < curE->N; ++k)
for (size_t i = 0; i < Nfreq; ++i)
F[i] += 0.5 * real(conj(curE->dft[k * Nfreq + i]) * curD->dft[k * Nfreq + i]);
double *Fsum = new double[Nfreq];
sum_to_all(F, Fsum, int(Nfreq));
delete[] F;
return Fsum;
}
double *dft_energy::magnetic() {
const size_t Nfreq = freq.size();
double *F = new double[Nfreq];
for (size_t i = 0; i < Nfreq; ++i)
F[i] = 0;
for (dft_chunk *curH = H, *curB = B; curH && curB;
curH = curH->next_in_dft, curB = curB->next_in_dft)
for (size_t k = 0; k < curH->N; ++k)
for (size_t i = 0; i < Nfreq; ++i)
F[i] += 0.5 * real(conj(curH->dft[k * Nfreq + i]) * curB->dft[k * Nfreq + i]);
double *Fsum = new double[Nfreq];
sum_to_all(F, Fsum, int(Nfreq));
delete[] F;
return Fsum;
}
double *dft_energy::total() {
const size_t Nfreq = freq.size();
double *Fe = electric();
double *Fm = magnetic();
double *F = new double[Nfreq];
for (size_t i = 0; i < Nfreq; ++i)
F[i] = Fe[i] + Fm[i];
delete[] Fe;
delete[] Fm;
return F;
}
dft_energy fields::add_dft_energy(const volume_list *where_, const double *freq, size_t Nfreq,
int decimation_factor) {
if (!where_) // handle empty list of volumes
return dft_energy(NULL, NULL, NULL, NULL, freq, Nfreq, v);
dft_chunk *E = 0, *D = 0, *H = 0, *B = 0;
volume firstvol(where_->v);
volume_list *where = new volume_list(where_);
volume_list *where_save = where;
while (where) {
LOOP_OVER_FIELD_DIRECTIONS(gv.dim, d) {
E = add_dft(direction_component(Ex, d), where->v, freq, Nfreq, true, 1.0, E,
false, 1.0, true, 0, decimation_factor);
D = add_dft(direction_component(Dx, d), where->v, freq, Nfreq, false, 1.0, D,
false, 1.0, true, 0, decimation_factor);
H = add_dft(direction_component(Hx, d), where->v, freq, Nfreq, true, 1.0, H,
false, 1.0, true, 0, decimation_factor);
B = add_dft(direction_component(Bx, d), where->v, freq, Nfreq, false, 1.0, B,
false, 1.0, true, 0, decimation_factor);
}
where = where->next;
}
delete where_save;
return dft_energy(E, H, D, B, freq, Nfreq, firstvol);
}
void dft_energy::save_hdf5(h5file *file, const char *dprefix) {
save_dft_hdf5(E, "E", file, dprefix);
file->prevent_deadlock(); // hackery
save_dft_hdf5(D, "D", file, dprefix);
file->prevent_deadlock(); // hackery
save_dft_hdf5(H, "H", file, dprefix);
file->prevent_deadlock(); // hackery
save_dft_hdf5(B, "B", file, dprefix);
}
void dft_energy::load_hdf5(h5file *file, const char *dprefix) {
load_dft_hdf5(E, "E", file, dprefix);
file->prevent_deadlock(); // hackery
load_dft_hdf5(D, "D", file, dprefix);
file->prevent_deadlock(); // hackery
load_dft_hdf5(H, "H", file, dprefix);
file->prevent_deadlock(); // hackery
load_dft_hdf5(B, "B", file, dprefix);
}
void dft_energy::save_hdf5(fields &f, const char *fname, const char *dprefix, const char *prefix) {
h5file *ff = f.open_h5file(fname, h5file::WRITE, prefix);
save_hdf5(ff, dprefix);
delete ff;
}
void dft_energy::load_hdf5(fields &f, const char *fname, const char *dprefix, const char *prefix) {
h5file *ff = f.open_h5file(fname, h5file::READONLY, prefix);
load_hdf5(ff, dprefix);
delete ff;
}
void dft_energy::scale_dfts(complex<double> scale) {
if (E) E->scale_dft(scale);
if (D) D->scale_dft(scale);
if (H) H->scale_dft(scale);
if (B) B->scale_dft(scale);
}
void dft_energy::remove() {
while (E) {
dft_chunk *nxt = E->next_in_dft;
delete E;
E = nxt;
}
while (D) {
dft_chunk *nxt = D->next_in_dft;
delete D;
D = nxt;
}
while (H) {
dft_chunk *nxt = H->next_in_dft;
delete H;
H = nxt;
}
while (B) {
dft_chunk *nxt = B->next_in_dft;
delete B;
B = nxt;
}
}
direction fields::normal_direction(const volume &where) const {
direction d = where.normal_direction();
if (d == NO_DIRECTION) {
/* hack so that we still infer the normal direction correctly for
volumes with empty dimensions */
volume where_pad(where);
LOOP_OVER_DIRECTIONS(where.dim, d1) {
if (nosize_direction(d1) && where.in_direction(d1) == 0.0)
where_pad.set_direction_max(d1, where.in_direction_min(d1) + 0.1);
}
d = where_pad.normal_direction();
if (d == NO_DIRECTION && gv.dim == D2 && beta != 0 && where_pad.in_direction(X) > 0 &&
where_pad.in_direction(Y) > 0)
d = Z;
if (d == NO_DIRECTION) meep::abort("Could not determine normal direction for given grid_volume.");
}
return d;
}
dft_flux fields::add_dft_flux(direction d, const volume &where, const double *freq, size_t Nfreq,
bool use_symmetry, bool centered_grid, int decimation_factor) {
if (d == NO_DIRECTION) d = normal_direction(where);
volume_list vl(where, direction_component(Sx, d));
dft_flux flux = add_dft_flux(&vl, freq, Nfreq, use_symmetry, centered_grid, decimation_factor);
flux.normal_direction = d;
return flux;
}
dft_flux fields::add_mode_monitor(direction d, const volume &where, const double *freq,
size_t Nfreq, bool centered_grid, int decimation_factor) {
return add_dft_flux(d, where, freq, Nfreq, /*use_symmetry=*/false, centered_grid, decimation_factor);
}
dft_flux fields::add_dft_flux_box(const volume &where, double freq_min, double freq_max,
int Nfreq) {
return add_dft_flux_box(where, meep::linspace(freq_min, freq_max, Nfreq));
}
dft_flux fields::add_dft_flux_box(const volume &where, const std::vector<double> &freq) {
volume_list *faces = 0;
LOOP_OVER_DIRECTIONS(where.dim, d) {
if (where.in_direction(d) > 0) {
volume face(where);
derived_component c = direction_component(Sx, d);
face.set_direction_min(d, where.in_direction_max(d));
faces = new volume_list(face, c, +1, faces);
face.set_direction_min(d, where.in_direction_min(d));
face.set_direction_max(d, where.in_direction_min(d));
faces = new volume_list(face, c, -1, faces);
}
}
dft_flux flux = add_dft_flux(faces, freq);
delete faces;
return flux;
}
dft_flux fields::add_dft_flux_plane(const volume &where, double freq_min, double freq_max,
int Nfreq) {
return add_dft_flux_plane(where, meep::linspace(freq_min, freq_max, Nfreq));
}
dft_flux fields::add_dft_flux_plane(const volume &where, const std::vector<double> &freq) {
return add_dft_flux(NO_DIRECTION, where, freq);
}
dft_fields::dft_fields(dft_chunk *chunks_, double freq_min, double freq_max, int Nf,
const volume &where_)
: where(where_) {
chunks = chunks_;
freq = meep::linspace(freq_min, freq_max, Nf);
}
dft_fields::dft_fields(dft_chunk *chunks_, const std::vector<double> &freq_, const volume &where_)
: where(where_) {
chunks = chunks_;
freq = freq_;
}
dft_fields::dft_fields(dft_chunk *chunks_, const double *freq_, size_t Nfreq, const volume &where_)
: freq(Nfreq), where(where_) {
chunks = chunks_;
for (size_t i = 0; i < Nfreq; ++i)
freq[i] = freq_[i];
}
void dft_fields::scale_dfts(complex<double> scale) { chunks->scale_dft(scale); }
void dft_fields::remove() {
while (chunks) {
dft_chunk *nxt = chunks->next_in_dft;
delete chunks;
chunks = nxt;
}
}
dft_fields fields::add_dft_fields(component *components, int num_components, const volume where,
const double *freq, size_t Nfreq, bool use_centered_grid,
int decimation_factor) {
bool include_dV_and_interp_weights = false;
bool sqrt_dV_and_interp_weights = false; // default option from meep.hpp (expose to user?)
std::complex<double> extra_weight = 1.0; // default option from meep.hpp (expose to user?)
complex<double> stored_weight = 1.0;
dft_chunk *chunks = NULL;
for (int nc = 0; nc < num_components; nc++)
chunks = add_dft(components[nc], where, freq, Nfreq, include_dV_and_interp_weights,
stored_weight, chunks, sqrt_dV_and_interp_weights, extra_weight,
use_centered_grid, 0, decimation_factor);
return dft_fields(chunks, freq, Nfreq, where);
}
/***************************************************************/
/* chunk-level processing for fields::process_dft_component. */
/***************************************************************/
complex<double> dft_chunk::process_dft_component(int rank, direction *ds, ivec min_corner, ivec max_corner,
int num_freq, h5file *file, realnum *buffer, int reim,
complex<realnum> *field_array, void *mode1_data, void *mode2_data,
int ic_conjugate, bool retain_interp_weights,
fields *parent) {
if ((num_freq < 0) || (num_freq > static_cast<int>(omega.size())-1))
meep::abort("process_dft_component: frequency index %d is outside the range of the frequency array of size %lu",num_freq,omega.size());
/*****************************************************************/
/* compute the size of the chunk we own and its strides etc. */
/*****************************************************************/
size_t start[3] = {0, 0, 0};
size_t file_count[3] = {1, 1, 1}, array_count[3] = {1, 1, 1};
int file_offset[3] = {0, 0, 0};
int file_stride[3] = {1, 1, 1};
ivec isS = S.transform(is, sn) + shift;
ivec ieS = S.transform(ie, sn) + shift;
ivec permute(zero_ivec(fc->gv.dim));
for (int i = 0; i < 3; ++i)
permute.set_direction(fc->gv.yucky_direction(i), i);
permute = S.transform_unshifted(permute, sn);
LOOP_OVER_DIRECTIONS(permute.dim, d) { permute.set_direction(d, abs(permute.in_direction(d))); }
for (int i = 0; i < rank; ++i) {
direction d = ds[i];
int isd = isS.in_direction(d), ied = ieS.in_direction(d);
start[i] = (std::min(isd, ied) - min_corner.in_direction(d)) / 2;
file_count[i] = abs(ied - isd) / 2 + 1;
if (ied < isd) file_offset[permute.in_direction(d)] = file_count[i] - 1;
array_count[i] = (max_corner.in_direction(d) - min_corner.in_direction(d)) / 2 + 1;
}
for (int i = 0; i < rank; ++i) {
direction d = ds[i];
int j = permute.in_direction(d);
for (int k = i + 1; k < rank; ++k)
file_stride[j] *= file_count[k];
file_offset[j] *= file_stride[j];
if (file_offset[j]) file_stride[j] *= -1;
}
/*****************************************************************/
/* For collapsing empty dimensions, we want to retain interpolation
weights for empty dimensions, but not interpolation weights for
integration of edge pixels (for retain_interp_weights == true).
All of the weights are stored in (s0, s1, e0, e1), so we make
a copy of these with the weights for non-empty dimensions set to 1. */
vec s0i(s0), s1i(s1), e0i(e0), e1i(e1);
LOOP_OVER_DIRECTIONS(fc->gv.dim, d) {
if (!empty_dim[d]) {
s0i.set_direction(d, 1.0);
s1i.set_direction(d, 1.0);
e0i.set_direction(d, 1.0);
e1i.set_direction(d, 1.0);
}
}
/***************************************************************/
/* loop over all grid points in our piece of the volume */
/***************************************************************/
vec rshift(shift * (0.5 * fc->gv.inva));
int chunk_idx = 0;
complex<double> integral = 0.0;
component c_conjugate = (component)(ic_conjugate >= 0 ? ic_conjugate : -ic_conjugate);
LOOP_OVER_IVECS(fc->gv, is, ie, idx) {
IVEC_LOOP_LOC(fc->gv, loc);
loc = S.transform(loc, sn) + rshift;
double w = IVEC_LOOP_WEIGHT(s0, s1, e0, e1, dV0 + dV1 * loop_i2);
double interp_w = retain_interp_weights ? IVEC_LOOP_WEIGHT(s0i, s1i, e0i, e1i, 1.0) : 1.0;
complex<double> dft_val =
(c_conjugate == NO_COMPONENT
? w
: c_conjugate == Dielectric
? parent->get_eps(loc)
: c_conjugate == Permeability
? parent->get_mu(loc)
: complex<double>(dft[omega.size() * (chunk_idx++) + num_freq]) / stored_weight);
if (include_dV_and_interp_weights) dft_val /= (sqrt_dV_and_interp_weights ? sqrt(w) : w);
complex<double> mode1val = 0.0, mode2val = 0.0;
if (mode1_data) mode1val = eigenmode_amplitude(mode1_data, loc, S.transform(c_conjugate, sn));
if (mode2_data) mode2val = eigenmode_amplitude(mode2_data, loc, S.transform(c, sn));
if (file) {
int idx2 = ((((file_offset[0] + file_offset[1] + file_offset[2]) + loop_i1 * file_stride[0]) +
loop_i2 * file_stride[1]) +
loop_i3 * file_stride[2]);
dft_val *= interp_w;
complex<double> val = (mode1_data ? mode1val : dft_val);
buffer[idx2] = reim ? imag(val) : real(val);
}
else if (field_array) {
IVEC_LOOP_ILOC(fc->gv, iloc); // iloc <-- indices of parent point in Yee grid
iloc = S.transform(iloc, sn) + shift; // iloc <-- indices of child point in Yee grid
iloc -= min_corner; // iloc <-- 2*(indices of point in DFT array)
// the index of point n1 or (n1,n2) or (n1,n2,n3) in a 1D, 2D, or 3D array is
// (for a 1D array) n1
// (for a 2D array) n2 + n1*N2
// (for a 3D array) n3 + n2*N3 + n1*N2*N3
// where NI = number of points in Ith direction.
int idx2 = 0;
for (int i = rank - 1, stride = 1; i >= 0; stride *= array_count[i--])
idx2 += stride * (iloc.in_direction(ds[i]) / 2);
field_array[idx2] = interp_w * dft_val;
}
else {
mode1val = conj(mode1val); // conjugated inner product
if (mode2_data)
integral += w * mode1val * mode2val;
else
integral += w * mode1val * dft_val;
}
} // LOOP_OVER_IVECS(fc->gv, is, ie, idx)
if (file) file->write_chunk(rank, start, file_count, buffer);
return integral;
}
/***************************************************************/
/* low-level [actually intermediate-level, since it calls */
/* dft_chunk::process_dft_component(), which is the true */
/* low-level function] workhorse routine that forms the common */
/* backend for several operations involving DFT fields. */
/* */
/* looks through the given collection of dft_chunks and */
/* processes only those chunks that store component c, using */
/* only data for frequency #num_freq. */
/* */
/* the meaning of 'processes' depends on the arguments: */
/* */
/* 1. if HDF5FileName is non-null: write to the given HDF5 */