Skip to content
DraconiticResearch
Search Sources API
186,123 studies31 sourcesUpdated 51 min ago
PreprintarXiv licencearXiv

The specular ellipse method for scalar ordinary differential equations: exactness and accuracy up to fourth order

Abstract

This paper introduces a family of one-step implicit methods for solving scalar ordinary differential equations. At each step, the update uses a scaled angular mean of two vector-field evaluations, and the positive scale may vary from step to step. The leading terms of the local truncation error can be expressed in terms of the derivative of the signed curvature of the scaled solution graph. We prove that the proposed method reproduces the exact solution at the mesh points when the solution graph has constant signed curvature under a fixed positive scaling and each implicit update is unique. When this special geometric condition is not satisfied, we establish second-order consistency and convergence for positive scale sequences satisfying suitable uniform conditions. Furthermore, third- and fourth-order consistency and convergence can be achieved by choosing the scale to cancel the relevant curvature terms in the local truncation error. Using only the given problem data, we classify when these improvements are possible and determine the corresponding scale choices. An example shows that the proposed fourth-order method can yield smaller errors than the classical fourth-order Runge--Kutta method at the same step size.

Related

  1. Existence and multiplicity results for third-order ordinary differential equations with derivative dependence subject to the Riemann–Stieltjes integral boundary conditions
    Du Yue, Cui Yujun
    Demonstratio MathematicaPeer-reviewedCC BYFull textGeneral mathematicsDOAJ
  2. Rational linear forms of linearizable ordinary differential equations
    Dmitry Lyakhov
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryStatistical & nonlinear physicsarXiv
  3. A Kac-Moody root system and linear ordinary differential equations
    Toshio Oshima
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Cross-ratios and first order ordinary differential equations
    Oumar Wone
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  5. A Sensitivity-based Framework for Calibrating Coupled Ordinary Differential Equations under Model Discrepancy
    Mitchel J. Colebank, William Consagra
    arXivPreprintCC BY-NC-SA 4.0Full textOptimisation & controlStatisticsarXiv
BibTeX
@misc{jung2026specular,
  title = {{The specular ellipse method for scalar ordinary differential equations: exactness and accuracy up to fourth order}},
  author = {Kiyuob Jung},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.30280},
  eprint = {2608.30280},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.30280},
}
RIS
TY  - UNPB
TI  - The specular ellipse method for scalar ordinary differential equations: exactness and accuracy up to fourth order
AU  - Kiyuob Jung
PY  - 2026
DA  - 2026/08/31
PB  - arXiv
DO  - 10.48550/arxiv.2608.30280
UR  - https://arxiv.org/abs/2608.30280
AB  - This paper introduces a family of one-step implicit methods for solving scalar ordinary differential equations. At each step, the update uses a scaled angular mean of two vector-field evaluations, and the positive scale may vary from step to step. The leading terms of the local truncation error can be expressed in terms of the derivative of the signed curvature of the scaled solution graph. We prove that the proposed method reproduces the exact solution at the mesh points when the solution graph has constant signed curvature under a fixed positive scaling and each implicit update is unique. When this special geometric condition is not satisfied, we establish second-order consistency and convergence for positive scale sequences satisfying suitable uniform conditions. Furthermore, third- and fourth-order consistency and convergence can be achieved by choosing the scale to cancel the relevant curvature terms in the local truncation error. Using only the given problem data, we classify when these improvements are possible and determine the corresponding scale choices. An example shows that the proposed fourth-order method can yield smaller errors than the classical fourth-order Runge--Kutta method at the same step size.
ER  -