43.11.04 · numerical-analysis / 11-finite-difference-pdes

Hyperbolic finite differences: upwind, Lax-Friedrichs, Lax-Wendroff; numerical diffusion and dispersion

shipped3 tiersLean: none

Anchor (Master): LeVeque 2002 *Finite Volume Methods for Hyperbolic Problems* (Cambridge) Ch. 8-12, §8.6 (the modified-equation analysis, numerical diffusion and dispersion, Godunov's order-barrier theorem, and monotone vs. high-resolution schemes for scalar conservation laws); Richtmyer-Morton 1967 *Difference Methods for Initial-Value Problems* 2e (Interscience) Ch. 5, 12-13 (the Lax-Wendroff scheme, dissipation and dispersion of difference schemes, and the heat-equation analogy of the modified equation); Hirsch 2007 *Numerical Computation of Internal and External Flows* 2e (Butterworth-Heinemann) Ch. 8-10 (the modified-equation/equivalent-differential-equation method, numerical dissipation and dispersion error, and monotonicity for convection schemes)

Intuition Beginner

Picture a coloured pulse painted onto water in a long, straight canal, with the water moving at a steady speed. An hour later the pulse has slid downstream, unchanged in shape — every part of it carried at the same speed. That sliding-without-changing is what the simplest moving-wave rule, the advection equation , describes: a profile travels rightward at the fixed speed and nothing else happens to it. This unit asks how a grid-and-clock computer can reproduce that clean slide, and why its first honest attempts smear the pulse or wrap it in ripples.

The trouble is that the true rule reads its answer from one upstream spot — the place the water just came from — while a grid only stores values at fixed dots. To advance a dot, a scheme must blend a few neighbour values, never a perfect copy of that one spot. The natural fix is to look in the right direction: since the flow comes from the left when is positive, build each new value from the dot and its left neighbour. That is the upwind scheme, the cheapest correct idea, leaning on the speed-limit from the previous unit 43.11.03 — the signal must not outrun the grid in one tick.

Upwind works, but it pays a price. Blending a value with its left neighbour is a kind of averaging, and averaging always softens. So the computed pulse, step after step, loses height and spreads out, as if the canal had grown sticky. This artificial stickiness is called numerical diffusion: the scheme has quietly added a smear the true equation never asked for. A close cousin, the Lax-Friedrichs scheme, replaces the centre value by the average of its two neighbours; it is even easier to write down and even smearier.

To stop the smearing you reach for a sharper, second-order scheme — the Lax-Wendroff scheme — which matches the true motion more closely and keeps the pulse tall. But sharper schemes trade one fault for another. Instead of softening the pulse they make different wavelengths travel at slightly different speeds, so a crisp edge sheds a train of little ripples behind it. This is numerical dispersion: not a loss of height but a scrambling of timing, spurious wiggles where the true answer is smooth. The story of this unit is that simple linear schemes must pick their poison — smear or wiggle — and Godunov's theorem says no fixed linear recipe escapes the choice.

Visual Beginner

There are two pictures. The first compares the three schemes on a single travelling step. The second sorts the error into the two flavours: diffusion (the pulse shrinks and spreads) and dispersion (the pulse grows a ripple tail).

The table lists the schemes by how they build each new value, their accuracy order, and the kind of error they leave behind. The Courant number — speed times time-step over spacing, from the previous unit 43.11.03 — must stay at most one for any of them to be stable.

scheme how it builds the new value order error flavour
upwind the dot blended with its upwind (left, if ) neighbour first numerical diffusion (smearing)
Lax-Friedrichs the average of the two neighbours, then nudged downstream first numerical diffusion (more smearing)
Lax-Wendroff a centred update plus a correction matching the true curvature second numerical dispersion (ripples)
 a step function carried right (true answer: same step, shifted)

  upwind / Lax-Friedrichs            Lax-Wendroff
  (numerical diffusion):            (numerical dispersion):

   true ___                          true ___
       |   |                             |   |
   ____|   |____ shifted            ____|   |____ shifted
                                                  ^
   computed: edge rounded off       computed: sharp edge, but a
   ____                             train of ripples behind it
       \____                        ____      _
            \___ smeared slope          |   |/ \  /\___ wiggles
                                    ____|   |   \/

The takeaway: the schemes split into two camps by the kind of error they make. First-order schemes (upwind, Lax-Friedrichs) add a smear — numerical diffusion — and are gentle but blurry. The second-order Lax-Wendroff scheme keeps edges sharp but adds ripples — numerical dispersion. Stability for all of them needs the Courant number , the same speed limit as in 43.11.03.

Worked example Beginner

Let us carry a single step one tick with the upwind scheme and watch it round off the corner — the smearing made concrete. Take the flow speed moving rightward, spacing , time step , so the Courant number is .

The upwind rule for rightward flow updates each value from itself and its left neighbour: . With this is — the new value is the plain average of the dot and its left neighbour.

Start from a sharp step: the values are , jumping from down to between two dots. Name the last as position and the first as position .

Step 1. Update position (value , left neighbour value ): . No change — both inputs were .

Step 2. Update position (value , left neighbour value ): . The first has been lifted to .

Step 3. Update position (value , left neighbour value ): . Still zero.

Step 4. Collect the new row: . The clean jump from to has become a two-step ramp . The corner has been rounded; the edge is one cell wider than it was.

What this tells us: a single upwind step turned a crisp jump into a softened ramp, without any sign of overshoot. That softening is numerical diffusion — the scheme behaving as though a little stickiness were smoothing the profile. Keep stepping and the ramp keeps widening, the step blurring more each tick, exactly the smearing the formal modified-equation analysis will pin to an artificial term.

Check your understanding Beginner

Formal definition Intermediate+

Work on the uniform grid , , with time step , time levels , and grid values approximating the solution of the linear advection (transport) equation $$ u_t + a,u_x = 0, \qquad x \in \mathbb{R},\ t > 0, \qquad u(x,0) = u_0(x), $$ with constant speed . Its exact solution is : the initial profile is transported rigidly at speed along the characteristics , the continuous theory of 02.13.04. The single dimensionless parameter governing every scheme below is the Courant number of 43.11.03.

The three schemes. Take for the one-sided scheme. The first-order upwind scheme differences in the upwind direction, $$ U_j^{n+1} = U_j^n - \nu,(U_j^n - U_{j-1}^n) \qquad (a > 0), $$ using the dot and its upstream neighbour (for one uses ). The Lax-Friedrichs scheme replaces the centre value in a forward-time centred-space update by the neighbour average, $$ U_j^{n+1} = \tfrac12\big(U_{j-1}^n + U_{j+1}^n\big) - \tfrac{\nu}{2}\big(U_{j+1}^n - U_{j-1}^n\big). $$ The Lax-Wendroff scheme adds to the centred update a centred second-difference correction whose weight is , $$ U_j^{n+1} = U_j^n - \tfrac{\nu}{2}\big(U_{j+1}^n - U_{j-1}^n\big) + \tfrac{\nu^2}{2}\big(U_{j-1}^n - 2U_j^n + U_{j+1}^n\big). $$ The centred-only scheme — Lax-Wendroff without its correction — is the unconditionally unstable forward-time centred-space scheme proved unstable in 43.11.03; it is the witness that the CFL condition is necessary but not sufficient. Stability of upwind, Lax-Friedrichs, and Lax-Wendroff is exactly , the von Neumann analysis carried out in 43.11.03.

The modified equation. A scheme of accuracy order for solves, to one order higher, an equivalent or modified equation , obtained by Taylor-expanding the scheme about and repeatedly using the equation itself (and its differential consequences such as ) to convert all time derivatives into space derivatives. The leading term on the right is the truncation error in differential form. Its parity determines the error type. An even-order leading term with is a diffusion (parabolic) term: it damps the amplitude of each Fourier mode, producing numerical diffusion — the dissipative smearing of upwind and Lax-Friedrichs. An odd-order leading term is a dispersion term: it leaves amplitudes intact but makes the phase speed depend on wavenumber, producing numerical dispersion — the spurious oscillations of Lax-Wendroff.

The symbols (Courant number), the advection speed , the diffusion coefficient of the modified equation, the second-difference , and the centred difference are recorded in _meta/NOTATION.md.

Counterexamples to common slips

  • Numerical diffusion is not round-off and not physical viscosity. It is a deterministic, scheme-induced term in the modified equation, present in exact arithmetic; its coefficient scales with the mesh and vanishes only as or at , where upwind becomes exact transport by one cell.

  • Higher order does not mean smaller error on a discontinuity. Lax-Wendroff is second-order for smooth data, but at a jump its dispersive term produces oscillations that do not shrink with refinement near the discontinuity; first-order upwind, though only accurate, gives a monotone, oscillation-free front. Order is an asymptotic statement about smooth solutions.

  • The centred scheme satisfies CFL yet is useless. Its stencil reaches one cell each side, so meets the CFL necessary condition of 43.11.03; but its amplification factor has for every , so it is unconditionally unstable. CFL screens domains of dependence; it does not certify stability.

  • The diffusion coefficient must be nonnegative for stability. The upwind modified-equation coefficient is exactly when ; a negative diffusion coefficient is anti-diffusion, which amplifies modes and is the differential signature of instability — the same threshold seen from the modified equation rather than the amplification factor.

Key theorem with proof Intermediate+

The signature result is the modified-equation classification: upwind and Lax-Friedrichs are first-order with an even-derivative leading error, hence diffusive; Lax-Wendroff is second-order with an odd-derivative leading error, hence dispersive. The mechanism is a single Taylor expansion of each scheme, with time derivatives traded for space derivatives through and [LeVeque, R. J. — Finite Difference Methods for Ordinary and Partial Differential Equations: Steady-State and Time-Dependent Problems; Strikwerda, J. C. — Finite Difference Schemes and Partial Differential Equations (2nd ed.)].

Theorem (modified equations of the advection schemes). Let be smooth and . Inserting the exact solution of into each scheme and expanding gives the following modified equations, satisfied to one order beyond the scheme's truncation order:

(i) Upwind () is first-order and solves $$ u_t + a u_x = \frac{ah}{2},(1 - \nu),u_{xx} + O(h^2), $$ a diffusion equation with nonnegative coefficient for .

(ii) Lax-Wendroff is second-order and solves $$ u_t + a u_x = -\frac{ah^2}{6},(1 - \nu^2),u_{xxx} + O(h^3), $$ a dispersion equation: no term, leading correction .

Proof. Write and abbreviate for its space derivatives there. Throughout, use the differential consequences of : , and differentiating, , and likewise .

(i) Upwind. The scheme's residual when the exact solution is inserted is $$ R = \frac{u(x_j, t_{n+1}) - u(x_j,t_n)}{k} + a,\frac{u(x_j,t_n) - u(x_{j-1},t_n)}{h}. $$ Expand each difference. The time difference is . The one-sided space difference is . Hence $$ R = \big(u_t + a u_x\big) + \frac{k}{2}u_{tt} - \frac{ah}{2}u_{xx} + O(k^2 + h^2). $$ The first bracket vanishes. Replace and : $$ R = \frac{k}{2}a^2 u_{xx} - \frac{ah}{2}u_{xx} + O(h^2) = \frac{a^2}{2}\cdot\frac{\nu h}{a},u_{xx} - \frac{ah}{2}u_{xx} + O(h^2) = \frac{ah}{2}\big(\nu - 1\big)u_{xx} + O(h^2). $$ Since the scheme sets its own update equal to the advection part, the exact solution satisfies , the claimed diffusion equation, with leading error so the scheme is first-order. The coefficient is nonnegative for .

(ii) Lax-Wendroff. The scheme is built to be second-order, so all , -type residuals cancel through second order; one expands to third order. The time advance, with , , , is $$ u(x_j, t_{n+1}) = u + k u_t + \tfrac{k^2}{2}u_{tt} + \tfrac{k^3}{6}u_{ttt} + O(k^4) = u - ak,u_x + \tfrac{a^2 k^2}{2}u_{xx} - \tfrac{a^3 k^3}{6}u_{xxx} + O(k^4). $$ The scheme's spatial part is the centred first difference (the centred difference has error ), plus the correction . The terms match, and the produced by the correction cancels the from the time advance — this cancellation is exactly why the second-order accuracy and why no diffusion term survives. Collecting the surviving third-order terms, the residual is $$ R = \Big(!-\tfrac{a^3 k^3}{6} + \tfrac{a k h^2}{6}\Big)u_{xxx} + O(h^3). $$ Factor and use : . With this is , an residual divided by , confirming second order, and the modified equation reads , with leading odd-derivative dispersion term and no .

Bridge. This theorem is the foundational reason the two error types are mutually exclusive at leading order for these schemes: the parity of the surviving derivative is fixed by the scheme's accuracy order, even orders giving the dissipative and odd orders the dispersive , and a second-order scheme has annihilated its term by construction so its leading error must be odd. This is exactly the amplitude-versus-phase split of the von Neumann amplification factor of 43.11.03: the modulus records the even, diffusive part of the truncation error and the phase records the odd, dispersive part, so the modified equation and the symbol are dual encodings of one expansion — putting these together, is numerical diffusion and a wavenumber-dependent is numerical dispersion. The diffusion coefficient generalises the artificial-viscosity reading of Lax-Friedrichs and builds toward the monotonicity theory below, where positive numerical diffusion is what buys an oscillation-free front. The central insight that one Taylor expansion governs both order and error character appears again in the Lax-Richtmyer equivalence theorem 43.11.05, where consistency (the order) and stability (the bounded amplification) combine into convergence, the bridge being that the modified equation is the differential face of the same consistency-plus-stability computation that von Neumann analysis performs algebraically.

Exercises Intermediate+

Advanced results Master

Theorem 1 (the three amplification factors and their stability thresholds). For on the whole line with , the von Neumann symbols of 43.11.03 are: upwind () with ; Lax-Friedrichs with ; Lax-Wendroff with . Each satisfies for all exactly when , the CFL number; the centred-only scheme has and is unconditionally unstable [LeVeque, R. J. — Finite Difference Methods for Ordinary and Partial Differential Equations: Steady-State and Time-Dependent Problems].

Theorem 2 (modified equations and the parity classification of error). Upwind is consistent of order one with modified equation , an even-derivative diffusion term, nonnegative for . Lax-Friedrichs is order one with diffusion coefficient , exceeding upwind's. Lax-Wendroff is order two with modified equation , an odd-derivative dispersion term. In every case the leading error vanishes at , where each scheme reduces to exact one-cell transport. The diffusion coefficient governs the decay rate of below , and the dispersion coefficient governs the deviation of the discrete phase speed from [Strikwerda, J. C. — Finite Difference Schemes and Partial Differential Equations (2nd ed.)].

Theorem 3 (Godunov's order barrier). A linear, constant-coefficient, monotonicity-preserving scheme for the advection equation — monotone in the sense that for all , equivalently the scheme is monotonicity-preserving (it maps monotone data to monotone data and creates no new local extrema) — is at most first-order accurate. Consequently no fixed linear scheme is simultaneously second-order and oscillation-free: forcing second order removes the diffusive term and exposes the dispersive term, which generates over- and undershoots at discontinuities. The obstruction is removed only by nonlinear high-resolution schemes whose coefficients depend on the solution [LeVeque, R. J. — Finite Volume Methods for Hyperbolic Problems].

Theorem 4 (the artificial-viscosity reading and the modified-equation method). Every stable scheme for may be read as a discretisation of an advection-diffusion-dispersion equation whose coefficients are the truncation terms; stability requires the leading even coefficient (positive numerical viscosity), instability is signalled by (anti-diffusion), and the order of the scheme is the smallest with a surviving term. This equivalent-differential-equation or modified-equation method (Warming-Hyett) reproduces the von Neumann stability threshold from the sign of the diffusion coefficient and predicts the qualitative error (smear if the leading surviving term is even, wiggle if odd) without solving the scheme [LeVeque, R. J. — Finite Volume Methods for Hyperbolic Problems].

Synthesis. The foundational reason the advection schemes split cleanly into smearers and wigglers is a single structural fact about one Taylor expansion: the parity of the leading surviving derivative in the modified equation is locked to the scheme's accuracy order, even orders producing the dissipative and odd orders the dispersive , so a first-order scheme must diffuse and a second-order scheme must disperse. This is exactly the amplitude-versus-phase decomposition of the von Neumann symbol of 43.11.03 — the modulus is the diffusive content and the phase the dispersive content of the same expansion — and the modified equation is dual to the amplification factor, one differential and one algebraic encoding of consistency. The central insight is that monotonicity and accuracy pull in opposite directions through the diffusion coefficient: a monotone linear scheme needs a positive term, which caps it at first order, while removing that term to gain second order unleashes the dispersive wiggles — putting these together is Godunov's barrier, and its only escape is to make the scheme nonlinear. The bridge to the wider theory is that this concrete diffusion-dispersion calculus is the linear, smooth-solution shadow of the nonlinear conservation-law theory of 02.18.06, where the same numerical viscosity that smears a linear front is what selects the physically correct entropy solution at a shock, and where consistency-plus-stability becomes the Lax-Richtmyer convergence theorem of 43.11.05 whose hypotheses these schemes verify mode by mode.

Full proof set Master

Proposition 1 (upwind is first-order with diffusive modified equation). For and smooth , the upwind scheme inserting the exact solution of has local truncation error , so the scheme is consistent of order one and its modified equation is with nonnegative coefficient for .

Proof. The local truncation error is the residual of the exact solution in the scheme, divided by : $$ \tau = \frac{u(x_j,t_{n+1}) - u(x_j,t_n)}{k} + a,\frac{u(x_j,t_n) - u(x_{j-1},t_n)}{h}. $$ Taylor-expand at . The forward time difference is and the backward space difference is , so $$ \tau = (u_t + au_x) + \tfrac{k}{2}u_{tt} - \tfrac{ah}{2}u_{xx} + O(k^2 + h^2). $$ The advection bracket vanishes. Differentiating the equation, , and gives . Hence $$ \tau = \frac{a\nu h}{2}u_{xx} - \frac{ah}{2}u_{xx} + O(h^2) = -\frac{ah}{2}(1-\nu)u_{xx} + O(h^2). $$ The leading term is , so the scheme is first-order. Since the scheme equates the discrete advance to the upwind advection difference, the exact solution satisfies , a diffusion equation; its coefficient exactly when (with ).

Proposition 2 (Lax-Wendroff is second-order with dispersive modified equation). For smooth , the Lax-Wendroff scheme has local truncation error , so it is consistent of order two and its modified equation is , with no term.

Proof. Expand the exact time advance to third order, using , , : $$ u(x_j,t_{n+1}) = u + ku_t + \tfrac{k^2}{2}u_{tt} + \tfrac{k^3}{6}u_{ttt} + O(k^4) = u - aku_x + \tfrac{a^2k^2}{2}u_{xx} - \tfrac{a^3k^3}{6}u_{xxx} + O(k^4). $$ The scheme's right-hand side applied to the exact solution is . The centred first difference expands as , so , using . The second difference expands as , so , using . Subtracting the scheme's advance from the exact advance, the , , and terms cancel identically (this triple cancellation is the design of the scheme), leaving $$ k\tau = -\tfrac{a^3k^3}{6}u_{xxx} + \tfrac{akh^2}{6}u_{xxx} + O(h^4) = \tfrac{akh^2}{6}\big(1 - \tfrac{a^2k^2}{h^2}\big)u_{xxx} + O(h^4) = \tfrac{akh^2}{6}(1-\nu^2)u_{xxx} + O(h^4). $$ Dividing by and using gives , second order, and the modified equation , purely dispersive.

Proposition 3 (Lax-Friedrichs as forward-time centred-space plus artificial viscosity). The Lax-Friedrichs scheme equals the forward-time centred-space scheme plus the term , and its modified-equation diffusion coefficient is for .

Proof. From the update is , the centred scheme plus . For the modified equation, expand: the forward-time part gives , the centred-space part gives (its error is third order), and the added contributes a diffusion. Collecting the terms with : from the time error subtracts (it appears on the residual side as pulled to the equation side with the opposite sign), and the artificial term adds , giving net coefficient . This is nonnegative for , and exceeds the upwind coefficient by the factor , so Lax-Friedrichs is the more diffusive scheme.

Proposition 4 (Godunov's order barrier for linear schemes). A constant-coefficient linear scheme for that is monotonicity-preserving (maps every monotone grid function to a monotone grid function) has all , and any such scheme is at most first-order accurate.

Proof. Monotonicity-preservation forces : if some , apply the scheme to the monotone Heaviside data for and for ; the first difference of the output at the index reached through is at the single jump, so a negative coefficient produces a negative first difference somewhere, breaking monotonicity. Hence all . Consistency to first order requires and (matching and the transported ). Consider the modified-equation diffusion coefficient, proportional to the second moment minus the square of the first: the coefficient of is . With summing to this is a variance of the integer displacements under the probability weights , which is zero only if all weight sits on a single ; that single-point case is exact transport, possible only when is an integer. For non-integer the variance is strictly positive, so the coefficient is strictly positive: the scheme carries genuine numerical diffusion and its leading error is the even term, first order. To be second-order the coefficient must vanish, forcing zero variance, hence a single nonzero and integer — not a scheme valid for general . Therefore no monotone linear scheme valid for non-integer exceeds first order.

Connections Master

  • The von Neumann stability analysis of 43.11.03 supplies the amplification factors this unit reinterprets: the upwind, Lax-Friedrichs, and Lax-Wendroff symbols computed there as moduli for the CFL threshold are read here through their modulus (diffusion) and phase (dispersion), so the same one-line Fourier substitution that decides stability also diagnoses error character. The centred-scheme instability proved there is the witness, reused here, that the CFL condition is necessary but not sufficient, and that a missing diffusion term (, anti-diffusion) is the differential signature of blow-up.

  • The method-of-lines and consistency-plus-stability framework of 43.11.02 is the analysis template specialised here from the parabolic heat equation to the hyperbolic advection equation: the local-truncation-error Taylor expansion, the order definition, and the principle that consistency order plus stability yields convergence order all transfer directly, with the crucial difference that the hyperbolic modified equation carries a transport leading term and either diffusion or dispersion, where the parabolic one carried diffusion intrinsically.

  • The continuous wave and transport theory of 02.13.04 is the exact problem these schemes approximate: the characteristics along which is carried rigidly are what the upwind stencil tries to follow by differencing in the upwind direction, and the analytic domain of dependence — the single characteristic foot — is what the CFL condition forces the numerical stencil to contain. Numerical diffusion and dispersion are precisely the ways a finite stencil fails to reproduce that rigid characteristic transport.

  • The scalar conservation laws and entropy solutions of 02.18.06 are the nonlinear context these linear schemes prefigure: numerical viscosity, harmless smearing in the linear smooth case, becomes the mechanism that selects the physically admissible entropy solution at a shock, and the monotonicity that Godunov's barrier shows incompatible with linear second-order accuracy is exactly the property needed to avoid spurious oscillations at discontinuities — motivating the nonlinear high-resolution (TVD/flux-limiter) schemes that the finite-volume theory builds on this foundation.

  • The Lax-Richtmyer equivalence theorem 43.11.05 is the capstone these schemes feed: each is a one-step operator whose consistency (computed here as the modified equation's leading order) and stability (the von Neumann bound of 43.11.03) combine, by that theorem, into convergence; the modified-equation method is the differential form of the consistency half of the same consistency-plus-stability-equals-convergence synthesis.

Historical & philosophical context Master

The linear advection equation became the proving ground for hyperbolic finite differences because it isolates pure transport without the complications of nonlinearity or systems. The first-order one-sided upwind idea — differencing into the direction information comes from — and the necessity of respecting the domain of dependence trace to the 1928 paper of Richard Courant, Kurt Friedrichs, and Hans Lewy [Courant, Friedrichs & Lewy 1928], whose condition on difference equations of mathematical physics is the CFL bound the schemes here must satisfy. The averaging device that stabilises the centred scheme is due to Peter Lax in his 1954 study of weak solutions and difference schemes for hyperbolic conservation laws (Communications on Pure and Applied Mathematics 7, 159–193) [Lax 1954], and is now named the Lax-Friedrichs scheme.

The second-order one-step scheme combining a centred difference with a curvature correction was introduced by Peter Lax and Burton Wendroff in 1960 in Systems of conservation laws (Communications on Pure and Applied Mathematics 13, 217–237) [Lax & Wendroff 1960], using the device of converting time derivatives into space derivatives via the equation — the Cauchy-Kowalevski substitution. The systematic reading of the leading truncation term as an equivalent differential equation whose even-order part is dissipative and odd-order part dispersive was developed by R. F. Warming and B. J. Hyett in their 1974 modified-equation analysis (Journal of Computational Physics 14, 159–179) [Warming & Hyett 1974]. The order barrier — that a linear monotonicity-preserving scheme cannot exceed first order — was established by Sergei Godunov in 1959 (Matematicheskii Sbornik 47, 271–306) [Godunov 1959], the result that drove the field toward the nonlinear high-resolution schemes consolidated in the monograph treatments of Randall LeVeque [LeVeque, R. J. — Finite Volume Methods for Hyperbolic Problems].

Bibliography Master

@book{leveque2007fdmhyperbolic,
  author    = {LeVeque, Randall J.},
  title     = {Finite Difference Methods for Ordinary and Partial Differential Equations: Steady-State and Time-Dependent Problems},
  publisher = {Society for Industrial and Applied Mathematics (SIAM)},
  year      = {2007}
}

@book{leveque2002finitevolume,
  author    = {LeVeque, Randall J.},
  title     = {Finite Volume Methods for Hyperbolic Problems},
  series    = {Cambridge Texts in Applied Mathematics},
  publisher = {Cambridge University Press},
  year      = {2002}
}

@article{lax1954weak,
  author  = {Lax, Peter D.},
  title   = {Weak solutions of nonlinear hyperbolic equations and their numerical computation},
  journal = {Communications on Pure and Applied Mathematics},
  volume  = {7},
  number  = {1},
  year    = {1954},
  pages   = {159--193}
}

@article{laxwendroff1960,
  author  = {Lax, Peter D. and Wendroff, Burton},
  title   = {Systems of conservation laws},
  journal = {Communications on Pure and Applied Mathematics},
  volume  = {13},
  number  = {2},
  year    = {1960},
  pages   = {217--237}
}

@article{warminghyett1974,
  author  = {Warming, R. F. and Hyett, B. J.},
  title   = {The modified equation approach to the stability and accuracy analysis of finite-difference methods},
  journal = {Journal of Computational Physics},
  volume  = {14},
  number  = {2},
  year    = {1974},
  pages   = {159--179}
}

@article{godunov1959,
  author  = {Godunov, Sergei K.},
  title   = {A difference method for numerical calculation of discontinuous solutions of the equations of hydrodynamics},
  journal = {Matematicheskii Sbornik},
  volume  = {47(89)},
  number  = {3},
  year    = {1959},
  pages   = {271--306}
}

@article{courantfriedrichslewy1928hyperbolic,
  author  = {Courant, Richard and Friedrichs, Kurt and Lewy, Hans},
  title   = {{\"U}ber die partiellen Differenzengleichungen der mathematischen Physik},
  journal = {Mathematische Annalen},
  volume  = {100},
  number  = {1},
  year    = {1928},
  pages   = {32--74}
}

@book{strikwerda2004,
  author    = {Strikwerda, John C.},
  title     = {Finite Difference Schemes and Partial Differential Equations},
  edition   = {2},
  publisher = {Society for Industrial and Applied Mathematics (SIAM)},
  year      = {2004}
}