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 step map with an exact or approximate Jacobian
Definition
Let be open, let , and let be a vector field (First-order systems, initial value problems, and solutions on intervals). For , a step size , a parameter , and a matrix , put When this matrix is invertible, the one-stage Rosenbrock step uses the stage slope and update At points where all state partial derivatives exist, the exact-Jacobian branch sets , where is the Jacobian in the state variables as in The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case. An approximate-Jacobian branch may supply a different ; the equation requires the chosen shifted matrix to be invertible. The name Rosenbrock–Euler here refers to the case . This definition specifies one linearized step and does not say that it solves the full backward-Euler nonlinear equation.
Depends on
Used by
- Finite-precision one-stage Rosenbrock step with residual status Algorithm
- Rosenbrock–Euler damps a stiff scalar decay with the backward-Euler factor Example
- Rosenbrock–Euler has an explicit one-step defect and solve-residual allowance Lemma
- The one-stage update has an explicit Jacobian-approximation defect Lemma
- Autonomous Rosenbrock–Euler is one Newton correction of backward Euler Proposition
- The Rosenbrock–Euler scalar stability function is A-stable exactly for gamma at least one half Theorem
Dependency tree · two levels
9 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.4 Rosenbrock Methods (standard reference, not scraped)
- Daniel Kressner, Advanced Numerical Analysis, §3.5 Rosenbrock methods (standard reference, not scraped)