Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

24TH INTERNATIONAL CONGRESS OF THE AERONAUTICAL SCIENCES

AN ENTROPY VARIABLE-BASED GRIDFREE SOLVER


WITH LU-SGS ACCELERATOR
K. Anandhanarayanan*, M. Nagarathinam* and S.M. Deshpande**
*Scientist, CFD Division, DRDL, Kanchanbagh, Hyderabad-500058, India
**Professor, Dept. of Aerospace Engg., IISc., Bangalore-560012, India

Keywords: Kinetic scheme, Gridfree, Implicit

Abstract derivatives of the Boltzmann equation are


discretized using weighted least squares
Lower-Upper Symmetric Gauss Seidel (LU-
method. The upwinding is done by choosing
SGS) implicit method has been implemented
appropriate stencils from the connectivity based
within the framework of gridfree Least Squares
on sign of the molecular velocity. Finally,
Kinetic Upwind Method (LSKUM). The LU-SGS
method is modified to preserve the generality of taking ψ-moments lead to LSKUM. Higher
the gridfree method for non-symmetric order accuracy in space is achieved using the
connectivity and yet retain matrix-free feature defect correction technique [3]. The q-LSKUM
of the LU-SGS method. Moreover, in the present [4] is an improvement over LSKUM in the
work kinetic boundary conditions are also sense that the entropy variables, also called q-
implemented in the implicit framework. Implicit variables, are used in the defect correction step
scheme for gridfree method is proved to be of LSKUM for obtaining second order accurate
stable for all time steps and a speed-up 5 to 6 is in space including boundary points. Both
obtained without any additional memory LSKUM and q-LSKUM have been applied to a
requirement. These aspects are demonstrated number of 2-D and 3-D problems [5,6] and
through specific examples. found to yield highly accurate results.
The solution to large-scale problems with
explicit method requires large number of
1 Introduction iterations. Convergence acceleration methods
can be used to reduce the computation time.
The Least Squares Kinetic Upwind Method
Among various convergence acceleration
(LSKUM) [1] is a gridfree method that requires
techniques, LU-SGS factorized implicit method
only a cloud of points distributed in the
is popular because it is a matrix-free method.
computational domain and a set of neighbours
The LU-SGS method proposed by Jameson and
around each point (connectivity). Therefore, this
Yoon [7] on structured grid has been
method makes solutions possible to
successfully generalized and extended to
geometrically complex configurations. The
unstructured meshes to solve the Euler and
LSKUM is based on the Kinetic Flux Vector
Navier-Stokes equations by Sharov and
Splitting (KFVS) scheme [2], which exploits the
Nakahashi [8]. The attractive feature of this
connection between the Boltzmann equation of
approximate factorization method is that the
kinetic theory of gases, and the governing
evaluation and storage of the Jacobian matrix is
equations of fluid dynamics by using moment
eliminated by approximating the split flux
method strategy. Euler equations are obtained
Jacobians in the implicit operator. This
by taking ψ-moments of the Boltzmann approximation provides stability for all time
equation with Maxwellian velocity distribution steps and facilitates faster convergence. The
function. The upwinding is done at the resulting LU-SGS method has comparable CPU
molecular level and then taking ψ-moments lead time per time step that of explicit method. LU-
to the KFVS scheme. In the LSKUM, the spatial SGS method has been successfully implemented
1
K. Anandhanarayanan, M. Nagarathinam and S.M. Deshpande

and a speed-up 6 is obtained using KFVS based The residual vector R(Un) is discretized
finite volume Euler and N.S. solvers [9, 10]. using q-LSKUM [3]. Consider a point Po and its
The above approximation of split-flux connectivity C(Po). The connectivity is split
Jacobians does not fetch similar advantages for into two sub stencils C + ( Po ) and C − ( Po ) (Fig.1),
LSKUM, since it uses split stencils of arbitrary such that
size for the spatial derivatives. Therefore, in the
present work, a different approximation is used
C + ( Po ) = [ Pi ∈C ( Po ) : x( Pi ) < x( Po ) ] ⎫⎪
to retain all the advantages of original LU-SGS ⎬ (4)
and yet retain the generality of the LSKUM. C − ( Po ) = [ Pi ∈C ( Po ) : x( Pi ) > x( Po ) ] ⎪⎭
This paper addresses the modification of
LU-SGS method applied to LSKUM and its
implementation in LSKUM based solvers. Pi Po X
Numerical experiments are carried out to prove
the efficacy of the extended LU-SGS method. C + ( Po ) C − ( Po )

2 Implicit q-LSKUM Fig. 1 Sub-stencil for point Po


Consider 1-D unsteady compressible Euler
equations The split fluxes derivatives in Eq. (3) are
evaluated using least squares method with
∂U ∂ above split-stencil such that upwind property is
+ G (U n +1 ) = 0 (1)
∂t ∂x satisfied [1]. Then the residue vector at Po can
be written in discretized form as
where U is vector of conserved variables and G
is the inviscid flux vector. The flux G(Un+1) is ∑ ∆x ∆G
+
i i
+
∑ ∆x ∆G

i i

linearized in time and can be written in terms of R (U on ) =


i∈C ( Po )
+
i∈C ( Po )
(5)
flux Jacobian A and the difference between ∑ ( ∆ xi ) 2 ∑ ( ∆x ) i
2

conserved variables at time levels n and n+1, i∈C + ( Po ) i∈C − ( Po )

δUn+1=Un+1-Un, as
where ∆(.)i = (.)i - (.)o. In order to obtain a
n
⎛ ∂G ⎞ steady-state solution, the spatially discretized
G (U n +1 ) = G (U n ) + ⎜ ⎟ δU
n
Euler equations must be integrated in time. Eq.
⎝ ∂U ⎠
(2) can be written in discretized form using
= G (U ) + A n δ U n
n
Euler implicit time-integration and least squares
method for spatial derivatives at Po as
and substituting in Eq. (1), we get

∂U ∂ ∂ ⎛ δU o ⎞
n ∑ ( Ai+δU i − Ao+δU o ) n ∆xi
+ ( A δ U ) n = − (G (U n )) (2) ⎜ ⎟ +
i∈C + ( Po )
∂t ∂x ∂x ⎝ δt ⎠ ∑ ( ∆ xi ) 2
i∈C + ( Po ) (6)
n
Consider the residue, R(U ), the spatial ∑ ( A δU i

i − A δ U o ) ∆ xi

o
n

derivatives in the RHS of Eq. (2). The above +


i∈C − ( Po )
= − R (U on )
residue can be written in KFVS split-flux [2] ∑ (∆x ) i
2

i∈C − ( Po )
form as

R (U n ) = (G (U n ))
∂x (3) where δt is the time increment. The LHS terms
∂ ∂ are grouped based on node number, i.e.,
= (G + (U n )) + (G − (U n )) corresponding to node Po whose index o and its
∂x ∂x
neighbor Pi, such that index i < o and i > o,
2
AN ENTROPY VARIABLE-BASED GRIDFREE SOLVER WITH LU-SGS ACCELERATOR

⎛ ∑ Ao+ ∆xi ∑− A o− ∆xi ⎞⎟ LSKUM, with the above approximation, the


n n

I
⎜ − i∈C + ( Po ) i∈C ( Po )
⎟ δU o n
− diagonal term becomes
⎜ δt
⎜ ∑ ( ∆ xi ) 2 ∑ ( ∆ xi ) 2 ⎟

i∈C + ( Po ) i∈C − ( Po )
⎝ ⎠ (7)
⎛ ∑ ( Ai δ U i ) ∆ xi
+ n
∑ ( Ai δ U i ) n ∆ xi

⎞ ⎛ ⎧ ∑ ∆xi ∑ ∆x ⎫
⎜ i∈C + ( P ), i < o i∈C − ( Po ), i < o
⎟ ⎜I ⎪ i∈C + ( Po ) ⎪
i
+⎜ + ⎟ i∈C − ( Po )
D= ⎜ − +
o

∑+ ( ∆xi ) 2 ∑ ( ∆ xi ) 2 A⎨ 2⎬
⎪ ∑ ∑ (∆xi ) ⎪
⎜⎜ ⎟⎟
⎜ δt (∆xi ) 2
⎝ i∈C ( Po ) i∈C − ( Po ) ⎠ ⎜
⎝ ⎩ i∈C + ( Po ) i∈C − ( Po ) ⎭
⎜ i∈C +∑ ∑ ( Ai−δU i ) n ∆xi
⎛ ( Ai+δ U i ) n ∆ xi ⎞

+⎜
( Po ), i > o
+
i∈C − ( Po ), i > o
⎟ = − R (U on ) ⎧ ∑ ∆xi ∑ ∆x ⎫⎞
∑+ ( ∆xi ) 2 ∑ ( ∆ xi ) 2 ⎪⎟
i
⎜⎜ ⎟⎟ ⎪ i∈C + ( Po ) i∈C − ( Po )
⎝ i∈C ( Po ) i∈C − ( Po ) ⎠ − ρ ( A)⎨ − 2⎬

⎪ ∑ (∆xi ) 2 ∑− (∆xi ) ⎪ ⎟⎟
⎩ i∈C + ( Po ) i∈C ( Po ) ⎭⎠
The above system of equations can be written in
the matrix form in terms of strict lower L, upper
U and diagonal D block matrices The above diagonal block matrix becomes
scalar diagonal matrix only if the second term in
(L + D + U ) δUn = - R(Un) RHS vanishes. This is possible only for the
symmetric point distributions and cannot be
and the system of equations can be solved using ensured for an arbitrary point distribution.
LU-SGS in two steps as Therefore, in the present work the split-flux
Jacobian is approximated as
Forward sweep: A± = ±ρ(A± ) I

δU* = D–1( - R(Un) – L δU*) and the diagonal block matrix becomes a scalar
diagonal matrix as
Backward sweep:
⎛ ⎧ ∑ ∆xi ⎫ ⎧ ∑ ∆x ⎫⎞
⎜1 ⎪⎟
i
+ ⎪ i∈C ( Po ) ⎪ − ⎪
+
i∈C − ( Po )
δU n
= δU - D ( – U δU )
* –1 * D = ⎜ − ρ ( A )⎨ ⎬ + ρ ( A )⎨ 2⎬
⎟I
⎜ δt
⎜ ⎪ ∑ (∆xi ) 2 ⎪ ⎪ ∑− i ⎪ ⎟⎟
( ∆ x )
⎝ ⎩ i∈C ( Po )
+
⎭ ⎩ i∈C ( Po ) ⎭⎠
The solution involves split flux Jacobian
evaluation and inversion which is which can be inverted easily. The product of
computationally expensive. Consider the split-flux Jacobians with increment in conserved
diagonal term variables appearing in Eq. (7) are approximated
as increment in split-fluxes as

⎜ ∑A +n
o ∆xi ∑A
∆xi ⎞⎟ −n
o
I
D= ⎜ −
i∈C + ( Po )

i∈C − ( Po )
⎟ A ±δU = G ± (U + δU ) −G ± (U ) ≡ δG ±
⎜ δt
⎜ ∑+ (∆xi ) 2 ∑− (∆xi ) 2 ⎟⎟
⎝ i∈C ( Po ) i∈C ( Po )
⎠ Then, the two-step sweep procedure can be
written as
In FVM and FDM methods, the split-flux Forward sweep:
Jacobians are approximated with
⎡ ⎧ ∑ ∆xi δGi+* ∑ ∆x δG −*
⎫⎤
⎢ ⎪⎥
i i
⎪ +
A = ( A ± ρ ( A) I )
1 −
±
δU o* = D −1 ⎢ R(U on ) − ⎨ i∈C ( Po ),i<o 2 + i∈C ( Po ), i <o
⎬⎥
2 ⎢ ⎪ ∑ ∆xi ∑ ∆x 2
i ⎪⎥
⎣ ⎩ i∈C + ( Po ) i∈C − ( Po ) ⎭⎦

where ρ(A) is the spectral radius of flux Backward sweep:


Jacobian A and the approximation makes
diagonal block matrix as a scalar matrix. In ⎡ ∑ ∆xi δGi+ n ∑ ∆x δ G i i
−n

⎢ i∈C + ( Po ),i >o −
i∈C ( Po ), i > o ⎥
δU on = δU o* − D −1 ⎢ + ⎥
⎢ ∑ ∆xi2 ∑ ∆x 2
i ⎥
⎣ i∈C + ( Po ) −
i∈C ( Po ) ⎦ 3
K. Anandhanarayanan, M. Nagarathinam and S.M. Deshpande

It can be observed that in the above two-step than 1.0 for the explicit method. In the current
procedure, the split-flux Jacobian evaluation, implicit calculation, a large time step is chosen
storage and inversions are completely and the CFL number for the implicit scheme is
eliminated. Also, the present approach is as high as 10,000.
applicable to non-symmetric point distribution.
4 Results and Discussions
3 Stability Analysis
The spectral radii approximation to split-flux 4.1 Flow past 2-D bump
Jacobian makes each term in Eq. (15)
individually positive. Presence of time-step term
ensures the system of equations is always
diagonally dominant. Therefore, the solution to
the system is unconditionally stable and allows
a larger time-step. In the present work, the
spectral radii is chosen as
1
ρ ( A± ) = (u ± a ) ± u ± a Fig.2 Point distribution for bump problem
2

Ghosh[1] has made a detailed stability The subsonic flow past 2-D bump problem has
analysis for the explicit method and derived the been studied with two sets of cloud of points
time step requirement as with 2275 points and 8901 points (Fig. 2). Both
∆si explicit and implicit methods are used to obtain
δ t = CFL Min the solution with CFL numbers 0.5 and 10,000
u + 3 RT
respectively. The convergence histories are
shown in Fig. 3. Implicit method converges
where ∆si is the distance between points Po and rapidly even for the finer cloud of points when
its neighbour Pi, R is the gas constant, T is the compared with explicit method. The pressure
absolute temperature and u is the fluid velocity. contours obtained using both explicit and
implicit methods are presented in Fig. 4. It can
be observed that the steady-state solution does
4 Code Development not depend on the time-step chosen. Also
contours are smooth and symmetric about
The above procedure has been implemented in vertical line passing through mid-chord.
2-D q-LSKUM based Euler and Navier-Stokes 0
codes and 3-D q-LSKUM based Euler code. In 10

the implicit method, first explicit method is used 10


-1

to obtain the residue and then two-sweep -2


10
procedure is adopted to update the state Explicit (Fine)
Residue

-3
variables. Kinetic Characteristic Boundary 10
Condition (KCBC) and Kinetic Outer Boundary 10 -4
Conditions KOBC)[11] are implemented to Explicit (Coarse)
10 -5
satisfy the slip wall boundary and farfield
boundary conditions respectively. The code has 10 -6 Implicit (Fine)
been validated for various inviscid test cases to 10
-7 Implicit (Coarse)
verify the modified implicit scheme. In the 0 20000 40000 60000 80000
present work, local time stepping is used for Iteration
time marching. CFL number is chosen smaller
Fig.3 Residue history for flow past bump
4
AN ENTROPY VARIABLE-BASED GRIDFREE SOLVER WITH LU-SGS ACCELERATOR

1
10

10 -1

10 -3

Residue
-5
10
-7
10
-9
10
Explicit
Implicit
10 -11
Fig.4 Pressure contours for flow past bump
10 -13
0 25000 50000 75000 100000 125000
Iteration

4.2 Subsonic viscous flow past NACA0012 Fig. 6 Residue history for viscous flow past
airfoil NACA0012 airfoil

0.53

0.56

0.59 0.53
0.62 0.40
0.03
0.40 0.25

0.43 0.56
0.46

0.53
0.49
0.49

Fig. 7 Mach contours for viscous flow past


Fig. 5 Point distribution for viscous flow NACA0012 airfoil
past NACA0012 airfoil

4.3 Supersonic flow past hemisphere


The 2-D q-LSKUM based Navier-Stokes
code has been applied to solve laminar flow past
NACA 0012 airfoil. A simple cloud with 257 x
97 points including 165 points on the airfoil is
used (Fig. 5). The freestream flow conditions
are M∞ = 0.5, α = 3o and Re = 5000.
Comparison of residue for both implicit and
explicit methods is presented in Fig. 6. A speed-
up 5 is achieved using LU-SGS method. Mach
contours are shown in Fig. 7 which clearly
shows the separation on the upper surface of
airfoil. The flow separates at 55% of the chord.
The length of flow separation region is slightly
under predicted. Fig. 8 Point distribution for flow past
hemisphere

5
K. Anandhanarayanan, M. Nagarathinam and S.M. Deshpande

Next a supersonic flow past hemisphere is 4.4 Supersonic Flow Past Scout Vehicle
considered. The freestream Mach number is 2.0.
The point distribution in the meridian plane is
shown in Fig. 8 and there are 9261 points in the
domain. The residue plot for both explicit and
implicit methods is shown in Fig. 9. The residue
plot shows a speed-up 6 is obtained with the
extended LU-SGS method. Even in supersonic
flow on relatively coarse grid, very good speed-
up is obtained using implicit method without
any extra storage. The pressure contours are
plotted in Fig. 10. The detached shock is
captured very well and contours are smooth. Fig. 11 Point distribution for flow past
Stagnation-to-freestream pressure ratio of 5.86 Scout vehicle
is obtained as compared to theoretical value
5.64. The 3-D q-LSKUM based Euler solver has been
applied to solve the flow past a three-stage
Scout vehicle for which experimental results are
10 0 available [12]. The points in the computational
-1
10 domain are obtained using an elliptic grid
10 -2 generator. The point distribution in the meridian
Explicit plane is shown in Fig. 11. The computed wall
10 -3
Residue

pressure distribution for M∞ = 4.86 and α= 8o is


10 -4 compared with the experimental results [12] and
10 -5 is presented in Fig. 12. Good agreement is
10 -6 apparent. Comparison of residue history for the
Implicit explicit and implicit schemes is given in Fig. 13,
10 -7
which indicates the faster convergence
10 -8 capability of LU-SGS method. Pressure
0 1000 2000 3000 4000 5000
contours near nose are shown in Fig. 14.
Iteration
Detached shock and followed by expansions are
captured.
Fig. 9 Residue history for flow past hemisphere
1.2

1.0 q-LSKUM (Windward)


q-LSKUM (Leeward)
0.8 Expt. (Windward)
Expt. (Leeward)
0.6
Cp
0.4

0.2

0.0

-0.2
0.0 0.2 0.4 0.6 0.8 1.0
X/L
Fig. 12 Cp distribution for flow past Scout
Fig. 10 Pressure contours for flow past vehicle
hemisphere
6
AN ENTROPY VARIABLE-BASED GRIDFREE SOLVER WITH LU-SGS ACCELERATOR

10 0 and implicit methods have been performed. The


-1
numerical simulations show a speed-up of 5 to 6
10 with implicit method over the explicit method.
10 -2
-3
Residue

10 Explicit References
-4
10 [1] Ghosh AK. Robust least squares kinetic upwind
-5 method for inviscid compressible flows. PhD thesis,
10 Department of Aerospace Engineering, Indian
Implicit Institute of Science, Bangalore, 1996.
10 -6
[2] Mandal JC and Deshpande SM. Kinetic flux vector
-7
10 splitting for Euler equations. Computers and Fluids,
Vol. 23, No. 2, pp. 447-478, 1994.
10 -8
0 1000 2000 3000 [3] Deshpande SM. Meshless method, accuracy,
symmetry breaking, upwinding and LSKUM. FM
Iteration report no. 2003 FM 1, Dept. of Aerospace Engg.,
Indian Institute of Science, Bangalore, Jan., 2003.
Fig. 13 Residue history for flow past Scout [4] Dauhoo MZ, Ghosh AK, Ramesh V and Deshpande
SM. q-LSKUM - A new higher order kinetic method
vehicle for Euler equations using entropy variables.
Proceedings ISCFD 99, Bremen, Germany,1999.
[5] Ramesh V. Least squares grid-free kinetic upwind
method. PhD thesis, Dept. of Aerospace Engg.,
2.26 Indian Institute of Science, Bangalore, 2001.
4.00 [6] Deshpande SM. Anandhanarayanan K, Praveen C
7.49
14.46
and Ramesh V. Theory and applications of 3-d
LSKUM based on entropy variables. Int Jnl of
26.67 Numerical Methods in Fluids,2002.
[7] Jameson A and Yoon S. Lower-upper implicit
14.46
7.49
schemes with multiple grids for the Euler equations.
AIAA Journal, Vol. 25, No. 7,1987.
5.74
4.00
2.26 [8] Sharov D and Nakahashi K. Low speed
preconditioning and LU-SGS scheme for 3-d viscous
flow computations on unstructured grids. AIAA Paper
98-0614, 1998.
[9] Balasubramanian R, Anandhanarayanan K and
Fig. 14 Pressure contours near nose region of Nagarathinam M. LU-SGS convergence accelerator
Scout vehicle for KFVS based Euler solver. Proceedings 4th Ae.S.I.
CFD symposium, Bangalore, India, 2001.
[10] Anandhanarayanan K, Nagarathinam M and
Deshpande SM. A KFVS-based N.S. solver.
5. Conclusions Proceedings 3rd Ae.S.I. CFD symposium, Bangalore,
India, 2000.
LU-SGS implicit method has been extended to
[11] Ramesh V, Mathur JS and Deshpande SM. Kinetic
LSKUM-based gridfree solvers. A different
treatment of the farfield boundary condition. FM
approximation is used for the split-flux Jacobian report No. 97 FM2, CFD center, Dept. of Aerospace
to retain all the advantages of original LU-SGS Engg., IISc., April 1997.
method like matrix-free, no-Jacobian [12] Jernell LS. Aerodynamic loading characteristics of a
evaluation, unconditionally stable with 1/10-scale model of the three-stage vehicle at Mach
comparable CPU time per iteration of explicit numbers from 1.57 to 4.65. NASA TND-1930,
Langley research center, 1963.
method. In addition, the present method is
applicable to gridfree methods employing
arbitrary point distribution. Two and three-
dimensional numerical simulations with explicit
7

You might also like