Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Hydrostatic reconstruction with a dry-safe HLL flux and one-sided pressure corrections

Definition

Let Δx>0 be a uniform cell width, let i range over a finite chain or a periodic or bi-infinite mesh, and let bi be the bed value in cell i. At time level n, the cell state is Uin=(hin,min)∈K from One-dimensional shallow-water balance law with a dry-state convention, with velocity uin and free surface ηin=hin+bi.

For a finite chain i=1,…,N with N≥1, supply at each time level two ghost states U0n,UN+1n∈K and bed values b0,bN+1∈R. These are boundary inputs, used only to evaluate the faces 1/2 and N+1/2; only cells 1,…,N are updated. On a periodic mesh, identify neighboring indices periodically.

At face i+1/2, set bi+1/2∗=max⁡(bi,bi+1),hi+1/2,L∗=max⁡(0,ηin−bi+1/2∗),hi+1/2,R∗=max⁡(0,ηi+1n−bi+1/2∗). For s=L,R, set ui+1/2,s∗=uin or ui+1n, respectively, when hi+1/2,s∗>0, and set it to zero when hi+1/2,s∗=0. Define Ui+1/2,s∗=(hi+1/2,s∗,hi+1/2,s∗ui+1/2,s∗) and ci+1/2,s∗=ghi+1/2,s∗. The face speeds are aL,i+1/2=min⁡(0,ui+1/2,L∗−ci+1/2,L∗,ui+1/2,R∗−ci+1/2,R∗),aR,i+1/2=max⁡(0,ui+1/2,L∗+ci+1/2,L∗,ui+1/2,R∗+ci+1/2,R∗). They satisfy aL≤0≤aR. Write Fs∗=F(Ui+1/2,s∗). The common HLL face flux is F^i+1/2n={FL∗,aL,i+1/2≥0,FR∗,aR,i+1/2≤0,aR,i+1/2FL∗−aL,i+1/2FR∗+aL,i+1/2aR,i+1/2(Ui+1/2,R∗−Ui+1/2,L∗)aR,i+1/2−aL,i+1/2,aL,i+1/2<0<aR,i+1/2. If both speeds are zero, both reconstructed states are dry and the first branch returns (0,0); the middle denominator is never used in that case.

The one-sided corrected fluxes, where L is the side of cell i and R the side of cell i+1, are Gi+1/2,Ln=F^i+1/2n+(0,g2((hin)2−(hi+1/2,L∗)2)),Gi+1/2,Rn=F^i+1/2n+(0,g2((hi+1n)2−(hi+1/2,R∗)2)). For Δt>0, put λ=Δt/Δx and update Uin+1=Uin−λ(Gi+1/2,Ln−Gi−1/2,Rn). Equivalently, with hi,+∗=hi+1/2,L∗, hi,−∗=hi−1/2,R∗, and F^ the shared face flux, Uin+1=Uin−λ(F^i+1/2n−F^i−1/2n)+Δt Sin,Sin=(0,g2Δx((hi,+∗)2−(hi,−∗)2)). The face-specific depth CFL condition is λ(aR,i+1/2−aL,i−1/2)≤1for every cell i.

The diagram is a wet/wet face with bi<bi+1 and a common rest level η0. The dotted line marks the free surface, the solid step is the bed, and both reconstructed depths are measured from b∗=max⁡(bi,bi+1). The displayed equations specify every state and orientation used in proofs.

diagram failed to render:
\begin{tikzpicture}[x=1.1cm,y=1cm]
  \draw[->] (0,0) -- (4.5,0) node[right] {$x$};
  \draw[thick] (0,0.35) -- (2,0.35) -- (2,1.0) -- (4,1.0);
  \draw[dotted,thick] (0,1.8) -- (4,1.8) node[right] {$\eta_0$};
  \draw[dashed] (2,1.0) -- (4,1.0);
  \draw[<->] (1,1.0) -- (1,1.8) node[midway,left] {$h_L^*$};
  \draw[<->] (3,1.0) -- (3,1.8) node[midway,right] {$h_R^*$};
  \draw (2,0.1) -- (2,1.95);
  \node at (1,0.12) {$b_i$};
  \node at (3,0.75) {$b_{i+1}=b^*$};
  \node at (2,2.08) {$i+\tfrac12$};
\end{tikzpicture}

Remarks

The scheme uses only the cell bed values, so its discrete fluxes are defined for bed steps. A continuum source or weak-limit statement across a discontinuous bed requires a separately specified path product and is not supplied here. No entropy inequality or stiff-relaxation/asymptotic-preserving claim is part of this definition.

Depends on

Used by

Dependency tree · one level

1 result 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