Advanced Mathematics for Engineers and Scientists/Finite Difference Method

From testwiki
Jump to navigation Jump to search

Finite Difference Method

The finite difference method is a basic numeric method which is based on the approximation of a derivative as a difference quotient. We all know that, by definition:

u(x)=limΔx0u(x+Δx)u(x)Δx

The basic idea is that if Δx is "small", then

u(x)u(x+Δx)u(x)Δx

Similarly,

u(x)=limΔx0u(x+Δx)2u(x)+u(xΔx)Δx2
u(x)u(x+Δx)2u(x)+u(xΔx)Δx2

It's a step backwards from calculus. Instead of taking the limit and getting the exact rate of change, we approximate the derivative as a difference quotient. Generally, the "difference" showing up in the difference quotient (ie, the quantity in the numeriator) is called a finite difference which is a discrete analog of the derivative and approximates the nth derivative when divided by Δxn.

Replacing all of the derivatives in a differential equation ditches differentiation and results in algebraic equations, which may be coupled depending on how the discretization is applied.

For example, the equation

ut=2ux2

may be discretized into:

u(x,t+Δt)u(x,t)Δt=u(x+Δx,t)2u(x,t)+u(xΔx,t)Δx2
u(x,t+Δt)=u(x,t)+ΔtΔx2(u(x+Δx,t)2u(x,t)+u(xΔx,t))

This discretization is nice because the "next" value (temporally) may be expressed in terms of "older" values at different positions.

Template:BookCat