Finite Difference Methods
Learning Objectives
- Approximate derivatives using the Finite Difference Method
Finite Difference Approximation
For a differentiable function , the derivative is defined as
Let’s consider the forward finite difference approximation to the first derivative as
where is often called a “perturbation”, i.e., a “small” change to the variable (small when compared to the magnitude of ). By the Taylor’s theorem, we can write
for some . Rearranging the above we get
Therefore, the truncation error of the finite difference approximation is bounded by , where is a bound on for near .
Using a similar approach, we can summarize the following finite difference approximations:
Forward Finite Difference Method
In addition to the computation of , this method requires one function evaluation for a given perturbation, and has truncation order .
Backward Finite Difference Method
In addition to the computation of , this method requires one function evaluation for a given perturbation, and has truncation order .
Central Finite Difference Method
This method requires two function evaluations for a given perturbation ( and ), and has truncation order .
Reference text: “Scientific Computing: an introductory survey” by Michael Heath
Review Questions
ChangeLog