Finite difference method
Derivation from Taylor's polynomial 
Assuming the function whose derivatives are to be approximated is properly-behaved, by Taylor's theorem,
where n! denotes the factorial of n, and Rn(x) is a remainder term, denoting the difference between the Taylor polynomial of degree n and the original function. Again using the first derivative of the function f as an example, by Taylor's theorem,
Setting, x0=a and (x-a)=h we have,
Dividing across by h gives:
Solving for f'(a):
so that for sufficiently small,
Accuracy and order 
The error in a method's solution is defined as the difference between its approximation and the exact analytical solution. The two sources of error in finite difference methods are round-off error, the loss of precision due to computer rounding of decimal quantities, and truncation error or discretization error, the difference between the exact solution of the finite difference equation and the exact quantity assuming perfect arithmetic (that is, assuming no round-off).
To use a finite difference method to attempt to solve (or, more generally, approximate the solution to) a problem, one must first discretize the problem's domain. This is usually done by dividing the domain into a uniform grid (see image to the right). Note that this means that finite-difference methods produce sets of discrete numerical approximations to the derivative, often in a "time-stepping" manner.
An expression of general interest is the local truncation error of a method. Typically expressed using Big-O notation, local truncation error refers to the error from a single application of a method. That is, it is the quantity if refers to the exact value and to the numerical approximation. The remainder term of a Taylor polynomial is convenient for analyzing the local truncation error. Using the Lagrange form of the remainder from the Taylor polynomial for , which is
- , where ,
the dominant term of the local truncation error can be discovered. For example, again using the forward-difference formula for the first derivative, knowing that ,
and with some algebraic manipulation, this leads to
and further noting that the quantity on the left is the approximation from the finite difference method and that the quantity on the right is the exact quantity of interest plus a remainder, clearly that remainder is the local truncation error. A final expression of this example and its order is:
This means that, in this case, the local truncation error is proportional to the step size.
Example: ordinary differential equation 
For example, consider the ordinary differential equation
The Euler method for solving this equation uses the finite difference quotient
to approximate the differential equation by first substituting in for u'(x) and applying a little algebra to get
The last equation is a finite-difference equation, and solving this equation gives an approximate solution to the differential equation.
Example: The heat equation 
- (boundary condition)
- (initial condition)
One way to numerically solve this equation is to approximate all the derivatives by finite differences. We partition the domain in space using a mesh and in time using a mesh . We assume a uniform partition both in space and in time, so the difference between two consecutive space points will be h and between two consecutive time points will be k. The points
will represent the numerical approximation of
Explicit method 
We can obtain from the other values this way:
So, with this recurrence relation, and knowing the values at time n, one can obtain the corresponding values at time n+1. and must be replaced by the boundary conditions, in this example they are both 0.
Implicit method 
If we use the backward difference at time and a second-order central difference for the space derivative at position (The Backward Time, Centered Space Method "BTCS") we get the recurrence equation:
We can obtain from solving a system of linear equations:
The scheme is always numerically stable and convergent but usually more numerically intensive than the explicit method as it requires solving a system of numerical equations on each time step. The errors are linear over the time step and quadratic over the space step.
Crank–Nicolson method 
Finally if we use the central difference at time and a second-order central difference for the space derivative at position ("CTCS") we get the recurrence equation:
This formula is known as the Crank–Nicolson method.
We can obtain from solving a system of linear equations:
The scheme is always numerically stable and convergent but usually more numerically intensive as it requires solving a system of numerical equations on each time step. The errors are quadratic over both the time step and the space step:
Usually the Crank–Nicolson scheme is the most accurate scheme for small time steps. The explicit scheme is the least accurate and can be unstable, but is also the easiest to implement and the least numerically intensive. The implicit scheme works the best for large time steps.
See also 
- Finite difference
- Finite difference time domain
- Stencil (numerical analysis)
- Finite difference coefficients
- Five-point stencil
- Lax–Richtmyer theorem
- Finite difference methods for option pricing
- Crank, J. The Mathematics of Diffusion. 2nd Edition, Oxford, 1975, p. 143.
- K.W. Morton and D.F. Mayers, Numerical Solution of Partial Differential Equations, An Introduction. Cambridge University Press, 2005.
- Oliver Rübenkönig, The Finite Difference Method (FDM) - An introduction, (2006) Albert Ludwigs University of Freiburg
- Autar Kaw and E. Eric Kalu, Numerical Methods with Applications, (2008) 
- List of Internet Resources for the Finite Difference Method for PDEs
- Finite Difference Method of Solving ODEs (Boundary Value Problems) Notes, PPT, Maple, Mathcad, Matlab, Mathematica
- Lecture Notes Shih-Hung Chen, National Central University
- Randall J. LeVeque, Finite Difference Methods for Ordinary and Partial Differential Equations, SIAM, 2007.
- Finite Difference Method
- Finite Difference Method for Boundary Value Problems
- Finite Difference Methodology in Materials Science