Journal of Approximation Theory
Information-based complexity
Stochastic properties of quadrature formulas
Numerische Mathematik
Randomization for continuous problems
Journal of Complexity
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
Quantum summation with an application to integration
Journal of Complexity
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
Journal of Approximation Theory
Hi-index | 0.00 |
The exact order of deterministic, stochastic and average error bounds of multidimensional quadrature formulas for anisotropic Sobolev class Wpr(Id), Nikolskii class Wpr(Id) and their periodic analogue is obtained. It is proved that if p 1, then the stochastic and average error bounds are essentially smaller than the deterministic error bounds.Nonlinear methods, adaptive methods, or even methods with varying cardinality are not significantly better than the simplest linear method s(f) = Σi=1n cif(ai).