Scribd
Upload
33 views

The Lecture Deals With:: Module 1: Introduction To Finite Difference Method and Fundamentals of CFD

This document discusses explicit and implicit methods for solving partial differential equations numerically using finite difference methods. It explains the explicit method, the implicit Crank-Nicolson method, and how to apply these methods to the 1D and 2D heat conduction equations. The Crank-Nicolson method results in a system of simultaneous linear equations that must be solved to obtain the unknown variable values at each timestep.

Uploaded by

sumanta.kundu318020
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

The Lecture Deals With:: Module 1: Introduction To Finite Difference Method and Fundamentals of CFD

This document discusses explicit and implicit methods for solving partial differential equations numerically using finite difference methods. It explains the explicit method, the implicit Crank-Nicolson method, and how to apply these methods to the 1D and 2D heat conduction equations. The Crank-Nicolson method results in a system of simultaneous linear equations that must be solved to obtain the unknown variable values at each timestep.

Uploaded by

sumanta.kundu318020
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_1.

htm

Module 1: Introduction to Finite Difference Method and Fundamentals of CFD


Lecture 5:

The Lecture deals with:

Explicit and Implicit Methods

1 of 1 6/20/2012 12:22 PM
Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_2.htm

Module 1: Introduction to Finite Difference Method and Fundamentals of CFD


Lecture 5:

Let us now attempt a different discretization of the original partial differential equation
given by Eq. (3.3). Here we express the spatial difference on the right-hand side in terms
of averages between and time level

(5.1)

The differencing shown in Eq. (5.1) is known as the Crank-Nicolson implicit scheme.

The unknown is not only expressed in terms of the known quantities at time level

but also in terms of unknown quantities at time level . Hence Eq. (5.1) at a given grid

point , cannot itself result in a solution of .

1 of 1 6/20/2012 12:22 PM
Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_3.htm

Module 1: Introduction to Finite Difference Method and Fundamentals of CFD


Lecture 5:

Eq. (5.1) has to be written at all grid points, resulting in a system of algebraic equations
from which the unknowns for all can be solved simultaneously. This is a typical
example of an implicit finite-difference solution (Fig. 5.1).

Figure 5.1: Crank Nicolson Implicit Scheme

Since they deal with the solution of large system of simultaneous linear algebraic
equations, implicit methods usually require the handling of large matrices.

Generally, the following steps are followed in order to obtain a solution. Eq (5.1) can be
rewritten as

(5.2)

where or

or

(5.3)

1 of 2 6/20/2012 12:23 PM
Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_3.htm

Eq. (5.3) has to be applied at all grid points, i.e., from to A system of
algebraic will result (refer to Fig 5.1).

at

at

at

at

Finally the equation will be of the form:

Here, we express the system of equation in the form of A ,

where,

C: right-hand side column vector (known),


A: tridiagonal coefficient matrix (known) and
: the solution vector (to be determined).

Note that the boundary values at and are transferred to the known
right-hand side.

For such a tridiagonal system, different solution procedures are available. In order to
derive advantage of the zeros in the coefficient-matrix, the well known Thomas
algorithm (1949) can be used .

2 of 2 6/20/2012 12:23 PM
Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_4.htm

Module 1: Introduction to Finite Difference Method and Fundamentals of CFD


Lecture 5:

Explicit and Implicit Methods for Two-Dimensional Heat Conduction Equation

The two-dimensional conduction is given by

(5.5)

Here, the dependent variable, (temperature) is a function of space and ( )and (


) is the thermal diffusivity.

If we apply the simple explicit method to heat conduction equation, the following
algorithm results

(5.6)

When we apply the crank-Nicolson to the two-dimensional heat conduction equation, we


obtain

(5.7)

where the central difference operators and in two different spatial directions are

defined by

(5.8)

1 of 1 6/20/2012 12:24 PM
Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_5.htm

Module 1: Introduction to Finite Difference Method and Fundamentals of CFD


Lecture 5:

The resulting system of linear algebraic equations is not tridiagonal because of the five
unknowns and In order to examine this further, let us rewrite
Eq. (5.7) as

(5.9)

where

Figure 5.2: Two-dimensional grid on the ( ) plane.

Eq. (5.9) can be applied to the two-dimensional (6×6) computational grid shown in Fig.
5.2.

A system of 16 linear algebraic equations have to be solved at time level, in order


to get the temperature distribution inside the domain. The matrix equation will be as the
following:

1 of 2 6/20/2012 12:24 PM
Objectives_template file:///D:/chitra/nptel_phase2/mechanical/cfd/lecture5/5_5.htm

(5.9)

where

The system of equations, described by Eq. (5.9) requires substantially more computer
time as compared to a tridiagonal system. The equations of this type are usually solved by
iterative methods. These methods will be described in a subsequent lecture. The quantity
is the boundary value.

Congratulations! You have finished Lecture 5. To view the next lecture select it from the
left hand side menu of the page or click the next button.

2 of 2 6/20/2012 12:24 PM

You might also like