Abstract
Abstract
Abstract
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
CHAPTER 2. TEMPORAL INTEGRATION 41<br />
integrate out for a long period of time in hopes of reaching this state from some<br />
initial condition. This method is needlessly costly to perform if we are not interested<br />
in tracking the transient solution. Another method, the one we use, is to apply an<br />
inexact-Newton method to the Wigner equation. We use the FORTRAN nonlinear<br />
solver NITSOL [29] which implements a forward differencing Newton-GMRES(m)<br />
with line searching method. We use K −1 as a preconditioner for the GMRES solve,<br />
since K −1 is an approximate inverse of the Jacobian W ′ ( f). The argument for this<br />
is the same as that for the preconditioner used in the temporal integration.<br />
For this problem, we wanted the initial iterate to satisfy the boundary conditions<br />
given in (1.11), (1.12) to avoid spending iterations resolving them. So for each x in the<br />
domain, we enforced the boundary conditions, which depend only on k. The 2-norm<br />
of the residual of the initial iterate was on the order of 10 −3 and 10 −4 , depending on<br />
the grid.<br />
Tabulated below are the preconditioned and unpreconditioned Newton- GMRES(m)<br />
statistics. For the preconditioned GMRES(m), m = 100 and for the unpreconditioned<br />
problem, we use m = 800. We terminate the nonlinear iteration when the first of<br />
three things happen: 400 nonlinear iterations have been taken, the 2-norm of the<br />
step is less than 10 −13 , or the 2-norm of the function is less than 10 −13 . We also used<br />
ηm = 1 . In the tables below, NLI stands for the number of nonlinear iterations, Avg.<br />
10<br />
Kry/N means the average number of Krylov iterations per Newton, and Line Search<br />
Red. is the number of line search reductions taken in the whole Newton iteration.