Summary
The ‘goodness’ of a set of quadrature points in [0, 1]d may be measured by the weighted star discrepancy. If the weights for the weighted star discrepancy are summable, then we show that for n prime there exist n-point rank-1 lattice rules whose weighted star discrepancy is O(n−1+δ) for any δ>0, where the implied constant depends on δ and the weights, but is independent of d and n. Further, we show that the generating vector z for such lattice rules may be obtained using a component-by-component construction. The results given here for the weighted star discrepancy are used to derive corresponding results for a weighted Lp discrepancy.
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
J. Dick, G. Leobacher, F. Pillichshammer, Construction algorithms for digital nets with small weighted star discrepancy, SIAM J. Numer. Anal., to appear.
F.J. Hickernell, H. Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300.
E. Hlawka, Funktionen von beschränkter Variation in der Theorie der Gleichverteilung, Ann. Mat. Pura ed Appl. 54 (1961) 325–334.
S. Joe, Component by component construction of rank-1 lattice rules having O(n−1(ln(n))d) star discrepancy, in: H. Niederreiter (Ed.), Monte Carlo and Quasi-Monte Carlo Methods 2002, Springer, Berlin, 2004, pp. 293–298.
S. Joe, I.H. Sloan, On computing the lattice rule criterion R, Math. Comp. 59 (1992) 557–568.
N.M. Korobov, Properties and calculation of optimal coefficients, Soviet Math. Dokl. 1 (1960) 696–700.
F.Y. Kuo, Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces, J. Complexity 19 (2003) 301–320.
F.Y. Kuo, S. Joe, Component-by-component construction of good lattice rules with a composite number of points, J. Complexity 18 (2002) 943–976.
F.Y. Kuo, S. Joe, Component-by-component construction of good intermediaterank lattice rules, SIAM J. Numer. Anal. 41 (2003) 1465–1486.
H. Niederreiter, Existence of good lattice points in the sense of Hlawka, Monatsh. Math. 86 (1978) 203–219.
H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 1992.
D. Nuyens, R. Cools, Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces, Math. Comp., to appear.
I.H. Sloan, S. Joe, Lattice Methods for Multiple Integration, Clarendon Press, Oxford, 1994.
I.H. Sloan, F.Y. Kuo, S. Joe, On the step-by-step construction of quasi-Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces, Math. Comp. 71 (2002) 1609–1640.
I.H. Sloan, F.Y. Kuo, S. Joe, Constructing randomly shifted lattice rules in weighted Sobolev spaces, SIAM J. Numer. Anal. 40 (2002) 1650–1665.
I.H. Sloan, A.V. Reztsov, Component-by-component construction of good lattice rules, Math. Comp. 71 (2002) 263–273.
I.H. Sloan, H. Woźniakowski, When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?, J. Complexity 14 (1998) 1–33.
X. Wang, I.H. Sloan, J. Dick, On Korobov lattice rules in weighted spaces, SIAM J. Numer. Anal. 42 (2004) 1760–1779.
S.K. Zaremba, Some applications of multidimensional integration by parts, Ann. Polon. Math. 21 (1968) 85–96.
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
Joe, S. (2006). Construction of Good Rank-1 Lattice Rules Based on the Weighted Star Discrepancy. 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_12
Download citation
DOI: https://doi.org/10.1007/3-540-31186-6_12
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)