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.

Linear multistep methods, consistency, order, and the root condition

Definition

Let k≥1, d≥1, and let f:U→Rd be the right-hand side of a first-order initial-value problem on an open set U⊆R×Rd, using the convention of First-order systems, initial value problems, and solutions on intervals. A constant-step k-step linear multistep method has real coefficients α0,…,αk,β0,…,βk with αk≠0 and advances values by

∑j=0kαjYn+j=h∑j=0kβjf(tn+j,Yn+j),tn+j=tn+jh,h>0.

Multiplying all coefficients by the same nonzero scalar leaves the method unchanged; one may normalize αk=1. Its characteristic polynomials are

ρ(ζ)=∑j=0kαjζj,σ(ζ)=∑j=0kβjζj.

For an exact solution y, the unscaled local residual at tn is

τn(h;y)=∑j=0kαjy(tn+jh)−h∑j=0kβjy′(tn+jh).

The method has order at least p, where p≥1 is an integer, if, for every open U⊆R×Rd, every right-hand side f:U→Rd as above, and every exact solution y of that IVP with p+1 continuous derivatives, τn(h;y)=O(hp+1) uniformly for admitted starting times in every fixed compact interval on which the indicated derivatives are bounded. It is consistent if it has order at least one. Equivalently, with the above coefficient convention, consistency is ρ(1)=0 and ρ′(1)=σ(1).

The root condition is that every complex root of ρ has modulus at most one and every root of modulus one has algebraic multiplicity one. The method is zero-stable if for each T>0 there is a constant MT independent of N such that every solution of the homogeneous recurrence ∑jαjYn+j=0 on the uniform grid h=T/N satisfies

max⁡0≤n≤N∥Yn∥∞≤MTmax⁡0≤j<k∥Yj∥∞.

Here ∥x∥∞=max⁡0≤i<d∣xi∣ for x∈Rd. The root-condition equivalence for zero-stability is established separately.

Depends on

Used by

Dependency tree · two levels

15 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