# Godunov's theorem

Godunov's theorem In numerical analysis and computational fluid dynamics, Godunov's theorem — also known as Godunov's order barrier theorem — is a mathematical theorem important in the development of the theory of high resolution schemes for the numerical solution of partial differential equations.

The theorem states that: Linear numerical schemes for solving partial differential equations (PDE's), having the property of not generating new extrema (monotone scheme), can be at most first-order accurate.

Professor Sergei K. Godunov originally proved the theorem as a Ph.D. student at Moscow State University. It is his most influential work in the area of applied and numerical mathematics and has had a major impact on science and engineering, particularly in the development of methods used in computational fluid dynamics (CFD) and other computational fields. One of his major contributions was to prove the theorem (Godunov, 1954; Godunov, 1959), that bears his name.

Inhalt 1 Der Satz 2 Siehe auch 3 Verweise 4 Further reading The theorem We generally follow Wesseling (2001).

Aside Assume a continuum problem described by a PDE is to be computed using a numerical scheme based upon a uniform computational grid and a one-step, constant step-size, M grid point, integration algorithm, either implicit or explicit. Dann wenn {Anzeigestil x_{j}=j,Delta x} und {Anzeigestil t^{n}=n,Delta t} , such a scheme can be described by {displaystyle sum limits _{m=1}^{M}{Beta _{m}}varphi_{j+m}^{n+1}= Summengrenzen _{m=1}^{M}{Alpha _{m}varphi_{j+m}^{n}}.quad quad (1)} Mit anderen Worten, the solution {Anzeigestil Varphi _{j}^{n+1}} at time {displaystyle n+1} and location {Anzeigestil j} is a linear function of the solution at the previous time step {Anzeigestil n} . We assume that {Anzeigestil Beta _{m}} determines {Anzeigestil Varphi _{j}^{n+1}} uniquely. Jetzt, since the above equation represents a linear relationship between {Anzeigestil Varphi _{j}^{n}} und {Anzeigestil Varphi _{j}^{n+1}} we can perform a linear transformation to obtain the following equivalent form, {Anzeigestil Varphi _{j}^{n+1}= Summengrenzen _{m}^{M}{Gamma _{m}varphi_{j+m}^{n}}.quad quad (2)} Satz 1: Monotonicity preserving The above scheme of equation (2) is monotonicity preserving if and only if {displaystyle gamma _{m}geq 0,quad forall m.quad quad (3)} Nachweisen - Godunov (1959) Fall 1: (sufficient condition) Davon ausgehen (3) applies and that {Anzeigestil Varphi _{j}^{n}} is monotonically increasing with {Anzeigestil j} .

Dann, Weil {Anzeigestil Varphi _{j}^{n}leq varphi _{j+1}^{n}leq cdots leq varphi _{j+m}^{n}} it therefore follows that {Anzeigestil Varphi _{j}^{n+1}leq varphi _{j+1}^{n+1}leq cdots leq varphi _{j+m}^{n+1}} Weil {Anzeigestil Varphi _{j}^{n+1}-varphi_{j-1}^{n+1}= Summengrenzen _{m}^{M}{Gamma _{m}links({varphi_{j+m}^{n}-varphi_{j+m-1}^{n}}Rechts)}geq 0.quad quad (4)} This means that monotonicity is preserved for this case.

Fall 2: (necessary condition) We prove the necessary condition by contradiction. Annehmen, dass {displaystyle gamma _{p}^{}<0} for some {displaystyle p} and choose the following monotonically increasing {displaystyle varphi _{j}^{n}quad } , {displaystyle varphi _{i}^{n}=0,quad i0,quad xin mathbb {R} quad quad (10)} cannot be monotonicity preserving unless {displaystyle sigma =left|cright|{{Delta t} Über {Delta x}}in mathbb {N} ,quad quad (11)} wo {Display-Sigma } is the signed Courant–Friedrichs–Lewy condition (CFL) Nummer.