DeepAI AI Chat
Log In Sign Up

On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes

by   Tomasz Bochacik, et al.

We show that the probability of the exceptional set decays exponentially for a broad class of randomized algorithms approximating solutions of ODEs, admitting a certain error decomposition. This class includes randomized explicit and implicit Euler schemes, and the randomized two-stage Runge-Kutta scheme (under inexact information). We design a confidence interval for the exact solution of an IVP and perform numerical experiments to illustrate the theoretical results.


page 1

page 2

page 3

page 4


On the randomized Euler schemes for ODEs under inexact information

We analyse errors of randomized explicit and implicit Euler schemes for ...

Approximating viscosity solutions of the Euler system

Applying the concept of S-convergence, based on averaging in the spirit ...

Error analysis of a backward Euler positive preserving stabilized scheme for a Chemotaxis system

For a Keller-Segel model for chemotaxis in two spatial dimensions we con...

Randomized Runge-Kutta method – stability and convergence under inexact information

We deal with optimal approximation of solutions of ODEs under local Lips...

A randomized operator splitting scheme inspired by stochastic optimization methods

In this paper, we combine the operator splitting methodology for abstrac...

Asymptotic properties of a class of linearly implicit schemes for weakly compressible Euler equations

In this paper we derive and analyse a class of linearly implicit schemes...

A note about Euler's inequality and automated reasoning with dynamic geometry

Using implicit loci in GeoGebra Euler's R≥ 2r inequality can be investig...