Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedprecheck pending
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 implicit-midpoint collocation for a nonlinear BVP

Definition

Fix a uniform mesh and the open nodal domain Dh and normalized residual Gh from Normalized implicit-midpoint collocation residual for a two-point BVP. If f and B are C1 on the required domains (total differentiability with continuous derivative entries), then Gh is a C1 square map from the open subset Dh⊆Rd(N+1) into Rd(N+1). Given an initial node vector Y0∈Dh, tolerance τ≥0, and correction budget M∈N0, apply Finite-budget Newton for a square vector residual to Gh using its exact Jacobian. Return the last node vector and its root, singular-jacobian, invalid-trial, or iteration-budget-exhausted status as defined by that procedure. A root status means only that ∥Gh(Y)∥≤τ; it is not a branch, convergence, or error certificate.

Depends on

Used by

Dependency tree · two levels

7 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