The simplest random walks for the Dirichlet problem

被引:0
|
作者
Milstein, GN
Tretyakov, MV
机构
[1] Ural State Univ, Dept Math, Ekaterinburg 620083, Russia
[2] Russian Acad Sci, Inst Math & Mech, Ekaterinburg 620219, Russia
关键词
Dirichlet problem for parabolic and elliptic equations; probabilistic representations; weak approximation of solutions of stochastic differential equations; Markov chains; random walks;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The Dirichlet problem for both parabolic and elliptic equations is considered. A solution of the corresponding characteristic system of stochastic differential equations is approximated in the weak sense by a Markov chain. If a state of the chain comes close to the boundary of the domain in which the problem is considered, then in the next step the chain either stops on the boundary or goes inside the domain with some probability due to an interpolation law. An approximate solution of the Dirichlet problem has the form of expectation of a functional of the chain trajectory. This makes it possible to use the Monte Carlo technique. The proposed methods are the simplest ones because they are based on the weak Euler approximation and linear interpolation. Convergence theorems, which give accuracy orders of the methods, are proved. Results of some numerical tests are presented.
引用
收藏
页码:53 / 68
页数:16
相关论文
共 50 条