2000 character limit reached
On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes (2202.01683v1)
Published 3 Feb 2022 in math.NA and cs.NA
Abstract: 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.
Collections
Sign up for free to add this paper to one or more collections.
