computational fluid dynamics, the upwind schemes are any of a class of discretizationmethods to solve hyperbolic partial differential equations numerically. The wave equation, the advectionequation, the Euler equationsin fluid dynamics, etc. belongs to hyperbolic PDEs. Upwind schemes use an adaptive or solution-sensitive finite differencestencil to numerically simulate more properly the direction of propagation of information in a flow field. More specifically, 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 Reeves who proposed the CIR method. [Courant, R., Isaacson, E., and Rees, M. (1952). "On the Solution of Non-Linear Hyperbolic Differential Equations", Comm. Pure Appl. Math., 5, 243.]
To illustrate the method, consider the following one-dimensional linear wave equation:It describes a wave propagating in the -direction with a velocity . The preceding equationis also a mathematical model for one-dimensional linear advection. Consider a typical grid point in thedomain. In a one-dimensional domain, there are only two direction associated with point - left andright. If is positive the left side is called "upwind" side and right side is the "downwind" side. Similarly, if is negative the left side is called "downwind" side and right side is the "upwind" side. If the finite difference scheme for the spatial derivative, contains morepoints 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 [cite book |last=Patankar |first=S. V. |title=Numerical Heat Transfer and Fluid Flow |publisher=
Taylor & Francis|year=1980 |isbn=978-0891165224] ::Defining:and:the two conditional equations (1) and (2) can be combined and written in a compact form as:Equation (3) is a general way of writing any upwind-type schemes.The upwind scheme is stable if the following Courant–Friedrichs–Lewy condition(CFL) condition is satisfied. [cite book |last=Hirsch |first=C.|title=Numerical Computation of Internal and External Flows|year=1990|publisher= John Wiley & Sons|isbn=978-0471924524] :
Taylor seriesanalysis of the upwind scheme discussed above will show that it is first-order accurate in space and time. The first-order upwind scheme introduces severe numerical diffusionin the solution where large gradients exists.
econd-order upwind scheme
The spatial accuracy of the first-order upwind scheme can be improved by choosing a more accurate finite difference stencil for the approximation of spatial derivative. For the second-order upwind scheme, in equation (3) is defined as :and is defined as :This scheme is less diffusive compared to the first-order accurate scheme.
Third-order upwind scheme
For the third-order upwind scheme, in equation (3) is defined as:and is defined as :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.
Finite volume method
Wikimedia Foundation. 2010.
Look at other dictionaries:
MUSCL scheme — MUSCL stands for Monotone Upstream centered Schemes for Conservation Laws , and the term was introduced in a seminal paper by Bram van Leer (van Leer, 1979). In this paper he constructed the first high order , total variation diminishing (TVD)… … Wikipedia
Flux limiter — Flux limiters are used in high resolution schemes mdash; numerical schemes used to solve problems in science and engineering, particularly fluid dynamics, described by partial differential equations (PDE s). They are used in high resolution… … Wikipedia
MacCormack method — In computational fluid dynamics, the MacCormack method is a widely used discretization scheme for the numerical solution of hyperbolic partial differential equations (hyperbolic PDEs). This second order finite difference method is introduced by R … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations. It is a second order method in time, implicit in time, and is numerically … Wikipedia
Spectral method — Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain Dynamical Systems, often involving the use of the Fast Fourier Transform. Where applicable, spectral methods have… … Wikipedia
Numerical partial differential equations — is the branch of numerical analysis that studies the numerical solution of partial differential equations (PDEs). Numerical techniques for solving PDEs include the following: The finite difference method, in which functions are represented by… … Wikipedia
Multigrid method — Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not… … Wikipedia
Collocation method — In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations. The idea is to choose a finite dimensional space of candidate solutions… … Wikipedia
Method of lines — The method of lines (MOL, NMOL, NUMOL) (Schiesser, 1991; Hamdi, et al., 2007; Schiesser, 2009 ) is a technique for solving partial differential equations (PDEs) in which all but one dimension is discretized. MOL allows standard, general purpose… … Wikipedia