Home Mathematics 2. An adaptive random bit multilevel algorithm for SDEs
Chapter
Licensed
Unlicensed Requires Authentication

2. An adaptive random bit multilevel algorithm for SDEs

  • , , and
Become an author with De Gruyter Brill

Abstract

We study the approximation of expectations E(f (X)) for solutions X of stochastic differential equations and functionals f on the path space by means of Monte Carlo algorithms that only use random bits instead of random numbers. We construct an adaptive random bit multilevel algorithm, which is based on the Euler scheme, the Lévy-Ciesielski representation of the Brownian motion, and asymptotically optimal random bit approximations of the standard normal distribution. We numerically compare this algorithm with the adaptive classical multilevel Euler algorithm for a geometric Brownian motion, an Ornstein-Uhlenbeck process, and a Cox-Ingersoll-Ross process.

Abstract

We study the approximation of expectations E(f (X)) for solutions X of stochastic differential equations and functionals f on the path space by means of Monte Carlo algorithms that only use random bits instead of random numbers. We construct an adaptive random bit multilevel algorithm, which is based on the Euler scheme, the Lévy-Ciesielski representation of the Brownian motion, and asymptotically optimal random bit approximations of the standard normal distribution. We numerically compare this algorithm with the adaptive classical multilevel Euler algorithm for a geometric Brownian motion, an Ornstein-Uhlenbeck process, and a Cox-Ingersoll-Ross process.

Downloaded on 30.3.2026 from https://www.degruyterbrill.com/document/doi/10.1515/9783110635461-002/html
Scroll to top button