One Dimensional SN
One Dimensional SN
Dimensional Discrete
Ordinates Formulation
Dany Sanchez Dominguez
[email protected]
INSTEC – Cuba
December - 2014
Lecturer 02 - Topics
• One dimensional transport equation
• Discrete ordinate formulation (SN)
• Spatial discretization
• Diamond Difference
• Step and Step Characteristic
Sext x, y, z ,
• Phase-space: x, y, z, , x, y, z, , , , x, y, z, ,
0 2
s x P P x, d Sext x, (9)
1
m 1: N
n 1
n 2
1 - incident, 0
1
2 - incident, 0
2
Discontinuity when
1 0, and 2 0
N /2 2 1 1 2 N /2
0
N /21 N 1 N
DMNT – INSTEC 2014 [email protected] 21 / 61
1D Discrete Ordinates
• Design 1D discrete ordinates for S2, S4 and S8
• Now, we write a boundary conditions for a subset of
discrete ordinates
• Prescribed boundary conditions
m 0 fm , 0, m 1: N / 2
(18)
m L gm , 0, m N / 2 1: N
P2 3 1 0 1,2
1 3
2
0.57735
2 3
Using eq. (21)
1
0, 1 P0 1 2 P0 2 00
2
1 2 1
1
1, 1 P1 1 2 P1 2 10
2
DMNT – INSTEC 2014 [email protected] 25 / 61
1D Discrete Ordinates
• Homework 1: Determine the parameters of SN
quadrature for N=4, 6 and 8.
• The quadrature parameters for a mots used orders
m 0 fm , 0, m 1: N
m L gm , 0, 0 xL
0 1 2 i I 1 I L
x1/2 x3/2 xi 1/2 xi 1/2 xI 1/2 xI 1/2
I spatial cells, i 1: I
I 1 edge cells, xi 1/2
L
hi xi 1/2 xi 1/2
I
• and
hi t ,i so ,i
x
(28) C0,i (29)
m ,i
m t ,i
DMNT – INSTEC 2014 [email protected] 31 / 61
1D Spatial Discretization
• Eq. (26) must be write for any spatial cell i=1:I and any
direction m=1:N
m ,i 1/2 m ,i 1/2 C0,i N S m ,i
m ,i
x
m ,i
2
n 1
n ,i n
t ,i
(26)
m ,i • Unknowns
N(I+1) – edge angular fluxes
m,i 1/2 m,i 1/2
NI - average angular fluxes
Total: N(2I+1)
DMNT – INSTEC 2014 [email protected] 32 / 61
1D Spatial Discretization
• Equations
NI – balance equations
N – boundary conditions (N/2 in each boundary)
Total: N(I+2)
Equations Unknowns
N I 2 N 2 I 1
m ,i
m,i 1/2
xi 1/2 xi 1/2
DMNT – INSTEC 2014 [email protected] 35 / 61
Diamond Difference
• Consider linear behavior of angular flux inside spatial cell
• Auxiliary equations is decoupling in angular directions
• In which conditions this is a good approximation?
• Finer spatial grids
• DD method is a fine mesh method obtain good results in
problems discretized with a high number of spatial cell
• Balance equations. (22), boundary conditions (22) and
auxiliary equations (27) formed an closed algebraic
system for DD method
• The next step is derive an algorithm to implement
iterative scheme to obtain solutions
DMNT – INSTEC 2014 [email protected] 36 / 61
Diamond Difference
• Implicit methods
Construct matrix system
Solve using numerical methods
Lower computational performance (I→)
• Explicit methods
Obtain sweeps expressions
Solve using iterative numerical scheme
High computational performance
S m ,i
2 m ,i x
S sc ,i
1/2 m ,i
t ,i
m ,i
2 mx ,i (34)
2. Initialization
S sc ,i 0 for m 1: N , i 1: I
0
i(0) 0 for i 1: I
DMNT – INSTEC 2014 [email protected] 43 / 61
Diamond Difference - Algorithm
3. Rightgoing sweep
For i 1: I
sum1 0
For m 1: N / 2
Calculate m ,i , eq.(29) using S (sciter,i )
Calculate m ,i 1/2 , eq.(28)
sum1 sum1 m ,im
End
sum1
i
( iter 1)
2
End
m,i 1/2
m,i 1/2
m ,i m ,i
m ,i m,i 1 m,i 1
m,i 1