|
|
 |
| |
|
|
|
Complexity of the Integration on Hölder-Nikolskii Classes with Mixed Smoothness |
|
|
|
PP: 351-356 |
|
|
|
doi:10.18576/amis/100137
|
|
|
|
Author(s) |
|
|
|
Duan Liqin,
Ye Peixin,
|
|
|
|
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. |
|
|
|
|
|
|
|
