Eingeschränkte Monte Carlo-Verfahren zur Numerischen Integration-Reference-Cited by-同舟云学术

Eingeschränkte Monte Carlo-Verfahren zur Numerischen Integration

Published:1985 Issue: Volume: Page:269-282
ISSN:
Container-title:Mathematical Statistics and Applications
language:
Short-container-title:

Author:

Novak Erich

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-009-5438-0_19.pdf

Reference14 articles.

1. Bahvalov, N.S.[1]: Über naherungsweise Berechnung von Integra- len (Russisch). Vestnik MGV, Ser. Math. Mech. Astron. Phys. Chem., 4 (1959), 3 – 18

2. Besov, O.V. [1]: Intercellular averages and an error estimate for cubature formulas in Sobolev spaces and their generalizations. Proc. of the Steklov Inst, of Math., 1980. Issue 1, 45 – 60

3. Besov, O. V.[2]: Error estimates for cubature formulas in terms of smoothness of functions. Proc. of the Steklov Inst, of Math.,1981. Issue 4, 11 – 23.

4. Coveyou, R.R.[1]: Random number generation is too important to be left to chance. Studies in Applied Mathematics, (1969), 70–111 SIAM 1969

5. Ermakow, S. M., Zolotukhin, V. G.[1]: Polynomial approximations and the Monte Carlo method. Theory Prob. and Appl., 5. (1960), 428 – 431

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms;Springer Proceedings in Mathematics & Statistics;2022

2. On the Power of Restricted Monte Carlo Algorithms;2018 MATRIX Annals;2020

3. Random Bit Quadrature and Approximation of Distributions on Hilbert Spaces;Foundations of Computational Mathematics;2018-03-21

4. How Many Random Bits Do We Need for Monte Carlo Integration?;Monte Carlo and Quasi-Monte Carlo Methods 2002;2004