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 stability function, A-stability, and L-stability for Runge–Kutta methods
Definition
For a Runge–Kutta tableau , apply its stage equations to the scalar test equation , with . Whenever is invertible, the stages satisfy , and the scalar stability function is
The scalar stability region is the set of for which the scalar update has . The method is A-stable when its rational stability function has no pole in and throughout that closed half-plane. It is L-stable when it is A-stable and as with .
These are properties of the scalar linear test equation and the tableau's rational function. They do not assert nonlinear contractivity or control of nonnormal matrix growth.
Depends on
Used by
- Trapezoidal ringing on a stiff scalar decay equation Example
- The selected two-stage SDIRK method has order two and is scalar L-stable Proposition
- Two-stage Radau IIA has order three and is scalar L-stable Proposition
- The Rosenbrock–Euler scalar stability function is A-stable exactly for gamma at least one half Theorem
- The selected exact-J two-stage Rosenbrock method is scalar L-stable Theorem
Dependency tree · two levels
11 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: Équations Différentielles Ordinaires (standard reference, not scraped)
- John C. Butcher, Implicit Runge–Kutta Methods, tutorial accompanying Numerical Methods for Ordinary Differential Equations (standard reference, not scraped)