Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
A constructive approach to strong tractability using Quasi-Monte Carlo algorithms
Journal of Complexity
Strong tractability of multivariate integration using quasi-Monte Carlo algorithms
Mathematics of Computation
Some open problems concerning the star-discrepancy
Journal of Complexity
Bounds for the weighted Lp discrepancy and tractability of integration
Journal of Complexity
Finite-order weights imply tractability of multivariate integration
Journal of Complexity
Covering numbers, vapnik-červonenkis classes and bounds for the star-discrepancy
Journal of Complexity
Journal of Complexity
Good Lattice Rules in Weighted Korobov Spaces with General Weights
Numerische Mathematik
Bounds and constructions for the star-discrepancy via δ-covers
Journal of Complexity
On the mean square weighted L2 discrepancy of randomized digital nets in prime base
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Note: A note on the existence of sequences with small star discrepancy
Journal of Complexity
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
SIAM Journal on Numerical Analysis
Hi-index | 0.01 |
Tractability properties of various notions of discrepancy have been intensively studied in the last decade. In this paper we consider the so-called weighted star discrepancy which was introduced by Sloan and Wozniakowski. We show that under a very mild condition on the weights one can obtain tractability with s-exponent zero (s is the dimension of the point set). In the case of product weights we give a condition such that the weighted star discrepancy is even strongly tractable. Furthermore, we give a lower bound for the weighted star discrepancy for a large class of weights. This bound shows that for such weights one cannot obtain strong tractability.