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.

Second-order nonlinear stabilized Runge–Kutta–Chebyshev step

Definition

Input a first-order right-hand side f:D→Rd on an open time-state domain D⊆R×Rd, an admitted pair (t,y)∈D, a step h>0, an integer stage count s≥2, and a right-hand-side evaluator that returns either f(τ,u) or an evaluation-failure status at each queried (τ,u)∈D. In the exact mathematical model the evaluator returns f at every point of D; the failure status records only an unavailable numerical evaluation. Set w1=3s2−1,b0=b1=b2=14,bj=j2−13j2 (3≤j≤s),aj=1−bj (0≤j≤s). For the stages define c0=0, c1=b1w1, and cj=bjw1j2 for 2≤j≤s. Put Y0=y. Before each query check that its time-state input belongs to the declared domain; if not, return domain-failure with that stage index. If the right-hand-side evaluator reports failure, return evaluation-failure with that stage index. Query k0=f(t,Y0) and on success set Y1=Y0+b1w1hk0. For each j=2,…,s, define μj=2bjbj−1,νj=−bjbj−2,mj=2bjw1bj−1,gj=−aj−1mj, query kj−1=f(t+cj−1h,Yj−1), and on success set Yj=(1−μj−νj)y+μjYj−1+νjYj−2+mjhkj−1+gjhk0. If (t+h,Ys) is outside the declared domain, return output-domain-failure; otherwise return success with (t+h,Ys). All stages use only the initial state and already computed values, so the procedure contains no implicit solve.

For an autonomous field, omit the time arguments. Order, stability, and stage-amplification properties are established separately.

The coefficient b2 agrees with the displayed formula at j=2; it is listed among the base values to make the recurrence unambiguous. The Chebyshev identities used to derive these coefficients are supplied by Chebyshev polynomials of the first and second kinds by their three-term recurrences.

Depends on

Used by

Dependency tree · two levels

10 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