Summary
We study the weighted star discrepancy of digital nets and sequences. Product weights and finite-order weights are considered and we prove tractability bounds for Niederreiter and Faure-Niederreiter sequences. Further we prove an existence result for digital nets achieving a strong tractability error bound by calculating the average over all generator matrices.
The first author is supported by the Australian Research Council under its Center of Excellence Program.
The third author is supported by the Austrian Science Fund (FWF), Project S8305 and Project P17022-N12.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chrestenson, H.E.: A class of generalized Walsh functions. Pacific J. Math., 5: 17–31, 1955.
Dick, J., Leobacher, G., Pillichshammer, F.: Construction algorithms for digital nets with small weighted star discrepancy. To appear in SIAM J. Num. Anal., 2005.
Dick, J., Pillichshammer, F.: Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces. J. Complexity, 21: 149–195, 2005.
Dick, J., Pillichshammer, F.: On the mean square weighted \(\mathcal{L}_2 \) discrepancy of randomized digital (t, m, s)-nets over ℤ2. Acta Arith., 117: 371–403, 2005.
Dick, J., Sloan, I.H., Wang, X., Woźniakowski, H.: Liberating the weights. J. Complexity, 20: 593–623, 2004.
Dick, J., Sloan, I.H., Wang, X., Wózniakowski, H.: Good lattice rules in weighted Korobov spaces with general weights. Submitted, 2003.
Hellekalek, P.: General discrepancy estimates: the Walsh function system. Acta Arith., 67: 209–218, 1994.
Hickernell, F.J., Niederreiter, H.: The existence of good extensible rank-1 lattices. J. Complexity, 19: 286–300, 2003.
Niederreiter, H.: Point sets and sequences with small discrepancy. Monatsh. Math., 104: 273–337, 1987.
Niederreiter, H.: Low-discrepancy and low-dispersion sequences. J. Number Theory, 30: 51–70, 1988.
Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, 1992.
Niederreiter, H., Xing, C.P.: Rational Points on Curves over Finite Fields: Theory and Applications. Cambridge University Press, Cambridge, 2001.
Rivlin, T.J., Saff, E.B.: Joseph L. Walsh Selected Papers. Springer Verlag, New York, 2000.
Sloan, I.H., Wang, X., Woźniakowski, H.: Finite-order weights imply tractability of multivariate integration. J. Complexity, 20: 46–74, 2004.
Sloan, I.H., Woźniakowski, H.: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? J. Complexity, 14: 1–33, 1998.
Walsh, J.L.: A closed set of normal orthogonal functions. Amer. J. Math., 55: 5–24, 1923.
Wang, X.: A constructive approach to strong tractability using Quasi-Monte Carlo algorithms. J. Complexity, 18: 683–701, 2002.
Wang, X.: Strong tractability of multivariate integration using quasi-Monte Carlo algorithms. Math. Comp., 72: 823–838, 2003.
Yue, R.X., Hickernell, F.J.: Strong tractability of integration using scrambled Niederreiter points. To appear in Math. Comp., 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dick, J., Niederreiter, H., Pillichshammer, F. (2006). Weighted Star Discrepancy of Digital Nets in Prime Bases. In: Niederreiter, H., Talay, D. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31186-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-31186-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25541-3
Online ISBN: 978-3-540-31186-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)