Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Upwind scheme

Numerical Algorithm

Upwind schemes are a class of numerical discretisation methods used in computational physics to solve hyperbolic partial differential equations. They estimate derivatives in a flow field using data points biased toward the upwind side of the query point, the side from which the flow is coming, instead of using symmetric neighbours. Historically the origin of upwind methods is traced to the CIR method proposed by Courant, Isaacson and Rees. The simplest is the first-order upwind scheme, illustrated on the one-dimensional linear advection equation. It is stable only when the Courant-Friedrichs-Lewy condition is satisfied and is first-order accurate in space and time, and it introduces severe numerical diffusion where gradients are large. Using three data points instead of two gives the second-order upwind scheme, which offers a more accurate finite difference stencil for the spatial derivative.

Connections

In Field

Source Upwind scheme (Wikipedia)
Sources
Upwind scheme (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead
    In computational physics, the term advection scheme refers to a class of numerical discretization methods for solving hyperbolic partial differential equations.
  • In Field: Computational Science, Lead
    In computational physics, the term advection scheme refers to a class of numerical discretization methods for solving hyperbolic partial differential equations.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.