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
|
#include <cmath>
#include <limits>
#include <WarpX.H>
#include <WarpXConst.H>
#include <WarpX_f.H>
void
WarpX::Evolve (int numsteps)
{
BL_PROFILE("WarpX::Evolve()");
Real cur_time = t_new[0];
static int last_plot_file_step = 0;
static int last_check_file_step = 0;
int numsteps_max = (numsteps >= 0 && numsteps <= max_step) ? numsteps : max_step;
bool max_time_reached = false;
for (int step = istep[0]; step < numsteps_max && cur_time < stop_time; ++step)
{
if (ParallelDescriptor::IOProcessor()) {
std::cout << "\nSTEP " << step+1 << " starts ..." << std::endl;
}
ComputeDt();
// Advance level 0 by dt
const int lev = 0;
{
// At the beginning, we have B^{n-1/2} and E^{n}.
// Particles have p^{n-1/2} and x^{n}.
EvolveB(lev, 0.5*dt[lev]); // We now B^{n}
if (WarpX::nox > 1 || WarpX::noy > 1 || WarpX::noz > 1) {
WarpX::FillBoundary(*Bfield[lev][0], geom[lev], Bx_nodal_flag);
WarpX::FillBoundary(*Bfield[lev][1], geom[lev], By_nodal_flag);
WarpX::FillBoundary(*Bfield[lev][2], geom[lev], Bz_nodal_flag);
WarpX::FillBoundary(*Efield[lev][0], geom[lev], Ex_nodal_flag);
WarpX::FillBoundary(*Efield[lev][1], geom[lev], Ey_nodal_flag);
WarpX::FillBoundary(*Efield[lev][2], geom[lev], Ez_nodal_flag);
}
// Evolve particles to p^{n+1/2} and x^{n+1}
// Depose current, j^{n+1/2}
mypc->Evolve(lev,
*Efield[lev][0],*Efield[lev][1],*Efield[lev][2],
*Bfield[lev][0],*Bfield[lev][1],*Bfield[lev][2],
*current[lev][0],*current[lev][1],*current[lev][2],dt[lev]);
mypc->Redistribute(); // Redistribute particles
EvolveB(lev, 0.5*dt[lev]); // We now B^{n+1/2}
// Fill B's ghost cells because of the next step of evolving E.
WarpX::FillBoundary(*Bfield[lev][0], geom[lev], Bx_nodal_flag);
WarpX::FillBoundary(*Bfield[lev][1], geom[lev], By_nodal_flag);
WarpX::FillBoundary(*Bfield[lev][2], geom[lev], Bz_nodal_flag);
EvolveE(lev, dt[lev]); // We now have E^{n+1}
++istep[lev];
}
cur_time += dt[0];
MoveWindow();
if (ParallelDescriptor::IOProcessor()) {
std::cout << "STEP " << step+1 << " ends." << " TIME = " << cur_time << " DT = " << dt[0]
<< std::endl;
}
// sync up time
for (int i = 0; i <= finest_level; ++i) {
t_new[i] = cur_time;
}
if (plot_int > 0 && (step+1) % plot_int == 0) {
last_plot_file_step = step+1;
WritePlotFile();
}
if (check_int > 0 && (step+1) % check_int == 0) {
last_check_file_step = step+1;
WriteCheckPointFile();
}
if (cur_time >= stop_time - 1.e-6*dt[0]) {
max_time_reached = true;
break;
}
}
if (plot_int > 0 && istep[0] > last_plot_file_step && (max_time_reached || istep[0] >= max_step)) {
WritePlotFile();
}
if (check_int > 0 && istep[0] > last_check_file_step && (max_time_reached || istep[0] >= max_step)) {
WriteCheckPointFile();
}
}
void
WarpX::EvolveB (int lev, Real dt)
{
BL_PROFILE("WarpX::EvolveB()");
const Real* dx = geom[lev].CellSize();
Real dtsdx[3];
#if (BL_SPACEDIM == 3)
dtsdx[0] = dt / dx[0];
dtsdx[1] = dt / dx[1];
dtsdx[2] = dt / dx[2];
#elif (BL_SPACEDIM == 2)
dtsdx[0] = dt / dx[0];
dtsdx[1] = std::numeric_limits<Real>::quiet_NaN();
dtsdx[2] = dt / dx[1];
#endif
long norder = 2;
long nstart = 0;
int l_nodal = false;
long nguard = Efield[lev][0]->nGrow();
BL_ASSERT(nguard == Efield[lev][1]->nGrow());
BL_ASSERT(nguard == Efield[lev][2]->nGrow());
BL_ASSERT(nguard == Bfield[lev][0]->nGrow());
BL_ASSERT(nguard == Bfield[lev][1]->nGrow());
BL_ASSERT(nguard == Bfield[lev][2]->nGrow());
#if (BL_SPACEDIM == 3)
long nxguard = nguard;
long nyguard = nguard;
long nzguard = nguard;
#elif (BL_SPACEDIM == 2)
long nxguard = nguard;
long nyguard = 0;
long nzguard = nguard;
#endif
for ( MFIter mfi(*Bfield[lev][0]); mfi.isValid(); ++mfi )
{
const Box& bx = BoxLib::enclosedCells(mfi.validbox());
#if (BL_SPACEDIM == 3)
long nx = bx.length(0);
long ny = bx.length(1);
long nz = bx.length(2);
#elif (BL_SPACEDIM == 2)
long nx = bx.length(0);
long ny = 0;
long nz = bx.length(1);
#endif
warpx_push_bvec( (*Efield[lev][0])[mfi].dataPtr(),
(*Efield[lev][1])[mfi].dataPtr(),
(*Efield[lev][2])[mfi].dataPtr(),
(*Bfield[lev][0])[mfi].dataPtr(),
(*Bfield[lev][1])[mfi].dataPtr(),
(*Bfield[lev][2])[mfi].dataPtr(),
dtsdx, dtsdx+1, dtsdx+2,
&nx, &ny, &nz,
&norder, &norder, &norder,
&nxguard, &nyguard, &nzguard,
&nstart, &nstart, &nstart,
&l_nodal );
}
}
void
WarpX::EvolveE (int lev, Real dt)
{
BL_PROFILE("WarpX::EvolveE()");
Real mu_c2_dt = (PhysConst::mu0*PhysConst::c*PhysConst::c) * dt;
const Real* dx = geom[lev].CellSize();
Real dtsdx_c2[3];
#if (BL_SPACEDIM == 3)
dtsdx_c2[0] = (PhysConst::c*PhysConst::c) * dt / dx[0];
dtsdx_c2[1] = (PhysConst::c*PhysConst::c) * dt / dx[1];
dtsdx_c2[2] = (PhysConst::c*PhysConst::c) * dt / dx[2];
#else
dtsdx_c2[0] = (PhysConst::c*PhysConst::c) * dt / dx[0];
dtsdx_c2[1] = std::numeric_limits<Real>::quiet_NaN();
dtsdx_c2[2] = (PhysConst::c*PhysConst::c) * dt / dx[1];
#endif
long norder = 2;
long nstart = 0;
int l_nodal = false;
long nguard = Efield[lev][0]->nGrow();
BL_ASSERT(nguard == Efield[lev][1]->nGrow());
BL_ASSERT(nguard == Efield[lev][2]->nGrow());
BL_ASSERT(nguard == Bfield[lev][0]->nGrow());
BL_ASSERT(nguard == Bfield[lev][1]->nGrow());
BL_ASSERT(nguard == Bfield[lev][2]->nGrow());
BL_ASSERT(nguard == current[lev][0]->nGrow());
BL_ASSERT(nguard == current[lev][1]->nGrow());
BL_ASSERT(nguard == current[lev][2]->nGrow());
#if (BL_SPACEDIM == 3)
long nxguard = nguard;
long nyguard = nguard;
long nzguard = nguard;
#elif (BL_SPACEDIM == 2)
long nxguard = nguard;
long nyguard = 0;
long nzguard = nguard;
#endif
for ( MFIter mfi(*Efield[lev][0]); mfi.isValid(); ++mfi )
{
const Box & bx = BoxLib::enclosedCells(mfi.validbox());
#if (BL_SPACEDIM == 3)
long nx = bx.length(0);
long ny = bx.length(1);
long nz = bx.length(2);
#elif (BL_SPACEDIM == 2)
long nx = bx.length(0);
long ny = 0;
long nz = bx.length(1);
#endif
warpx_push_evec( (*Efield[lev][0])[mfi].dataPtr(),
(*Efield[lev][1])[mfi].dataPtr(),
(*Efield[lev][2])[mfi].dataPtr(),
(*Bfield[lev][0])[mfi].dataPtr(),
(*Bfield[lev][1])[mfi].dataPtr(),
(*Bfield[lev][2])[mfi].dataPtr(),
(*current[lev][0])[mfi].dataPtr(),
(*current[lev][1])[mfi].dataPtr(),
(*current[lev][2])[mfi].dataPtr(),
&mu_c2_dt, dtsdx_c2, dtsdx_c2+1, dtsdx_c2+2,
&nx, &ny, &nz,
&norder, &norder, &norder,
&nxguard, &nyguard, &nzguard,
&nstart, &nstart, &nstart,
&l_nodal );
}
}
void
WarpX::ComputeDt ()
{
Array<Real> dt_tmp(finest_level+1);
for (int lev = 0; lev <= finest_level; ++lev)
{
const Real* dx = geom[lev].CellSize();
dt_tmp[lev] = cfl * 1./( std::sqrt(D_TERM( 1./(dx[0]*dx[0]),
+ 1./(dx[1]*dx[1]),
+ 1./(dx[2]*dx[2]))) * PhysConst::c );
}
// Limit dt's by the value of stop_time.
Real dt_0 = dt_tmp[0];
const Real eps = 1.e-3*dt_0;
if (t_new[0] + dt_0 > stop_time - eps) {
dt_0 = stop_time - t_new[0];
}
dt[0] = dt_0;
for (int lev = 1; lev <= finest_level; ++lev) {
dt[lev] = dt[lev-1] / nsubsteps[lev];
}
}
void
WarpX::MoveWindow ()
{
if (do_moving_window == 0) return;
// compute the number of cells to shift
int dir = moving_window_dir;
Real new_lo[BL_SPACEDIM];
Real new_hi[BL_SPACEDIM];
const Real* current_lo = geom[0].ProbLo();
const Real* current_hi = geom[0].ProbHi();
const Real* dx = geom[0].CellSize();
moving_window_x += moving_window_v * dt[0];
int num_shift = (moving_window_x - current_lo[dir]) / dx[dir];
if (num_shift == 0) return;
// update the problem domain
for (int i=0; i<BL_SPACEDIM; i++) {
new_lo[i] = current_lo[i];
new_hi[i] = current_hi[i];
}
new_lo[dir] = current_lo[dir] + num_shift * dx[dir];
new_hi[dir] = current_hi[dir] + num_shift * dx[dir];
RealBox new_box(new_lo, new_hi);
geom[0].ProbDomain(new_box);
// shift the mesh fields (Note - only on level 0 for now)
shiftMF(*Bfield[0][0], geom[0], num_shift, dir, Bx_nodal_flag);
shiftMF(*Bfield[0][1], geom[0], num_shift, dir, By_nodal_flag);
shiftMF(*Bfield[0][2], geom[0], num_shift, dir, Bz_nodal_flag);
shiftMF(*Efield[0][0], geom[0], num_shift, dir, Ex_nodal_flag);
shiftMF(*Efield[0][1], geom[0], num_shift, dir, Ey_nodal_flag);
shiftMF(*Efield[0][2], geom[0], num_shift, dir, Ez_nodal_flag);
// remove particles that are outside of the box
mypc->Redistribute(false); // Redistribute particles
}
|
