How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Upwind discontinuous Galerkin discretization of constant transport
Definition
Let , let be constant, and consider on a fixed domain. For , use Oriented interval meshes and broken polynomial spaces. For , use a finite matching affine simplicial mesh and its broken space from Matching affine simplicial meshes and shape regularity and Broken and conforming polynomial spaces on a matching mesh. On each cell , let , with .
In this discretization, a cell face means a facet of dimension when , and an endpoint when ; all face sums below use only these faces, with counting measure at endpoints. For each cell face , let be the outward unit normal, , and the trace of . On an interior face with neighbor , define the upwind trace by when and when ; either trace may be used when . On a physical boundary face, use the prescribed inflow datum when and when . The numerical flux is .
The upwind DG semidiscretization seeks a differentiable cellwise polynomial such that for every and , This definition is spatial only. It asserts neither a fully discrete bound nor a shock-convergence result.
For the face orientation, in the diagram is the shared vertical edge, points from to , and . The flux takes the trace on the side from which the sign of transports data. The coordinates and orientation specify the diagram completely; the proofs use the displayed flux formula, not the picture.
Depends on
Used by
- Forward-Euler step for degree-zero upwind DG transport Algorithm
- Cellwise L2 projection relation onto broken polynomials Definition
- Conservative flux-differencing SBP method for nonlinear systems Definition
- Upwind SBP-SAT discretization of constant transport Definition
- A constant upwind DG state with inflow data on one interval Example
- Central and upwind fluxes have different periodic dissipation Example
- Smooth-solution L2 error bound for upwind DG transport Theorem
- The degree-zero upwind forward-Euler step preserves mass and convex entropy Theorem
- Upwind DG transport satisfies the semidiscrete L2 energy identity Theorem
Dependency tree · one level
3 results within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Bernardo Cockburn, An Introduction to the Discontinuous Galerkin Method for Convection-Dominated Problems, CIME lecture notes (standard reference, not scraped)
- Bernardo Cockburn and Chi-Wang Shu, Runge–Kutta Discontinuous Galerkin Methods for Convection-Dominated Problems, Journal of Scientific Computing 16 (2001) (standard reference, not scraped)