An Efficient Algorithm to Simulate a Brownian Motion Over Irregular Domains

An Efficient Algorithm to Simulate a Brownian Motion Over Irregular Domains

Year:    2010

Communications in Computational Physics, Vol. 8 (2010), Iss. 4 : pp. 901–916

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.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/cicp.240209.031209a

Communications in Computational Physics, Vol. 8 (2010), Iss. 4 : pp. 901–916

Published online:    2010-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    16

Keywords: