Professional Documents
Culture Documents
Nice Morel
Nice Morel
Slide 1/86
Overview
The thermal radiation transport equation in static media
The equations of thermal radiation transport
The analytic equilibrium-diffusion limit
Asymptotic-preserving discretization
Angular, energy, spatial, and temporal discretization
Solution of the transport equation
Source Iteration
Diffusion-Synthetic Acceleration (DSA)
Linear Multifrequency Grey Acceleration (LMFGA)
Preconditioned Krylov adaptation of LMFGA
Slide 2/86
Overview
Thermal radiation transport equation with non-relativistic material motion
(u/c
< 0.01).
Slide 3/86
Basic Equations
The equations of thermal radiation transport consist of a transport
r , , E, t):
s
1 I
+ I + t I =
+ a B(T ) ,
c t
4
and an equation for the material temperature T (
T
Cv
=
t
r , t):
a [ 4B(T ) ] dE .
Slide 4/86
Basic Equations
The angular intensity has units of
Slide 5/86
Basic Equations
1
E
,
1
B(E, T ) = 3 2 exp
h c
kT
2E 3
h is Plancks constant,
k is Boltzmanns constant
There are two other basic equations associated with the transport
Slide 6/86
Basic Equations
The radiation energy equation is obtained by integrating the transport
E
+ F =
t
a [ 4B(T ) ] dE .
1
E
c
I , E d dE ,
I , E d dE .
F
0
Slide 7/86
Basic Equations
E that the radiation intensity integrated over
angle and energy (energy area time), which we denote by , is
equal to cE.
The radiation energy is an energy balance equation stating that the time
transport equation by
energies:
1 F
+ P +
2
c t
=
a
F dE = 0 ,
c
Slide 8/86
Basic Equations
(energy/volume) is given by
Z Z
1
i j I , E d dE ,
c 0
4
Pi,j
Slide 9/86
Nonlinearities
Note that the radiative transfer equations have nonlinearities arising only
Slide 10/86
transport equation.
The regimes are quite different, but most of the computational technology
developed for neutron transport has been applied over the last twenty
years to the radiative transfer equation both in static media and with
nonrelativistic material motion.
Because radiative transfer calculations are much more demanding than
may be required.
Slide 11/86
0.
Slide 12/86
equations.
Scale each physical parameter by an appropriate power of .
Return the scaled equations to dimensional form.
Express the intensity and temperature solutions as power series in .
Substitute these series into the radiative transfer equations.
Expand all functions of the temperature in the radiative transfer
equations in as well.
Create a heirarchical system of equations for the expansion coefficients
Slide 13/86
parameters arise:
t, , the ratio of the characteristic time between photon interactions to
ct
Cv T c
4I E , the ratio of the material internal energy density to the
Slide 14/86
t, .
s,
The previous scaling implies that a,
t,
Cv T c 0 .
4I E
1 .
Slide 15/86
where
4aT 3
T
Cv + 4aT 3
T = 0,
t
3ht i
1
=
ht i
1 B
dE
t T
Z
B
dE .
T
I = B(E, T ) .
Slide 16/86
variational solutions.
Slide 17/86
discretization.
However, it is desirable to have a robust discretization as well.
Accurate (or at least physically-acceptable) interior diffusion solutions with
unresolved boundary layers are also highly desirable since it can be very
difficult to numerically resolve boundary layrers.
Achieving asymptotic preservation is almost entirely a function of the
Slide 18/86
diffusion limit as long as the spatial zoning resolves the variation of the
asymptotic solution.
A consistent but nonasymptotic-preserving discretization will only give
Slide 19/86
Angular Discretization
We use the Sn or discrete-ordinates angular discretization, which is
and the integration over angle is carried out using the quadrature formula.
The discretized equations are:
s
1 Im
+ Im + t Im =
+ a B(T ) , m = 1, M,
c t
4
and
T
Cv
=
t
where
a [ 4B(T ) ] dE .
Im = I( m ) , and =
M
X
Im wm .
m=1
Slide 20/86
Angular Discretization
The biggest weakness of the Sn method is non-physical ray-effects that
arise in optically thin media with localized sources and are caused by a
finite number of photon directions.
The only other major discretization technique is the spherical-harmonic or
Pn method.
The Pn method can be viewed as a Galerkin method based upon a global
Slide 21/86
Energy Discretization
There is only one major energy discretization technique in use, and it is
G continuous intervals or
groups, with the g th group corresponding to E (Eg 1 , Eg+ 1 )
Slide 22/86
Energy Discretization
The trial space representation for the intensity is
I =
G
X
Ig g (E) ,
g=1
where the g th basis function, g , is defined for all g to be zero for all
energies not in group g and can have any desired dependence for
energies within group g , subject to the following normalization:
Eg+ 1
2
g (E) dE = 1 .
Eg 1
2
Slide 23/86
Energy Discretization
I over group g , we find that Ig represents the integral of the
angular intensity over group g :
Z E 1
g+
2
Ig =
I(E)
dE .
Integrating
Eg 1
2
To ensure the correct equilibrium solution for the angular intensity, the
=
B
G
X
Bg g (E) ,
g=1
where
Bg =
Eg+ 1
B(E, T ) dE .
Eg 1
2
Slide 24/86
Energy Discretization
One generally defines the group basis function to have either a
g as follows:
Slide 25/86
Energy Discretization
The multigroup equations take the following form:
1 Ig
s
+ Ig + t,g Ig =
g + a,g Bg (T ) , g = 1, G,
c t
4
and
G
X
T
=
Cv
a,g [ g 4Bg (T ) ] dE ,
t
g=1
where
g =
Ig d ,
Slide 26/86
Energy Discretization
where
g =
Ig d ,
and the multigroup cross sections represent averages over each group as
follows:
a,g =
Eg 1
Eg 1
a (E)g (E) dE ,
Eg+ 1
s,g =
s (E)g (E) dE ,
Eg+ 1
2
with
Slide 27/86
Spatial Discretization
The requirements for spatial discretization schemes are extremely
demanding because:
Within a specific material region, the cross sections can vary with
orders of magnitude.
Problems often contain both optically-thin regions and optically-thick
regions.
Optically thick regions may be strongly absorbing or highly diffusive.
In diffusive regions, the spatial scale-length of the solution can have a
Slide 28/86
Spatial Discretization
It is not clear that one can afford to spatially resolve the transport solution
follows:
Conservative.
Second-order accurate.
Asymptotic preserving.
Nearly positive and highly damped (robust).
For the most part, finite-element discontinuous Galerkin (DG) methods
have the first three properties, but lumping of both the gradient and
interaction terms is generally required to achieve sufficient robustness.
Let us initially consider the asymptotic properties of unlumped DG
schemes.
Slide 29/86
Unlumped DG Properties
The diffusion limit is never preserved with a constant DG trial-space.
Linear or higher-order trial spaces preserve the diffusion limit on
appropriate meshes.
For instance, a linear DG trial space preserves the diffusion limit on
Slide 30/86
Unlumped DG Properties
DG schemes can yield amazingly accurate interior solutions in the
Slide 31/86
5
Conservation Preserving Cell Average
Solution Preserving Cell Average
Analytical Solution
-2 -1
0.2
0.4
0.6
0.8
z (cm)
Slide 32/86
5
Numerical Cell Average
Anaytical Cell Average
Analytical Solution
-2 -1
0.2
0.4
0.6
0.8
z (cm)
Slide 33/86
Lumped DG Schemes
Finite-element lumping improves robustness by reducing the span of the
maintained.
Lumping of the interaction terms (standard mass-matrix lumping) is well
understood and works well in essentially all cases, but lumping of the
gradient terms remains a research topic.
Considerable effort has been expended in recent years on lumping of
difficult.
Slide 34/86
Lumped DG Schemes
It has recently been found that non-orthogonal meshes significantly restrict
gradient lumping.
As a result we expect to see more research on higher-order DG
Slide 35/86
Lumped DG Schemes
Lets consider a simple example problem to demonstrate discontinuous
f
+ f = 0 , for x [0, h], with f (0) = 1,
x
The solution to this equation is
f (x) = exp(x).
f(x) = 1 , for x = 0,
hx
x
= fL
+ fR , otherwise.
h
h
Slide 36/86
Lumped DG Schemes
The equations for fL and fR are
1
(fR + fL ) 1 +
2
2
1
fL + fR h = 0 ,
3
3
and
1
fR (fR + fL ) +
2
2
1
fR + fL h = 0 .
3
3
1 31 h
fR =
.
1
2
2
1 + 6 h + h
This is a superconvergent third-order accurate approximation to
Slide 37/86
Lumped DG Schemes
Lumping the interaction terms, the equations for fL and fR become
1
(fR + fL ) 1 + fL h = 0 ,
2
and
1
fR (fR + fL ) + fR h = 0 .
2
Solving these equations for fR , we obtain
1
fR =
1 2 2 .
1 + h + 2 h
exp(h) that is
strictly positive.
Slide 38/86
Time discretization
Surprisingly, little research has been traditionally been done on
Slide 39/86
Time discretization
We are now investigating a variation of the trapezoidal-BDF-2 method,
form:
f
= Af ,
t
where f is the solution and A is an operator that depends upon f , but is a
linear operator for fixed f . This is analogous to the radiative transfer
equations with the Planck function linearized.
Slide 40/86
Time discretization
Then our scheme can be expressed in predictor-corrector form as follows,
n+ 21
fn
= An
t/2
f n+1 f n
n+ 12
=A
t
n+ 21
+ fn
2
n+ 21
f n+1 + f
3
+ fn
In effect, two sequential solutions must be performed rather than one, but
Slide 41/86
Time discretization
For the case of a linear operator
3
2
n+ 12
t/2
f n+1 f
fn
n+ 21
=A
t/2
1
2
n+ 21
n+ 21
+
2
fn
fn
= Af n+1 .
Slide 42/86
a transport operator.
For many years, such methods were thought to be unconditionally
Slide 43/86
to find ways to either use simpler diffusion discretizations or solve the full
discretizations in an approximate manner without significant loss of
effectiveness.
These efforts have met with limited success.
Furthermore, over the last five years or so, it has been recognized that
Slide 44/86
Slide 45/86
X
1
1
s,g g + g
a,k
k + g , g = 1, G,
Ig + ,g I =
4
4
k=1
T = T +
PG
Cv
n T )
(T
+
4B
k
g
g
g=1 a,g
t
,
PG
B
Cv
g
4
+
k
a,g
g=1
t
T
Presentation at Universit de Nice-Sophia Antipolis, Nice, France, July 30 - September 3, 2007
Slide 46/86
= t + ,
1
=
,
k
ct
PG
Bg
g=1 a,g 4 T
= C
PG
Bg
v
g=1 a,g 4 T
tk +
Bg
a,g
T
g = PG
,
B
k
k=1 a,k T
Bg + gn
g = a,g
1
g
4
"
G
X
k=1
a,k
4Bk
Cv
n
+
(T
T
) .
tk
Slide 47/86
Source Iteration
The traditional method for solving the transport equation is a nested
source iteration.
Denoting the iteration index by , the inner iteration can be represented as
follows:
+1
+1
Ig + ,g Ig
X
1
1
=
s,g g +
g
a,k
k + g ,
4
4
k=1
X
1 +1
1
+1
+1
s,g g =
g
a,k
k + g .
Ig + ,g Ig
4
4
k=1
Slide 48/86
Source Iteration
The operator
f=
PG
Slide 49/86
Source Iteration
The inner iteration process can become arbitrarily slow to converge as
. This corresponds to scattering dominating absorption.
s,g
,g
The outer iteration can become arbitrarily slow to converge as
1 and
used to demonstrate that the most slowly converging error modes for both
iterations are those that slowly vary in space.
Thus the inversion of the advection-reaction operator is a form of
Slide 50/86
Diffusion-Synthetic Acceleration
Inner source iteration with diffusion-synthetic acceleration (DSA) takes the
following form:
+ 1
Ig 2
+ 12
+ ,g
Ig
X
1
1
a,k
k + g ,
s,g g +
g
=
4
4
k=1
+ 1
1
g + ,g
g = s,g
g 2 g ,
s,g
3,g
+1
g
+ 12
g
+ g .
Slide 51/86
Diffusion-Synthetic Acceleration
For the case of an infinite homogeneous medium, Fourier analysis can be
Slide 52/86
+ 12
,g Ig
1 + 21
1
s,g g =
g f + g ,
4
4
hDi + [ha i (1 ) + ] = f
f
+1
=f
+ 12
+ 21
f ,
(1)
+ ha i ,
Slide 53/86
3,g
g=1
ha i =
G
X
g ,
a,g
g=1
g =
,g
PG k
k=1 ,k
Slide 54/86
Slide 55/86
Krylov Methods
The details of Krylov methods are not of importance for this discussion,
Ax = y ,
where A is a matrix,
vector.
A Krylov method will construct an approximate solution to this equation
Kd = r, A r , A r , . . . , A
where
d1
r = y A x 0.
Slide 56/86
Krylov Methods
There are many different types of Krylov solvers that construct this
arbitrary vector,
A on an
v =A z .
It is important to recognize that one need not actually form the matrix
A to
Slide 57/86
Krylov Methods
In many instances, the matrix
technique.
Characterizing the convergence of Krylov methods for general matrices
Slide 58/86
PA x = P y ,
where the matrix P is called the preconditioner.
Ideally,
eigenvectors with eigenvalues closest to zero, and act as the identity for
the remaining eigenvalues.
Slide 59/86
f , from the
equation for f .
Once
1
g f + g , g = 1, G.
Ag Ig =
4
,g
s,g P ,
4
Ag +
Z
hi d ,
Phi =
4
Slide 60/86
Ig =
A1
g
1
g f + A1
g g , g = 1, G.
4
Given
Integrating the above equation over all directions, multiplying on the left by
, and summing over all groups yields the desired equation for f :
,g
Bf =
G
X
PA1
a,g
g g ,
g=1
B = I
G
X
g=1
PA1
a,g
g
1
g ,
4
Slide 61/86
transport equations.
These equations must be solved via a preconditioned Krylov method,
f:
Slide 62/86
CBf = C
G
X
a,g
PA1
g g ,
g=1
C I + ha iH
Slide 63/86
expressed as follows:
f +1 = f + C
G
X
PA1
a,g
g g CBf ,
g=1
Note that this is just Richardson iteration on the system solved in our
Krylov method.
Slide 64/86
associated with the DSA method, and is very effective because it moves
the eigenvalues nearest zero to essentially one.
Once
Slide 65/86
equation for each energy group and each inner preconditioned Krylov
iteration.
A solution of the LMFGA diffusion equation.
The diffusion equations themselves are solved via a precondioned Krylov
method.
If the diffusion solution technique is efficient, the transport solution
Slide 66/86
preconditioners.
It may not always be optimal to use a reduced-rank equation.
To illustrate this point, we consider a variant of our solution technique with
Slide 67/86
each group rather than a transport equation for each group. Thus the
cost per iteration will be lower.
Preconditioning is performed by solving a diffusion equation for each
Slide 68/86
Slide 69/86
g g
Dg g + ,g
G
X
a,k
k = g , g = 1, G,
k=1
.
Ag Dg + ,g
Thus we solve a diffusion equation rather than a transport equation for
each group.
Slide 70/86
non-uniform zoning.
There are two problems: one with a uniform density everywhere and the
other with a density jump of 1000 between the inner and outer regions both were performed with the same 10-group cross sections.
The radiation source is turned on at
Region 3
Region 2
Region 1
0.5
R
Source
0
0
Slide 71/86
t (sh)
Method
Time (s)
No. of Outer
No. of Inner
Iterations
Iterations
LMFGK
327.2
7.98
1424.42
LMFGA
679.1
25.73
2929.14
LMFGK
1776.7
3.55
668.40
LMFGA
2353.6
8.07
785.00
LMFGK
9412.8
1.26
260.32
LMFGA
11020.7
1.56
190.12
0.1
0.01
0.001
Slide 72/86
t (sh)
Method
Time (s)
No. of Outer
No. of inner
Iterations
Iterations
LMFGK
62.8
3.41
455.71
LMFGA
79.3
6.14
472.31
LMFGK
117.3
2.83
403.83
LMFGA
139.4
4.57
376.99
LMFGK
897.7
1.228
249.49
LMFGA
1014.4
1.375
180.97
0.2
0.1
0.01
Slide 73/86
Number of Iterations
80
60
40
20
50
100
Time Step Number
150
200
Slide 74/86
method.
The Krylov method performs takes significantly few iterations with a large
discontinuity in density.
The relative CPU times are not proportional to the number of iterations
because the Krylov method requires more time per outer iteration because
more inner iterations are required with the Krylov method.
This is an unexpected effect that is easily understood.
The inner solves for the acceleration technique have increasingly better
initial guesses as the solution converges - the guesses are the solutions
from the previous outer iteration.
The inner iteration solutions for the Krylov method are independent for
Slide 75/86
Slide 76/86
Slide 77/86
cross sections, which are defined in the rest frame of the material.
It might be assumed that material motion can be neglected for continuum
transport if the material speed is less than a percent of the speed of light,
but care must be taken.
Although the material motion correction terms are relatively small,
neglecting them means that the change in the kinetic energy of the
material due to momentum deposition by the photons will not be removed
from the photon energy field.
This imbalance can be significant over the course of an entire calculation
Slide 78/86
sections kinematically in the lab frame with material motion, but this would
be onerous.
An alternative is to apply an instantanous Lorentz transformation at each
point and time to a frame that is locally at rest with respect to the material.
This is called the comoving frame.
The comoving-frame intensity,
I(t, r , 0 , E0 ), represent the intensity
direction
Slide 79/86
Slide 80/86
1 I
+ I + (E0 /E)t (E0 )I( , E) =
c t
Z
2 s
(E0 /E ) I( , E ) d +(E/E0 )2 a (E0 )B(E0 ) ,
(E/E0 )
4 4
where
E0 = E 1 u /c ,
2
1
2 2
= 1 u /c
E =E
1 u /c
1 u /c
Slide 81/86
nonrelativistic applications:
1 I
s
+ I + t I =
+ a B +
c t
4
s
a
B
a
I+
2 E
+ 2a B B E
a E
t + E
E
4
E
E
E
!
F
s
u /c .
F E
4
E
Slide 82/86
accordance with these constraints that has the following properties when
coupled with the hydrodynamic equations:
Total (radiation plus material) energy and momentum are conserved.
The correct equilibrium solutions for radiation energy density, radiation
to O(u/c).
The approximate equation is almost correct to O(u/c) in an integral sense
Slide 83/86
where
C0,g
3
1
C0,g +
C 1,g ,
4
4
!
u
u
4
= t,g F g g
,
3
c
c
C 1,g
4
= t,g g u .
3
Slide 84/86
are respectively:
E
+ F =
t
G
X
G
X
a,g [ 4Bg g ]
g=1
a,g
Fg
g=1
u
4
g
3
c
,
c
and
Fg
1
+
2
c t
The
=
Pg
G
G
X
X
u
a,g
a,g 4
+
g
,
Fg=
c
c 3
c
g=1
g=1
Slide 85/86
by
4
= F Eu ,
3
which is correct through O(u/c), and they also ensure that there is no
F0
in equilibrium is zero.
Slide 86/86