50 YEARS OF 50 YEARS OF 50 YEARS OF 50 YEARS OF

CFD CFD CFD CFD

Dr. Fakhir Hasani Dr. Fakhir Hasani
Professor & Chairman Professor & Chairman
Department of Mechanical Engineering Department of Mechanical Engineering
NED University of Engineering & Technology NED University of Engineering & Technology
What is CFD? What is CFD? What is CFD? What is CFD?
It is the analysis of systems involving fluid It is the analysis of systems involving fluid
flow, heat transfer and associated flow, heat transfer and associated
phenomena such as chemical reactions by phenomena such as chemical reactions by
means of computer based simulations. means of computer based simulations.
Ho as CFDe ol ed? Ho as CFDe ol ed? How was CFD evolved? How was CFD evolved?
FLUID
DYNAMICS
COMPUTER
SCIENCE
MATHEMATICS
Applications Applications Applications Applications
Aerodynamics of aircraft and vehicles: lift and Aerodynamics of aircraft and vehicles: lift and
drag drag
H d d i f hi H d d i f hi Hydrodynamics of ships Hydrodynamics of ships
Power plants: combustion in diesel/petrol Power plants: combustion in diesel/petrol
engines and gas turbines engines and gas turbines engines and gas turbines engines and gas turbines
Turbomachinery: flows inside rotating passages, Turbomachinery: flows inside rotating passages,
diffusers etc. diffusers etc. diffusers etc. diffusers etc.
Electrical and electronic engineering: cooling of Electrical and electronic engineering: cooling of
equipment including micro equipment including micro- -circuits circuits
Applications (cont ) Applications (cont ) Applications (cont) Applications (cont)
Chemical process engineering: mixing and Chemical process engineering: mixing and
separation, polymer molding separation, polymer molding
External and internal environment of buildings: External and internal environment of buildings:
wind loading, heating and ventilation wind loading, heating and ventilation
l d ff l d ff hh Marine engineering: loads on off Marine engineering: loads on off--shore shore
structures structures
E i t l i i di t ib ti f E i t l i i di t ib ti f Environmental engineering: distribution of Environmental engineering: distribution of
effluents and pollutants effluents and pollutants
Applications (cont ) Applications (cont ) Applications (cont) Applications (cont)
Hydrology and oceanography: Flow in Hydrology and oceanography: Flow in
rivers, estuaries and oceans rivers, estuaries and oceans
Meteorology: Weather prediction Meteorology: Weather prediction
Manufacturing engineering: Flow of Manufacturing engineering: Flow of g g g g g g
material and temperature distribution in material and temperature distribution in
moulds used in sand and die casting moulds used in sand and die casting
Biomedical engineering: blood flow Biomedical engineering: blood flow
through arteries and veins through arteries and veins
Governing Equations Governing Equations Governing Equations Governing Equations
Conservation of Mass Conservation of Mass Co se at o o ass Co se at o o ass
0 ) ( = +

V div
t

Conservation of Momentum Conservation of Momentum

p g
V
ij
+ =

'
.
Conservation of Energy Conservation of Energy
p g
t
ij
+

.
j
i
ij
x
u
T k div
Dt
Dp
Dt
Dh

+ + =
'
) (
where where
) ( ) (
'
divV
x
u
x
u
ij
i
j
j
i
ij
+

=
Mathematical character of Mathematical character of
governing equations governing equations
22
nd nd
Order PDEs Order PDEs
Coupled in pressure and velocity Coupled in pressure and velocity
Solution is very complex Solution is very complex Solution is very complex Solution is very complex
C l t A l i C l t A l i 3 t 3 t Complete Analysis Complete Analysis 3 step process 3 step process
Pre Pre--processing processing
Processing (Solution) Processing (Solution) Processing (Solution) Processing (Solution)
Post Post--processing processing
P e P e p ocessing p ocessing Pre Pre--processing processing
Defining the geometry: The computational Defining the geometry: The computational
domain domain
Grid generation Grid generation the subdivision of the the subdivision of the
domain into a number of smaller, non domain into a number of smaller, non- -
overlapping sub overlapping sub- -domains: a grid (or mesh) domains: a grid (or mesh)
of cells (or control volumes or elements) of cells (or control volumes or elements)
Selection of the physical and chemical Selection of the physical and chemical
phenomena that need to be modeled phenomena that need to be modeled
P e P e p ocessing (cont ) p ocessing (cont ) Pre Pre--processing (cont) processing (cont)
Definition of fluid properties Definition of fluid properties
Specification of appropriate boundary Specification of appropriate boundary Specification of appropriate boundary Specification of appropriate boundary
conditions at cells which coincide with conditions at cells which coincide with
or touch the domain boundary or touch the domain boundary o touc t e do a bou da y o touc t e do a bou da y
Mesh t pes Mesh t pes
Structured Structured
Mesh types Mesh types
Uniform
Structured Structured
Non-uniform
dd Unstructured Unstructured
Meshes can be generated in 2d and 3d. In the first Meshes can be generated in 2d and 3d. In the first
d d h i bili li i d d d h i bili li i d decade mesh generation capability was limited to decade mesh generation capability was limited to
2d structured grids only 2d structured grids only
N me ical Sol tion Techniq es N me ical Sol tion Techniq es Numerical Solution Techniques Numerical Solution Techniques
Finite Difference Methods Finite Difference Methods
Finite Elements Methods Finite Elements Methods Finite Elements Methods Finite Elements Methods
Spectral Methods Spectral Methods
Fi it V l M th d Fi it V l M th d Finite Volume Methods Finite Volume Methods
Finite Diffe ence Methods (FDM) Finite Diffe ence Methods (FDM) Finite Difference Methods (FDM) Finite Difference Methods (FDM)
Finite difference methods describe the Finite difference methods describe the
unknown flow variables by means of point unknown flow variables by means of point y p y p
samples at the grid points. Truncated samples at the grid points. Truncated
Taylor series expansions are used to Taylor series expansions are used to y p y p
generate the finite difference generate the finite difference
approximations of derivatives in terms of approximations of derivatives in terms of pp pp
point samples at each grid point and its point samples at each grid point and its
immediate neighbors immediate neighbors gg
Finite Element Methods (FEM) Finite Element Methods (FEM) Finite Element Methods (FEM) Finite Element Methods (FEM)
FEM use simple piecewise linear or FEM use simple piecewise linear or
quadratic functions valid on elements to quadratic functions valid on elements to
describe the local variations of unknown describe the local variations of unknown
flow variables. The governing equation is flow variables. The governing equation is
p ecisel satisfied b the e act sol tion If p ecisel satisfied b the e act sol tion If precisely satisfied by the exact solution. If precisely satisfied by the exact solution. If
the piecewise approximating functions for the piecewise approximating functions for
unknown variables are substituted into the unknown variables are substituted into the unknown variables are substituted into the unknown variables are substituted into the
equation, it will not hold exactly and a equation, it will not hold exactly and a
residual is defined to measure the errors. residual is defined to measure the errors. residual is defined to measure the errors. residual is defined to measure the errors.
FEM(cont ) FEM(cont ) FEM (cont) FEM (cont)
Next the residuals (and hence the errors) are Next the residuals (and hence the errors) are
minimized by multiplying with a set of weighting minimized by multiplying with a set of weighting
functions and integrating. As a result we obtain functions and integrating. As a result we obtain
a set of algebraic functions for the unknown a set of algebraic functions for the unknown
coefficients of the approximating functions coefficients of the approximating functions coefficients of the approximating functions. coefficients of the approximating functions.
The theory of FEM was initially developed for The theory of FEM was initially developed for
stress analysis and was applied to CFDproblems stress analysis and was applied to CFDproblems stress analysis and was applied to CFD problems stress analysis and was applied to CFD problems
only in the last two decades only in the last two decades
Spect al Methods Spect al Methods Spectral Methods Spectral Methods
Spectral methods approximate the unknowns by Spectral methods approximate the unknowns by
means of truncated Fourier series or series of means of truncated Fourier series or series of
Chebychev polynomials Unlike the FDMor FEM Chebychev polynomials Unlike the FDMor FEM Chebychev polynomials. Unlike the FDM or FEM Chebychev polynomials. Unlike the FDM or FEM
approach the approximations are not local but approach the approximations are not local but
valid throughout the computational domain. We valid throughout the computational domain. We g p g p
replace the unknowns in the governing equation replace the unknowns in the governing equation
by the truncated series. The constraint that lead by the truncated series. The constraint that lead
to the algebraic equations for the coefficients of to the algebraic equations for the coefficients of to the algebraic equations for the coefficients of to the algebraic equations for the coefficients of
the Fourier or Chebychev series is provided by the Fourier or Chebychev series is provided by
Spect al Methods (cont ) Spect al Methods (cont ) Spectral Methods (cont) Spectral Methods (cont)
the weighted residuals concept similar to FEM or the weighted residuals concept similar to FEM or
by making the approximate function coincide by making the approximate function coincide
with exact solution at a number of grid points with exact solution at a number of grid points
Most work on these methods was carried out in Most work on these methods was carried out in
h d d d h d d d the second decade the second decade
Finite Vol me Method (FVM) Finite Vol me Method (FVM) Finite Volume Method (FVM) Finite Volume Method (FVM)
The FVM was originally developed as a The FVM was originally developed as a
special FDM formulation special FDM formulation pp
The CV integration distinguishes the FVM The CV integration distinguishes the FVM
fromall other CFDtechniques fromall other CFDtechniques from all other CFD techniques from all other CFD techniques
The resulting statements express the The resulting statements express the
conservation of relevant properties for conservation of relevant properties for conservation of relevant properties for conservation of relevant properties for
each finite size cell each finite size cell
FVM(cont ) FVM(cont ) FVM (cont) FVM (cont)
The clear relationship between the numerical The clear relationship between the numerical
algorithm and the underlying physical algorithm and the underlying physical
conservation principle forms one of the main conservation principle forms one of the main
attractions of the FVM and makes its concepts attractions of the FVM and makes its concepts
much more simple to understand by engineers much more simple to understand by engineers much more simple to understand by engineers much more simple to understand by engineers
than the FEM or the spectral methods than the FEM or the spectral methods
The FVMuse has dominated the CFDcommunity The FVMuse has dominated the CFDcommunity The FVM use has dominated the CFD community The FVM use has dominated the CFD community
for the last three decades and most commercial for the last three decades and most commercial
CFDcodes are based on this method CFDcodes are based on this method CFD codes are based on this method CFD codes are based on this method
P ocessing P ocessing Processing Processing
Approximation of unknown flow variables Approximation of unknown flow variables
by means of simple functions by means of simple functions y p y p
Discretisation by substitution of the Discretisation by substitution of the
approximations into the governing flow approximations into the governing flow approximations into the governing flow approximations into the governing flow
equations and subsequent mathematical equations and subsequent mathematical
manipulations manipulations manipulations manipulations
Solution of the algebraic equations Solution of the algebraic equations
Disc etisation Disc etisation Discretisation Discretisation
It is the process of approximating the partial It is the process of approximating the partial
derivatives in the governing equations using derivatives in the governing equations using g g q g g g q g
Taylor series and converting them to Taylor series and converting them to
algebraic equations algebraic equations g q g q
E ample of Disc etisation E ample of Disc etisation Example of Discretisation Example of Discretisation
0 =

x
T
u
t
T
0
) (
1 1
1
=

+
+
T T u T T
n
j
n
j
n
j
n
j
0
2
=

+
x t
) (
2
1 1
1 n
j
n
j
n
j
n
j
T T
x
t u
T T
+
+

=
Famo s disc etisation schemes Famo s disc etisation schemes Famous discretisation schemes Famous discretisation schemes
FTCS FTCS
Lax Lax- -Wendroff Wendroff
Crank Nicolson Crank Nicolson Crank Nicolson Crank Nicolson
Richardson Richardson
Leap Frog Leap Frog p g p g
Alternate direction implicit (ADI) Alternate direction implicit (ADI)
Alternate direction explicit (ADE) Alternate direction explicit (ADE)
11
tt
O d U i di O d U i di 11
st st
Order Upwinding Order Upwinding
22
nd nd
and higher order upwinding and higher order upwinding
QUICK QUICK QUICK QUICK
(Most of these schemes were developed during the first (Most of these schemes were developed during the first
two decades) two decades)
Nat e of disc etised schemes Nat e of disc etised schemes Nature of discretised schemes Nature of discretised schemes
Explicit schemes: calculate the value of the flow Explicit schemes: calculate the value of the flow
variable at the new time interval using values at variable at the new time interval using values at
the old time interval for the neighborhood nodes the old time interval for the neighborhood nodes
Implicit schemes: calculate the value of the flow Implicit schemes: calculate the value of the flow
i bl h i i h i i bl h i i h i variable at the new time using the new time variable at the new time using the new time
interval values for neighborhood nodes interval values for neighborhood nodes
E o s in n me ical sol tions E o s in n me ical sol tions Errors in numerical solutions Errors in numerical solutions
Truncation errors due to truncation of series. Truncation errors due to truncation of series.
Higher order accuracy reduces the truncation Higher order accuracy reduces the truncation
error error error error
Machine round Machine round- -off errors result due to chopping off errors result due to chopping
of decimal digits in the machine language. Use of decimal digits in the machine language. Use of decimal digits in the machine language. Use of decimal digits in the machine language. Use
of double precision machines has almost of double precision machines has almost
eliminated machine round eliminated machine round- -off errors off errors
Aliasing error is the inability to resolve small Aliasing error is the inability to resolve small
components of the solution due to grid size components of the solution due to grid size
limitation Larger RAMS reduce aliasing errors limitation Larger RAMS reduce aliasing errors limitation. Larger RAMS reduce aliasing errors. limitation. Larger RAMS reduce aliasing errors.
C diti f i l l ith C diti f i l l ith Conditions for numerical algorithms Conditions for numerical algorithms
How good a numerical algorithm is ? How good a numerical algorithm is ?
It is determined by: It is determined by: It is determined by: It is determined by:
Convergence Convergence
C i t C i t Consistency Consistency
Stability Stability
The FDM algorithms developed during the The FDM algorithms developed during the
first two decades used these criteria first two decades used these criteria
Con e gence Con e gence Convergence Convergence
It is the property of a numerical method It is the property of a numerical method
to produce a solution which approaches to produce a solution which approaches p pp p pp
the exact solution as the grid spacing or the exact solution as the grid spacing or
control volume size reduces to zero. control volume size reduces to zero.
(theoretically difficult to prove) (theoretically difficult to prove)
Consistenc Consistenc Consistency Consistency
Consistency of numerical schemes Consistency of numerical schemes
produce systems of algebraic equations produce systems of algebraic equations p y g q p y g q
which can be demonstrated to be which can be demonstrated to be
equivalent to the original governing equivalent to the original governing q g g g q g g g
equation as the grid size spacing tends to equation as the grid size spacing tends to
zero zero
Stabilit Stabilit Stability Stability
Stability is associated with damping of Stability is associated with damping of
errors as the numerical methods proceeds. errors as the numerical methods proceeds. pp
An unstable scheme can cause wide An unstable scheme can cause wide
oscillations and divergence of the solution oscillations and divergence of the solution gg
Additional conditions fo FVM Additional conditions fo FVM Additional conditions for FVM Additional conditions for FVM
Patankar (1980) formulated rules that yield Patankar (1980) formulated rules that yield
robust finite volume calculations robust finite volume calculations robust finite volume calculations robust finite volume calculations
Conservativeness Conservativeness
B d d B d d Boundedness Boundedness
Transpotiveness Transpotiveness
Conse ati eness Conse ati eness Conservativeness Conservativeness
Conservativeness property ensure global Conservativeness property ensure global
conservation of the entire domain. This is conservation of the entire domain. This is
physically achieved by means of consistent physically achieved by means of consistent
expressions for fluxes through the cell expressions for fluxes through the cell p g p g
faces of adjacent control volumes. faces of adjacent control volumes.
Bo ndedness Bo ndedness Boundedness Boundedness
Property is akin to stability and requires Property is akin to stability and requires
that in a linear problem without sources that in a linear problem without sources pp
the solution is bounded by the minimum the solution is bounded by the minimum
and maximum boundary values of the flow and maximum boundary values of the flow yy
variables. variables.
T anspo ti eness T anspo ti eness Transportiveness Transportiveness
All flow processes involve the phenomena of All flow processes involve the phenomena of
convection and diffusion. Convective phenomena convection and diffusion. Convective phenomena
involve influencing exclusively in the flow involve influencing exclusively in the flow
direction so that a point only experiences effects direction so that a point only experiences effects
due to changes at upstreamlocations Finite due to changes at upstreamlocations Finite due to changes at upstream locations. Finite due to changes at upstream locations. Finite
Volume schemes with the tranportivemness Volume schemes with the tranportivemness
property must account for the directionality of property must account for the directionality of property must account for the directionality of property must account for the directionality of
influencing in terms of the relative strength of influencing in terms of the relative strength of
diffusion to convection. diffusion to convection.
Sol tion of disc eti ed eq ations Sol tion of disc eti ed eq ations Solution of discretized equations Solution of discretized equations
The discretized equations result in a The discretized equations result in a
system of linear algebraic equations which system of linear algebraic equations which y g q y g q
can be represented in matrix form: can be represented in matrix form:
[A] [x]=[C] [A] [x]=[C] [A] [x] [C] [A] [x] [C]
where where [A]=Coefficient Matrix [A]=Coefficient Matrix
[x]=Flowvariable column vector [x]=Flowvariable column vector [x] Flow variable column vector [x] Flow variable column vector
[C]= Constant Matrix (Collection of [C]= Constant Matrix (Collection of
sources terms) sources terms) sources terms) sources terms)
Sol tion Methods Sol tion Methods Solution Methods Solution Methods
1. 1. Direct Methods: provide the solution in a Direct Methods: provide the solution in a
finite and predetermined number of finite and predetermined number of pp
operations using an algorithm that is operations using an algorithm that is
often relatively complicated. often relatively complicated. y p y p
2. 2. Iterative Methods: consists of repeated Iterative Methods: consists of repeated
application of an algorithmthat is usually application of an algorithmthat is usually application of an algorithm that is usually application of an algorithm that is usually
relatively simple. relatively simple.
E amples of di ect methods E amples of di ect methods Examples of direct methods Examples of direct methods
Cramers Rule Cramers Rule
Gaussian Elimination Gaussian Elimination Gaussian Elimination Gaussian Elimination
Tri Tri- -diagonal matrix algorithm diagonal matrix algorithm
LU Decomposition LU Decomposition
Matrix Matrix--Inversion Inversion Matrix Matrix Inversion Inversion
E amples of Ite ati e Methods E amples of Ite ati e Methods Examples of Iterative Methods Examples of Iterative Methods
Gauss Gauss--Seided Seided
Successive Overrelaxation. Successive Overrelaxation.
Pressure Pressure Velocity Coupling Algorithms: Velocity Coupling Algorithms: Pressure Pressure--Velocity Coupling Algorithms: Velocity Coupling Algorithms:
SIMPLE: Semi SIMPLE: Semi- -implicit method for implicit method for
pressure linked equations pressure linked equations p q p q
SIMPLER: SIMPLE Revised. SIMPLER: SIMPLE Revised.
SIMPLEC: SIMPLE Consistent SIMPLEC: SIMPLE Consistent SIMPLEC: SIMPLE Consistent SIMPLEC: SIMPLE Consistent
PISO: Pressure Implicit with Splitting PISO: Pressure Implicit with Splitting
f O t f O t of Operators of Operators
Post Post P ocessing P ocessing Post Post--Processing Processing
Domain geometry and grid display Domain geometry and grid display
Vector plots Vector plots
Li d h d d t l t Li d h d d t l t Line and shaded contour plots Line and shaded contour plots
2d and 3d surface plots 2d and 3d surface plots
Particle tracking Particle tracking Particle tracking Particle tracking
View manipulation (translation, rotation, scaling View manipulation (translation, rotation, scaling
etc.) etc.)
Real time animation Real time animation
Color postscript output Color postscript output
E pe imental Flo Vis ali ation E pe imental Flo Vis ali ation Experimental Flow Visualization Experimental Flow Visualization
CFDin the beginning CFDin the beginning CFD in the beginning CFD in the beginning
urs of pressure distribution
the blade surfaces in the
presence of bubbles
Bubble field simulation around a propeller
using an actual nuclei size distribution as
measured in the ocean shows where the
b bbl b l ( d th i ibl t bubbles become large (and thus visible to
human eyes as cavitation)
erimental setup of the vessel with mixer (left) showing the free surface and vortex
ath it; numerical simulation (right) also shows the free surface and vortex as well ath it; numerical simulation (right) also shows the free surface and vortex, as well
as a plane where a relatively steady velocity field can be observed.
Whe e is CFDheading in f t e? Whe e is CFDheading in f t e? Where is CFD heading in future? Where is CFD heading in future?
ODELING ODELING
Fluid Fluid- -solid interactions (FSI) solid interactions (FSI) ( ) ( )
Multi Multi- -phase flow modeling phase flow modeling
Modeling of gas mixtures Modeling of gas mixtures ode g o gas tu es ode g o gas tu es
Turbulent jet impingements Turbulent jet impingements
Combustion modeling Combustion modeling Combustion modeling Combustion modeling
Non Non--Newtonian flow modeling Newtonian flow modeling
Weather prediction modeling Weather prediction modeling Weather prediction modeling Weather prediction modeling
F t e (cont ) F t e (cont ) Future (cont) Future (cont)
MESH GENERATION MESH GENERATION
Efforts are underway to develop mesh Efforts are underway to develop mesh y p y p
generators with a self generators with a self- -adaptive meshing adaptive meshing
capability. Ultimately such programs will capability. Ultimately such programs will
refine the grid in areas of rapid variations refine the grid in areas of rapid variations
COMPUTATIONAL SIDE COMPUTATIONAL SIDE
Cluster computing Cluster computing
Grid computing Grid computing p g p g
Th k Th k Thank you Thank you