Godunov's theorem

From testwiki
Jump to navigation Jump to search

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:

Template:Block indent

Professor Sergei 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.

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. Then if xj=jΔx and tn=nΔt, such a scheme can be described by Template:NumBlk

In other words, the solution φjn+1 at time n+1 and location j is a linear function of the solution at the previous time step n. We assume that βm determines φjn+1 uniquely. Now, since the above equation represents a linear relationship between φjn and φjn+1 we can perform a linear transformation to obtain the following equivalent form, Template:NumBlk

Theorem 1: Monotonicity preserving

The above scheme of equation (2) is monotonicity preserving if and only if Template:NumBlk

Proof - Godunov (1959)

Case 1: (sufficient condition)

Assume (3) applies and that φjn is monotonically increasing with j.

Then, because φjnφj+1nφj+mn it therefore follows that φjn+1φj+1n+1φj+mn+1 because Template:NumBlk

This means that monotonicity is preserved for this case.

Case 2: (necessary condition)

We prove the necessary condition by contradiction. Assume that γp<0 for some p and choose the following monotonically increasing φjn, Template:NumBlk

Then from equation (2) we get Template:NumBlk

Now choose j=kp, to give Template:NumBlk which implies that φjn+1 is NOT increasing, and we have a contradiction. Thus, monotonicity is NOT preserved for γp<0, which completes the proof.

Theorem 2: Godunov’s Order Barrier Theorem

Linear one-step second-order accurate numerical schemes for the convection equation Template:NumBlk cannot be monotonicity preserving unless Template:NumBlk

where σ is the signed Courant–Friedrichs–Lewy condition (CFL) number.

Proof - Godunov (1959)

Assume a numerical scheme of the form described by equation (2) and choose Template:NumBlk

The exact solution is Template:NumBlk

If we assume the scheme to be at least second-order accurate, it should produce the following solution exactly Template:NumBlk

Substituting into equation (2) gives: Template:NumBlk

Suppose that the scheme IS monotonicity preserving, then according to the theorem 1 above, γm0.

Now, it is clear from equation (15) that Template:NumBlk

Assume σ>0,σ and choose j such that j>σ>(j1). This implies that (jσ)>0 and (jσ1)<0.

It therefore follows that, Template:NumBlk

which contradicts equation (16) and completes the proof.

The exceptional situation whereby σ=|c|ΔtΔx is only of theoretical interest, since this cannot be realised with variable coefficients. Also, integer CFL numbers greater than unity would not be feasible for practical problems.

See also

References

  • Godunov, Sergei K. (1954), Ph.D. Dissertation: Different Methods for Shock Waves, Moscow State University.
  • Godunov, Sergei K. (1959), A Difference Scheme for Numerical Solution of Discontinuous Solution of Hydrodynamic Equations, Mat. Sbornik, 47, 271-306, translated US Joint Publ. Res. Service, JPRS 7226, 1969.
  • Template:Cite book

Further reading