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 , , and let be the right-hand side of a first-order initial-value problem on an open set , using the convention of First-order systems, initial value problems, and solutions on intervals. A constant-step -step linear multistep method has real coefficients with and advances values by
Multiplying all coefficients by the same nonzero scalar leaves the method unchanged; one may normalize . Its characteristic polynomials are
For an exact solution , the unscaled local residual at is
The method has order at least , where is an integer, if, for every open , every right-hand side as above, and every exact solution of that IVP with continuous derivatives, 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 and .
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 there is a constant independent of such that every solution of the homogeneous recurrence on the uniform grid satisfies
Here for . The root-condition equivalence for zero-stability is established separately.
Depends on
- First-order systems, initial value problems, and solutions on intervals
- The complex numbers as $\mathbb R[x]/(x^2+1)$, with the real embedding and imaginary unit $i$
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- Real and imaginary parts, complex conjugation, and modulus
Used by
- Variable-step Adams predictor-evaluate-correct-evaluate procedure Algorithm
- Variable-step BDF2 with an explicit local implicit-branch rule Algorithm
- A repeated unit root causes a linearly growing parasitic mode Counterexample
- Scalar absolute stability, A-stability, L-stability, and multistep root regions Definition
- A repeated interior root preserves bounded companion powers Example
- Simple unit-circle roots give bounded oscillatory modes Example
- Uniform-step BDF2 satisfies the Dahlquist conditions Example
- BDF2 roots on or outside the unit disk map to the closed right half-plane Lemma
- Quadratic interpolation gives the variable-step BDF2 formula and cubic residual Lemma
- Taylor moment conditions characterize the order of a linear multistep method Lemma
- The root condition is equivalent to bounded powers of the multistep companion matrix Lemma
- Dahlquist equivalence for a consistent linear multistep method Theorem
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
- Ernst Hairer and Gerhard Wanner, Introduction à l’Analyse Numérique, Chapter III, §§III.6–III.8 (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §§6.6 and 6.8 (standard reference, not scraped)