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.

Finite-volume size transport with positive division quadrature

Definition

Input a partition 0=x0<x1<⋯<xJ=X with J≥1, a time step Δt>0, a nonnegative current mass vector Mk=(Mjk)j=1J, and the coefficients and kernel from Size transport with a nonlocal division kernel. Partition [0,X] into disjoint cells Cj=[xj−1,xj) for j<J and CJ=[xJ−1,X], with widths hj=xj−xj−1>0 and centers xjc=(xj−1+xj)/2. Set ujk=Mjk/hj, the incoming flux F0k=0, the internal and outgoing upwind fluxes Fjk=g(xj)ujk for 1≤j≤J, and dj=μ(xjc)+γ(xjc).

For each parent cell Cℓ, form nonnegative daughter coefficients

Ajℓ=1hℓ QM(y↦Ky(Cj);xℓ−1,xℓ,1),

using Composite midpoint rule on a uniform grid on the parent-size interval. Since the one-panel midpoint rule is QM(f;xℓ−1,xℓ,1)=hℓf(xℓc), this gives Ajℓ=Kxℓc(Cj)≥0. If Δt(g(xj)/hj+dj)>1 for any cell, return invalid-cfl without an update. Otherwise the finite-volume update is

Mjk+1=Mjk−Δt(Fjk−Fj−1k)−Δt djMjk+Δt∑ℓ=1JAjℓMℓk.

The flux FJk is absorbing outflow. The admissible variable-width CFL is Δt(g(xj)/hj+dj)≤1 for every cell. If a grid or any required coefficient/kernel evaluation fails, return failure without a partial update. Otherwise return Mk+1 together with the fluxes and daughter coefficients used in the step.

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