Académique Documents
Professionnel Documents
Culture Documents
Introduction to CFD
1.1
1.1.2
YES!
For RANS calculations, there are
0 equation models - Mixing length hypothesis
1 equation models - turbulence kinetic energy transport equation
2 equation models - k model
Stress transport models : DSM, ASM
Also there are DIA, EDQNM, RNG k ....
Not one of them works perfectly for all flow problems!
1.2
1.3
Looking ahead
Over the next few weeks, we shall be looking at various aspects of the discretisation process, including
Interpolation schemes
Approaches to discretisation;
Finite difference methods
6
1.4
Interpolation schemes
1.5
Motivation
Interpolation methods
(n1)
such that P
(xk ) = fk . i.e. the polynomial interpolates the set S. In the following sections, we examine a number of ways in which the desired interpolating
polynomial P (n1) (x) can be derived.
2.1
n1
m=0
am (xi )m = fi .
x00
x01
x02
..
.
x10
x11
x12
x20
x21
x22
Xa = f
..
a0
a1
a2
..
.
f0
f1
=
.
f
2
.
.
.
The coefficient vector a can be found formally by inverting the linear system to
obtain a = X1 f .
While straightforward, this method is undesirable due to the coefficient matrix rapidly becoming ill conditioned with increasing n. Ill conditioning will be
discussed later in the course, but for now it is sufficient to point out that ill
conditioning renders difficult the task of accurately inverting the X matrix. Ill
conditioning arises because of the increasingly near linear dependence between
successively higher monomials of x. Another drawback of the approach is that
it requires a linear system solver, which could be expensive.
2.2
Newtons Method
Suppose we fit a straight line between (x0 , f(x0 )) and (x1 , f(x1 )). We call the
resultant polynomial P (1) (x);
P (1) (x) = f0 +
f1 f0
(x x0 ) = b0 + b1 (x x0 ).
x1 x0
b0
b1 (x x0 )
b2 (x x0 ) (x x1 )
..
.
+ bn1 (x x0 ) (x x1 ) . . . (x xn1 )
or
P
(n1)
(x) = b0 +
n1
m=1
m1
bm
(x xr ) .
r=0
Calculation of the bi is straightforward but tedious. The resultant polynomial is identical to that obtained by the method of undetermined coefficients,
but circumvents the ill-conditioning of the coefficient matrix.
2.3
Lagranges Method
Suppose that, for each point (xi , f (xi )), we introduce a polynomial Li (x) designed such that
1 j = i 0 i, j n 1
Li (xj ) =
.
0
j
= i
4
2
-2
-1
2
1
-2
-1
-2
-2
-4
-4
-6
-6
n1
fm Lm (x)
m=0
2.3.1
design of Lm (x)
Lm (x) has part of the desired property, i.e. Lm (xj ) = C mj where C is some
constant. To complete the construction, we need to normalize Lm (xj ). We do
this by observing that at xm the value of Lm (xm ) is
Lm (xm ) = (xm x0 ) (xm x1 ) . . . (xm xm1 ) (xm xm+1 ) . . . (xm xn1 ) .
Hence if we divide Lm (x) through by this value, the resultant polynomial will
have all of the desired properties. We finally arrive at the definition of the
Lm (x);
n1
x xi
0 m n 1.
Lm (x) =
xm xi
i=0,i=m
All of the schemes so far presented can be applied to the entire set of points
(xi , f (xi )), or to contiguous subsets of these points. This last point will be
returned to later in the context of finite differences, finite volumes and Taylor
series expansions. If the function f (x) P (n1) (x) m < n (i.e. the function is
a polynomial of degree less than that estimated by the number of points), then
these methods will automatically find that polynomial.
11