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.
Finite-budget residual-merit damped Newton
Definition
Let be open, , and let be
(Continuously differentiable maps, local inverses, and local diffeomorphisms) with Jacobian as in
The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case. The matrix of in the standard
basis is by
A total derivative computes every directional derivative, and its matrix is the Jacobian. Define
the residual merit
. Inputs: , residual tolerance
, update budget , sufficient-decrease
parameter , reduction factor , and finite
backtrack budget . Output: the last valid iterate and one
of root, singular-jacobian, invalid-trial, line-search-exhausted, or
iteration-budget-exhausted.
At iteration , apply these instructions in order:
- Evaluate . If , return . This status records the residual test only.
- If , return .
- Call Newton correction for a square vector residual with
and . If it returns
singular-jacobian, return . Otherwise let be its correction. - For , set and trial . If , reject the trial and continue. If , evaluate and accept the first trial satisfying On acceptance set and continue at iteration .
- If no trial was accepted, return if every tested point was outside ; otherwise return .
The residual-merit test is defined directly for a vector root problem. A finite backtrack budget can return failure; no global convergence or quadratic-rate claim is made.
Depends on
Used by
Dependency tree · two levels
14 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
- E. Hairer and G. Wanner, Solving Ordinary Differential Equations II, Chapter VI: Iterative Methods—Nonlinear Equations (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, version 1.0 (standard reference, not scraped)