Geodesic
Study of weighted Monte Carlo algorithms with branching
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 3, pp. 441-452 
I. N. Medvedev; G. A. Mikhailov. Study of weighted Monte Carlo algorithms with branching. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 3, pp. 441-452. http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_3_a4/
@article{ZVMMF_2009_49_3_a4,
     author = {I. N. Medvedev and G. A. Mikhailov},
     title = {Study of weighted {Monte} {Carlo} algorithms with branching},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {441--452},
     year = {2009},
     volume = {49},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_3_a4/}
}
TY  - JOUR
AU  - I. N. Medvedev
AU  - G. A. Mikhailov
TI  - Study of weighted Monte Carlo algorithms with branching
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2009
SP  - 441
EP  - 452
VL  - 49
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_3_a4/
LA  - ru
ID  - ZVMMF_2009_49_3_a4
ER  - 
%0 Journal Article
%A I. N. Medvedev
%A G. A. Mikhailov
%T Study of weighted Monte Carlo algorithms with branching
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2009
%P 441-452
%V 49
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_3_a4/
%G ru
%F ZVMMF_2009_49_3_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

Various weighted algorithms for numerical statistical simulation are formulated and studied. The trajectory of an algorithm branches when the current weighting factor exceeds unity. As a result, the weight of an individual branch does not exceed unity and the variance of the estimate for the computed functional is finite. The unbiasedness and finiteness of the variance of estimates are analyzed using the recurrence “partial” averaging method formulated in this study. The estimation of the particle reproduction factor and solutions to the Helmholtz equation are considered as applications. The comparative complexity of the algorithms is examined using a test problem. The variances of weighted algorithms with branching as applied to integral equations with power nonlinearity are analyzed.

[1] Mikhailov G. A., Optimizatsiya vesovykh metodov Monte-Karlo, Nauka, M., 1987 | MR

[2] Mikhailov G A., Voitishek A. B., Chislennoe statisticheskoe modelirovanie. Metody Monte-Karlo, Izdat. tsentr “Akademiya”, M., 2006

[3] Marchuk G. I., Mikhailov G. A., Nazaraliev M. A. i dr., Metod Monte-Karlo v atmosfernoi optike, Nauka, Novosibirsk, 1976 | Zbl

[4] Mikhailov G. A., New Monte Carlo methods with estimating derivatives, VSP, Utrecht, 1995 | MR | Zbl

[5] Ermakov S. M., “Ob analoge skhemy Neimana–Ulama v nelineinom sluchae”, Zh. vychisl. matem. i matem. fiz., 13:3 (1973), 564–573 | MR | Zbl

[6] Mikhailov G. A., Vesovye metody Monte-Karlo, SO RAN, Novosibirsk, 2000 | MR

[7] Ermakov S. M., Mikhailov G. A., Statisticheskoe modelirovanie, Nauka, M., 1982 | MR

[8] Sizova A. F., “O dispersii otsenki po stolknoveniyam dlya resheniya nelineinykh zadach metodom Monte-Karlo”, Vestn. Leningradskogo un-ta, 1976, no. 1, 155–157 | MR

[9] Halton J. H., “A retrospective and prospective survey of the Monte Carlo methods”, SIAM Rev., 12 (1970), 1–63 | DOI | MR | Zbl