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.

One-step IMEX Euler with an implicit branch and residual status

Definition

For the additive ODE partition Additive autonomous ODE partitions, take a current state y∈U, a step h>0, a closed ball B‾(c,R)⊂U centered at c:=y+ha(y), bounds Mb,Lb≥0 for ∥b∥2 and its Lipschitz constant on that ball, a tolerance τ≥0, and a solve routine that returns either a candidate z∈B‾(c,R) or a failure status. The procedure is:

  1. If the solve routine is unavailable, return solver-unavailable.
  2. If hMb>R or hLb≥1, return branch-not-certified without claiming a root.
  3. Call the solve routine on z=c+hb(z).
  4. If it returns failure, return that failure status. If it returns z∉B‾(c,R), return out-of-branch-ball.
  5. Compute the update residual r:=z−c−hb(z) in the state units of Implicit residuals and their update and derivative units. If ∥r∥2>τ, return residual-too-large with z and r; otherwise return success with z and r.

When the routine returns an exact root, r=0 and z is the IMEX Euler step Y=y+ha(y)+hb(Y). A success status records only the requested residual check; the forward error conclusion is supplied separately by the residual theorem. This procedure uses one explicit evaluation of a and one implicit solve.

Depends on

Used by

Dependency tree · two levels

17 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