An Efficient Algorithm to Simulate a Brownian Motion Over Irregular Domains - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Communications in Computational Physics Année : 2010

An Efficient Algorithm to Simulate a Brownian Motion Over Irregular Domains

Résumé

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.
Fichier principal
Vignette du fichier
zein_lejay_deaconu_cicp_2010.pdf (120.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00444056 , version 1 (05-01-2010)

Identifiants

Citer

Samih Zein, Antoine Lejay, Madalina Deaconu. An Efficient Algorithm to Simulate a Brownian Motion Over Irregular Domains. Communications in Computational Physics, 2010, 8 (4), pp.901-916. ⟨10.4208/cicp.240209.031209a⟩. ⟨inria-00444056⟩
360 Consultations
4165 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More