科研之友
微信
新浪微博
Facebook
分享链接
摘要
We study a Monte Carlo algorithm that is based on a specific (randomly shifted and dilated) lattice point set. The main result of this paper is that the mean squared error for a given compactly supported, square-integrable function is bounded by n(-1/2) times the L-2-norm of the Fourier transform outside a region around the origin, where n is the expected number of function evaluations. As corollaries we obtain the optimal order of convergence for functions from the Sobolev spaces H-p(s) with isotropic, anisotropic, or mixed smoothness with given compact support for all values of the parameters. If the region of integration is the unit cube, we obtain the same optimal orders for functions without boundary conditions. This proves, in particular, that the optimal order of convergence in the latter case is n(-s-1/2) for p >= 2, which is, in contrast to the case of deterministic algorithms, independent of the dimension. This shows that Monte Carlo algorithms can improve the order by more than n(-1/2) for a whole class of natural function spaces. Note that a similar result (for a different class) was obtained by Heinrich, Hickernell, and Yue, [Math. Comp., 73 (2004), pp. 259-277].
- 出版日期2017
