Tractability properties of the weighted star discrepancy

Journal of Complexity

Volumn 24, Issue 2, 2008, Pages 134-143

  Hinrichs, Aicke ^a   Pillichshammer, Friedrich ^b   Schmid, Wolfgang Ch ^c  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

^c UNIVERSITY OF SALZBURG   (Austria)

Author keywords

(strong) Tractability; Quasi Monte Carlo; Weighted star discrepancy

Indexed keywords

MATHEMATICAL MODELS; MONTE CARLO METHODS; PROBLEM SOLVING; SET THEORY;

(STRONG) TRACTABILITY; QUASI MONTE CARLO; WEIGHTED STAR DISCREPANCY;

COMPUTATIONAL COMPLEXITY;

EID: 40749103808     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2007.08.002     Document Type: Article

References (19)

1. 2 discrepancy of randomized digital nets in prime base. J. Complexity 22 (2006) 605-629
2. J. Dick, A note on the existence of sequences with small star discrepancy, J. Complexity 2007, to appear.
3. Dick J., Niederreiter H., and Pillichshammer F. Weighted star discrepancy of digital nets in prime bases. In: Talay D., and Niederreiter H. (Eds). Monte Carlo and Quasi-Monte Carlo Methods 2004 (2006), Springer, Berlin, Heidelberg, New York
4. 2. Acta Arith. 117 (2005) 371-403
5. Dick J., Sloan I.H., Wang X., and Woźniakowski H. Liberating the weights. J. Complexity 20 (2004) 593-623
6. Dick J., Sloan I.H., Wang X., and Woźniakowski H. Good lattice rules in weighted Korobov spaces with general weights. Numer. Math. 103 (2006) 63-97
7. Doerr B., Gnewuch M., and Srivastav A. Bounds and constructions for the star discrepancy via δ-covers. J. Complexity 21 (2005) 691-709
8. Drmota M., and Tichy R.F. Sequences, Discrepancies and Applications. Lecture Notes in Mathematics vol. 1651 (1997), Springer, Berlin
9. Heinrich S. Some open problems concerning the star-discrepancy. J. Complexity 19 (2003) 416-419
10. Heinrich S., Novak E., Wasilkowski G.W., and Woźniakowski H. The inverse of the star discrepancy depends linearly on the dimension. Acta Arith. 96 (2001) 279-302
11. Hinrichs A. Covering numbers, Vapnik-Červonenkis classes and bounds on the star-discrepancy. J. Complexity 20 (2004) 477-483
12. Kuipers L., and Niederreiter H. Uniform Distribution of Sequences (1974), Wiley, New York
13. p discrepancy and tractability of integration. J. Complexity 19 (2003) 529-547
14. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods. CBMS-NSF Series in Applied Mathematics vol. 63 (1992), SIAM, Philadelphia
15. Novak E., and Woźniakowski H. When are integration and discrepancy tractable?. Foundations of Computational Mathematics (Oxford, 1999), London Mathematical Society Lecture Note Series vol. 284 (2001), Cambridge University Press, Cambridge 211-266
16. Sloan I.H., Wang X., and Woźniakowski H. Finite-order weights imply tractability of multivariate integration. J. Complexity 20 (2004) 46-74
17. Sloan I.H., and Woźniakowski H. When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?. J. Complexity 14 (1998) 1-33
18. Wang X. A constructive approach to strong tractability using Quasi-Monte Carlo algorithms. J. Complexity 18 (2002) 683-701
19. Wang X. Strong tractability of multivariate integration using quasi-Monte Carlo algorithms. Math. Comp. 72 (2003) 823-838