•  
  •  
 

Author Country (or Countries)

P. R. China

Abstract

We study the information complexity of the numerical integration on the H¨older-Nikolskii classes MHrp in the randomized setting. We adopt classical Monte Carlo method to approximate this integration and derive the corresponding convergence rate. Comparing our results with the previous known results in the deterministic setting, we see that the randomized algorithms have faster convergence rates.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/100137

Share

COinS