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.
Trapezoidal ringing on a stiff scalar decay equation
Facts & Assumptions
Given: The scalar decay equation with and , so .
Scalar stability function, A-stability, and L-stability for Runge–Kutta methods: for a scalar linear test equation, a Runge–Kutta step multiplies the state by its rational stability function evaluated at .
The selected two-stage SDIRK method has order two and is scalar L-stable: the SDIRK stability function is , , and is L-stable.
Two-stage Radau IIA has order three and is scalar L-stable: the Radau IIA stability function is , and is L-stable.
Backward Euler step equation and algebraic residual: backward Euler applied to has amplification factor .
Proof
Here the test argument is . The trapezoidal rule equation rearranges to the factor Thus, for , successive trapezoidal values alternate sign, while the magnitude after each step is multiplied by ; for , every iterate remains zero.
Backward Euler gives . The proved scalar functions give Each L-stable method damps this stiff mode strongly at this step size; the trapezoidal factor instead changes sign and has magnitude near one. These are scalar linear-test calculations only and imply no nonlinear stability comparison.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, Chapter 11: Stiffness (standard reference, not scraped)
- Ernst Hairer and Gerhard Wanner, Introduction à l’Analyse Numérique, Chapter III (standard reference, not scraped)