A random walk on rectangles algorithm (Q2433258): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11009-006-7292-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019720802 / rank | |||
Normal rank | |||
Revision as of 18:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A random walk on rectangles algorithm |
scientific article |
Statements
A random walk on rectangles algorithm (English)
0 references
27 October 2006
0 references
The authors introduce a new algorithm that is designed to simulate the first exit time and first exit position from a rectangle (or a parallelepiped or polygonal domain) for a Brownian motion that starts at any point inside. This method provides an approximative solution to some nonrandom Dirichlet problems for linear second order PDEs in any dimension. It represents an analogous method to the method of the random walk on spheres (WOS) and can be adapted to treat Neumann boundary conditions or Brownian motion with a constant drift. Some numerical tests and discussions are presented as well.
0 references
Monte Carlo method
0 references
Laplace operator
0 references
random walk on spheres/squares/rectangles
0 references
Green functions
0 references
Dirichlet-Neumann problem
0 references
numerical algorithm
0 references
