A quantitative probabilistic investigation into the accumulation of rounding errors in numerical ODE solution

From MaRDI portal
Publication:971612

DOI10.1016/J.CAMWA.2009.01.020zbMATH Open1186.65096arXivmath/0512364OpenAlexW1978062485MaRDI QIDQ971612FDOQ971612


Authors: Sebastian Mosbach, Amanda G. Turner Edit this on Wikidata


Publication date: 16 May 2010

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Abstract: We examine numerical rounding errors of some deterministic solvers for systems of ordinary differential equations (ODEs). We show that the accumulation of rounding errors results in a solution that is inherently random and we obtain the theoretical distribution of the trajectory as a function of time, the step size and the numerical precision of the computer. We consider, in particular, systems which amplify the effect of the rounding errors so that over long time periods the solutions exhibit divergent behaviour. By performing multiple repetitions with different values of the time step size, we observe numerically the random distributions predicted theoretically. We mainly focus on the explicit Euler and RK4 methods but also briefly consider more complex algorithms such as the implicit solvers VODE and RADAU5.


Full work available at URL: https://arxiv.org/abs/math/0512364




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: A quantitative probabilistic investigation into the accumulation of rounding errors in numerical ODE solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971612)