Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Judicious use of interval arithmetic, combined with careful pen and paper estimates, leads to effective strategies for computer assisted analysis of nonlinear operator equations. The method of radii polynomials is an efficient tool for bounding the smallest and largest neighborhoods on which a Newton-like operator associated with a nonlinear equation is a contraction mapping. The method has been used to study solutions of ordinary, partial, and delay differential equations such as equilibria, periodic orbits, solutions of initial value problems, heteroclinic and homoclinic connecting orbits in the <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C Superscript bold k"> <mml:semantics> <mml:msup> <mml:mi>C</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="bold">k</mml:mi> </mml:mrow> </mml:mrow> </mml:msup> <mml:annotation encoding="application/x-tex">C^{\mathbf {k}}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> category of functions. In the present work we adapt the method of radii polynomials to the analytic category. For ease of exposition we focus on studying periodic solutions in Cartesian products of infinite sequence spaces. We derive the radii polynomials for some specific application problems and give a number of computer assisted proofs in the analytic framework.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it