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.
Each SDC sweep raises the order up to the collocation order
Statement
Fix collocation nodes and a nonnegative integer independent of . Use the explicit-left-Euler SDC sweep in Finite explicit-left-Euler spectral deferred-correction sweep with constant predictor and form the candidate endpoint from , after completed sweeps. Assume each coordinate of has continuous partial derivatives through total order on an open neighborhood of a common compact tube ; assume is state-Lipschitz with constant and bounded by on , which contains the exact path, all iterates, and the comparison segments. Also assume the exact-path integrand has the derivative bound required by M-node collocation has local defect order M. At each mesh time , let be a set of starting states containing the exact and numerical grid states used in the global-error comparison. For every , assume the constant predictor belongs to a nonempty closed product ball used in Contraction and residual error bound for the SDC sweep, and each inner stage map and sweep preserves . Assume the contraction theorem holds uniformly with and . For the global-order assertion, initialize the numerical grid solution exactly, . For fixed , the endpoint map has exact-start defect and global order on any fixed interval, provided all grid states stay in . The claim is local-step and fixed-; it asserts no uniform constants as or grows.
Facts & Assumptions
Given: A fixed uniform mesh, an IVP, its collocation stages and endpoint, the constant SDC predictor, and the uniform tube and contraction hypotheses.
Collocation tableau from distinct quadrature nodes: and the collocation endpoint is .
Finite explicit-left-Euler spectral deferred-correction sweep: each iterate satisfies , and its candidate endpoint is .
Contraction and residual error bound for the SDC sweep: there is a unique collocation stage vector ; when , the iterates converge to it and .
M-node collocation has local defect order M: the exact-start collocation defect is uniformly .
Finite geometric error bound from a one-step recurrence: if and uniformly, then the maximum grid error is on a fixed interval.
The numerical grid solution starts at . The field satisfies and on the common invariant tube. The fixed nodes make finite and independent of .
Proof
The stage points of the contraction limit lie in the compact set , since all iterates do and they converge by [F3]. The constant predictor gives by [F1] and the row-sum norm. Since , [F3] gives for fixed (with the same bound when ).
To bound dependence on the input, let for two starts , and put . Subtracting the stage equations [F2] and using the row-sum norm gives . Since and , and induction for the fixed number gives with independent of .
Let be the open neighborhood of on which the stated smoothness holds, within the IVP domain. There is such that the closed -neighborhood of lies in : cover by finitely many balls whose concentric doubled balls lie in , and take smaller than the minimum of their radii. The set is compact, so all partial derivatives through order are bounded there. In particular, since , the state Jacobian has a uniform bound ; applying the scalar mean-value estimate along state segments gives a state Lipschitz bound on each convex cylinder contained in . For an exact start , the fixed cylinder is compact, convex, and contained in , because its points have distance at most from . These bounds are uniform in and independent of .
For an exact start, [F1] and step 1.1 give . The exact path has speed at most , hence . Thus for and , both paths, the stages, and their comparison segments lie in . Any two collocation solutions with stage points in satisfy by subtracting [F1]. Taking proves uniqueness there; existence follows from [F3] and the containment of . Together with the assumed exact-path derivative bound, step 1.3 now verifies every tube, smoothness, and branch hypothesis of [F4], with uniform constants.
Applying the endpoint formula [F2] to the two stage vectors gives for .
The endpoint formula in [F2], the state Lipschitz bound, and step 1.1 give a difference from the exact collocation endpoint of at most . Adding the exact collocation defect [F4], whose hypotheses were checked in step 2.1, gives an exact-start defect , since and .
Let . Both starts lie in by the Statement. Insert and subtract the exact-start one-step output to obtain, using step 2.2 and step 3.1, with and a uniform . The initial error is , so [F5] gives global order .
Depends on
Used by
Dependency tree · two levels
37 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
- Mathew F. Causley and David C. Seal, On the convergence of spectral deferred correction methods, Communications in Applied Mathematics and Computational Science 14 (2019), §3, Theorem 3.1 (standard reference, not scraped)
- Ernst Hairer, Syvert P. Nørsett, and Gerhard Wanner, Solving Ordinary Differential Equations I, 2nd ed., Chapter II §II.7 (standard reference, not scraped)