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.

Backward Euler FEM with interval-averaged forms and load

Definition

Input a real evolution triple (V,H,V∗) and a finite-dimensional conforming subspace Vh⊂V with its inherited H inner product and V norm; a finite-element use instantiates it with a zero-boundary conforming polynomial space. Input also a final time T>0, a finite partition 0=t0<t1<⋯<tN=T, and a real bilinear form family ah(t;⋅,⋅):Vh×Vh→R such that t↦ah(t;vh,wh) is measurable for each fixed vh,wh∈Vh. There must be constants 0≤M<∞, α>0 and one null set E⊂(0,T) such that ∣ah(t;vh,wh)∣≤M∥vh∥V∥wh∥V,ah(t;vh,vh)≥α∥vh∥V2(vh,wh∈Vh, t∈(0,T)∖E). The same exceptional set and constants apply to all pairs. Input a strongly measurable load g∈L2(0,T;Vh∗) and an initial value U0∈Vh. A finite-element load f∈L2(0,T;V∗) is supplied as its restriction g(t)=f(t)∣Vh. For Ij=(tj−1,tj) and τj=tj−tj−1, form the scalar bilinear and Bochner load averages aˉj(vh,wh)=τj−1∫Ijah(t;vh,wh) dt,gˉj=τj−1∫Ijg(t) dt. For j=1,…,N, solve for Uj∈Vh from τj−1(Uj−Uj−1,vh)H+aˉj(Uj,vh)=⟨gˉj,vh⟩Vh∗,Vh(vh∈Vh). Return the nodes U0,…,UN, the piecewise-constant function Uˉ(t)=Uj on each open interval (tj−1,tj) (endpoint values do not affect the L2 function), and the continuous piecewise affine reconstruction U^ joining consecutive nodes. The initial value is the separately supplied U0; the initial jump is U1−U0, and subsequent jumps are Uj−Uj−1. Invalid spaces, partitions, or form/data hypotheses return invalid-input; the well-definedness theorem proves that each indicated solve has a unique answer under the stated hypotheses. Because coefficients and loads are averaged, this procedure is defined on their almost-everywhere equivalence classes and does not sample a representative at a point. For a time-dependent form this is the averaged-coefficient backward Euler method; with piecewise-constant time trials it is also the dG(0) step.

Depends on

Used by

Dependency tree · two levels

8 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