An efficient algorithm to simulate a Brownian motion over irregular domains

S. Zein, A. Lejay, M. Deaconu

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

6 Citas (Scopus)

Resumen

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.

Idioma originalEnglish
Páginas (desde-hasta)901-916
Número de páginas16
PublicaciónCommunications in Computational Physics
Volumen8
N.º4
DOI
EstadoPublished - oct. 2010
Publicado de forma externa

ASJC Scopus Subject Areas

  • Physics and Astronomy (miscellaneous)

Huella

Profundice en los temas de investigación de 'An efficient algorithm to simulate a Brownian motion over irregular domains'. En conjunto forman una huella única.

Citar esto

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