Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Periodic advection schemes and the finite-interval upwind row

Definition

Use the index sets and uniform spacings of Uniform periodic, infinite, and Dirichlet grid conventions: xj=jh, j∈Z, or j reduced modulo N in the periodic case. Fix a>0, h,k>0, and ν=ak/h. The target equation is the one-dimensional constant-velocity transport equation ut+aux=0, the constant-coefficient case of Linear transport equations and their characteristic flow. Set Uj0=u0(jh) and define, for n≥0, upwind: Ujn+1=Ujn−ν(Ujn−Uj−1n),downwind: Ujn+1=Ujn−ν(Uj+1n−Ujn),centered: Ujn+1=Ujn−ν2(Uj+1n−Uj−1n),Lax–Friedrichs: Ujn+1=Uj−1n+Uj+1n2−ν2(Uj+1n−Uj−1n),Lax–Wendroff: Ujn+1=Ujn−ν2(Uj+1n−Uj−1n)+ν22(Uj+1n−2Ujn+Uj−1n). On a periodic grid, every index in these formulas is reduced modulo N; no physical boundary data are present. For a<0, reflect the stencil by j↦−j and replace ν by ∣a∣k/h.

For a finite interval [0,L] with a>0, the inflow boundary is x=0. The upwind initial/boundary rows are Uj0=u0(jh) for j=0,…,N, U0n=g(tn) with u0(0)=g(0), and Ujn+1=(1−ν)Ujn+νUj−1n,j=1,…,N,n≥0. The outflow node j=N is computed by this row and receives no prescribed value. This item supplies no finite-interval boundary closure or stability statement for centered, Lax--Friedrichs, or Lax--Wendroff updates.

Depends on

Used by

Dependency tree · two levels

7 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