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.
Nonlinear Boundary-Value Solvers
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonlinear equations and Newton methods
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page defines square nonlinear two-point boundary-value problems and exact shooting residuals, then separates exact flow sensitivity from the derivative and error contract of a numerical IVP evaluator. Single and multiple shooting are formulated as finite-budget residual solvers, with their exact residual Jacobians and solution correspondences proved locally. The implicit-midpoint section defines the normalized collocation residual, proves its discrete linearized inverse from a bounded inverse for the continuous BVP, and derives a local second-order branch estimate with an algebraic residual budget. Newton claims remain local and finite-budget, and the estimates keep IVP error, mesh error, residual error, and BVP conditioning distinct.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Square nonlinear two-point boundary-value problems and endpoint residuals
Definition
Fix , an integer , an open set containing the states under consideration, and a vector field . Let be open and let . A square nonlinear two-point boundary-value problem (BVP) is
where is a continuously differentiable curve whose graph lies in , whose endpoint pair lies in , and where the scalar components of give exactly boundary equations. A BVP solution is such a curve satisfying both the differential equation and endpoint equation. No existence or uniqueness is part of this definition.
If the IVP from initial state has a unique solution on , the exact shooting residual is whenever . For a mesh and segment initial states , the exact multiple-shooting residual has rows for and final row , where denotes the unique segment IVP solution when it exists. These residuals are defined only on their admissible IVP and boundary domains.
Initial-data sensitivity of an ODE flow on a common compact tube
Statement
Let , let be open, and let be . Let be compact and convex, and let be open. Assume that for every the unique IVP solution from exists on and for every . Then is on for each . Its derivative matrix is the unique solution of
and hence satisfies , . The claim is local to the stated common compact tube; it does not assert differentiability beyond it.
Facts & Assumptions
Given: , the open state-time domain , the vector field , compact convex , open , and the stated common existence and tube assumptions.
Continuously differentiable maps, local inverses, and local diffeomorphisms: means total differentiability at every point and continuity of the derivative entries.
A first-order initial value problem is equivalent to its Volterra integral equation: each continuous IVP solution satisfies .
Gronwall's integral inequality with variable and constant coefficients: if for nonnegative continuous and constants , then .
Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous map on a compact metric space is uniformly continuous; its proof uses no choice principle.
For and integrable when , ; for , is integrable: for an integrable vector-valued function on , .
The chain rule for total derivatives: : the derivative of a composition is the composition of the derivatives.
The mean value inequality: if is continuous and differentiable on with , then : a vector curve continuous on a closed interval with derivative norm at most in its interior changes by at most times the interval length.
Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous vector field locally Lipschitz in the state has a unique local IVP solution; any two solutions through the same data agree on their common interval.
Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: every Picard-Lindelöf IVP has a unique maximal solution, and every other solution through the data is its restriction.
Proof technique: Uniform continuity of on the common compact tube controls the difference-quotient remainder; Gronwall controls both the flow difference and its linearized remainder.
Proof
Compactness of and continuity of give a finite constant bounding and a modulus such that for ; this uses [F1] and [F4]. For fixed and sufficiently small with , set . The two Volterra equations, convexity of , and [F7] applied to the line segment between the two state values give . Applying [F3] to the norm inequality from the integral equations yields .
For each fixed , the matrix equation , , with has a unique solution on . View matrices as vectors in with the Frobenius norm and extend continuously by its endpoint values to an open interval containing . The extended linear vector field is locally Lipschitz in the matrix state, so the linear IVP has a unique maximal solution by [F8] and [F9]. Gronwall bounds on every finite subinterval. If its maximal interval ended at a finite time at or before , then would be bounded there, making Cauchy with a finite limit; local existence from that limit extends the solution, a contradiction. Its integral equation is unique by [F3].
Uniform continuity of on implies, with and , that . The line segment remains in by convexity. For , the chain rule [F6] gives , whose norm is at most ; applying [F7] on gives the claimed remainder bound.
Put . Subtract the integral equations for , , and . The result is , where by steps 1.1 and 2.1. Applying [F3] gives . Thus in the total-derivative definition [F1].
If in , step 1.1 gives uniform convergence . Uniform continuity of on then gives uniform convergence . Subtract the two integral equations for and ; [F3], together with the uniform bound on obtained from its integral equation, implies ; equivalence of matrix norms gives the same convergence in operator norm. The derivative is continuous, so the flow is on .
Certified differentiable IVP approximation interface for shooting
Definition
Fix an interval and an open set on which each exact IVP flow exists for all . A certified differentiable IVP evaluator on declares a approximate endpoint map (here means total differentiability with continuous derivative entries) and a stated number . A call at either returns failure or supplies a continuous approximate trajectory , the endpoint and the exact derivative for that numerical map, satisfying
The same bounds every successful call, uniformly in its initial state; no approximate trajectory or error bound is required at a failed call. The declared endpoint map remains on even when some calls fail. The returned derivative is not asserted to equal the derivative of the exact flow. This is an interface contract for a supplied method; it does not assert that any particular integrator satisfies the contract.
Continuous linearized BVP operator and its conditioning
Definition
Let solve a square BVP, with and continuously differentiable on open neighborhoods of the trajectory and endpoint pair. Put , , and . Let
and
The continuous linearized BVP operator is the bounded linear map given by
It is boundedly invertible when it is bijective and its inverse has finite operator norm. That norm is the conditioning constant for the linearized BVP used in the local discretization theorem.
Normalized implicit-midpoint collocation residual for a two-point BVP
Definition
For a -dimensional BVP on , an integer , uniform mesh width , mesh nodes , and node vector , let be the open set of node vectors for which every midpoint pair lies in the vector-field domain and lies in the boundary-map domain. Define by
Use the maximum of the Euclidean block norms for both node and residual vectors. The interior rows are normalized by ; consequently an unscaled increment row has size times its normalized row.
Zeros of the exact multiple-shooting residual are exactly BVP solutions
Statement
Fix a mesh and states . Suppose the unique IVP solution from each segment start exists as a curve on for , and . The exact multiple-shooting residual has rows and . For this fixed tuple, it vanishes exactly when there is a BVP solution with for every ; that solution restricts to the given segment solutions on all mesh intervals.
Facts & Assumptions
Given: The square BVP, mesh, segment starts, and unique segment IVP solutions on all mesh intervals.
Square nonlinear two-point boundary-value problems and endpoint residuals: the multiple-shooting residual consists of segment endpoint mismatch rows and the boundary residual .
Proof
If the residual vanishes, each row gives . Define on each interval by the corresponding segment solution. At every interior mesh point, the left endpoint value equals the next initial state, so the pieces are continuous; the last residual row supplies .
At a mesh point , both one-sided derivatives equal , since each segment solves the same ODE and the joined values agree. Thus the pieces join to a solution on ; the endpoint pair lies in and the last residual row gives its boundary equation, so it is a BVP solution.
Conversely, let be a BVP solution with for every , keeping the given tuple fixed. On each mesh interval its restriction and the given segment IVP solution have initial state , so the assumed uniqueness identifies them. Thus for , and . All residual rows vanish.
Zeros of the exact shooting residual are exactly BVP solutions
Statement
On an open set of initial states, suppose each IVP has a unique solution on that is a curve, and for every . Define the exact shooting residual by . Then if and only if is a BVP solution. Any BVP solution with initial state equals this shot.
Facts & Assumptions
Given: The BVP data and an initial state whose unique IVP solution exists on .
Square nonlinear two-point boundary-value problems and endpoint residuals: a BVP solution is a continuously differentiable IVP curve satisfying , and .
Proof
If , then already solves the IVP with initial state and satisfies by the definition of . It is continuously differentiable and lies in the BVP domain, so [F1] makes it a BVP solution.
Conversely, let be any BVP solution with . It solves the same IVP as ; the assumed uniqueness implies throughout . The boundary equation then gives .
The same uniqueness argument shows that any BVP solution with initial state is exactly this trajectory, proving both the equivalence and the asserted trajectory identity.
Finite-budget implicit-midpoint collocation for a nonlinear BVP
Definition
Fix a uniform mesh and the open nodal domain and normalized residual from Normalized implicit-midpoint collocation residual for a two-point BVP. If and are on the required domains (total differentiability with continuous derivative entries), then is a square map from the open subset into . Given an initial node vector , tolerance , and correction budget , apply Finite-budget Newton for a square vector residual to 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 ; it is not a branch, convergence, or error certificate.
Uniform inverse bound for the sampled midpoint linearized BVP
Statement
Here means each coordinate has continuous total derivatives through order . Let be near an exact solution of a square BVP, and suppose the continuous linearized operator in Continuous linearized BVP operator and its conditioning is boundedly invertible. For uniform meshes with , let and let be the Jacobian of the normalized midpoint residual. There are and such that for every mesh width , is invertible and
where both finite-dimensional norms are the maximum of the Euclidean block norms. The bound is independent of ; this is a local linear inverse result, not a nonlinear convergence theorem.
Facts & Assumptions
Given: The square BVP, data near , , uniform meshes, and bounded invertibility of the continuous operator .
Normalized implicit-midpoint collocation residual for a two-point BVP: has normalized interior midpoint rows and the boundary row ; differentiating its rows gives the stated midpoint Jacobian blocks.
Continuous linearized BVP operator and its conditioning: , and bounded invertibility implies in particular that its kernel is zero.
Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous coefficient matrix defines unique local solutions of the linear IVP .
Gronwall's integral inequality with variable and constant coefficients: a bound implies .
The chain rule for total derivatives: : differentiating a composition gives the product of its total derivatives.
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in : finite-dimensional Euclidean spaces, hence also with an equivalent maximum norm, are complete.
Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: a Picard–Lindelöf IVP has a maximal solution and every other solution through the same data is its restriction.
A first-order initial value problem is equivalent to its Volterra integral equation: a solution of a continuous finite-dimensional IVP on an interval satisfies its Volterra integral equation, including on closed subintervals. Apply this to each column of the fundamental matrix.
For and integrable when , ; for , is integrable: the Euclidean norm of a vector-valued integral over an increasing interval is at most the integral of its norm. Applying this to a continuous matrix integrand acting on each unit vector gives the corresponding operator-norm bound.
Proof
Write and let solve , . Since is continuous and bounded on , extend it continuously by its endpoint values to an open interval containing . Local existence follows from [F3], and the integral equation [F8] gives the Gronwall bound for the maximal solution from [F7]; if it stopped at or before , boundedness of would give a finite endpoint limit from which local existence extends it, a contradiction. Thus exists on . Define . If , then satisfies ; [F2] forces , and then gives . The square matrix is therefore invertible.
For each mesh let . Uniform continuity of and on a compact neighborhood implies . Also . Applying the chain rule [F5] to the rows in [F1], the interior equation is . For small , is invertible by its convergent geometric series; its inverse norm is at most , and the induced transition matrices satisfy for a constant independent of .
Let , the discrete homogeneous transfer from to . By [F8] on each column, the exact fundamental matrix satisfies . The integrand is uniformly continuous, so its average over each cell differs from its midpoint value by a quantity tending uniformly to zero as . Explicitly, put , and for and . Write , , and by step 1.2. By [F9], . Define the normalized midpoint defect by . Adding and subtracting and therefore gives , since and are uniformly continuous on . The transition bound in step 1.2 propagates the increment defects with total bound at most ; hence .
Put . By step 2.1, . Since is invertible, determinant continuity makes invertible for all sufficiently small , and the adjugate formula gives a uniform bound on . For arbitrary forcing blocks , the recurrence in step 1.2 and its transition bound give and , with . The boundary row becomes , so and then every are bounded by uniformly in .
For every right-hand side , step 3.1 constructs a unique solution of the square linear system and gives the asserted uniform operator bound. Therefore is onto and one-to-one, hence invertible, with the stated estimate.
Zeros of the normalized midpoint residual are precisely midpoint collocation solutions
Statement
For any , if and only if
Equivalently, the piecewise-linear interpolant has on each segment a constant slope equal to the vector field at the segment midpoint state and satisfies the endpoint residual.
Facts & Assumptions
Given: The BVP data, uniform mesh, admissible node vector, and normalized residual from Normalized implicit-midpoint collocation residual for a two-point BVP.
Normalized implicit-midpoint collocation residual for a two-point BVP: every interior block is the increment divided by minus the midpoint vector field, and the last block is .
Square nonlinear two-point boundary-value problems and endpoint residuals: the endpoint equation in the BVP is .
Proof
If , each block is zero. For , multiply the normalized row by the positive scalar to get the stated increment equation; the last block gives , the BVP endpoint equation by [F2].
Conversely, if all displayed increment equations and the endpoint equation hold, dividing each increment equation by makes every interior block zero, and the endpoint equation makes the last block zero; by [F2] it is the BVP boundary condition. Thus .
The piecewise-linear interpolant changes by over an interval of width , so its slope is the quotient on the left of each increment equation. This proves the equivalent slope wording without adding another condition.
The multiple-shooting Jacobian is bordered block-bidiagonal
Statement
Fix a mesh , , and an open product domain of segment starts on which and each exact or certified approximate segment endpoint map are . Here means total differentiability with continuous derivative matrix entries. Define by rows for and . Its Jacobian block row has in column , in column , and zero in every other column. Its boundary row has and in columns and and zero elsewhere. When , columns and are distinct.
Facts & Assumptions
Given: The mesh, open product domain, maps , and residual .
The chain rule for total derivatives: : for totally differentiable maps , .
Initial-data sensitivity of an ODE flow on a common compact tube: an exact segment endpoint map is when its solutions remain in a common compact convex tube.
Certified differentiable IVP approximation interface for shooting: a certified approximate segment endpoint map is and supplies its own exact derivative.
Square nonlinear two-point boundary-value problems and endpoint residuals: the exact multiple-shooting rows are the segment endpoint minus next segment start, followed by .
Proof
For an interior row , varying only block changes that row by , varying only block changes it by , and varying any other block leaves it unchanged. These are precisely the stated nonzero and zero blocks.
For the boundary row , the chain rule gives derivatives and with respect to the first and last blocks; all intermediate blocks are absent from its formula, so their derivatives are zero. The differentiability assertions for exact and approximate segment maps follow from [F2] and [F3].
The residual has scalar rows and scalar variables, so the displayed block matrix is square.
Derivative of the nonlinear shooting residual
Statement
Let be a endpoint map (total differentiability with continuous derivative entries) on an open set , and let be on an open neighborhood of . Define . Then is and
This applies to the exact flow endpoint map under Initial-data sensitivity of an ODE flow on a common compact tube and to the approximate endpoint map in Certified differentiable IVP approximation interface for shooting; in the latter case the derivative is exact for the numerical map, not the exact flow.
Facts & Assumptions
Given: , , , and their stated properties.
The chain rule for total derivatives: : for totally differentiable maps , .
The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: the Jacobian matrix represents the total derivative in standard coordinates.
Initial-data sensitivity of an ODE flow on a common compact tube: the exact endpoint map is on its open initial-state domain.
Certified differentiable IVP approximation interface for shooting: the approximate endpoint map is and its supplied derivative is its derivative as a map on initial states.
Proof
Define by . The coordinate product map is totally differentiable and .
The residual is the composition . Applying [F1] at each gives for every , hence the displayed matrix identity.
Since both component maps and their derivatives are continuous, the derivative in step 2.1 varies continuously with ; therefore is . Facts [F3] and [F4] verify the two stated choices of under their respective hypotheses.
Finite-budget multiple shooting for a nonlinear two-point BVP
Definition
Fix a mesh , , and an open product domain of segment starts on which and every certified segment endpoint map are , meaning they are totally differentiable with continuous derivative entries. Inputs are an initial tuple in this domain, a residual tolerance , and a correction budget . Each evaluator supplies an approximate endpoint map and its derivative. Form the computed square residual with rows for and ; its block Jacobian is the matrix in The multiple-shooting Jacobian is bordered block-bidiagonal. For , in this order:
- Evaluate the residual, its Jacobian, and the approximate segment trajectories. If any evaluator fails, return the last valid tuple with status evaluator-failure and no residual certificate.
- If the Euclidean norm of the residual is at most , return the tuple and trajectories with status root-tolerance-met.
- If , return status iteration-budget-exhausted.
- Solve the Newton correction equation with the displayed square Jacobian using Newton correction for a square vector residual. A singular Jacobian returns status singular-jacobian.
- If the proposed tuple is outside the open product domain, return the last tuple with status invalid-trial; otherwise accept it as the next iterate.
The procedure applies the finite-budget Newton checks to the variables. Its residual-tolerance status concerns the approximate map that was evaluated. It does not certify that the segment approximations join, that an exact BVP solution exists, or that the procedure converges from arbitrary starts.
Finite-budget single shooting for a nonlinear two-point BVP
Definition
Let be the open trial-initial-state set. Let be the open domain of the boundary map , where means total differentiability with continuous derivative entries. Inputs are a certified evaluator from Certified differentiable IVP approximation interface for shooting, an initial trial , residual tolerance , and a correction budget . The evaluator may return failure on a queried trial. Every successful response must supply the approximate trajectory, the endpoint and the exact derivative of the declared numerical endpoint map, with the interface's stated uniform trajectory-error bound. Success on every queried trial is not an input assumption.
For , in this order:
- Query the evaluator at . If it fails, return the last accepted trial with status evaluator-failure and no residual certificate. Before evaluating , check ; if this fails or cannot be established, return the last accepted trial with status invalid-endpoint-pair and no residual certificate. On success form and using Derivative of the nonlinear shooting residual. A failure to evaluate these quantities returns evaluator-failure without a residual certificate.
- If , return , its approximate trajectory, and status root-tolerance-met. This status asserts only the displayed residual tolerance.
- If , return the last trial and status iteration-budget-exhausted.
- Call Newton correction for a square vector residual with and . If it reports singular-jacobian, stop with that status. Otherwise let be its returned correction.
- If the proposed trial is outside or its membership cannot be established, return the last accepted trial with status invalid-trial; otherwise accept . Initially the last accepted trial is ; accepting a trial supplies no boundary residual certificate until step 1 succeeds there.
On a sequence of successful evaluations with endpoint pairs in , this has the same residual, singularity, trial-domain and budget checks as Finite-budget Newton for a square vector residual. It makes no global-start, exact-root, or discretization-error claim. The numerical residual is on the open subset of where ; no boundary value is evaluated outside that subset.
Local second-order midpoint collocation error with an algebraic residual budget
Statement
Here means continuously differentiable with continuous second total derivatives, and means the same through third derivatives. Let be on open neighborhoods of an exact solution of the square BVP, and suppose its continuous linearized BVP operator is boundedly invertible. For all sufficiently fine uniform meshes, the normalized midpoint residual has a unique zero in a fixed-radius maximum-norm ball about the sampled vector . Its Jacobian at is invertible with an inverse bound independent of . For every candidate in that ball with , its piecewise-linear interpolant satisfies
where is independent of and the candidate. This is a local branch result only; it asserts no branch selection outside the ball and no global Newton convergence.
Facts & Assumptions
Given: The square BVP, near the solution, , bounded invertibility of the continuous linearized BVP operator, and a uniform mesh.
Normalized implicit-midpoint collocation residual for a two-point BVP: consists of normalized midpoint ODE rows and the boundary row, with maximum Euclidean block norms.
Continuous linearized BVP operator and its conditioning: the continuous linearized operator is ; the theorem assumes it is boundedly invertible.
Uniform inverse bound for the sampled midpoint linearized BVP: at the sampled vector , is invertible with uniformly for small .
A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point: a contraction from a nonempty complete metric space into itself has a unique fixed point.
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in : a closed ball in a finite-dimensional normed Euclidean space is complete.
Multivariable Taylor formula with a Lagrange remainder along a line segment: the scalar Taylor formula with remainder applies to each coordinate of a vector-valued curve or residual block.
Proof
Let . Applying scalar Taylor's formula coordinatewise to the components of the curve on each cell gives and . Since , bounded first derivatives of make each normalized interior residual uniformly. The exact endpoint pair makes the boundary block zero; [F2] names the boundedly invertible continuous linearized operator assumed here, and thus . The Taylor remainder bounds are uniform because the derivatives are bounded on a compact neighborhood of the trajectory.
On a fixed-radius ball about , all midpoint states and endpoint pairs stay in compact subsets of the domains for sufficiently small radius. Bounded second derivatives of and imply a constant , independent of , such that on this ball: every interior row depends on only two node blocks and its nonlinear part is evaluated at their average, while the linear increment term has constant derivative; the boundary row depends only on the two endpoint blocks. The bounds on each row therefore do not grow with the number of mesh cells.
Choose small enough that the closed ball lies in the nodal domain and . Define . The mean-value bound from step 1.2 gives on the ball. Also , so for small enough this is at most ; then maps the ball into itself. It is a contraction on a nonempty complete ball by [F4] and [F5].
The contraction theorem gives a unique fixed point in the ball. Since is invertible, is equivalent to , so this is the unique residual zero there. The fixed-point estimate gives . Further, . For small , ; the geometric-series inverse of shows invertible with inverse norm at most .
For any candidate in the ball, put . Each interior residual block depends only on two node blocks, and the boundary block only on the two endpoint blocks. Apply [F6] to each scalar component of for ; the segment lies in the open nodal domain. The uniform second-derivative bounds from step 1.2, row locality, and fixed give a constant , independent of and , such that with . Since both points lie in the radius- ball, ; reduce initially if needed so . Using [step 3.1], , so . The piecewise-linear interpolant is a convex combination of adjacent nodes, hence . The linear interpolant of differs from by at most on each cell, and by step 3.1. Adding these bounds proves the stated estimate.
Local Newton convergence on the selected midpoint collocation branch
Statement
For each sufficiently fine mesh, let be the local root of the normalized midpoint residual supplied by Local second-order midpoint collocation error with an algebraic residual budget. On a sufficiently small ball about , the exact-Jacobian finite-budget Newton procedure in Finite-budget implicit-midpoint collocation for a nonlinear BVP has a basin in which every attempted update is valid, remains in the ball, and satisfies a quadratic error estimate. The radius may depend on ; a finite budget may stop early, and arbitrary initial node vectors receive no convergence guarantee.
Facts & Assumptions
Given: A sufficiently fine fixed mesh, the local root , the C2 data and conditioning assumptions of the midpoint branch theorem, tolerance , budget , and an initial vector in the local Newton ball.
Local second-order midpoint collocation error with an algebraic residual budget: and is invertible; the theorem defines as continuously differentiable with continuous second total derivatives.
Normalized implicit-midpoint collocation residual for a two-point BVP: is the normalized square collocation residual.
Finite-budget implicit-midpoint collocation for a nonlinear BVP: the procedure applies the finite exact-Jacobian Newton method to on its open nodal domain.
Updated-Jacobian Newton has local quadratic convergence at a simple root: a C2 square map with an invertible derivative at a root and locally Lipschitz Jacobian has a local quadratic Newton basin.
Proof
By [F1], the branch theorem’s convention means continuous second total derivatives. For this fixed mesh, maps the open nodal domain in to the same-dimensional residual space. Since and are , composition with the affine midpoint maps shows that is ; on a closed ball around inside the domain its continuous second derivatives are bounded, so its Jacobian is Lipschitz there.
Fact [F1] gives the zero and invertible derivative required by [F4]. Applying [F4] to this fixed finite-dimensional map yields a positive local radius and quadratic estimate. By [F3] the prescribed algorithm follows those exact Newton updates while the iterates remain in the ball; its finite budget can stop early and imposes no assertion for starts outside the basin.
Local Newton convergence for a simple nonlinear shooting root
Statement
Here means twice continuously differentiable. Let the exact shooting residual be on an open neighborhood of a root , with , invertible, and Lipschitz on a closed ball about . Assume there is an open neighborhood of on which the exact IVP flow is an evaluator satisfying Certified differentiable IVP approximation interface for shooting with , , and . Also assume is on an open neighborhood of , as required by Finite-budget single shooting for a nonlinear two-point BVP. Then there are and such that, for every initial trial , every attempted exact-Jacobian Newton update is defined, remains in this ball, and satisfies
A finite budget may stop before the residual tolerance is met. No arbitrary-start or global-convergence guarantee follows.
Facts & Assumptions
Given: The exact shooting residual, its simple root and local regularity, the exact evaluator, a residual tolerance, a finite update budget, and an initial state in the local ball below.
Certified differentiable IVP approximation interface for shooting: the exact flow is an allowed evaluator with zero trajectory error and endpoint map equal to the exact flow endpoint map.
Derivative of the nonlinear shooting residual: the residual Jacobian is for the exact endpoint map.
Finite-budget single shooting for a nonlinear two-point BVP: with the exact evaluator, the method applies the finite exact-Jacobian Newton steps to and has the stated stopping statuses.
Updated-Jacobian Newton has local quadratic convergence at a simple root: a square map with a simple root and Lipschitz Jacobian has a ball where its exact-Jacobian Newton updates remain valid and satisfy a quadratic error estimate; a finite budget may stop early.
Proof
The residual is a square map from an open subset of to . Intersect its neighborhood with the exact-evaluator neighborhood ; this is still open and contains . The stated root, invertible derivative, and Lipschitz bound give the map hypotheses of [F4] on a closed ball inside that intersection.
The exact evaluator in [F1] makes the computed residual in [F3] equal to , and [F2] supplies its exact Jacobian. Applying [F4] therefore gives a radius and constant for which every attempted update is defined, remains in the ball, and obeys the quadratic estimate. Procedure [F3] can stop earlier on residual tolerance or budget; neither stopping status changes the update conclusion, and [F4] supplies no global-start claim.
Shooting error separates IVP integration and nonlinear residual error
Statement
Let the exact shooting residual have a root whose trajectory is a BVP solution. For some , suppose is on an open neighborhood of (twice continuously differentiable), is invertible, and is -Lipschitz on this ball, where and . Assume a certified evaluator from Certified differentiable IVP approximation interface for shooting succeeds on this ball with uniform trajectory error , and that is -Lipschitz in its terminal-state argument between the exact and approximate endpoints there. For any candidate with computed residual ,
If, in addition, is on an open field domain , and there are an open neighborhood and a compact convex such that for every the IVP has a unique solution on with graph in , and
then the approximate trajectory from differs uniformly from the exact BVP trajectory by at most
The integration and root-residual terms remain separate; the theorem makes no global solver-success claim.
Facts & Assumptions
Given: The BVP, exact shooting root , regularity and inverse bound, radius , certified evaluator with error , terminal Lipschitz constant , candidate and computed residual tolerance , and, when the trajectory estimate is used, the open set , common compact convex tube , field, and state-Lipschitz bound from the Statement.
Square nonlinear two-point boundary-value problems and endpoint residuals: is the exact endpoint residual.
Finite-budget single shooting for a nonlinear two-point BVP: the computed root-tolerance status is only the residual bound for .
Vector Newton remainder under a Lipschitz Jacobian: apply its estimate on the convex ball with its evaluation point and its other point . Since , this gives with .
Gronwall's integral inequality with variable and constant coefficients: a difference bound yields .
Initial-data sensitivity of an ODE flow on a common compact tube: under the common-tube hypotheses in the Statement, exact solutions satisfy their Volterra integral equations.
Proof
Put . The vector remainder estimate [F4] and give with . Since and , the radius condition yields .
The exact and computed residuals have the same first boundary argument. By the stated terminal-state Lipschitz bound and [F2], . The computed residual assumption therefore gives . Combining with step 1.1 proves the initial-state estimate. If the candidate is the algorithm's root-tolerance output, [F3] supplies exactly the needed residual premise; other statuses supply no such premise.
Let . The common-tube hypothesis makes the flows satisfy the Volterra equations by [F6], and the tube's Lipschitz bound gives . Applying [F5] yields for every . The evaluator error [F2] and the triangle inequality add at most , giving the displayed trajectory estimate. The given root trajectory is the exact BVP trajectory.
5 · Examples, counterexamples and false statements
None yet.
Sources
- R. Verfürth, Numerical Methods and Stochastics, Part I: Numerical Methods, Lecture Notes
- T. A. Driscoll and R. J. Braun, Fundamentals of Numerical Computation, Chapter 10
- T. A. Driscoll and R. J. Braun, Fundamentals of Numerical Computation, Chapter10: Nonlinearity and boundary conditions
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, author-source revision2025.01.27, Chapter10, Collocation for linear problems
- E. Hairer and G. Wanner, Solving Ordinary Differential Equations II, Chapter VI: Iterative Methods—Nonlinear Equations