Professional Documents
Culture Documents
1-1
FDM
1-2
FDM
1-3
FDM
1-4
FDM
1-5
FDM
1-6
FDM
1-7
FDM
1-8
FDM
1-9
FDM
1-10
FDM
1-11
FDM
1-12
FDM
1-13
FDM
1-14
FDM
1-15
FDM
1-16
FDM
1-17
FDM
1-18
FDM
1-19
FDM
1-20
FDM
1-21
FDM
Using this approach, now we derive the three point central difference
formula for second order derivative
1-22
FDM
1-23
FDM
1-24
FDM
1-25
POLYNOMIAL FITTING
1-26
POLYNOMIAL FITTING
1-27
POLYNOMIAL FITTING
1-28
POLYNOMIAL FITTING
Derive fourth order central difference Eq. by fitting a polynomial of
degree 4 on uniform grid. Also obtain the corresponding
approximations for the first, third and fourth order derivatives.
1-29
POLYNOMIAL FITTING
1-30
POLYNOMIAL FITTING
1-31
POLYNOMIAL FITTING
1-32
POLYNOMIAL FITTING
1-33
POLYNOMIAL FITTING
1-34
POLYNOMIAL FITTING
1-35
APPROXIMATION OF SECOND ORDER DERIVATIVE IN
GENERIC TRANSPORT EQUATION
1-36
APPROXIMATION OF SECOND ORDER DERIVATIVE IN
GENERIC TRANSPORT EQUATION
1-37
FINITE DIFFERENCE DISCRETE ALGEBRAIC SYSTEM
This equation is linear for a linear PDE, and non-linear for non-linear
PDEs. In the latter case, the non-linear equation would require linearization
in the process of its numerical solution.
(1)
where index P represents the node at which the PDE is approximated and l
denotes the neighboring node involved in finite difference approximation.
Coefficients Al and AP are functions of grid size and material properties. QP
contains all the terms which do not contains unknown variable 1-38
FINITE DIFFERENCE DISCRETE ALGEBRAIC SYSTEM
The node P and its neighbors form the so called computational molecule
(or stencil). In the finite difference and the finite volume methods, compass
notation is usually employed, i.e. for a node (i, j), node (i+1, j) is denoted by
E (eastern neighbor), node (i, j-1) is denoted by S (southern neighbor), and
so on. Figure depicts the computational molecules in 1D ,2D and 3D
1-39
FINITE DIFFERENCE DISCRETE ALGEBRAIC SYSTEM
Collection of algebraic equation (1) at all the computational nodes leads to
a system of algebraic equations given by
(2)
For structured grids, variables are usually ordered starting from a corner
and traversing line after-line in a regular manner. This ordering scheme is
called lexicographic ordering and results in a poly-diagonal structure for
matrix A.
1-41
FINITE DIFFERENCE DISCRETE ALGEBRAIC SYSTEM
1-42
FINITE DIFFERENCE DISCRETE ALGEBRAIC SYSTEM
1-43
ONE DIMENSIONAL HEAT CONDUCTION
1-44
ONE DIMENSIONAL HEAT CONDUCTION
1-45
TWO DIMENSIONAL HEAT CONDUCTION
1-46
ONE DIMENSIONAL ADVECTION-DIFFUSION
1-47
ONE DIMENSIONAL ADVECTION-DIFFUSION
1-48
ONE DIMENSIONAL HEAT CONDUCTION
1-49
ONE DIMENSIONAL HEAT CONDUCTION
1-50
ONE DIMENSIONAL HEAT CONDUCTION
1-51