Upwind scheme - Alchetron, The Free Social Encyclopedia

In computational physics, upwind schemes denote a class of numerical discretization methods for solving hyperbolic partial differential equations. Upwind schemes use an adaptive or solution-sensitive finite difference stencil to numerically simulate the direction of propagation of information in a flow field. The upwind schemes attempt to discretize hyperbolic partial differential equations by using differencing biased in the direction determined by the sign of the characteristic speeds. Historically, the origin of upwind methods can be traced back to the work of Courant, Isaacson, and Rees who proposed the CIR method.

Model equation

To illustrate the method, consider the following one-dimensional linear advection equation

∂ u ∂ t + a ∂ u ∂ x = 0

which describes a wave propagating along the x -axis with a velocity a . This equation is also a mathematical model for one-dimensional linear advection. Consider a typical grid point i in the domain. In a one-dimensional domain, there are only two directions associated with point i – left (towards negative infinity) and right (towards positive infinity). If a is positive, the travelling wave solution of the equation above propagates towards the right, the left side of i is called upwind side and the right side is the downwind side. Similarly, if a is negative the travelling wave solution propagates towards the left, the left side is called downwind side and right side is the upwind side. If the finite difference scheme for the spatial derivative, ∂ u / ∂ x contains more points in the upwind side, the scheme is called an upwind-biased or simply an upwind scheme.

First-order upwind scheme

The simplest upwind scheme possible is the first-order upwind scheme. It is given by

( 1 ) u i n + 1 − u i n Δ t + a u i n − u i − 1 n Δ x = 0 for a > 0 ( 2 ) u i n + 1 − u i n Δ t + a u i + 1 n − u i n Δ x = 0 for a < 0

Compact form

Defining

a + = max ( a , 0 ) , a − = min ( a , 0 )

and

u x − = u i n − u i − 1 n Δ x , u x + = u i + 1 n − u i n Δ x

the two conditional equations (1) and (2) can be combined and written in a compact form as

( 3 ) u i n + 1 = u i n − Δ t [ a + u x − + a − u x + ]

Equation (3) is a general way of writing any upwind-type schemes.

Stability

The upwind scheme is stable if the following Courant–Friedrichs–Lewy condition (CFL) is satisfied.

c = | a Δ t Δ x | ≤ 1.

A Taylor series analysis of the upwind scheme discussed above will show that it is first-order accurate in space and time. Modified wavenumber analysis shows that the first-order upwind scheme introduces severe numerical diffusion/dissipation in the solution where large gradients exist(due to neccessity of high wavenumbers to represent sharp gradients).

Second-order upwind scheme

The spatial accuracy of the first-order upwind scheme can be improved by including 3 data points instead of just 2, which offers a more accurate finite difference stencil for the approximation of spatial derivative. For the second-order upwind scheme, u x − becomes the 3-point backward difference in equation (3) and is defined as

u x − = 3 u i n − 4 u i − 1 n + u i − 2 n 2 Δ x

and u x + is the 3-point forward difference, defined as

u x + = − u i + 2 n + 4 u i + 1 n − 3 u i n 2 Δ x

This scheme is less diffusive compared to the first-order accurate scheme and is called linear upwind differencing (LUD) scheme.

Third-order upwind scheme

For the third-order upwind scheme, u x − in equation (3) is defined as

u x − = 2 u i + 1 + 3 u i − 6 u i − 1 + u i − 2 6 Δ x

and u x + is defined as

u x + = − u i + 2 + 6 u i + 1 − 3 u i − 2 u i − 1 6 Δ x

This scheme is less diffusive compared to the second-order accurate scheme. However, it is known to introduce slight dispersive errors in the region where the gradient is high.

References

Upwind scheme Wikipedia

(Text) CC BY-SA

Contents