Addendum to a paper on the Monte Carlo method
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 6, pp. 991-992
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{ZVMMF_2001_41_6_a13,
author = {S. M. Ermakov},
title = {Addendum to a paper on the {Monte} {Carlo} method},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {991--992},
year = {2001},
volume = {41},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_6_a13/}
}
S. M. Ermakov. Addendum to a paper on the Monte Carlo method. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 41 (2001) no. 6, pp. 991-992. http://geodesic.mathdoc.fr/item/ZVMMF_2001_41_6_a13/
[1] Danilov D. L., Ermakov S. M., “O sravnitelnoi trudoemkosti metoda Monte-Karlo dlya resheniya sistem lineinykh algebraicheskikh uravnenii”, Zh. vychisl. matem. i matem. fiz., 35:5 (1995), 661–676 | MR
[2] Ermakov S. M., Metod Monte Karlo i smezhnye voprosy, Nauka, M., 1975 | MR | Zbl
[3] Danilov D. L., Ermakov S. M., “Asimptoticheskaya slozhnost otsenki po stolknoveniyam dlya resheniya lineinykh sistem”, Zh. vychisl. matem. i matem. fiz., 37:5 (1997), 515–523 | MR
[4] Danilov D. L., Ermakov S. M., Halton J. H., “Asymptotic complexity of Monte Carlo methods for solving linear systems”, J. Statistical Planning and Inference, 2000, no. 85, 5–18 | DOI | MR | Zbl