Using Machine Learning to Design Time Step Size Controllers for Stable Time Integrators

Abstract We present a new method for developing time step controllers based on a technique from the field of machine learning. This method is applicable to stable time integrators that have an embedded scheme, i.e., that provide a local error estimate similar to Runge–Kutta pairs. To design good time step size controllers using these error estimates, we propose to use Bayesian optimization. In particular, we design a novel objective function that captures important properties such as tolerance convergence and computational stability. We apply our new approach to several modified Patankar–Runge–Kutta (MPRK) schemes and a Rosenbrock-type scheme, equipping them with controllers based on digital signal processing which extend classical PI and PID controllers. We demonstrate that the optimization process yields controllers that are at least as good as the best controllers chosen from a wide range of suggestions available for classical explicit and implicit time integration methods by providing work-precision diagrams for a variety of ordinary and partial differential equations.

Authors

Publication Details

Journal
Journal of Scientific Computing
Published
2026-10-08
DOI
https://doi.org/10.1007/s10915-026-03496-1
Primary Topic
Numerical methods for differential equations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Using Machine Learning to Design Time Step Size Controllers for Stable Time Integrators

Thomas Izgin, Hendrik Ranocha
Journal of Scientific Computing
Numerical methods for differential equations
article

Using Machine Learning to Design Time Step Size Controllers for Stable Time Integrators

Thomas Izgin, Hendrik Ranocha
article en

Abstract

Abstract We present a new method for developing time step controllers based on a technique from the field of machine learning. This method is applicable to stable time integrators that have an embedded scheme, i.e., that provide a local error estimate similar to Runge–Kutta pairs. To design good time step size controllers using these error estimates, we propose to use Bayesian optimization. In particular, we design a novel objective function that captures important properties such as tolerance convergence and computational stability. We apply our new approach to several modified Patankar–Runge–Kutta (MPRK) schemes and a Rosenbrock-type scheme, equipping them with controllers based on digital signal processing which extend classical PI and PID controllers. We demonstrate that the optimization process yields controllers that are at least as good as the best controllers chosen from a wide range of suggestions available for classical explicit and implicit time integration methods by providing work-precision diagrams for a variety of ordinary and partial differential equations.

Journal of Scientific ComputingVol. 109(3)
Openalex Percentile: Top 11%
Numerical methods for differential equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Using Machine Learning to Design Time Step Size Controllers for Stable Time Integrators — Thomas Izgin, Hendrik Ranocha · Journal of Scientific Computing (2026) | TGRS Research Map | TGRS