Metraipolis › archive › dc_8d65cdb72641
Controlled B-series, controlled Runge-Kutta methods and controlled rough differential equations — arXiv:2609.14196
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14196
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:22:28.679Z
- SHA-256 of the archived text
887b1e74f86c7edc08def17e2d64e4927db08b19792eb279a14e242ad2332aec- Stable URL of this page
https://metraipolis.com/documento/dc_8d65cdb72641
How to cite
Controlled B-series, controlled Runge-Kutta methods and controlled rough differential equations — arXiv:2609.14196 — arXiv (en), https://arxiv.org/abs/2609.14196 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8d65cdb72641 (Metraipolis archive dc_8d65cdb72641, sha256 887b1e74f86c7edc08def17e2d64e4927db08b19792eb279a14e242ad2332aec)
BibTeX
@misc{dc8d65cdb72641,
title = {Controlled B-series, controlled Runge-Kutta methods and controlled rough differential equations — arXiv:2609.14196},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14196},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8d65cdb72641; sha256 887b1e74f86c7edc08def17e2d64e4927db08b19792eb279a14e242ad2332aec},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14196. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop controlled B-series and controlled Runge-Kutta methods as extensions of classical B-series and Runge-Kutta theory to controlled-driven rough differential equations. The driving signal is a path controlled by an underlying $\alpha$-Hölder step-$2$ rough path, with $\alpha\in(1/3,1/2]$, as arises when the output of one rough system drives another. Controlled B-series retain the classical rooted-tree and elementary-differential structure, while incorporating driver-dependent coefficients defined recursively through controlled rough integration. We establish finite-order expansions of the exact solution and its controlled Runge-Kutta approximation, and derive corresponding tree-based order conditions. Under suitable smoothness, solvability, stability, and boundedness assumptions, matching through tree order $p$ yields local error $O(|t-s|^{(p+1)\alpha})$ and global error $O(h^{(p+1)\alpha-1})$, provided $(p+1)\alpha>1$. The standard rough differential equation formulation is recovered when the controlled driver is the reference path itself, and the classical time-driven case recovers the usual B-series and Runge-Kutta methods. We further construct a simplified method using only increments of the controlled driver. Segmentwise canonical lifting of its piecewise linear interpolation gives explicit tree coefficients and reduces the third-order conditions to the classical ones. Assuming a Wong-Zakai solution-approximation rate $r_0>0$, the simplified method has global error $O(h^{\min\{r_0,(p+1)\alpha-1\}})$. Numerical experiments with fractional Brownian controlled drivers illustrate the resulting convergence behaviour.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.14196 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:06.303Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).