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 linear stabilized Runge–Kutta–Chebyshev step

Definition

Input a finite-dimensional real vector space V, a linear endomorphism A:V→V, an initial vector y∈V, a step h>0, and an integer stage count s≥2. Each application of A is the exact value of this total linear map, so this mathematical procedure has no application-failure branch. Define w1=3s2−1,bs=s2−13s2,as=1−bs. Set V0=y and V1=V0+w1hA(V0). For j=2,…,s, compute Vj=2Vj−1+2w1hA(Vj−1)−Vj−2. Return asV0+bsVs. Each stage uses one application of A; no implicit system is solved. The output is the one-step update for the autonomous linear equation y′=Ay. Here Ts denotes the Chebyshev polynomial defined by Chebyshev polynomials of the first and second kinds by their three-term recurrences; the equivalent polynomial in hA and its certified real stability interval are proved separately.

Depends on

Used by

Dependency tree · two levels

14 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