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.
Scalar absolute stability, A-stability, L-stability, and multistep root regions
Definition
For the scalar test equation , a step size gives . A one-step scalar update has stability function when one step sends to . If is rational, write it in reduced form; it is defined at exactly when its denominator is nonzero there. Its absolute-stability region is
The update is A-stable when the closed left half-plane is contained in . A rational one-step update is L-stable when it is A-stable and
where the limit means that the values tend to zero along every sequence in the closed left half-plane whose modulus tends to infinity.
For a linear multistep method with the coefficient and polynomial convention of Linear multistep methods, consistency, order, and the root condition, substitution of the scalar test equation gives the characteristic polynomial
The multistep absolute-stability region consists of those for which the leading coefficient is nonzero and every root of satisfies the root condition: all roots have modulus at most one, and every root of modulus one is simple. This criterion concerns constant-step scalar test recurrences.
Remarks
Absolute stability is a scalar test-equation property. It does not itself assert an accuracy bound for an ODE solution, contractivity of a matrix step, positivity preservation, or conservation.
Depends on
Used by
- Backward Euler scalar A-stability does not imply matrix contractivity Counterexample
- BDF2 roots on or outside the unit disk map to the closed right half-plane Lemma
- Backward Euler is A-stable and L-stable Theorem
- Constant-step BDF2 is A-stable under the multistep root condition Theorem
- Forward Euler has the closed unit disk centered at −1 as its absolute-stability region Theorem
- The trapezoidal rule is A-stable but not L-stable Theorem
Dependency tree · two levels
5 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.9 (standard reference, not scraped)
- MIT OpenCourseWare, 18.330 Introduction to Numerical Analysis, Chapter 5, §5.2.2: Stability (standard reference, not scraped)
- Masayuki Yano, James Douglass Penn, George Konidaris, and Anthony T. Patera, Math, Numerics, and Programming (for Mechanical Engineers), Unit IV, Chapter 21 (standard reference, not scraped)