论文信息 - Monte Carlo integration with small random bits

Monte Carlo integration with small random bits

Motivated by the recent progress on quantum integration, we study restricted Monte Carlo integration for anisotropic Hölder-Nikolskii classes. The results show that with c · log2 n random bits we have the same optimal order for the n-th minimal Monte Carlo integration error as with arbitrary random numbers.

[1] M. Nikolskii,et al. Approximation of Functions of Several Variables and Embedding Theorems , 1971 .

[2] Arthur O. Pittenger,et al. An Introduction to Quantum Computing Algorithms , 2000 .

[3] Stefan Heinrich. Quantum Summation with an Application to Integration , 2002, J. Complex..

[4] Erich Novak. Quantum Complexity of Integration , 2001, J. Complex..

[5] Stefan Heinrich,et al. Quantum integration in Sobolev classes , 2001, J. Complex..

[6] H. Woxniakowski. Information-Based Complexity , 1988 .

[7] Ye Peixin,et al. Computational complexity of the integration problem for anisotropic classes , 2005 .

[8] S. Nikol,et al. Approximation of Functions of Several Variables and Imbedding Theorems , 1975 .

[9] Wolfgang Dahmen,et al. Multidimensional Spline Approximation , 1980 .

[10] Erich Novak,et al. How Many Random Bits Do We Need for Monte Carlo Integration , 2004 .