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
|
/* 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 <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <complex>
#include "meep.hpp"
#include "meep_internals.hpp"
using namespace std;
namespace meep {
/*********************************************************************/
// this function is necessary to make equality commutative ... ugh
bool src_times_equal(const src_time &t1, const src_time &t2)
{
return t1.is_equal(t2) && t2.is_equal(t1);
}
src_time *src_time::add_to(src_time *others, src_time **added) const
{
if (others) {
if (src_times_equal(*this, *others))
*added = others;
else
others->next = add_to(others->next, added);
return others;
}
else {
src_time *t = clone();
t->next = others;
*added = t;
return t;
}
}
double src_time::last_time_max(double after)
{
after = max(last_time(), after);
if (next)
return next->last_time_max(after);
else
return after;
}
gaussian_src_time::gaussian_src_time(double f, double fwidth, double s)
{
freq = f;
width = 1.0 / fwidth;
peak_time = width * s;
cutoff = width * s * 2;
// this is to make last_source_time as small as possible
while (exp(-cutoff*cutoff / (2*width*width)) < 1e-100)
cutoff *= 0.9;
cutoff = float(cutoff); // don't make cutoff sensitive to roundoff error
}
gaussian_src_time::gaussian_src_time(double f, double w, double st, double et)
{
freq = f;
width = w;
peak_time = 0.5 * (st + et);
cutoff = (et - st) * 0.5;
// this is to make last_source_time as small as possible
while (exp(-cutoff*cutoff / (2*width*width)) < 1e-100)
cutoff *= 0.9;
cutoff = float(cutoff); // don't make cutoff sensitive to roundoff error
}
complex<double> gaussian_src_time::dipole(double time) const
{
double tt = time - peak_time;
if (float(fabs(tt)) > cutoff)
return 0.0;
// correction factor so that current amplitude (= d(dipole)/dt) is
// ~ 1 near the peak of the Gaussian.
complex<double> amp = 1.0 / complex<double>(0,-2*pi*freq);
return exp(-tt*tt / (2*width*width)) * polar(1.0, -2*pi*freq*tt) * amp;
}
bool gaussian_src_time::is_equal(const src_time &t) const
{
const gaussian_src_time *tp = dynamic_cast<const gaussian_src_time*>(&t);
if (tp)
return(tp->freq == freq && tp->width == width &&
tp->peak_time == peak_time && tp->cutoff == cutoff);
else
return 0;
}
complex<double> continuous_src_time::dipole(double time) const
{
float rtime = float(time);
if (rtime < start_time || rtime > end_time)
return 0.0;
// correction factor so that current amplitude (= d(dipole)/dt) is 1.
complex<double> amp = 1.0 / (complex<double>(0,-1.0) * (2*pi)*freq);
if (width == 0.0)
return exp(complex<double>(0,-1.0) * (2*pi)*freq*time) * amp;
else {
double ts = (time - start_time) / width - slowness;
double te = (end_time - time) / width - slowness;
return exp(complex<double>(0,-1.0) * (2*pi)*freq*time) * amp
* (1.0 + tanh(ts)) // goes from 0 to 2
* (1.0 + tanh(te)) // goes from 2 to 0
* 0.25;
}
}
bool continuous_src_time::is_equal(const src_time &t) const
{
const continuous_src_time *tp =
dynamic_cast<const continuous_src_time*>(&t);
if (tp)
return(tp->freq == freq && tp->width == width &&
tp->start_time == start_time && tp->end_time == end_time &&
tp->slowness == slowness);
else
return 0;
}
bool custom_src_time::is_equal(const src_time &t) const
{
const custom_src_time *tp = dynamic_cast<const custom_src_time*>(&t);
if (tp)
return(tp->start_time == start_time && tp->end_time == end_time &&
tp->func == func && tp->data == data);
else
return 0;
}
/*********************************************************************/
src_vol::src_vol(component cc, src_time *st, int n, int *ind, complex<double> *amps) {
c = cc;
if (is_D(c)) c = direction_component(Ex, component_direction(c));
if (is_B(c)) c = direction_component(Hx, component_direction(c));
t = st; next = NULL;
npts = n;
index = ind;
A = amps;
}
src_vol::src_vol(const src_vol &sv) {
c = sv.c;
t = sv.t;
npts = sv.npts;
index = new int[npts];
A = new complex<double>[npts];
for (int j=0; j<npts; j++) {
index[j] = sv.index[j];
A[j] = sv.A[j];
}
if (sv.next)
next = new src_vol(*sv.next);
else
next = NULL;
}
src_vol *src_vol::add_to(src_vol *others) {
if (others) {
if (*this == *others) {
if (npts != others->npts)
abort("Cannot add grid_volume sources with different number of points\n");
/* Compare all of the indices...if this ever becomes too slow,
we can just compare the first and last indices. */
for (int j=0; j<npts; j++) {
if (others->index[j] != index[j])
abort("Different indices\n");
others->A[j] += A[j];
}
}
else
others->next = add_to(others->next);
return others;
}
else {
next = others;
return this;
}
}
/*********************************************************************/
// THIS VARIANT IS FOR BACKWARDS COMPATIBILITY, and is DEPRECATED:
void fields::add_point_source(component c, double freq,
double width, double peaktime,
double cutoff, const vec &p,
complex<double> amp, int is_c) {
width /= freq;
if (is_c) { // TODO: don't ignore peaktime?
continuous_src_time src(freq, width, time(), infinity, cutoff);
if (is_magnetic(c)) src.is_integrated = false;
add_point_source(c, src, p, amp);
}
else {
cutoff = gv.inva + cutoff * width;
if (peaktime <= 0.0)
peaktime = time() + cutoff;
// backward compatibility (slight phase shift in old Meep version)
peaktime += is_magnetic(c) ? -dt*0.5 : dt;
gaussian_src_time src(freq, width,
peaktime - cutoff, peaktime + cutoff);
if (is_magnetic(c)) src.is_integrated = false;
add_point_source(c, src, p, amp);
}
}
void fields::add_point_source(component c, const src_time &src,
const vec &p, complex<double> amp) {
add_volume_source(c, src, volume(p, p), amp);
}
static complex<double> one(const vec &pt) {(void) pt; return 1.0;}
void fields::add_volume_source(component c, const src_time &src,
const volume &where,
complex<double> amp) {
add_volume_source(c, src, where, one, amp);
}
struct src_vol_chunkloop_data {
complex<double> (*A)(const vec &);
complex<double> amp;
src_time *src;
vec center;
};
/* Adding source volumes can be treated as a kind of "integration"
problem, since we need to loop over all the chunks that intersect
the source grid_volume, with appropriate interpolation weights at the
boundaries so that the integral of the current is fixed regardless
of resolution. Unlike most uses of fields::loop_in_chunks, however, we
set use_symmetry=false: we only find the intersection of the grid_volume
with the untransformed chunks (since the transformed versions are
implicit). */
static void src_vol_chunkloop(fields_chunk *fc, int ichunk, component c,
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 *data_)
{
src_vol_chunkloop_data *data = (src_vol_chunkloop_data *) data_;
(void) S; (void) sn; // these should be the identity
(void) dV0; (void) dV1; // grid_volume weighting is included in data->amp
(void) ichunk;
int npts = 1;
LOOP_OVER_DIRECTIONS(is.dim, d)
npts *= (ie.in_direction(d) - is.in_direction(d)) / 2 + 1;
int *index_array = new int[npts];
complex<double> *amps_array = new complex<double>[npts];
complex<double> amp = data->amp * conj(shift_phase);
direction cd = component_direction(c);
double inva = fc->gv.inva;
int idx_vol = 0;
LOOP_OVER_IVECS(fc->gv, is, ie, idx) {
IVEC_LOOP_LOC(fc->gv, loc);
loc += shift * (0.5*inva) - data->center;
amps_array[idx_vol] = IVEC_LOOP_WEIGHT(s0,s1,e0,e1,1) * amp * data->A(loc);
/* for "D" sources, multiply by epsilon. FIXME: this is not quite
right because it doesn't handle non-diagonal chi1inv!
similarly, for "B" sources, multiply by mu. */
if (is_D(c) && fc->s->chi1inv[c-Dx+Ex][cd])
amps_array[idx_vol] /= fc->s->chi1inv[c-Dx+Ex][cd][idx];
if (is_B(c) && fc->s->chi1inv[c-Bx+Hx][cd])
amps_array[idx_vol] /= fc->s->chi1inv[c-Bx+Hx][cd][idx];
index_array[idx_vol++] = idx;
}
if (idx_vol != npts)
abort("add_volume_source: computed wrong npts (%d vs. %d)", npts, idx_vol);
src_vol *tmp = new src_vol(c, data->src, npts, index_array, amps_array);
field_type ft = is_magnetic(c) ? B_stuff : D_stuff;
fc->sources[ft] = tmp->add_to(fc->sources[ft]);
}
void fields::add_volume_source(component c, const src_time &src,
const volume &where_,
complex<double> A(const vec &),
complex<double> amp) {
volume where(where_); // make a copy to adjust size if necessary
if (gv.dim != where.dim)
abort("incorrect source grid_volume dimensionality in add_volume_source");
LOOP_OVER_DIRECTIONS(gv.dim, d) {
double w = user_volume.boundary_location(High, d)
- user_volume.boundary_location(Low, d);
if (where.in_direction(d) > w + gv.inva)
abort("Source width > cell width in %s direction!\n", direction_name(d));
else if (where.in_direction(d) > w) { // difference is less than 1 pixel
double dw = where.in_direction(d) - w;
where.set_direction_min(d, where.in_direction_min(d) - dw * 0.5);
where.set_direction_max(d, where.in_direction_min(d) + w);
}
}
src_vol_chunkloop_data data;
data.A = A ? A : one;
data.amp = amp;
LOOP_OVER_DIRECTIONS(gv.dim, d)
if (where.in_direction(d) == 0.0 && !nosize_direction(d)) // delta-fun
data.amp *= gv.a; // correct units for J delta-function amplitude
sources = src.add_to(sources, &data.src);
data.center = (where.get_min_corner() + where.get_max_corner()) * 0.5;
loop_in_chunks(src_vol_chunkloop, (void *) &data, where, c, false);
require_component(c);
}
} // namespace meep
|