/
meepgeom.cpp
1598 lines (1392 loc) · 50.6 KB
/
meepgeom.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-2015 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.
*/
#include <vector>
#include "meepgeom.hpp"
namespace meep_geom {
#define master_printf meep::master_printf
/***************************************************************/
/* global variables for default material */
/***************************************************************/
medium_struct vacuum_medium =
{ {1.0, 1.0, 1.0}, /* epsilon_diag */
{0.0, 0.0, 0.0}, /* epsilon_offdiag */
{1.0, 1.0, 1.0}, /* mu_diag */
{0.0, 0.0, 0.0}, /* mu_offdiag */
{0, 0}, /* E_susceptibilities */
{0, 0}, /* H_susceptibilities */
{0.0, 0.0, 0.0}, /* E_chi2_diag */
{0.0, 0.0, 0.0}, /* E_chi3_diag */
{0.0, 0.0, 0.0}, /* H_chi2_diag */
{0.0, 0.0, 0.0}, /* H_chi3_diag */
{0.0, 0.0, 0.0}, /* D_conductivity_diag */
{0.0, 0.0, 0.0} /* B_conductivity_diag */
};
material_data vacuum_material_data =
{ material_data::MEDIUM, vacuum_medium, 0, 0, 0, {0,0,0} };
material_type vacuum = &vacuum_material_data;
static bool susceptibility_equal(const susceptibility &s1, const susceptibility &s2)
{
return (vector3_equal(s1.sigma_diag, s2.sigma_diag) &&
vector3_equal(s1.sigma_offdiag, s2.sigma_offdiag) &&
s1.frequency == s2.frequency && s1.gamma == s2.gamma &&
s1.noise_amp == s2.noise_amp && s1.drude == s2.drude &&
s1.is_file == s2.is_file);
}
static bool susceptibility_list_equal(const susceptibility_list &s1, const susceptibility_list &s2)
{
if (s1.num_items != s2.num_items) return false;
for (int i = 0; i < s1.num_items; ++i)
if (!susceptibility_equal(s1.items[i], s2.items[i]))
return false;
return true;
}
static bool medium_struct_equal(const medium_struct *m1, const medium_struct *m2)
{
return (vector3_equal(m1->epsilon_diag, m2->epsilon_diag) &&
vector3_equal(m1->epsilon_offdiag, m2->epsilon_offdiag) &&
vector3_equal(m1->mu_diag, m2->mu_diag) &&
vector3_equal(m1->mu_offdiag, m2->mu_offdiag) &&
vector3_equal(m1->E_chi2_diag, m2->E_chi2_diag) &&
vector3_equal(m1->E_chi3_diag, m2->E_chi3_diag) &&
vector3_equal(m1->H_chi2_diag, m2->H_chi2_diag) &&
vector3_equal(m1->D_conductivity_diag, m2->D_conductivity_diag) &&
vector3_equal(m1->B_conductivity_diag, m2->B_conductivity_diag) &&
susceptibility_list_equal(m1->E_susceptibilities, m2->E_susceptibilities) &&
susceptibility_list_equal(m1->H_susceptibilities, m2->H_susceptibilities));
}
static bool material_type_equal(const material_type m1, const material_type m2)
{
if (m1 == m2) return true;
if (m1->which_subclass != m2->which_subclass) return false;
switch (m1->which_subclass) {
case material_data::MATERIAL_FILE: case material_data::PERFECT_METAL: return true;
case material_data::MATERIAL_USER: return m1->user_func == m2->user_func && m1->user_data == m2->user_data;
case material_data::MEDIUM: return medium_struct_equal( &(m1->medium), &(m2->medium));
default: return false;
}
}
/***************************************************************/
/***************************************************************/
/***************************************************************/
typedef struct {
double m00, m01, m02,
m11, m12,
m22;
} symmetric_matrix;
/* rotate A by a unitary (real) rotation matrix R:
RAR = transpose(R) * A * R
*/
void sym_matrix_rotate(symmetric_matrix *RAR,
const symmetric_matrix *A_,
const double R[3][3])
{
int i,j;
double A[3][3], AR[3][3];
A[0][0] = A_->m00;
A[1][1] = A_->m11;
A[2][2] = A_->m22;
A[0][1] = A[1][0] = A_->m01;
A[0][2] = A[2][0] = A_->m02;
A[1][2] = A[2][1] = A_->m12;
for (i = 0; i < 3; ++i) for (j = 0; j < 3; ++j)
AR[i][j] = A[i][0]*R[0][j] + A[i][1]*R[1][j] + A[i][2]*R[2][j];
for (i = 0; i < 3; ++i) for (j = i; j < 3; ++j)
A[i][j] = R[0][i]*AR[0][j] + R[1][i]*AR[1][j] + R[2][i]*AR[2][j];
RAR->m00 = A[0][0];
RAR->m11 = A[1][1];
RAR->m22 = A[2][2];
RAR->m01 = A[0][1];
RAR->m02 = A[0][2];
RAR->m12 = A[1][2];
}
/* Set Vinv = inverse of V, where both V and Vinv are real-symmetric matrices.*/
void sym_matrix_invert(symmetric_matrix *Vinv,
const symmetric_matrix *V)
{
double m00 = V->m00, m11 = V->m11, m22 = V->m22;
double m01 = V->m01, m02 = V->m02, m12 = V->m12;
if (m01 == 0.0 && m02 == 0.0 && m12 == 0.0) {
/* optimize common case of a diagonal matrix: */
Vinv->m00 = 1.0 / m00;
Vinv->m11 = 1.0 / m11;
Vinv->m22 = 1.0 / m22;
Vinv->m01 = Vinv->m02 = Vinv->m12 = 0.0;
}
else {
double detinv;
/* compute the determinant: */
detinv = m00*m11*m22 - m02*m11*m02 + 2.0 * m01*m12*m02 -
m01*m01*m22 - m12*m12*m00;
if (detinv == 0.0) meep::abort( "singular 3x3 matrix");
detinv = 1.0/detinv;
Vinv->m00 = detinv * (m11*m22 - m12*m12);
Vinv->m11 = detinv * (m00*m22 - m02*m02);
Vinv->m22 = detinv * (m11*m00 - m01*m01);
Vinv->m02 = detinv * (m01*m12 - m11*m02);
Vinv->m01 = detinv * (m12*m02 - m01*m22);
Vinv->m12 = detinv * (m01*m02 - m00*m12);
}
}
/* Returns whether or not V is positive-definite. */
int sym_matrix_positive_definite(symmetric_matrix *V)
{
double det2, det3;
double m00 = V->m00, m11 = V->m11, m22 = V->m22;
#if defined(WITH_HERMITIAN_EPSILON)
scalar_complex m01 = V->m01, m02 = V->m02, m12 = V->m12;
det2 = m00*m11 - CSCALAR_NORMSQR(m01);
det3 = det2*m22 - m11*CSCALAR_NORMSQR(m02) - CSCALAR_NORMSQR(m12)*m00 +
2.0 * ((m01.re * m12.re - m01.im * m12.im) * m02.re +
(m01.re * m12.im + m01.im * m12.re) * m02.im);
#else /* real matrix */
double m01 = V->m01, m02 = V->m02, m12 = V->m12;
det2 = m00*m11 - m01*m01;
det3 = det2*m22 - m02*m11*m02 + 2.0 * m01*m12*m02 - m12*m12*m00;
#endif /* real matrix */
return (m00 > 0.0 && det2 > 0.0 && det3 > 0.0);
}
/***************************************************************/
/***************************************************************/
/***************************************************************/
static meep::ndim dim = meep::D3;
void set_dimensions(int dims)
{
if (dims == CYLINDRICAL) {
dimensions = 2;
dim = meep::Dcyl;
}
else {
dimensions = dims;
dim = meep::ndim(dims - 1);
}
}
vector3 vec_to_vector3(const meep::vec &pt)
{
vector3 v3;
switch (pt.dim) {
case meep::D1:
v3.x = 0;
v3.y = 0;
v3.z = pt.z();
break;
case meep::D2:
v3.x = pt.x();
v3.y = pt.y();
v3.z = 0;
break;
case meep::D3:
v3.x = pt.x();
v3.y = pt.y();
v3.z = pt.z();
break;
case meep::Dcyl:
v3.x = pt.r();
v3.y = 0;
v3.z = pt.z();
break;
}
return v3;
}
meep::vec vector3_to_vec(const vector3 v3)
{
switch (dim) {
case meep::D1:
return meep::vec(v3.z);
case meep::D2:
return meep::vec(v3.x, v3.y);
case meep::D3:
return meep::vec(v3.x, v3.y, v3.z);
case meep::Dcyl:
return meep::veccyl(v3.x, v3.z);
default:
meep::abort("unknown dimensionality in vector3_to_vec");
}
}
static geom_box gv2box(const meep::volume &v)
{
geom_box box;
box.low = vec_to_vector3(v.get_min_corner());
box.high = vec_to_vector3(v.get_max_corner());
return box;
}
static bool is_variable(material_type mt)
{
return (mt->which_subclass == material_data::MATERIAL_USER);
}
static bool is_variable(void* md) { return is_variable((material_type) md); }
static bool is_file(material_type md)
{
return (md->which_subclass == material_data::MATERIAL_FILE);
}
static bool is_file(void* md) { return is_file((material_type) md); }
static bool is_medium(material_type md, medium_struct **m)
{
if (md->which_subclass == material_data::MEDIUM)
{ *m = &(md->medium);
return true;
};
return false;
}
static bool is_medium(void* md, medium_struct **m)
{ return is_medium((material_type) md, m); }
static bool is_metal(meep::field_type ft, const material_type *material) {
material_data *md = *material;
if (ft == meep::E_stuff)
switch (md->which_subclass) {
case material_data::MEDIUM:
return (md->medium.epsilon_diag.x < 0 ||
md->medium.epsilon_diag.y < 0 ||
md->medium.epsilon_diag.z < 0);
case material_data::PERFECT_METAL:
return true;
default:
meep::abort("unknown material type");
}
else
switch (md->which_subclass) {
case material_data::MEDIUM:
return (md->medium.mu_diag.x < 0 ||
md->medium.mu_diag.y < 0 ||
md->medium.mu_diag.z < 0);
case material_data::PERFECT_METAL:
return false; // is an electric conductor, but not a magnetic conductor
default:
meep::abort("unknown material type");
}
}
/* Linearly interpolate a given point in a 3d grid of data. The point
coordinates should be in the range [0,1], or at the very least [-1,2]
... anything outside [0,1] is *mirror* reflected into [0,1] */
static meep::realnum linear_interpolate(
meep::realnum rx, meep::realnum ry, meep::realnum rz,
meep::realnum *data, int nx, int ny, int nz, int stride)
{
int x, y, z, x2, y2, z2;
meep::realnum dx, dy, dz;
/* mirror boundary conditions for r just beyond the boundary */
if (rx < 0.0) rx = -rx; else if (rx > 1.0) rx = 1.0 - rx;
if (ry < 0.0) ry = -ry; else if (ry > 1.0) ry = 1.0 - ry;
if (rz < 0.0) rz = -rz; else if (rz > 1.0) rz = 1.0 - rz;
/* get the point corresponding to r in the epsilon array grid: */
x = rx * nx; if (x == nx) --x;
y = ry * ny; if (y == ny) --y;
z = rz * nz; if (z == nz) --z;
/* get the difference between (x,y,z) and the actual point
... we shift by 0.5 to center the data points in the pixels */
dx = rx * nx - x - 0.5;
dy = ry * ny - y - 0.5;
dz = rz * nz - z - 0.5;
/* get the other closest point in the grid, with mirror boundaries: */
x2 = (dx >= 0.0 ? x + 1 : x - 1);
if (x2 < 0) x2++; else if (x2 == nx) x2--;
y2 = (dy >= 0.0 ? y + 1 : y - 1);
if (y2 < 0) y2++; else if (y2 == ny) y2--;
z2 = (dz >= 0.0 ? z + 1 : z - 1);
if (z2 < 0) z2++; else if (z2 == nz) z2--;
/* take abs(d{xyz}) to get weights for {xyz} and {xyz}2: */
dx = fabs(dx);
dy = fabs(dy);
dz = fabs(dz);
/* define a macro to give us data(x,y,z) on the grid,
in row-major order (the order used by HDF5): */
#define D(x,y,z) (data[(((x)*ny + (y))*nz + (z)) * stride])
return(((D(x,y,z)*(1.0-dx) + D(x2,y,z)*dx) * (1.0-dy) +
(D(x,y2,z)*(1.0-dx) + D(x2,y2,z)*dx) * dy) * (1.0-dz) +
((D(x,y,z2)*(1.0-dx) + D(x2,y,z2)*dx) * (1.0-dy) +
(D(x,y2,z2)*(1.0-dx) + D(x2,y2,z2)*dx) * dy) * dz);
#undef D
}
// return material of the point p from the file (assumed already read)
static void epsilon_file_material(material_data *md, vector3 p)
{
default_material = (void*) md;
if (md->which_subclass != material_data::MATERIAL_FILE)
meep::abort("epsilon-input-file only works with a type=file default-material");
if (!(md->epsilon_data)) return;
medium_struct *mm=&(md->medium);
double rx = geometry_lattice.size.x == 0
? 0 : 0.5 + (p.x-geometry_center.x) / geometry_lattice.size.x;
double ry = geometry_lattice.size.y == 0
? 0 : 0.5 + (p.y-geometry_center.y) / geometry_lattice.size.y;
double rz = geometry_lattice.size.z == 0
? 0 : 0.5 + (p.z-geometry_center.z) / geometry_lattice.size.z;
mm->epsilon_diag.x = mm->epsilon_diag.y = mm->epsilon_diag.z =
linear_interpolate(rx, ry, rz, md->epsilon_data,
md->epsilon_dims[0],
md->epsilon_dims[1],
md->epsilon_dims[2], 1);
mm->epsilon_offdiag.x = mm->epsilon_offdiag.y = mm->epsilon_offdiag.z = 0;
}
struct pol {
susceptibility user_s;
struct pol *next;
};
// structure to hold a conductivity profile (for scalar absorbing layers)
struct cond_profile {
double L; // thickness
int N; // number of points prof[n] from 0..N corresponding to 0..L
double *prof; // (NULL if none)
};
class geom_epsilon : public meep::material_function {
geometric_object_list geometry;
geom_box_tree geometry_tree;
geom_box_tree restricted_tree;
cond_profile cond[5][2]; // [direction][side]
public:
geom_epsilon(geometric_object_list g, material_type_list mlist,
const meep::volume &v);
virtual ~geom_epsilon();
virtual void set_cond_profile(meep::direction, meep::boundary_side,
double L, double dx,
double (*prof)(int,double*,void*), void*,
double R);
virtual void set_volume(const meep::volume &v);
virtual void unset_volume(void);
bool has_chi(meep::component c, int p);
virtual bool has_chi3(meep::component c);
virtual bool has_chi2(meep::component c);
double chi(meep::component c, const meep::vec &r, int p);
virtual double chi3(meep::component c, const meep::vec &r);
virtual double chi2(meep::component c, const meep::vec &r);
virtual bool has_mu();
virtual bool has_conductivity(meep::component c);
virtual double conductivity(meep::component c, const meep::vec &r);
virtual double chi1p1(meep::field_type ft, const meep::vec &r);
virtual void eff_chi1inv_row(meep::component c, double chi1inv_row[3],
const meep::volume &v,
double tol, int maxeval);
void eff_chi1inv_matrix(meep::component c, symmetric_matrix *chi1inv_matrix,
const meep::volume &v, double tol, int maxeval);
void fallback_chi1inv_row(meep::component c, double chi1inv_row[3],
const meep::volume &v,
double tol, int maxeval);
virtual void sigma_row(meep::component c, double sigrow[3],
const meep::vec &r);
void add_susceptibilities(meep::structure *s);
void add_susceptibilities(meep::field_type ft, meep::structure *s);
static bool verbose;
private:
void get_material_pt(material_type &material, const meep::vec &r);
material_type_list extra_materials;
pol *current_pol;
};
/***********************************************************************/
bool geom_epsilon::verbose=false;
geom_epsilon::geom_epsilon(geometric_object_list g,
material_type_list mlist,
const meep::volume &v)
{
geometry = g; // don't bother making a copy, only used in one place
extra_materials = mlist;
current_pol = NULL;
FOR_DIRECTIONS(d) FOR_SIDES(b) cond[d][b].prof = NULL;
if (meep::am_master()) {
for (int i = 0; i < geometry.num_items; ++i) {
display_geometric_object_info(5, geometry.items[i]);
medium_struct *mm;
if ( is_medium(geometry.items[i].material, &mm) )
printf("%*sdielectric constant epsilon diagonal "
"= (%g,%g,%g)\n", 5 + 5, "",
mm->epsilon_diag.x,
mm->epsilon_diag.y,
mm->epsilon_diag.z
);
}
}
geom_fix_objects0(geometry);
geom_box box = gv2box(v);
geometry_tree = create_geom_box_tree0(geometry, box);
if (verbose && meep::am_master()) {
printf("Geometric-object bounding-box tree:\n");
display_geom_box_tree(5, geometry_tree);
int tree_depth, tree_nobjects;
geom_box_tree_stats(geometry_tree, &tree_depth, &tree_nobjects);
master_printf("Geometric object tree has depth %d "
"and %d object nodes (vs. %d actual objects)\n",
tree_depth, tree_nobjects, geometry.num_items);
}
restricted_tree = geometry_tree;
}
geom_epsilon::~geom_epsilon()
{
unset_volume();
destroy_geom_box_tree(geometry_tree);
FOR_DIRECTIONS(d) FOR_SIDES(b) if (cond[d][b].prof)
delete[] cond[d][b].prof;
}
void geom_epsilon::set_cond_profile(meep::direction dir,
meep::boundary_side side,
double L, double dx,
double (*P)(int,double*,void*), void *data,
double R)
{
if (cond[dir][side].prof) delete[] cond[dir][side].prof;
int N = int(L / dx + 0.5);
cond[dir][side].L = L;
cond[dir][side].N = N;
double *prof = cond[dir][side].prof = new double[N+1];
double umin = 0, umax = 1, esterr;
int errflag;
double prof_int = adaptive_integration(P, &umin,&umax, 1, data, 1e-9, 1e-4,
50000, &esterr, &errflag);
double prefac = (-log(R)) / (4*L*prof_int);
for (int i = 0; i <= N; ++i) {
double u = double(i)/N;
prof[i] = prefac * P(1, &u, data);
}
}
void geom_epsilon::unset_volume(void)
{
if (restricted_tree != geometry_tree) {
destroy_geom_box_tree(restricted_tree);
restricted_tree = geometry_tree;
}
}
void geom_epsilon::set_volume(const meep::volume &v)
{
unset_volume();
geom_box box = gv2box(v);
restricted_tree = create_geom_box_tree0(geometry, box);
}
static void material_epsmu(meep::field_type ft, material_type material,
symmetric_matrix *epsmu, symmetric_matrix *epsmu_inv) {
material_data *md=material;
if (ft == meep::E_stuff)
switch (md->which_subclass) {
case material_data::MEDIUM:
case material_data::MATERIAL_FILE:
case material_data::MATERIAL_USER:
epsmu->m00 = md->medium.epsilon_diag.x;
epsmu->m11 = md->medium.epsilon_diag.y;
epsmu->m22 = md->medium.epsilon_diag.z;
epsmu->m01 = md->medium.epsilon_offdiag.x;
epsmu->m02 = md->medium.epsilon_offdiag.y;
epsmu->m12 = md->medium.epsilon_offdiag.z;
sym_matrix_invert(epsmu_inv,epsmu);
break;
case material_data::PERFECT_METAL:
epsmu->m00 = -meep::infinity;
epsmu->m11 = -meep::infinity;
epsmu->m22 = -meep::infinity;
epsmu_inv->m00 = -0.0;
epsmu_inv->m11 = -0.0;
epsmu_inv->m22 = -0.0;
epsmu->m01 = epsmu->m02 = epsmu->m12 = 0.0;
epsmu_inv->m01 = epsmu_inv->m02 = epsmu_inv->m12 = 0.0;
break;
default:
meep::abort("unknown material type");
}
else
switch (md->which_subclass) {
case material_data::MEDIUM:
case material_data::MATERIAL_FILE:
case material_data::MATERIAL_USER:
epsmu->m00 = md->medium.mu_diag.x;
epsmu->m11 = md->medium.mu_diag.y;
epsmu->m22 = md->medium.mu_diag.z;
epsmu->m01 = md->medium.mu_offdiag.x;
epsmu->m02 = md->medium.mu_offdiag.y;
epsmu->m12 = md->medium.mu_offdiag.z;
sym_matrix_invert(epsmu_inv,epsmu);
break;
case material_data::PERFECT_METAL:
epsmu->m00 = 1.0;
epsmu->m11 = 1.0;
epsmu->m22 = 1.0;
epsmu_inv->m00 = 1.0;
epsmu_inv->m11 = 1.0;
epsmu_inv->m22 = 1.0;
epsmu->m01 = epsmu->m02 = epsmu->m12 = 0.0;
epsmu_inv->m01 = epsmu_inv->m02 = epsmu_inv->m12 = 0.0;
break;
default:
meep::abort("unknown material type");
}
}
// the goal of this routine is to fill in the 'medium' field
// within the material structure as appropriate for the
// material properties at r.
void geom_epsilon::get_material_pt(material_type &material, const meep::vec &r)
{
vector3 p = vec_to_vector3(r);
boolean inobject;
material = (material_type)
material_of_unshifted_point_in_tree_inobject(p, restricted_tree,&inobject);
material_data *md = material;
switch(md->which_subclass)
{
// material read from file: interpolate to get properties at r
case material_data::MATERIAL_FILE:
if (md->epsilon_data)
epsilon_file_material(md, p);
else
material = (material_type) default_material;
return;
// material specified by user-supplied function: call user
// function to get properties at r.
// Note that we initialize the medium to vacuum, so that
// the user's function only needs to fill in whatever is
// different from vacuum.
case material_data::MATERIAL_USER:
md->medium = vacuum_medium;
md->user_func(p, md->user_data, &(md->medium));
// TODO: update this to allow user's function to set
// position-dependent susceptibilities. For now
// it's an error if the user's function creates
// any.
if ( (md->medium.E_susceptibilities.num_items>0)
|| (md->medium.H_susceptibilities.num_items>0)
)
meep::abort("susceptibilities in user-defined-materials not yet supported");
return;
// position-independent material or metal: there is nothing to do
case material_data::MEDIUM:
case material_data::PERFECT_METAL:
return;
default:
meep::abort("unknown material type");
};
}
// returns trace of the tensor diagonal
double geom_epsilon::chi1p1(meep::field_type ft, const meep::vec &r)
{
symmetric_matrix chi1p1, chi1p1_inv;
#ifdef DEBUG
vector3 p = vec_to_vector3(r);
if (p.x < restricted_tree->b.low.x ||
p.y < restricted_tree->b.low.y ||
p.z < restricted_tree->b.low.z ||
p.x > restricted_tree->b.high.x ||
p.y > restricted_tree->b.high.y ||
p.z > restricted_tree->b.high.z)
meep::abort("invalid point (%g,%g,%g)\n", p.x,p.y,p.z);
#endif
material_type material;
get_material_pt(material, r);
material_epsmu(ft, material, &chi1p1, &chi1p1_inv);
return (chi1p1.m00 + chi1p1.m11 + chi1p1.m22)/3;
}
/* Find frontmost object in v, along with the constant material behind it.
Returns false if material behind the object is not constant.
Requires moderately horrifying logic to figure things out properly,
stolen from MPB. */
static bool get_front_object(const meep::volume &v,
geom_box_tree geometry_tree,
vector3 &pcenter,
const geometric_object **o_front,
vector3 &shiftby_front,
material_type &mat_front,
material_type &mat_behind) {
vector3 p;
const geometric_object *o1 = 0, *o2 = 0;
vector3 shiftby1 = {0,0,0}, shiftby2 = {0,0,0};
geom_box pixel;
material_type mat1, mat2;
int id1 = -1, id2 = -1;
const int num_neighbors[3] = { 3, 5, 9 };
const int neighbors[3][9][3] = {
{ {0,0,0}, {0,0,-1}, {0,0,1},
{0,0,0},{0,0,0},{0,0,0},{0,0,0},{0,0,0},{0,0,0} },
{ {0,0,0},
{-1,-1,0}, {1,1,0}, {-1,1,0}, {1,-1,0},
{0,0,0},{0,0,0},{0,0,0},{0,0,0} },
{ {0,0,0},
{1,1,1},{1,1,-1},{1,-1,1},{1,-1,-1},
{-1,1,1},{-1,1,-1},{-1,-1,1},{-1,-1,-1} }
};
pixel = gv2box(v);
pcenter = p = vec_to_vector3(v.center());
double d1, d2, d3;
d1 = (pixel.high.x - pixel.low.x) * 0.5;
d2 = (pixel.high.y - pixel.low.y) * 0.5;
d3 = (pixel.high.z - pixel.low.z) * 0.5;
for (int i = 0; i < num_neighbors[dimensions - 1]; ++i) {
const geometric_object *o;
material_type mat;
vector3 q, shiftby;
int id;
q.x = p.x + neighbors[dimensions - 1][i][0] * d1;
q.y = p.y + neighbors[dimensions - 1][i][1] * d2;
q.z = p.z + neighbors[dimensions - 1][i][2] * d3;
o = object_of_point_in_tree(q, geometry_tree, &shiftby, &id);
if ((id == id1 && vector3_equal(shiftby, shiftby1)) ||
(id == id2 && vector3_equal(shiftby, shiftby2)))
continue;
mat = (material_type) default_material;
if (o)
{ material_data *md = (material_data *)o->material;
if (md->which_subclass != material_data::MATERIAL_FILE)
mat = md;
}
if (id1 == -1) {
o1 = o;
shiftby1 = shiftby;
id1 = id;
mat1 = mat;
}
else if (id2 == -1 || ( (id >= id1 && id >= id2) &&
(id1 == id2
|| material_type_equal(mat1,mat2)))) {
o2 = o;
shiftby2 = shiftby;
id2 = id;
mat2 = mat;
}
else if (!(id1 < id2 &&
(id1 == id || material_type_equal(mat1,mat))) &&
!(id2 < id1 &&
(id2 == id || material_type_equal(mat2,mat))))
return false;
}
// CHECK(id1 > -1, "bug in object_of_point_in_tree?");
if (id2 == -1) { /* only one nearby object/material */
id2 = id1;
o2 = o1;
mat2 = mat1;
shiftby2 = shiftby1;
}
if ( (o1 && is_variable(o1->material))
|| (o2 && is_variable(o2->material))
|| ( (is_variable(default_material) || is_file(default_material))
&& ( !o1 || is_file(o1->material)
|| !o2 || is_file(o2->material)
)
)
)
return false;
if (id1 >= id2) {
*o_front = o1;
shiftby_front = shiftby1;
mat_front = mat1;
if (id1 == id2) mat_behind = mat1; else mat_behind = mat2;
}
if (id2 > id1) {
*o_front = o2;
shiftby_front = shiftby2;
mat_front = mat2;
mat_behind = mat1;
}
return true;
}
void geom_epsilon::eff_chi1inv_row(meep::component c, double chi1inv_row[3],
const meep::volume &v, double tol, int maxeval) {
symmetric_matrix meps_inv;
eff_chi1inv_matrix(c, &meps_inv, v, tol, maxeval);
switch (component_direction(c)) {
case meep::X:
case meep::R:
chi1inv_row[0] = meps_inv.m00;
chi1inv_row[1] = meps_inv.m01;
chi1inv_row[2] = meps_inv.m02;
break;
case meep::Y:
case meep::P:
chi1inv_row[0] = meps_inv.m01;
chi1inv_row[1] = meps_inv.m11;
chi1inv_row[2] = meps_inv.m12;
break;
case meep::Z:
chi1inv_row[0] = meps_inv.m02;
chi1inv_row[1] = meps_inv.m12;
chi1inv_row[2] = meps_inv.m22;
break;
case meep::NO_DIRECTION:
chi1inv_row[0] = chi1inv_row[1] = chi1inv_row[2] = 0;
break;
}
}
void geom_epsilon::eff_chi1inv_matrix(meep::component c, symmetric_matrix *chi1inv_matrix,
const meep::volume &v, double tol, int maxeval) {
const geometric_object *o;
material_type mat, mat_behind;
symmetric_matrix meps;
vector3 p, shiftby, normal;
if (maxeval == 0 || !get_front_object(v, geometry_tree, p, &o, shiftby, mat, mat_behind)) {
noavg:
get_material_pt(mat, v.center());
trivial:
material_epsmu(meep::type(c), mat, &meps, chi1inv_matrix);
return;
}
// FIXME: reimplement support for fallback integration, without
// messing up anisotropic support
// if (!get_front_object(v, geometry_tree,
// p, &o, shiftby, mat, mat_behind)) {
// fallback_chi1inv_row(c, chi1inv_row, v, tol, maxeval);
// return;
// }
/* check for trivial case of only one object/material */
if (material_type_equal(mat, mat_behind)) goto trivial;
// it doesn't make sense to average metals (electric or magnetic)
if (is_metal(meep::type(c), &mat) || is_metal(meep::type(c), &mat_behind))
goto noavg;
normal = unit_vector3(normal_to_fixed_object(vector3_minus(p, shiftby), *o));
if (normal.x == 0 && normal.y == 0 && normal.z == 0)
goto noavg; // couldn't get normal vector for this point, punt
geom_box pixel = gv2box(v);
pixel.low = vector3_minus(pixel.low, shiftby);
pixel.high = vector3_minus(pixel.high, shiftby);
double fill = box_overlap_with_object(pixel, *o, tol, maxeval);
material_epsmu(meep::type(c), mat, &meps, chi1inv_matrix);
symmetric_matrix eps2, epsinv2;
symmetric_matrix eps1, delta;
double Rot[3][3];
material_epsmu(meep::type(c), mat_behind, &eps2, &epsinv2);
eps1 = meps;
Rot[0][0] = normal.x;
Rot[1][0] = normal.y;
Rot[2][0] = normal.z;
if (fabs(normal.x) > 1e-2 || fabs(normal.y) > 1e-2) {
Rot[0][2] = normal.y;
Rot[1][2] = -normal.x;
Rot[2][2] = 0;
}
else { /* n is not parallel to z direction, use (x x n) instead */
Rot[0][2] = 0;
Rot[1][2] = -normal.z;
Rot[2][2] = normal.y;
}
{ /* normalize second column */
double s = Rot[0][2]*Rot[0][2]+Rot[1][2]*Rot[1][2]+Rot[2][2]*Rot[2][2];
s = 1.0 / sqrt(s);
Rot[0][2] *= s;
Rot[1][2] *= s;
Rot[2][2] *= s;
}
/* 1st column is 2nd column x 0th column */
Rot[0][1] = Rot[1][2] * Rot[2][0] - Rot[2][2] * Rot[1][0];
Rot[1][1] = Rot[2][2] * Rot[0][0] - Rot[0][2] * Rot[2][0];
Rot[2][1] = Rot[0][2] * Rot[1][0] - Rot[1][2] * Rot[0][0];
/* rotate epsilon tensors to surface parallel/perpendicular axes */
sym_matrix_rotate(&eps1, &eps1, Rot);
sym_matrix_rotate(&eps2, &eps2, Rot);
#define AVG (fill * (EXPR(eps1)) + (1-fill) * (EXPR(eps2)))
#define SQR(x) ((x) * (x))
#define EXPR(eps) (-1 / eps.m00)
delta.m00 = AVG;
#undef EXPR
#define EXPR(eps) (eps.m11 - SQR(eps.m01) / eps.m00)
delta.m11 = AVG;
#undef EXPR
#define EXPR(eps) (eps.m22 - SQR(eps.m02) / eps.m00)
delta.m22 = AVG;
#undef EXPR
#define EXPR(eps) (eps.m01 / eps.m00)
delta.m01 = AVG;
#undef EXPR
#define EXPR(eps) (eps.m02 / eps.m00)
delta.m02 = AVG;
#undef EXPR
#define EXPR(eps) (eps.m12 - eps.m02 * eps.m01 / eps.m00)
delta.m12 = AVG;
#undef EXPR
meps.m00 = -1/delta.m00;
meps.m11 = delta.m11 - SQR(delta.m01) / delta.m00;
meps.m22 = delta.m22 - SQR(delta.m02) / delta.m00;
meps.m01 = -delta.m01/delta.m00;
meps.m02 = -delta.m02/delta.m00;
meps.m12 = delta.m12 - (delta.m02 * delta.m01) / delta.m00;
#undef SQR
#define SWAP(a,b) { double xxx = a; a = b; b = xxx; }
/* invert rotation matrix = transpose */
SWAP(Rot[0][1], Rot[1][0]);
SWAP(Rot[0][2], Rot[2][0]);
SWAP(Rot[2][1], Rot[1][2]);
sym_matrix_rotate(&meps, &meps, Rot); /* rotate back */
#undef SWAP
#ifdef DEBUG
if(!sym_matrix_positive_definite(&meps))
meep::abort("negative mean epsilon from Kottke algorithm");
#endif
sym_matrix_invert(chi1inv_matrix, &meps);
}
static int eps_ever_negative = 0;
static meep::field_type func_ft = meep::E_stuff;
#ifdef CTL_HAS_COMPLEX_INTEGRATION
static cnumber ceps_func(int n, number *x, void *geomeps_)
{
geom_epsilon *geomeps = (geom_epsilon *) geomeps_;
vector3 p = {0,0,0};
p.x = x[0]; p.y = n > 1 ? x[1] : 0; p.z = n > 2 ? x[2] : 0;
double s = 1;
if (dim == meep::Dcyl) { double py = p.y; p.y = p.z; p.z = py; s = p.x; }
cnumber ret;
double ep = geomeps->chi1p1(func_ft, vector3_to_vec(p));
if (ep < 0) eps_ever_negative = 1;
ret.re = ep * s;
ret.im = s / ep;
return ret;
}
#else
static number eps_func(int n, number *x, void *geomeps_)
{
geom_epsilon *geomeps = (geom_epsilon *) geomeps_;
vector3 p = {0,0,0};
double s = 1;
p.x = x[0]; p.y = n > 1 ? x[1] : 0; p.z = n > 2 ? x[2] : 0;
if (dim == meep::Dcyl) { double py = p.y; p.y = p.z; p.z = py; s = p.x; }
double ep = geomeps->chi1p1(func_ft, vector3_to_vec(p));
if (ep < 0) eps_ever_negative = 1;
return ep * s;
}
static number inveps_func(int n, number *x, void *geomeps_)
{
geom_epsilon *geomeps = (geom_epsilon *) geomeps_;
vector3 p = {0,0,0};
double s = 1;
p.x = x[0]; p.y = n > 1 ? x[1] : 0; p.z = n > 2 ? x[2] : 0;
if (dim == meep::Dcyl) { double py = p.y; p.y = p.z; p.z = py; s = p.x; }
double ep = geomeps->chi1p1(func_ft, vector3_to_vec(p));
if (ep < 0) eps_ever_negative = 1;
return s / ep;
}
#endif
// fallback meaneps using libctl's adaptive cubature routine
void geom_epsilon::fallback_chi1inv_row(meep::component c,
double chi1inv_row[3],
const meep::volume &v,
double tol, int maxeval)
{
symmetric_matrix chi1p1, chi1p1_inv;
material_type material;
get_material_pt(material, v.center());
material_epsmu(meep::type(c), material, &chi1p1, &chi1p1_inv);
if (chi1p1.m01 != 0 || chi1p1.m02 != 0 || chi1p1.m12 != 0
|| chi1p1.m00 != chi1p1.m11 || chi1p1.m11 != chi1p1.m22 ||
chi1p1.m00 != chi1p1.m22) {
int rownum = meep::component_direction(c) % 3;