DeepAI AI Chat
Log In Sign Up

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

by   Tomasz Bochacik, et al.

We deal with optimal approximation of solutions of ODEs under local Lipschitz condition and inexact discrete information about the right-hand side functions. We show that the randomized two-stage Runge-Kutta scheme is the optimal method among all randomized algorithms based on standard noisy information. We perform numerical experiments that confirm our theoretical findings. Moreover, for the optimal algorithm we rigorously investigate properties of regions of absolute stability.


page 1

page 2

page 3

page 4


A note on the probabilistic stability of randomized Taylor schemes

We study the stability of randomized Taylor schemes for ODEs. We conside...

On the randomized Euler schemes for ODEs under inexact information

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

Randomized Kaczmarz for Rank Aggregation from Pairwise Comparisons

We revisit the problem of inferring the overall ranking among entities i...

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

We show that the probability of the exceptional set decays exponentially...

Randomized Milstein algorithm for approximation of solutions of jump-diffusion SDEs

We investigate the error of the randomized Milstein algorithm for solvin...

On the power of standard information for tractability for L_2-approximation in the randomized setting

We study approximation of multivariate functions from a separable Hilber...