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 Rosenbrock–Euler scalar stability function is A-stable exactly for gamma at least one half
Statement
For scalar stability, consider the exact-arithmetic complexification of the exact-Jacobian one-stage equation. For , , , and , use and . Equivalently, identify with and multiplication by with the real matrix ; the corresponding real exact Jacobian is , and the equations become and . This is a scalar stability analysis of exact stage equations; it is not an execution of the finite-precision real algorithm Finite-precision one-stage Rosenbrock step with residual status. Use the scalar rational-function criteria in Scalar stability function, A-stability, and L-stability for Runge–Kutta methods for its amplification function. Its scalar stability function is It has no pole in and satisfies throughout that half-plane if and only if . Among these parameters, it is L-stable if and only if . In particular, the named Rosenbrock–Euler case has the backward-Euler factor .
Facts & Assumptions
Given: , the scalar test equation, and .
The Rosenbrock–Euler step map with an exact or approximate Jacobian: the real exact-Jacobian stage equation is and the update is ; the complex extension analyzed here is specified explicitly in the Statement.
Scalar stability function, A-stability, and L-stability for Runge–Kutta methods: A-stability means no pole and modulus at most one on the closed left half-plane; L-stability additionally requires the limit to vanish at infinity there.
Real and imaginary parts, complex conjugation, and modulus: each complex has coordinates with .
Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive: the complex modulus is nonnegative and multiplicative and satisfies the triangle inequality.
Proof
Given: The data in the Statement.
For , the exact complexified equation in the Statement gives , so the amplification factor is the stated .
Write with . The denominator has real part , so it has no zero there. Using [F4] and [F5], direct expansion gives .
If , both terms on the right of step 2.1 are nonnegative; hence for all , and [F3] gives A-stability. If , choose real with . Then the right side is , so and A-stability fails.
Along as , . This is zero exactly when . For , and on the closed left half-plane by step 3.1. Also by [F5], so for we have as there. Thus [F3] gives the claimed L-stability characterization and the backward-Euler equality.
Remarks
[F2] Finite-precision one-stage Rosenbrock step with residual status: this is a finite-precision real-space implementation with the real exact stage equation of [F1]; no execution or numerical status of that algorithm is used here.
Depends on
- The Rosenbrock–Euler step map with an exact or approximate Jacobian
- Finite-precision one-stage Rosenbrock step with residual status
- Scalar stability function, A-stability, and L-stability for Runge–Kutta methods
- Real and imaginary parts, complex conjugation, and modulus
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
Used by
Dependency tree · two levels
18 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
- WIAS Berlin, Numerical Methods for Stiff Ordinary Differential Equations, §2.3 Linear Stability Theory (standard reference, not scraped)
- Daniel Kressner, Advanced Numerical Analysis, §3.5 Rosenbrock methods (standard reference, not scraped)