Alphabeta Math
AlgorithmAlgorithm: 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.

Forward-Euler step for degree-zero upwind DG transport

Definition

Input a dimension d≥2, a finite matching affine simplicial mesh Th whose boundary faces are paired by translations to form a periodic mesh, a constant velocity β∈Rd, one cell mean UK∈R per cell, and a step Δt>0. The output is either CFL-inadmissible or an updated vector of cell means U+=(UK+)K∈Th. Let VK=∫K1 dx be the cell volume and AF=∫F1 dS the face area. Here a cell face is a codimension-one facet, as in Upwind discontinuous Galerkin discretization of constant transport. For each face F⊂∂K, let nK,F be the outward unit normal, bK,F=β⋅nK,F, and KF the neighboring cell across that periodic face. With b+=max⁡(b,0) and b−=min⁡(b,0), the upwind flux out of K is f^K,F=bK,F+UK+bK,F−UKF.

Compute λK=ΔtVK∑F⊂∂KAFbK,F+. If λK>1 for any cell, return CFL-inadmissible without updating the state. Otherwise, the degree-zero upwind forward-Euler update is admissible and its output is UK+=UK−ΔtVK∑F⊂∂KAFf^K,F. This is the degree-zero specialization of Upwind discontinuous Galerkin discretization of constant transport.

Depends on

Used by

Dependency tree · two levels

4 results within two dependency steps 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