CFD Lecture 6

Dr. Thomas J. Barber

Numerical Properties: Time-Accurate vs. Time- archin! " Time-marchin!: stea#$-state solution %orm unstea#$ e&uations ' (nterme#iate solution has no meanin! " Time-accurate: time-#epen#ent) vali# at an$ time step

Numerical Concepts

Numerical Concepts
Numerical Properties o% *cheme " Consistenc$
' (mplies numerical e&uations !o to PD+ as t) , !o to -. ' (mplies #iscreti.ation can be reverse# /usin! Ta$lor0 to !et PD+

" *tabilit$
' Ten#enc$ o% error in solution o% al!ebraic e&uations to #eca$ ' (mplies numerical solution !oes to e,act solution o% #iscreti.e# e&uations

" Conver!ence
' *olution o% appro,imate e&uations approaches e,act set o% al!ebraic e&ns. ' *olutions o% al!ebraic e&ns. approaches e,act solution o% P.D.+.1s as x t 0
3overnin! P.D.+.1s L/20

Discretization Consistency

*$stem o% Al!ebraic +&uations

+,act *olution 2

Convergence as x t 0

Appro,imate *olution u

4o5 !oo# are the results6

" Assess the calculation %or ' 3ri# in#epen#ence ' Conver!ence /mathematical0: resi#uals as measure o% ho5 5ell the %inite #i%%erence e&uation is satis%ie#. 7 Loo8 %or location o% ma,imum errors 7 Loo8 %or non-monotonicit$

P.D.E. F .D.E. R.M .S . Max

Lu = 0
n Lu n ( xi , y j ) = ij 0

error error =

( L2

1 norm) = N at

( )
i, j

n 2 ij

( )

n ij max

xi , y j

Preprocessin! 3eometr$ 9 3ri# 3eneration :(ntro;

<h$ #oes preprocessin! ta8e so lon!6

" 4i!h-%i#elit$ anal$sis process time /historicall$0
Geometry & Grid (60%) Solution Analysis (20%) (20%)

"

ulti-%i#elit$ anal$sis approach is t$picall$ use#) but

' Do the$ start 5ith lo5 %i#elit$ results6 ' Are the hi!h %i#elit$ anal$sis results too late to have an e%%ect6
0 D !eanline "D 2 D Streamline #D

Co#e Preprocessin!
3eometr$ " CAD !eometr$ must be a#apte# = cleane# up %or !ri# !eneration an# %lo5 solution
' eliminate bolts) %illets) real !eometr$ e%%ects ' eliminate casin! !aps or treat 5ith a boun#ar$ con#ition

" *o%t5are not available to maintain common #atabase

' CAD CFD anal$sis) 4eat Trans%er anal$sis) > ' CFD ?D anal$ses @D anal$ses AD anal$ses

" 3eometrical topolo!ies are %re&uentl$ not suite# to simple !ri##in! concepts

3eometr$: 3as Turbine Combustor

$uel ,n-ector $lo% into 'ig( *ur+ine

Co#e Preprocessin!

$lo% &rom 'ig( Com)ressor

Co#e Preprocessin!
3eometr$: Combustor Liner

Dilution .et

Co#e Preprocesin!
3ri# 3eneration Bptions
Y, j i-1,j i,j i,j-1 i+1,j

" *tructure# 3ri# = *tructures Data

i,j+1

Ui,j

" 2nstructure# Data = *tructure# 3ri#

60 Y 35 10

61

X,i 62

U36

36 11

37 12

Co#e Preprocessin!
3ri# 3eneration

" Attributes o% a ba# !ri# ' some points insi#e bo#$ ' %e5 points on or near sur%ace

Co#e Preprocessin!
3ri# 3eneration
*rans&ormation to a ne% coordinate system *rans&ormation to a stretc(ed grid

3ri# 3eneration - 3eneric Topolo!ies

" !ore com)licated grids can +e constructed +y com+ining t(e +asic grid to)ologies cylinder in a duct

Co#e Preprocessin!

/loc0 structured 1 2 '

1verset or C(imera Cartesian 2 3olar

/ot( ta0e advantage o& natural symmetries o& t(e geometry

3ri# 3eneration - 3eneric Topolo!ies

" !ore com)licated grids can +e constructed ta0ing advantage o& sim)le elements

Co#e Preprocessin!

Cartesian ste)%ise

4nstructured (y+rid

Dimension @D AD

4nstructured trian!ular tetrahe#ra

Structured &ua#rilateral he,ahe#ra

3ri# Topolo!$ De%initions = Bptions

an$ #i%%erent cell=element an# !ri# t$pes are available. " Choice #epen#s on the problem an# the solver capabilities. " Cell or element t$pes:
"

Terminolo!$
" Cell C control volume into 5hich #omain is bro8en up. " No#e C !ri# point. " Cell center C center o% a cell. " +#!e C boun#ar$ o% a %ace. " Face C boun#ar$ o% a cell. " Done C !roupin! o% no#es) %aces) an# cells:
' <all boun#ar$ .one. ' Flui# cell .one. cell center node

face cell 2D computational grid

node edge face cell 3D computational grid

" Domain C !roup o% no#e) %ace an# cell .ones.

3ri# t$pes: structure# !ri#

" *in!le-bloc8) structure# !ri#.
' i)E)8 in#e,in! to locate nei!hborin! cells. ' 3ri# lines must pass all throu!h #omain.

" Bbviousl$ can1t be use# %or ver$ complicate# !eometries.

Face meshin!: structure# !ri#s

" Di%%erent t$pes o% he,ahe#ral !ri#s. " *in!le-bloc8.
' The mesh has to be represente# in a sin!le bloc8. ' Connectivit$ in%ormation /i#enti%$in! cell nei!hbors0 %or entire mesh is accesse# b$ three in#e, variables: i) E) 8. *in!le-bloc8 !eometr$ + + + + Lo!ical representation.

" *in!le-bloc8 meshes ma$ inclu#e ?F- #e!ree corners .

3ri# t$pes: multibloc8

" ulti-bloc8) structure# !ri#. ' 2ses i)E)8 in#e,in! 5ithin each mesh bloc8. ' The !ri# can be ma#e up o% /some5hat0 arbitraril$connecte# bloc8s. " ore %le,ible than sin!le bloc8) but still limite#.

Source: www.cfdreview.com

Face meshin!: multibloc8

" Di%%erent t$pes o% he,ahe#ral !ri#s. ' ulti-bloc8. ' The mesh can be represente# in multiple bloc8s. ulti-bloc8 !eometr$ representation. Lo!ical

' This structure !ives %ull control o% the mesh !ra#in!) usin! e#!e meshin!) 5ith hi!h-&ualit$ elements. ' anual creation o% multi-bloc8 structures is usuall$ more time-consumin! compare# to unstructure# meshes.

3ri# t$pes: unstructure#

" 2nstructure# !ri#. ' The cells are arran!e# in an arbitrar$ %ashion. ' No i)E)8 !ri# in#e,) no constraints on cell la$out. " There is some memor$ an# CP2 overhea# %or unstructure# re%erencin!.

Unstructured mesh on a dinosaur

Face meshin!: unstructure# !ri#s

" Di%%erent t$pes o% he,ahe#ral !ri#s.
' 2nstructure#. ' The mesh has no lo!ical representation.

2nstructure# 3ri#

Face meshin!: Gua# e,amples

" Gua#: ap.

" Gua#: *ubmap.

" Gua#: Tri-Primitive.

" Gua#: Pave an# Tri-Pave.

3ri# t$pes: h$bri#

" 4$bri# !ri#.
' 2se the most appropriate cell t$pe in an$ combination. 7 Trian!les an# &ua#rilaterals in @D. 7 Tetrahe#ra) prisms an# p$rami#s in AD. ' Can be non-con%ormal: !ri#s lines #on1t nee# to match at bloc8 boun#aries. tetrahe#ral volume mesh is !enerate# automaticall$ prism la$er e%%icientl$ resolves boun#ar$ la$er

trian!ular sur%ace mesh on car bo#$ is &uic8 an# eas$ to create

non-conformal interface

Tetrahe#ral mesh
" *tart %rom AD boun#ar$ mesh containin! onl$ trian!ular %aces. " 3enerate mesh consistin! o% tetrahe#ra.

omplex !eometrie"

Surface me"# for a grid containing onl$ tetra#edra

Donal h$bri# mesh

" Flo5 ali!nment 5ell #e%ine# in speci%ic re!ions. " *tart %rom AD boun#ar$ an# volume mesh:
' Trian!ular an# &ua#rilateral %aces. ' 4e,ahe#ral cells.

" 3enerate .onal h$bri# mesh) usin!:

' Tetrahe#ra. ' +,istin! he,ahe#ra. ' Transition elements: p$rami#s. Surface me"# for a grid containing #exa#edra, p$ramid", and tetra#edra (and pri"m")

Noncon%ormal mesh
" Parametric stu#$ o% comple, !eometries. " Noncon%ormal capabilit$ allo5s $ou to replace portion o% mesh bein! chan!e#. " *tart %rom AD boun#ar$ mesh or volume mesh. " A## or replace certain parts o% mesh. " Hemesh volume i% necessar$.

%onconformal me"# for a valve port

nonconformal interface

esh namin! conventions - topolo!$

" *tructure# mesh: the mesh %ollo5s a structure# i)E)8 convention. " 2nstructure# mesh: no re!ularit$ to the mesh. " ultibloc8: the mesh consists o% multiple bloc8s) each o% 5hich can be either structure# or unstructure#.

esh namin! conventions ' cell t$pe

" " " " " Tri mesh: mesh consistin! entirel$ o% trian!ular elements. Gua# mesh: consists entirel$ o% &ua#rilateral elements. 4e, mesh: consists entirel$ o% he,ahe#ral elements. Tet mesh: mesh 5ith onl$ tetrahe#ral elements. 4$bri# mesh: mesh 5ith one o% the %ollo5in!:
7 Trian!les an# &ua#rilaterals in @D. 7 An$ combination o% tetrahe#ra) prisms) p$rami#s in AD. 7 Boun#ar$ la$er mesh: pri.ms at 5alls an# tetrahe#ra ever$5here else. 7 4e,core: he,ahe#ra in center an# other cell t$pes at 5alls.

" Pol$he#ral mesh: consists o% arbitrar$ pol$he#ra. " Noncon%ormal mesh: mesh in 5hich !ri# no#es #o not match up alon! an inter%ace.

Co#e Preprocessin!
3ri# 3eneration

esh &ualit$
" For the same cell count) he,ahe#ral meshes 5ill !ive more accurate solutions) especiall$ i% the !ri# lines are ali!ne# 5ith the %lo5. " The mesh #ensit$ shoul# be hi!h enou!h to capture all relevant %lo5 %eatures. " The mesh a#Eacent to the 5all shoul# be %ine enou!h to resolve the boun#ar$ la$er %lo5. (n boun#ar$ la$ers) &ua#) he,) an# prism=5e#!e cells are pre%erre# over tri1s) tets) or p$rami#s. " Three measures o% &ualit$:
' *8e5ness. ' *moothness /chan!e in si.e0. ' Aspect ratio.

esh &ualit$: s8e5ness

" T5o metho#s %or #eterminin! s8e5ness:
?. Base# on the e&uilateral volume: 7 *8e5ness C 7 Applies onl$ to trian!les an# tetrahe#ra. 7 De%ault metho# %or tris an# tets.
optimal (e'uilateral) cell circumcircle

@. Base# on the #eviation %rom a normali.e# e&uilateral an!le: &0 &0 min 7 *8e5ness /%or a &ua#0 C max max ,

actual cell

&0

&0

7 Applies to all cell an# %ace shapes. 7 Al5a$s use# %or prisms an# p$rami#s.

+&uian!le s8e5ness
" Common measure o% &ualit$ is base# on e&uian!le s8e5. " De%inition o% e&uian!le s8e5:
max e e min max , 1(0 e e

5here:
ma, C lar!est an!le in %ace or cell. min C smallest an!le in %ace or cell. e C an!le %or e&uian!ular %ace or cell. 7 e.!.) 6- %or trian!le) I- %or s&uare.

max min

" Han!e o% s8e5ness:

0 )e"t

1 wor"t

esh &ualit$: smoothness an# aspect ratio

" Chan!e in si.e shoul# be !ra#ual /smooth0.

"moot# c#ange in cell "i+e

large *ump in cell "i+e

" Aspect ratio is ratio o% lon!est e#!e len!th to shortest e#!e len!th. +&ual to ? /i#eal0 %or an e&uilateral trian!le or a s&uare.

a"pect ratio , 1

#ig#-a"pect-ratio 'uad

a"pect ratio , 1

#ig#-a"pect-ratio triangle

*trivin! %or &ualit$

" A poor &ualit$ !ri# 5ill cause inaccurate solutions an#=or slo5 conver!ence. " inimi.e e&uian!le s8e5:
' 4e, an# &ua# cells: s8e5ness shoul# not e,cee# -.FJ. ' Tri1s: s8e5ness shoul# not e,cee# -.FJ. ' Tets: s8e5ness shoul# not e,cee# -.I.

"

inimi.e local variations in cell si.e:

' +.!. a#Eacent cells shoul# not have Ksi.e ratio1 !reater than @-L.

" (% such violations e,ist: #elete mesh) per%orm necessar$ #ecomposition an#=or pre-mesh e#!es an# %aces) an# remesh.

3ri# #esi!n !ui#elines: resolution

" Pertinent %lo5 %eatures shoul# be a#e&uatel$ resolve#.

flow

inade'uate

)etter

" Cell aspect ratio /5i#th=hei!ht0 shoul# be near one 5here %lo5 is multi-#imensional. " Gua#=he, cells can be stretche# 5here %lo5 is %ull$#evelope# an# essentiall$ one-#imensional.
0low Direction

-./

3ri# #esi!n !ui#elines: smoothness

" Chan!e in cell=element si.e shoul# be !ra#ual /smooth0.

"moot# c#ange in cell "i+e

"udden c#ange in cell "i+e 1 23-4D/

" (#eall$) the ma,imum chan!e in !ri# spacin! shoul# be M@-L:

5
xi

5
xi61

x i+1 1.2 x i

3ri# #esi!n !ui#elines: total cell count

" ore cells can !ive hi!her accurac$. The #o5nsi#e is increase# memor$ an# CP2 time. " To 8eep cell count #o5n:
' 2se a non-uni%orm !ri# to cluster cells onl$ 5here the$ are nee#e#. ' 2se solution a#aption to %urther re%ine onl$ selecte# areas.

" Cell counts o% the or#er:

' ?+N are relativel$ small problems. ' ?+J are interme#iate si.e problems. ' ?+6 are lar!e. *uch problems can be e%%icientl$ run usin! multiple CP2s) but mesh !eneration an# post-processin! ma$ become slo5. ' ?+O are hu!e an# shoul# be avoi#e# i% possible. 4o5ever) the$ are common in aerospace an# automotive applications. ' ?+F an# more are #epartment o% #e%ense st$le applications.

*olution a#aption
" 4o5 #o $ou ensure a#e&uate !ri# resolution) 5hen $ou #on1t necessaril$ 8no5 the %lo5 %eatures6 *olution-base# !ri# a#aptionP " The !ri# can be re%ine# or coarsene# b$ the solver base# on the #evelopin! %lo5:
' ' ' ' *olution values. 3ra#ients. Alon! a boun#ar$. (nsi#e a certain re!ion.

3ri# a#aption
" 3ri# a#aption a##s more cells 5here nee#e# to resolve the %lo5 %iel#. " T$picall$) CFD so%t5are /e.!. Fluent0 a#apt on cells liste# in re!ister. He!isters can be #e%ine# base# on:
7 7 7 7 7 7 7 7 7 7 3ra#ients o% %lo5 or user-#e%ine# variables. (sovalues o% %lo5 or user-#e%ine# variables. All cells on a boun#ar$. All cells in a re!ion. Cell volumes or volume chan!es. $Q in cells a#Eacent to 5alls. Combine a#aption re!isters. Dra5 contours o% a#aption %unction. Displa$ cells mar8e# %or a#aption. Limit a#aption base# on cell si.e an# number o% cells.

" To assist a#aption process) $ou can:

A#aption e,ample: %inal !ri# an# solution

2D planar "#ell - final grid

2D planar "#ell - contour" of pre""ure final grid