An efficient algorithm to simulate a Brownian motion over irregular domains

5Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we present an algorithm to simulate a Brownian motion by coupling two numerical schemes: the Euler scheme with the random walk on the hyper-rectangles. This coupling algorithm has the advantage to be able to compute the exit time and the exit position of a Brownian motion from an irregular bounded domain (with corners at the boundary), and being of order one with respect to the time step of the Euler scheme. The efficiency of the algorithm is studied through some numerical examples by comparing the analytical solution with the Monte Carlo solution of some Poisson problems. The Monte Carlo solution of these PDEs requires simulating Brownian motions of different types (natural, reflected or drifted) over an irregular domain. © 2010 Global-Science Press.

Cite

CITATION STYLE

APA

Zein, S., Lejay, A., & Deaconu, M. (2010). An efficient algorithm to simulate a Brownian motion over irregular domains. Communications in Computational Physics, 8(4), 901–916. https://doi.org/10.4208/cicp.240209.031209a

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free