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.
The selected two-stage SDIRK method has order two and is scalar L-stable
Statement
Let , and use the tableau in Selected two-stage singly diagonally implicit Runge–Kutta tableau. The coefficient satisfies . For a vector field on a neighborhood of the exact solution segment, the local small-step stage branch specified by Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error has local defect ; hence the method has classical order at least two. Its scalar stability function is and it is L-stable in the scalar sense of Scalar stability function, A-stability, and L-stability for Runge–Kutta methods. This is only a scalar linear-test-equation assertion, not a nonlinear contractivity claim.
Facts & Assumptions
Given: The selected tableau, a vector field on an open neighborhood of an exact solution segment, and a sufficiently small positive step for which an invariant stage ball contains the selected stage solution.
Implicit Runge–Kutta stage equations and update: , with update .
Square roots exist: a unique with ; the positives are : is the unique nonnegative real whose square is .
Squaring is monotone on the nonnegatives: for nonnegative , if and only if .
Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error: if is bounded by , is -Lipschitz on an invariant product ball of radius , , and , then the stage fixed point exists uniquely in that ball.
Multivariable Taylor formula with a Lagrange remainder along a line segment gives the Lagrange remainder for each scalar component on a convex segment. 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.
The invariant-ball and bounded-derivative hypotheses of [F5] hold locally, and the derivatives through order two used below are bounded on the tube.
Proof
Since and by [F3], [F4] rules out because that would imply . Thus , so and . The row sums of are , and is the last row of , so the method is internally consistent and stiffly accurate by [F1] and [F2]. Also and , since substituting gives .
To check order, augment the nonautonomous equation by the clock variable and write , . The row-sum condition in step 1.1 makes its Runge–Kutta stage time coordinates . Writing , the stage bound [F5] gives . The componentwise Taylor bound [F6] and the bounded derivatives [A1] then give : indeed . Thus the update is , which agrees with the exact Taylor expansion through degree two. Its local defect is therefore .
On the scalar equation, solving the first stage gives ; substitution into the second gives . Stiff accuracy identifies with the update, proving the displayed rational formula wherever the stages are defined.
To rule out order three or higher, apply the method from to . The exact solution is , whereas [F1] and [F2] give the update . Since (equality would imply after squaring), its local defect has a nonzero cubic coefficient. Together with step 2.1 this proves that the classical order is exactly two.
Put , , , and . From [F3] and , one obtains . Direct expansion gives Also , so the denominator is nonzero for . The inequality proves for , and the numerator degree is one while the denominator degree is two, so as in that half-plane. By the scalar definition this is L-stability.
Depends on
- Selected two-stage singly diagonally implicit Runge–Kutta tableau
- Scalar stability function, A-stability, and L-stability for Runge–Kutta methods
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error
- First-order systems, initial value problems, and solutions on intervals
- Multivariable Taylor formula with a Lagrange remainder along a line segment
- Implicit Runge–Kutta stage equations and update
- Squaring is monotone on the nonnegatives
Used by
Dependency tree · two levels
30 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)