Finite Difference Methods


Learning Objectives

Finite Difference Approximation

For a differentiable function f:RR, the derivative is defined as

f(x)=limh0f(x+h)f(x)h

Let’s consider the forward finite difference approximation to the first derivative as

f(x)f(x+h)f(x)h

where h is often called a “perturbation”, i.e., a “small” change to the variable x (small when compared to the magnitude of x). By the Taylor’s theorem, we can write

f(x+h)=f(x)+f(x)h+f(ξ)h22

for some ξ[x,x+h]. Rearranging the above we get

f(x)=f(x+h)f(x)hf(ξ)h2

Therefore, the truncation error of the finite difference approximation is bounded by Mh/2, where M is a bound on |f(ξ)| for ξ near x.

Using a similar approach, we can summarize the following finite difference approximations:

Forward Finite Difference Method

In addition to the computation of f(x), this method requires one function evaluation for a given perturbation, and has truncation order O(h).

f(x)=f(x+h)f(x)h

Backward Finite Difference Method

In addition to the computation of f(x), this method requires one function evaluation for a given perturbation, and has truncation order O(h).

f(x)=f(x)f(xh)h

Central Finite Difference Method

This method requires two function evaluations for a given perturbation (f(x+h) and f(xh) ), and has truncation order O(h2).

f(x)=f(x+h)f(xh)2h

Reference text: “Scientific Computing: an introductory survey” by Michael Heath

Review Questions

ChangeLog