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.
Backward Euler, the selected SDIRK, and two-stage Radau IIA converge at their stated orders under controlled stage residuals
Statement
Let , , , and let solve . Assume is on a neighborhood of a common compact tube containing the exact solution, all grid states, and all stage balls; is -Lipschitz in state there; and . For each grid input in the tube, use the local stage branch in a prescribed invariant product ball for one of: BE with order , the tableau Selected two-stage singly diagonally implicit Runge–Kutta tableau with , or the tableau Two-stage Radau IIA tableau with . The exact stage root and any approximate stage vector being compared must lie in that same ball. For BE, also require the exact ODE endpoint to lie in the same one-stage ball as the exact BE root, so its residual can be used in the branch estimate. Assume uniformly that the hypotheses of Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error hold with , , and that the exact one-step stages, approximate stages, and outputs stay in the tube.
Initialize . At each step, use a stage vector in the prescribed ball whose update residual satisfies for a constant independent of , and update by the method formula. Then there is a constant , independent of , such that The same conclusion holds with an initial error bounded by . The residual condition is in update-residual units; if a derivative-scaled residual is used, it requires . A fixed absolute stage residual tolerance alone does not imply the stated order.
Facts & Assumptions
Given: The exact IVP, common tube, state Lipschitz and smoothness bounds, uniform invariant stage balls, a selected method, and residual bounds from the Statement.
Implicit Runge–Kutta stage equations and update: the stages solve , the update is , and stiff accuracy means is the final row of with .
Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error: if the stage fixed-point map is a contraction with constant on an invariant product ball, there is a unique stage root there and every approximate stage vector in the ball has error at most .
The selected two-stage SDIRK method has order two and is scalar L-stable: the selected SDIRK coefficient satisfies , and the method has local defect on the stated smooth tube.
Two-stage Radau IIA has order three and is scalar L-stable: the selected Radau IIA method has local defect on the stated smooth tube.
Global error from uniform one-step defect and stability: on a common tube, an exact one-step method with local defect , stability factor at most , and initial error has global error .
Finite geometric error bound from a one-step recurrence: if and , then for .
Multivariable Taylor formula with a Lagrange remainder along a line segment is applied to each scalar coordinate of the exact solution. The supplier is scalar-valued. For a vector map , apply it separately to each real component ; its intermediate points may differ. If the absolute values of all order- component partial derivatives on the segment are at most , each component remainder is at most , where is a fixed finite constant, since . Hence the Euclidean remainder is at most . In one time variable the max-norm bound is . No common intermediate point for all components is asserted. With and the uniformly bounded second derivatives on the tube, and in Euclidean norm; using gives the BE update residual .
Backward Euler step equation and algebraic residual: BE is the one-stage Runge–Kutta stage equation with , so its stage is its endpoint and its update is that stage.
At every step, the approximate stages and exact stage roots lie in the same prescribed invariant product ball, the stage map is -Lipschitz, and . For BE, the exact ODE endpoint also lies in that one-stage ball.
Proof
BE and both tableaux are stiffly accurate. Their row-sum norms satisfy , and their positive weights satisfy : for BE this is immediate; for SDIRK the absolute row sums are and ; for Radau they are and .
For exact stages at two inputs , subtract the fixed-point equations. The state Lipschitz bound [A1] gives hence . The update formula and now give
For an approximate stage vector and the exact stages with the same input, [F2] and give . Stiff accuracy and the residual equation give the method output , whereas the exact output is . Since , the output perturbation is at most .
The exact one-step map has local defect order : for BE, [F8] identifies the endpoint with its one-stage value, [F7] gives residual at the exact endpoint, and [F2] turns this into endpoint error because both the endpoint and the selected stage root lie in the same ball; for SDIRK and Radau, use [F3] and [F4]. With the stability estimate in step 1.2, the exact-solve trajectory satisfies [F5] and has global error .
Let be the exact-solve trajectory from the same initial value and set . Steps 1.2 and 1.3 give Applying [F6] yields uniformly in . The triangle inequality and step 2.1 give . An initial error is handled by the same recurrence and [F5].
Depends on
- Backward Euler step equation and algebraic residual
- Implicit Runge–Kutta stage equations and update
- Selected two-stage singly diagonally implicit Runge–Kutta tableau
- Two-stage Radau IIA tableau
- Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error
- The selected two-stage SDIRK method has order two and is scalar L-stable
- Two-stage Radau IIA has order three and is scalar L-stable
- Global error from uniform one-step defect and stability
- Multivariable Taylor formula with a Lagrange remainder along a line segment
- Finite geometric error bound from a one-step recurrence
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
37 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)