Various numerical methods have been devived to solve the heat equation
numerically. The method based on
Finite Difference start with
rewriting the heat equation in terms of finite differences on a
space grid (equally spaced, ) and a time grid (equally spaced,
).
Picture a space and time grid as in the following figure;
The initial temperature field is on the
line.
It must satisfy the boundary conditions. The task is now to solve
for
for all the subsequent time lines under the BCs
constraints.
Note that the grid does not close with a known field profile for large time. This makes it impossible to use an algorithm based on a stencil (averaging) as in the elliptic PDE scheme.
An explicit scheme follows if we use a first
order time derivative, i.e., the forward derivative,
![]() |
(3) |
![]() |
(4) |
Introducing the grid indices,
and
, the
heat equation becomes
![]() |
(5) |
This algorithm is explicit. The index starts at
,
the initial time, with
, and proceeds up to
the desired time.
This yields the finite difference equation for heat transfer.
2015-01-20