Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generated
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 index-one eigenvector-following Newton step

Definition

Let U,V be as in Regular minimum-energy paths on a declared collision-free tube. Inputs: an initial point x0∈U, a unit initial mode reference vref∈Rd, a local-ball center xref∈U, radius rloc>0, gradient tolerance τg≥0, eigenvalue margin γ>0, eigenpair residual tolerance τeig≥0, mode-overlap threshold 0≤τmode<1, update budget N∈N0, and a supplied spectral-data routine E. On input (x,H(x)), E must return in finite time either failure or an orthogonal matrix Q, ordered approximate eigenvalues λ^j, and validated ordered intervals Ij with their checked certificates as specified below. This input routine supplies spectral data; the enclosure definition does not compute them. Return the last point, the most recently accepted mode reference, and a termination status from geometry-failure, outside-local-basin, gradient-residual-tolerance, budget-exhausted, eigensolve-tolerance-failure, index-one-branch-failure, mode-tracking-failure, or singular-jacobian. The mode reference starts at vref and changes only after a successful eigenpair and overlap check, storing the signed q1 from that check. A positive residual tolerance does not in general certify that q1 is an exact lowest eigenvector, and a reference accepted at an earlier iterate carries no spectral certification at the returned point. When called at xk in step 2, the input routine E supplies an orthogonal matrix Q=[q1,…,qd], ordered approximate eigenvalues λ^1≤⋯≤λ^d, and validated intervals Ij=[ℓj,uj] in the sense of Validated ordered eigenvalue enclosures for an index-one Hessian. Require every residual ∥H(xk)qj−λ^jqj∥2≤τeig, d τeig≤γ/2, and λ^j∈Ij. The Hessian H=∇2V is symmetric by The Hessian of a C2 scalar field is symmetric.

For k=0,…,N, in order:

  1. If xk∉U, return geometry-failure. If xk∉B2(xref,rloc), return outside-local-basin. Compute gk=∇V(xk). If ∥gk∥2≤τg, return gradient-residual-tolerance; if k=N, return budget-exhausted.
  2. Evaluate H(xk) and call E(xk,H(xk)). If it returns failure, return eigensolve-tolerance-failure; otherwise use its returned Q, λ^j, and Ij. If an eigenpair residual exceeds τeig, dτeig>γ/2, or some λ^j∉Ij, return eigensolve-tolerance-failure. If the validated intervals do not satisfy u1≤−γ and ℓj≥γ for all j≥2 (with the dimension-one convention in the definition), return index-one-branch-failure. If ∣q1Tvref∣≤τmode, return mode-tracking-failure; otherwise retain q1 when q1Tvref>0 and replace it by −q1 when q1Tvref<0. Use the resulting direction as the next mode reference. This overlap check screens changes of the computed reference direction; it does not certify exact mode identity or alter the Newton correction.
  3. Call Newton correction for a square vector residual with A=H(xk) and r=gk. If it returns singular-jacobian, return that status. Its correction pk is the exact Newton solution of H(xk)pk=−gk in the mathematical model; the eigenpair data certifies the index-one branch but does not replace this linear solve.
  4. If xk+pk∉U or lies outside B2(xref,rloc), return outside-local-basin. Otherwise set xk+1=xk+pk and continue.

An approximate eigensolve has a finite residual-tolerance branch and an explicit failure status. The definition makes no global-convergence claim. Local quadratic behavior is stated separately and requires the hypotheses of Updated-Jacobian Newton has local quadratic convergence at a simple root.

Depends on

Used by

Dependency tree · two levels

23 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