|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2009, Volume 49, Number 3, Pages 441–452
(Mi zvmmf21)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Study of weighted Monte Carlo algorithms with branching
I. N. Medvedev, G. A. Mikhailov Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090, Russia
Abstract:
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.
Key words:
Monte Carlo method, variance of weighted estimates, branching trajectory, complexity reduction, numerical solution to the Helmholtz equation, integral equations with power singularity.
Received: 23.05.2008
Citation:
I. N. Medvedev, G. A. Mikhailov, “Study of weighted Monte Carlo algorithms with branching”, Zh. Vychisl. Mat. Mat. Fiz., 49:3 (2009), 441–452; Comput. Math. Math. Phys., 49:3 (2009), 428–438
Linking options:
https://www.mathnet.ru/eng/zvmmf21 https://www.mathnet.ru/eng/zvmmf/v49/i3/p441
|
Statistics & downloads: |
Abstract page: | 568 | Full-text PDF : | 169 | References: | 55 | First page: | 7 |
|