This document provides an introduction to grid generation techniques used for computational modeling. It discusses the key steps in modeling as pre-processing, analysis, and post-processing. Pre-processing involves creating geometry and discretizing it into a mesh using automatic grid generation methods. Structured grid generation techniques are described, including algebraic mapping, transfinite interpolation, and conformal mapping to map complex geometries to a simple rectangular shape. Metrics and transformations are discussed to account for changes due to grid generation.
This document provides an introduction to grid generation techniques used for computational modeling. It discusses the key steps in modeling as pre-processing, analysis, and post-processing. Pre-processing involves creating geometry and discretizing it into a mesh using automatic grid generation methods. Structured grid generation techniques are described, including algebraic mapping, transfinite interpolation, and conformal mapping to map complex geometries to a simple rectangular shape. Metrics and transformations are discussed to account for changes due to grid generation.
Original Description:
Tutorial on Grid generation by T.Sundararajan, HOD, Mechanicsl Dept., IIT Madras
This document provides an introduction to grid generation techniques used for computational modeling. It discusses the key steps in modeling as pre-processing, analysis, and post-processing. Pre-processing involves creating geometry and discretizing it into a mesh using automatic grid generation methods. Structured grid generation techniques are described, including algebraic mapping, transfinite interpolation, and conformal mapping to map complex geometries to a simple rectangular shape. Metrics and transformations are discussed to account for changes due to grid generation.
This document provides an introduction to grid generation techniques used for computational modeling. It discusses the key steps in modeling as pre-processing, analysis, and post-processing. Pre-processing involves creating geometry and discretizing it into a mesh using automatic grid generation methods. Structured grid generation techniques are described, including algebraic mapping, transfinite interpolation, and conformal mapping to map complex geometries to a simple rectangular shape. Metrics and transformations are discussed to account for changes due to grid generation.
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
You are on page 1/ 73
AN INTRODUCTION TO
GRID GENERATION BY T.SUNDARARAJAN DEPT. OF MECHANICAL ENGG. PROFESSOR, IIT MADRAS
STEPS INVOLVED IN MODELING
PRE-PROCESSING (CREATION GEOMETRY & MESH AND APPLICATION OF BOUNDARY CONDITIONS) ANALYSIS (SOLUTION OF GOVERNING EQUATIONS --> Mass, Momentum & Energy balance) POST-PROCESSING (ESTIMATION OF DESIRED QUANTITIES- SAY, HEAT TRANSFER FROM PREDICTION OF TEMPERATURE, ETC.)
PRE-PROCESSING CREATION OF GEOMETRY USING SOLID MODELING OR SURFACE MODELING TECHNIQUES DISCRETISATION OF THE GEOMETRY INTO MESH BY AUTOMATIC GRID GENERATION METHODS APPLICATION OF BOUNDARY CONDITIONS AND SPECIFICATION OF INPUTS
AUTOMATIC GRID GENERATION
DISCRETISATION OF COMPLEX GEOMETRIES INTO A MESH WITH DESIRED PROPERTIES GENERATION OF STRUCTURED MESH FOR FINITE DIFFERENCE/ FINITE VOLUME METHOD APPLICATIONS GENERATION OF UNSTRUCTRED MESH FOR FINITE ELEMENT METHOD ADAPTIVE MESH FOR REGIONS OF SHARP GRADIENTS IN SOLUTION
AIRCRAFT MODEL
DISCRETISATION ERROR Ti 1 Ti d 2 T x d 3 T x 2
2 3 x i dx i 2! dx i 3! T Ti i 1 0(x ) x
dT
dx
Ti Ti 1 d 2T x d 3T x 2 dT
2 3 dx
x dx 2 ! dx
i 3! T T i i 1 0(x) x
dT
dx
Ti 1 Ti 1
O (x 2 ) 2x
GRID ADAPTION SINCE DISCRETISATION ERROR DEPENDS ON GRADIENTS, WHEREVER GRADIENTS ARE HIGH, STEP SIZE SHOULD BE SMALL. WE CAN PROPOSE THAT DT/DX h, WHERE h IS THE STEP SIZE. OR, DT/DX.h = CONSTANT. REFINING THE GRID AT LOCATIONS OF HIGH GRADIENTS AND DEREFINING AT LOCATIONS OF LOW GRADIENTS WILL LEAD TO OPTIMAL USE OF GRID POINTS. HENCE ONE CAN GET ACCURATE SOLUTIONS WITH LESS NUMBER OF GRID POINTS.
LAUNCH VEHICLE
STRUCTURED GRID GENERATION
INVOLVES MAPPING OF COMPLEX GEOMETRY INTO A SIMPLE RECTANGULAR SHAPE BODY FITTING COORDINATES ARE EMPLOYED SIMPLIFICATION GEOMETRY RESULTS IN COMPLEX FORM OF GOVERNING EQUATIONS LENGTHS, AREAS, VOLUMES AND VECTORS (VELOCITIES ETC.) NEED TO BE TRANSFORMED MAPPING TRANSFORMATION SHOULD BE SMOOTH, PREFERABLY CONFORMAL AND PROVIDE CONTROL OVER GRID SPACING
STRUCTURED GRIDS MAPPING BY BODY- FITTING COORDINATE TRANSFORMATIONS ISOPARAMETRIC MAPPING OF SUB-DOMAINS AND CREATION OF MULTI- BLOCK GRIDS THE SEQUENCE OF MAPPING DETERMINES WHETHER THE FINAL MESH WILL BE A PSEUDORECTANGULAR, O-TYPE, C-TYPE OR H-TYPE MESH
PSEUDO- RECTANGULAR MESH
ISOPARAMETRIC MAPPING m
x N i ( , ) xi i 1
and
y N i ( , ) yi i 1
MULTI- BLOCK STRUCTURED GRIDS
MAPPING CONFIGURATIONS
TRANSFORMATION RELATIONS Coordinate transformation implies =(x, y) and = (x, y). Or, x =x(, ) and y = y(, )
Here, (x,y) are physical coordinates and ()
are body-fitting coordinates.
METRIC DERIVATIVES x d x dx y dy
dx
dy x x
x dx
dy y
y x
y y x
y y y
x y z z z
y y
dx
dy
x d
y d 1
x x
1 y
| J | y
y z
x y z
y z
TRANSFORMATION OF DERIVATIVES T T T Tx x x x
T T T Ty y y y
T 2 2 2 2 2 T Txx Tyy
x y
2T 2T
2 2 xx y y
2 x
2 y
TRANSFORMATION OF COORDINATES 2T 2T T T T T C p k t t 2 2 Q( x , y ) C p t
y
x 2 2 2
k 2
T 2 2 2 Q( , ) 0 2 ( x y ) 2 x y 2 2( y y x x )
| J|
LENGTHS, AREAS, VOLUMES
e dl e dl kdA
e dl i dx jdy i x d jy d
e dl i dx jdy i x d jy d
kdA e dl e dl k x y y x dd k | J | dd
dv e dl . e dl e dl | J | ddd
VECTORS (COVARIANT, CONTRAVARIANT)
e dl i x d
e dl i x d
e dl i x d
jy d kz d
jy d kz d
jy d kz d
i x j y k z
| | x2
y2
z2
i x j y kz
| | x2 y2 z2
i x j y k z
| | x2 y2 z2
METHODS OF STRUCTURED MESH GENERATION
STRUCTURED GRID METHODS
ALGEBRAIC MAPPING (ANALYTICAL & TRANSFINITE INTERPOLATION) CONFORMAL MAPPING USE OF ELLIPTIC, PARABOLIC & HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS
ALGEBRAIC MAPPING D
=1
=1
=0
=0
B (x,y)
=1
=0
C =1
A (
=0
ALGEBRAIC MAPPING Consider the simply connected domain shown in Figure whose sides AB, BC, CD and DA are given by the equations f1 (x, y) = 0, f2(x, y) = 0, f3(x, y) = 0 and f4(x, y) = 0 respectively. Without loss of generality; one can map the curves AB and CD onto the lines = 0 and = 1.0, using a transformation of the form
f 1 ( x , y ) / { f 1 ( x , y ) f 3 ( x , y )} Similarly, it can be assumed that
f 4 ( x, y) / { f 4 ( x, y) f 2 ( x, y) }
TRANSFINITE INTERPOLATION
Apply unidirectional interpolation in -direction (or direction) between the boundary grid data given on the curves = 0 and = 1 (or = 0 and = 1) and obtain the coordinates x'p yp' for every interior and boundary point.
Calculate the mismatch between the interpolated and the actual
coordinates on the = 0 and = I (or = 0 and = 1) boundaries.
Linearly interpolate the difference in the boundary point
coordinates in (or direction and find the correction to be applied to the coordinates of every interior point.
CONFORMAL MAPPING THIS USES MAPPING TRANSFORMATION OF THE FORM W = F(Z) OR Z = G(W) WHERE Z = X + i Y AND W = U + i V DEPENDING ON THE TRANSFORMATION FUNCTION USED, SOME GEOMETRY IN (X,Y) DOMAIN CAN BE MAPPED INTO A SIMPLER SHAPE IN (U,V) DOMAIN MAPPING IS CONFORMAL, EXCEPT AT A FEW SINGULAR POINTS CAN BE USED FOR 2-D DOMAINS
CONFORMAL MAPPING w = u + iv = f (z) w = u+ iv = z2 = (x2 - y2) + 2ixy
Consider
z = (w + 1 / w) / 2 z = x + iy = (i-i x = (cos y = (sin
SCHWARTZ CHRISTOFFEL TRANSFORMATION z C ( w u1 ) k1 ( w u2 ) k2 ...( w un ) kn dw K Where ki = / It is easy to show that ,
i 1
ki 2
PDE BASED METHODS
ELLIPTIC AND HYPERBOLIC PDES ARE COMMONLY USED ELLIPTIC PDE TRANSFORMATIONXXYYZZP XXYYZZQ XXYYZZR HERE, P, Q, R ARE CONTROL FUNCTIONS FOR OBTAINING DESIRED STEP SIZE VARIATION
STRUCTURED MESH GENERATION BY FEM 2 W {
i P}dxdy 0
W { i Q}dxdy 0
UNSTRUCTURED MESH GENERATION INVOLVES ALGORITHMIC DIVISION OF GIVEN GEOMETRY USING DESIRED ELEMENT SHAPES SPECIFIC REGIONS OF THE GEOMETRY COULD BE REFINED (INTRODUCTION OF NEW NODES & ELEMENTS) OR DEREFINED (REMOVAL OF NODES/ ELEMENTS)
UNSTRUCTURED MESH GENERATION TRIANGULATION METHODS - DIVISION OF LARGE TRIANGLES - DELAUNAY TRIANGULATION - ADVANCING FRONT TECHNIQUE QUADTREE/ OCTREE METHODS SWAPPING/ SMOOTHING OF ADJACENT ELEMENTS MAY BE REQUIRED
THREE DIMENSIONAL GRID
GENERATION
ADAPTIVE MESH GENERATION
MESH IS REFINED/ DEREFINED DEPENDING ON SOME MEASURE OF ERROR ERROR MEASURES CAN DEPEND ON GRADIENTS, FLUX MISMATCH, FINITE ELEMENT RESIDUE ETC. DEPENDING ON THE LEVEL OF ERROR, THE EXTENT OF ERROR CAN BE DECIDED
STRUCTURED MESH ADAPTION W
1 a b| dT / dx| c| d 2 T / dx 2 |... k |{d n T / dx n |
= W
These are called as error equi-distribution methods
MODELLING OF PREMIXED COMBUSTION IN A PROPAGATING FLAME
1-D PREMIXED FLAME
PROPAGATION T 2T 2 Q exp(k / T ) t x 2
Q exp(k / T ) t x 2
At x = 0;
0 x x
At x=1; T = To, x 0
x= 0
x=1
ERROR BASED GRID ADAPTION
N j ( x) j
T N j ( x)T j
T 2T N i ( t x 2 Q exp(k / T ))dx 0 E2n(t) = E2(t) =
hn2 12 p 2
2 r ( x, t )dx
e(n)
2 E n (t ) n
ERROR ON UNIFORM MESHES
PREDICTION ON UNIFORM MESHES
SOLUTION WITH ADAPTIVE MESH
H-VERSION & MOVING MESHES
ERROR ON ADAPTIVE MESHES
CONCLUSIONS AUTOMATIC GRID GENERATION HELPS IN REDUCING DRUDGERY OF USER INPUT ADAPTIVE GRID GENERATION IMPROVES THE ACCURACY OF PREDICTIONS STRUCTURED OR UNSTRUCTURED MESHES MAY BE GENERATED DEPENDING ON THE DEMAND OF THE APPLICATION
