Pith. sign in

REVIEW 3 major objections 4 minor 39 references

The error estimate of entropy-stable discontinuous Galerkin methods for hyperbolic conservation laws

T0 review · 3 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper proves that the semi-discrete entropy-stable discontinuous Galerkin method converges at order k to smooth solutions of scalar hyperbolic conservation laws and symmetrizable systems, under a polynomial reconstruction hypothesis…

desk verdict First rigorous a priori error estimate for Chen–Shu ESDG; the conditional theorem is proven, but the reconstruction assumption is verified only for k=1,2 on triangles, so the 'gap closed' claim is slightly ahead of what is actually established. read the letter →

arxiv 2608.06642 v1 pith:OCUXIO5O submitted 2026-08-06 math.NA cs.NA

Xu-Kun Chen , Yong Liu , Chi-Wang Shu This is my paper · ORCID
classification math.NAcs.NA MSC 65M1265M1565M20
keywords discontinuousGalerkinmethodentropystabilityerrorestimatehyperbolicconservationlawssummation-by-partsaprioriboundquadrature-basednorm
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes the first rigorous a priori error estimates for a widely used class of entropy-stable discontinuous Galerkin (DG) methods for hyperbolic conservation laws. The scheme, built from summation-by-parts operators and collocated quadrature nodes, provably converges at order k to smooth solutions in a quadrature-based norm equivalent to the broken L2 norm, for both scalar equations and symmetrizable systems. The proof works directly on nodal vectors via a finite-difference-style consistency–stability argument, closing a gap left by earlier truncation-error analyses. The result also covers the oscillation-free variant, whose extra damping is shown not to lower the convergence rate.

What carries the argument

The central mechanism is the skew-symmetric summation-by-parts structure of the ESDG scheme combined with the entropy-variable weighted energy norm ||e||$_U^{2}$ = (e)^T H M e, where H is the entropy Hessian. The proof decomposes the discrete operator S_m into symmetric and skew-symmetric parts; the skew-symmetric part kills the leading volume error term because H f'_m is symmetric, while interface contributions are controlled by entropy stability of the numerical flux, and the remaining nonlinear terms are bounded by Taylor expansion plus mesh-scaled matrix-norm estimates. A Gronwall argument then closes the differential inequality. The polynomial reconstruction hypothesis ensures inverse estimates and norm equivalence on the non-polynomial nodal solution.

What would settle it

Compute the rank of the Vandermonde matrix V_k for the quadrature nodes on the reference triangle for k=3 and k=4; if the rank falls below N_{Q,k} for either degree (or for any degree admitted by the scheme), Assumption 3.1 fails for those nodes and the theorem's proof collapses. The paper's Remark 3.8 indicates this has only been checked numerically, not proved.

Watch

Extended reading notes

Core claim

The paper proves that, under a polynomial-reconstruction hypothesis (each nodal vector is the evaluation of a unique polynomial in a fixed-degree space) and an a priori L∞ bound, the semi-discrete entropy-stable DG scheme (2.9) satisfies ||u(t)-u_h(t)||_h ≤ C h^k for 0≤t≤T, with the quadrature norm equivalent to the broken L2 norm on the reconstruction space (Theorems 3.3 and 4.3). The same bound is shown for the oscillation-free ESOFDG scheme (Theorems 3.10 and 4.5). The analysis covers scalar conservation laws and symmetrizable systems, and the observed numerical rates can exceed k by up to half an order, indicating the bound may not be sharp.

Load-bearing premise

That for every element there exists a fixed-degree polynomial space whose nodal-evaluation map at the scheme's quadrature nodes is an isomorphism — a property verified for k=1,2 on triangles but only asserted numerically for higher degrees.

Editorial extensions

If this is right

  • Entropy-stable DG methods on unstructured simplex meshes are now justified at the same O(h^k) convergence level as classical DG methods for smooth solutions, not merely at the truncation-error level.
  • The proof applies to symmetrizable systems such as the compressible Euler equations, so the physically relevant entropy yields a convergence rate independent of the particular entropy-stable flux choice.
  • The oscillation-free ESOFDG damping terms, designed to control spurious oscillations, do not sacrifice the theoretical convergence order.
  • The a priori L∞ bound is self-justifying on intervals where k - d/2 > 1, i.e., for sufficiently high polynomial degree, via the standard continuity argument plus the O(h^k) estimate.
  • Numerical experiments showing rates up to half an order above k suggest sharper estimates may be available, but the current bound is the rigorous guarantee.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The rank-deficiency check for higher-order quadrature nodes (k≥3) is a concrete, low-cost test that would either broaden or restrict the theorem's range; if deficiency occurs, an adaptive choice of reconstruction space might restore the argument.
  • The quadrature-norm framework suggests that similar consistency–stability arguments could yield error estimates for entropy-stable schemes with curved elements or non-simplex meshes, where the reconstruction hypothesis may need to be reformulated per element.
  • Because the bound is k rather than k+1/2, the gap to observed superconvergence may hide cancellation mechanisms akin to those known for DG; a sharper norm or a dual problem analysis might be the next step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The manuscript proves a conditional a priori error estimate for the semi-discrete entropy-stable discontinuous Galerkin (ESDG) method of Chen and Shu: for smooth solutions, the error in a quadrature-based norm is O(h^k) on general unstructured simplicial meshes. The proof works at the nodal level and is based on three ingredients: the skew-symmetric summation-by-parts structure, entropy symmetrization of the flux Jacobians, and a polynomial-reconstruction assumption under which nodal vectors are identified with polynomials in a space V_h(K). The same framework is extended to the entropy-stable oscillation-free DG (ESOFDG) method, for which the damping terms are shown not to reduce the order. The analysis covers both scalar conservation laws and symmetrizable systems. Numerical experiments for Burgers' equation and the two-dimensional Euler equations confirm convergence orders close to k.

Significance. If the assumptions are met, the paper would provide the first rigorous k-th-order error estimate for the Chen-Shu ESDG method, a scheme for which only truncation-error analyses were previously available. The nodal-level consistency-stability technique is a genuine methodological contribution, and the extension to ESOFDG is nontrivial because the damping term is nonlinear and mesh-dependent. The proof is detailed and the technical lemmas are largely proved in the appendix. The main weakness is that the load-bearing polynomial-reconstruction assumption is verified only for k=1,2 on triangles; for k=3,4 and for tetrahedra it is asserted without a construction or proof. Since the numerical tests include k=3 on triangles, the reported rates for the highest degree tested depend on an unestablished rank condition. The paper is significant as a conditional convergence theory, but the abstract's claim of closing the gap is stronger than what is proven.

major comments (3)
  1. [§3.2, Remark 3.8 and Proposition 3.4] Assumption 3.1 is load-bearing: the proof identifies nodal vectors with polynomials in V_h(K), and all norm equivalences, inverse estimates, and interpolation estimates act on that reconstructed polynomial. Proposition 3.4 correctly reduces the existence of such a space to full column rank of the Vandermonde matrix V_k^K. The paper verifies this full-rank condition only for k=1 and k=2 on triangles (Examples 3.6 and 3.7). For k=3,4, Remark 3.8 states that V_h 'can still be numerically constructed' but omits the construction, and no tetrahedral examples are given. Because Tables 2 and 3 report k=3 results on triangular meshes, the numerical claim for the highest degree tested depends on an unproven rank condition. If V_k^K is rank-deficient for any of the included degrees, the reconstructed polynomial does not exist and the theorem does not apply to the scheme. The authors should either establish full column rank for the specific node sets used, provide the explicit algorithmic construction with a verification for all degrees tested, or state the theorem as conditional on that rank condition.
  2. [§3.2, 'A priori assumption'] The continuity argument closing Assumption 3.2 requires k - d/2 > 1. In one dimension this excludes k=1; in two dimensions it excludes k=1 and k=2. Since Tables 1-3 include k=1 in 1D and 2D, and k=2 in 2D, the final O(h^k) theorem is not known to apply to several of the computed configurations under the paper's own justification. The authors should either restrict the claims to degrees satisfying k > d/2 + 1, or supply a different mechanism (for example, a higher-order error estimate in a stronger norm or an inductive Gronwall argument) that establishes the a priori bound for low-degree multi-dimensional cases.
  3. [Abstract and §6] The abstract and concluding remarks state that the paper 'closes the gap' and that 'k-th order convergence is proved', without flagging that the theorem is conditional on Assumptions 3.1 and 3.2, and that Assumption 3.1 is verified only for k=1,2 on triangles. This framing overstates the unconditional nature of the result. The claims should be revised to state explicitly which node sets and degrees the full-rank reconstruction has been verified for, and that for k=3,4 and 3D the result is conditional on a numerically checkable rank condition.
minor comments (4)
  1. [Funding line, p. 1] The word 'Funding' is typeset with an erroneous space as 'F unding'.
  2. [§3.3, Eq. (3.15)] The notation 'bf γ,K n' appears in the surface term of (3.15); this should presumably be the hatted flux 'ˆf γ,K n' used elsewhere.
  3. [Table 3] The header '20/h' is ambiguous and inconsistent with the '1/h' headers used in Table 2; the table should clarify the mesh-size convention.
  4. [Abstract and §5] The statement that observed rates 'may exceed the theoretical prediction by up to half an order' is not uniformly supported: in Table 1, the 1D k=3 case reaches order 3.92, well above k+0.5=3.5, while Tables 2 and 3 stay below k+0.5; the wording should be adjusted to match the reported values.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the O(h^k) bound follows from a consistency-stability argument whose same-author dependencies are independent prior truncation-error and SBP facts.

full rationale

The paper's central claim is a conditional a priori error estimate for the ESDG scheme. The derivation subtracts the scheme (2.9) from the nodal evolution of the exact solution and bounds the resulting error equation term by term. The O(h^k) source is Lemma 2.7, a local truncation-error estimate cited from the authors' earlier work [6]; that result is a consistency statement about the scheme, not the target convergence theorem, and it does not contain or presuppose the final error estimate. Similarly, the SBP identities used throughout are operator-level facts from [7], independent of the error bound being proved. Assumptions 3.1 and 3.2 are explicitly stated hypotheses: Assumption 3.1 is a geometric unisolvency condition, and Assumption 3.2 is the standard a priori L-infinity bound. The continuation argument in Subsection 3.2 is not circular: it invokes the already-proved h^k bound together with an inverse inequality to obtain an improved L-infinity bound that is stronger than the assumed one, then concludes T* = T by continuity. No fitted parameters are renamed as predictions, no empirical pattern is repackaged as a derivation, and no uniqueness or existence claim is imported from a self-citation in place of proof. The main caveat is completeness rather than circularity: Remark 3.8 asserts without details that reconstruction spaces for k = 3, 4 can be numerically constructed as in [6], so the theorem's applicability to the reported k = 3 tables rests on an unverified assumption. That gap affects rigor but does not make the derivation equivalent to its inputs, so the circularity score stays near zero.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claim rests on standard PDE and mesh assumptions plus two paper-specific hypotheses: the polynomial reconstruction condition and the L^infinity a priori bound. The reconstruction condition is the most fragile because the ESDG solution exists as nodal values and does not automatically lie in a polynomial space; the paper only proves the condition for low-degree triangles and cites numerical construction for higher degrees. No free parameters or invented entities are introduced.

assumptions (5)
  • domain assumption Uniform convexity of the entropy: C1 I <= U''(u) <= C2 I on the relevant state set.
    Used in Section 2.1 to ensure the entropy variable map is invertible and the U-weighted norm is equivalent to the quadrature norm.
  • domain assumption Sufficient smoothness of exact solution, physical fluxes, entropy conservative fluxes, and local Lipschitz continuity of entropy-stable interface fluxes.
    Used for Taylor expansions, the truncation error estimate (Lemma 2.7), and Lemma 2.8.
  • domain assumption Mesh family is conforming, shape-regular, quasi-uniform simplicial partitions; quadrature rules have positive weights and degree at least 2k-1 (volume) and 2k (surface); SBP operators satisfy exactness and summation-by-parts.
    These are the standard assumptions for the Chen-Shu ESDG construction in Section 2.2.
  • ad hoc to paper Assumption 3.1: for each K there exists a polynomial space V_h(K) with P_k ⊂ V_h ⊂ P_r (r fixed) such that the nodal evaluation map is an isomorphism.
    This is the key extra hypothesis that lets nodal vectors be treated as polynomials for inverse estimates. It is proven equivalent to Vandermonde full column rank (Proposition 3.4) but only verified for k=1,2 on triangles; for k>=3 it is asserted by numerical construction.
  • ad hoc to paper Assumption 3.2: the numerical solution satisfies ||u-u_h||_{L^infinity} <= h on [0,T].
    Standard a priori bound in nonlinear DG error analysis. The paper's continuation argument only justifies it when k-d/2>1; for low order it is assumed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The error estimate of entropy-stable discontinuous Galerkin methods for hyperbolic conservation laws." pith.science (2026). https://pith.science/paper/OCUXIO5O

@misc{pith2026260806642,
  author       = {Pith},
  title        = {Pith review of: The error estimate of entropy-stable discontinuous Galerkin methods for hyperbolic conservation laws},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OCUXIO5O}},
  note         = {Machine review of arXiv:2608.06642}
}
abstract

Entropy inequalities are fundamental to the well-posedness of hyperbolic conservation laws, providing the essential criterion for selecting the physically admissible solution among infinitely many weak solutions. Chen and Shu [J. Comput. Phys. 345 (2017)] proposed a unified framework for constructing high-order discontinuous Galerkin (DG) methods that satisfy entropy inequalities for any given entropy via specific numerical quadrature; however, their accompanying error analysis was limited to the truncation error level, leaving a critical gap in the rigorous convergence theory for these entropy-stable schemes. This paper closes that gap by establishing rigorous a priori error estimates for semi-discrete entropy-stable DG (ESDG) methods on general unstructured meshes for hyperbolic conservation laws. The analysis applies to both scalar equations and systems, and is built upon a finite-difference-type consistency-stability argument carried out directly at the nodal level. Under a polynomial-reconstruction hypothesis and an $L^\infty$ a priori bound, we prove an $O(h^k)$ error estimate in a quadrature-based norm, which is equivalent to the broken $L^2$ norm on the finite-dimensional reconstruction space. We further extend this framework to the entropy-stable oscillation-free DG (ESOFDG) method introduced by Liu, Lu, and Shu [SIAM J. Sci. Comput. 46 (2024)], demonstrating that the additional damping terms do not degrade the convergence order. Numerical experiments suggest that the observed convergence rates may exceed the theoretical prediction by up to half an order.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

39 extracted references · 38 canonical work pages

  1. [6]

    Chen and C.-W

    T. Chen and C.-W. Shu,Entropy stable high order discontinuous Galerkin methods with suitable quadrature rules for hyperbolic conservation laws, J. Comput. Phys., 345 (2017), pp. 427–461

    work page 2017

  2. [7]

    Chen and C.-W

    T. Chen and C.-W. Shu,Review of entropy stable discontinuous Galerkin methods for systems of conservation laws on unstructured simplex meshes, CSIAM Trans. Appl. Math., 1 (2020), pp. 1–52. ERROR ESTIMATES OF ENTROPY STABLE DG METHODS29

    work page 2020

  3. [1]

    M. Bohm, A. R. Winters, G. J. Gassner, D. Derigs, F. J. Hindenlang, and J. Saur,An entropy stable nodal discontinuous Galerkin method for the resistive MHD equations. Part I: Theory and numerical verification, J. Comput. Phys., 422 (2020), 108076

    work page 2020

  4. [2]

    M. H. Carpenter, T. C. Fisher, E. J. Nielsen, and S. H. Frankel,Entropy stable spectral collocation schemes for the Navier–Stokes equations: Discontinuous interfaces, SIAM J. Sci. Comput., 36 (2014), pp. B835–B867

    work page 2014

  5. [3]

    Chan,On discretely entropy conservative and entropy stable discontinuous Galerkin meth- ods, J

    J. Chan,On discretely entropy conservative and entropy stable discontinuous Galerkin meth- ods, J. Comput. Phys., 362 (2018), pp. 346–374

    work page 2018

  6. [4]

    J. Chan, D. C. Del Rey Fern’andez, and M. H. Carpenter,Efficient entropy stable Gauss collocation methods, SIAM J. Sci. Comput., 41 (2019), pp. A2938–A2966

    work page 2019

  7. [5]

    Chandrashekar,Kinetic energy preserving and entropy stable finite volume schemes for compressible Euler and Navier–Stokes equations, Commun

    P. Chandrashekar,Kinetic energy preserving and entropy stable finite volume schemes for compressible Euler and Navier–Stokes equations, Commun. Comput. Phys., 14 (2013), pp. 1252–1286

    work page 2013

  8. [8]

    P. G. Ciarlet,The Finite Element Method for Elliptic Problems, North-Holland, Amsterdam, 1978

    work page 1978

Show all 39 references
  1. [9]

    Crean, J

    J. Crean, J. E. Hicken, D. C. Del Rey Fern´ andez, D. W. Zingg, and M. H. Carpenter,High- order, entropy-stable discretizations of the Euler equations for complex geometries, in 23rd AIAA Computational Fluid Dynamics Conference, AIAA Paper 2017-4496, 2017

    2017

  2. [10]

    Crean, J

    J. Crean, J. E. Hicken, D. C. Del Rey Fern´ andez, D. W. Zingg, and M. H. Carpenter,Entropy stable summation-by-parts discretization of the Euler equations on general curved elements, J. Comput. Phys., 356 (2018), pp. 410–438

    2018

  3. [11]

    C. M. Dafermos,Hyperbolic Conservation Laws in Continuum Physics, 3rd ed., Grundlehren Math. Wiss. 325, Springer, Berlin, 2010

    2010

  4. [12]

    D. C. Del Rey Fern’andez, J. E. Hicken, and D. W. Zingg,Simultaneous approximation terms for multidimensional summation-by-parts operators, J. Sci. Comput., 75 (2018), pp. 83– 110

    2018

  5. [13]

    U. S. Fjordholm, S. Mishra, and E. Tadmor,Arbitrarily high-order accurate entropy stable essentially nonoscillatory schemes for systems of conservation laws, SIAM J. Numer. Anal., 50 (2012), pp. 544–573

    2012

  6. [14]

    U. S. Fjordholm, S. Mishra, and E. Tadmor,ENO reconstruction and ENO interpolation are stable, Found. Comput. Math., 13 (2013), pp. 139–159

    2013

  7. [15]

    G. J. Gassner, A. R. Winters, and D. A. Kopriva,A well balanced and entropy conservative discontinuous Galerkin spectral element method for the shallow water equations, Appl. Math. Comput., 272 (2016), pp. 291–308

    2016

  8. [16]

    G. J. Gassner, A. R. Winters, F. J. Hindenlang, and D. A. Kopriva,The BR1 scheme is stable for the compressible Navier–Stokes equations, J. Sci. Comput., 77 (2018), pp. 154–200

    2018

  9. [17]

    Geuzaine and J.-F

    C. Geuzaine and J.-F. Remacle,Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities, Internat. J. Numer. Methods Engrg., 79 (2009), pp. 1309– 1331

    2009

  10. [18]

    Godlewski and P.-A

    E. Godlewski and P.-A. Raviart,Hyperbolic Systems of Conservation Laws, Ellipses, Paris, 1991

    1991

  11. [19]

    Godlewski and P.-A

    E. Godlewski and P.-A. Raviart,Numerical Approximation of Hyperbolic Systems of Conser- vation Laws, Appl. Math. Sci. 118, Springer, New York, 1996

    1996

  12. [20]

    Gottlieb, C.-W

    S. Gottlieb, C.-W. Shu, and E. Tadmor,Strong stability-preserving high-order time discretiza- tion methods, SIAM Rev., 43 (2001), pp. 89–112

    2001

  13. [21]

    J. E. Hicken, D. C. Del Rey Fern’andez, and D. W. Zingg,Multidimensional summation- by-parts operators: General theory and application to simplex elements, SIAM J. Sci. Comput., 38 (2016), pp. A1935–A1958

    2016

  14. [22]

    Huang and C.-W

    J. Huang and C.-W. Shu,Error estimates to smooth solutions of semidiscrete discontinuous Galerkin methods with quadrature rules for scalar conservation laws, Numer. Methods Partial Differential Equations, 33 (2017), pp. 467–488

    2017

  15. [23]

    P. G. LeFloch, J.-M. Mercier, and C. Rohde,Fully discrete, entropy conservative schemes of arbitrary order, SIAM J. Numer. Anal., 40 (2002), pp. 1968–1992

    2002

  16. [24]

    Y. Liu, W. Guo, Y. Jiang, and M. Zhang,Structure-preserving nodal DG method for the Euler equations with gravity: Well-balanced, entropy stable, and positivity preserving, J. Comput. Phys., 537 (2025), 114095

    2025

  17. [25]

    Y. Liu, W. Guo, Y. Jiang, and M. Zhang,Structure-preserving nodal DG method for Euler equations with gravity II: General equilibrium states, J. Sci. Comput., 108 (2026), 1

    2026

  18. [26]

    Y. Liu, J. Lu, and C.-W. Shu,An entropy stable essentially oscillation-free discontinuous Galerkin method for hyperbolic conservation laws, SIAM J. Sci. Comput., 46 (2024), pp. A1132–A1159

    2024

  19. [27]

    Liu, C.-W

    Y. Liu, C.-W. Shu, and M. Zhang,Entropy stable high order discontinuous Galerkin methods for ideal compressible MHD on structured meshes, J. Comput. Phys., 354 (2018), pp. 163– 178

    2018

  20. [28]

    ¨Offner, J

    P. ¨Offner, J. Glaubitz, and H. Ranocha,Stability of correction procedure via reconstruction with summation-by-parts operators for Burgers’ equation using a polynomial chaos approach, ESAIM Math. Model. Numer. Anal., 52 (2018), pp. 2215–2245

    2018

  21. [29]

    Ranocha,Convergence of entropy-conservative summation-by-parts discretizations to smooth solutions of hyperbolic conservation laws, arXiv:2607.27049, 2026

    H. Ranocha,Convergence of entropy-conservative summation-by-parts discretizations to smooth solutions of hyperbolic conservation laws, arXiv:2607.27049, 2026

    2026 arXiv

  22. [30]

    Renac,Entropy stable DGSEM for nonlinear hyperbolic systems in nonconservative form with application to two-phase flows, J

    F. Renac,Entropy stable DGSEM for nonlinear hyperbolic systems in nonconservative form with application to two-phase flows, J. Comput. Phys., 382 (2019), pp. 1–26

    2019

  23. [31]

    Z. Sun, J. A. Carrillo, and C.-W. Shu,An entropy stable high-order discontinuous Galerkin method for cross-diffusion gradient flow systems, Kinet. Relat. Models, 12 (2019), pp. 885– 908

    2019

  24. [32]

    Tadmor,The numerical viscosity of entropy stable schemes for systems of conservation 30X.-K

    E. Tadmor,The numerical viscosity of entropy stable schemes for systems of conservation 30X.-K. CHEN, Y. LIU, AND C.-W. SHU laws. I, Math. Comp., 49 (1987), pp. 91–103

    1987

  25. [33]

    Tadmor,Entropy stability theory for difference approximations of nonlinear conservation laws and related time-dependent problems, Acta Numer., 12 (2003), pp

    E. Tadmor,Entropy stability theory for difference approximations of nonlinear conservation laws and related time-dependent problems, Acta Numer., 12 (2003), pp. 451–512

    2003

  26. [34]

    Wintermeyer, A

    N. Wintermeyer, A. R. Winters, G. J. Gassner, and D. A. Kopriva,An entropy stable nodal dis- continuous Galerkin method for the two dimensional shallow water equations on unstruc- tured curvilinear meshes with discontinuous bathymetry, J. Comput. Phys., 340 (2017), pp. 200–242

    2017

  27. [35]

    Z. A. Worku, D. C. Del Rey Fern’andez, and D. W. Zingg,Convergence of entropy-stable continuous summation-by-parts discretizations of symmetric hyperbolic conservation laws, arXiv:2603.18369, 2026

    2026

  28. [36]

    Zhang and C.-W

    M. Zhang and C.-W. Shu,An analysis of three different formulations of the discontinuous Galerkin method for diffusion equations, Math. Models Methods Appl. Sci., 13 (2003), pp. 395–413

    2003

  29. [37]

    Zhang and C.-W

    Q. Zhang and C.-W. Shu,Error estimates to smooth solutions of Runge–Kutta discontinuous Galerkin methods for scalar conservation laws, SIAM J. Numer. Anal., 42 (2004), pp. 641– 666

    2004

  30. [38]

    Zhang and C.-W

    Q. Zhang and C.-W. Shu,Error estimates to smooth solutions of Runge–Kutta discontinuous Galerkin methods for symmetrizable systems of conservation laws, SIAM J. Numer. Anal., 44 (2006), pp. 1703–1720

    2006

  31. [39]

    Zhang and C.-W

    Q. Zhang and C.-W. Shu,Stability analysis and a priori error estimates of the third-order explicit Runge–Kutta discontinuous Galerkin method for scalar conservation laws, SIAM J. Numer. Anal., 48 (2010), pp. 1038–1063

    2010

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.