Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 d≥1, let β∈Rd be constant, and consider ut+∇⋅(βu)=0 on a fixed domain. For d=1, use Oriented interval meshes and broken polynomial spaces. For d≥2, use a finite matching affine simplicial mesh Th and its broken space Vhbr=∏K∈ThPp(K) from Matching affine simplicial meshes and shape regularity and Broken and conforming polynomial spaces on a matching mesh. On each cell K, let uh∣K∈Pp(K), with p≥0.

In this discretization, a cell face means a facet of dimension d−1 when d≥2, and an endpoint when d=1; all face sums below use only these faces, with counting measure at endpoints. For each cell face F⊂∂K, let nK,F be the outward unit normal, bK,F=β⋅nK,F, and uK the trace of uh∣K. On an interior face with neighbor K′, define the upwind trace by u^K,F=uK when bK,F>0 and u^K,F=uK′ when bK,F<0; either trace may be used when bK,F=0. On a physical boundary face, use the prescribed inflow datum g when bK,F<0 and uK when bK,F≥0. The numerical flux is f^K,F=bK,Fu^K,F.

The upwind DG semidiscretization seeks a differentiable cellwise polynomial uh(t) such that for every K∈Th and vh∈Pp(K), ∫K(∂tuh)vh dx−∫Kβuh⋅∇vh dx+∑F⊂∂K∫Ff^K,Fvh dS=0. This definition is spatial only. It asserts neither a fully discrete bound nor a shock-convergence result.

For the face orientation, in the diagram F is the shared vertical edge, nF=(1,0) points from K− to K+, and b=β⋅nF. The flux takes the trace on the side from which the sign of b transports data. The coordinates and orientation specify the diagram completely; the proofs use the displayed flux formula, not the picture.

K¡K+u¡u+nF¯F

Depends on

Used by

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