Good lattice rules based on the general weighted star discrepancy

Authors:
Vasile Sinescu and Stephen Joe

Journal:
Math. Comp. **76** (2007), 989-1004

MSC (2000):
Primary 65D30, 65D32; Secondary 11K38

Published electronically:
December 12, 2006

MathSciNet review:
2291846

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We study the problem of constructing rank- lattice rules which have good bounds on the ``weighted star discrepancy''. Here the non-negative weights are general weights rather than the product weights considered in most earlier works. In order to show the existence of such good lattice rules, we use an averaging argument, and a similar argument is used later to prove that these lattice rules may be obtained using a component-by-component (CBC) construction of the generating vector. Under appropriate conditions on the weights, these lattice rules satisfy strong tractability bounds on the weighted star discrepancy. Particular classes of weights known as ``order-dependent'' and ``finite-order'' weights are then considered and we show that the cost of the construction can be very much reduced for these two classes of weights.

**1.**R. Cools, F.Y. Kuo and D. Nuyens, Constructing embedded lattice rules for multivariate integration, SIAM J. Sci Comput., to appear.**2.**Josef Dick, Ian H. Sloan, Xiaoqun Wang, and Henryk Woźniakowski,*Good lattice rules in weighted Korobov spaces with general weights*, Numer. Math.**103**(2006), no. 1, 63–97. MR**2207615**, 10.1007/s00211-005-0674-6**3.**Fred J. Hickernell,*A generalized discrepancy and quadrature error bound*, Math. Comp.**67**(1998), no. 221, 299–322. MR**1433265**, 10.1090/S0025-5718-98-00894-1**4.**Fred J. Hickernell and Harald Niederreiter,*The existence of good extensible rank-1 lattices*, J. Complexity**19**(2003), no. 3, 286–300. Numerical integration and its complexity (Oberwolfach, 2001). MR**1984115**, 10.1016/S0885-064X(02)00026-2**5.**Fred J. Hickernell, Ian H. Sloan, and Grzegorz W. Wasilkowski,*On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}*, Math. Comp.**73**(2004), no. 248, 1885–1901 (electronic). MR**2059741**, 10.1090/S0025-5718-04-01624-2**6.**Fred J. Hickernell, Ian H. Sloan, and Grzegorz W. Wasilkowski,*On strong tractability of weighted multivariate integration*, Math. Comp.**73**(2004), no. 248, 1903–1911 (electronic). MR**2059742**, 10.1090/S0025-5718-04-01653-9**7.**Stephen Joe and Ian H. Sloan,*On computing the lattice rule criterion 𝑅*, Math. Comp.**59**(1992), no. 200, 557–568. MR**1134733**, 10.1090/S0025-5718-1992-1134733-2**8.**Stephen Joe,*Component by component construction of rank-1 lattice rules having 𝑂(𝑛⁻¹(ln(𝑛))^{𝑑}) star discrepancy*, Monte Carlo and quasi-Monte Carlo methods 2002, Springer, Berlin, 2004, pp. 293–298. MR**2076940****9.**Stephen Joe,*Construction of good rank-1 lattice rules based on the weighted star discrepancy*, Monte Carlo and quasi-Monte Carlo methods 2004, Springer, Berlin, 2006, pp. 181–196. MR**2208709**, 10.1007/3-540-31186-6_12**10.**Gerhard Larcher,*A best lower bound for good lattice points*, Monatsh. Math.**104**(1987), no. 1, 45–51. MR**903774**, 10.1007/BF01540524**11.**Dirk Nuyens and Ronald Cools,*Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces*, Math. Comp.**75**(2006), no. 254, 903–920 (electronic). MR**2196999**, 10.1090/S0025-5718-06-01785-6**12.**Harald Niederreiter,*Existence of good lattice points in the sense of Hlawka*, Monatsh. Math.**86**(1978/79), no. 3, 203–219. MR**517026**, 10.1007/BF01659720**13.**Harald Niederreiter,*Random number generation and quasi-Monte Carlo methods*, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 63, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1992. MR**1172997****14.**I. H. Sloan and S. Joe,*Lattice methods for multiple integration*, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1994. MR**1442955****15.**Ian H. Sloan, Xiaoqun Wang, and Henryk Woźniakowski,*Finite-order weights imply tractability of multivariate integration*, J. Complexity**20**(2004), no. 1, 46–74. MR**2031558**, 10.1016/j.jco.2003.11.003**16.**Ian H. Sloan and Henryk Woźniakowski,*When are quasi-Monte Carlo algorithms efficient for high-dimensional integrals?*, J. Complexity**14**(1998), no. 1, 1–33. MR**1617765**, 10.1006/jcom.1997.0463**17.**Xiaoqun Wang and Ian H. Sloan,*Why are high-dimensional finance problems often of low effective dimension?*, SIAM J. Sci. Comput.**27**(2005), no. 1, 159–183 (electronic). MR**2201179**, 10.1137/S1064827503429429**18.**S. C. Zaremba,*Some applications of multidimensional integration by parts*, Ann. Polon. Math.**21**(1968), 85–96. MR**0235731**

Retrieve articles in *Mathematics of Computation*
with MSC (2000):
65D30,
65D32,
11K38

Retrieve articles in all journals with MSC (2000): 65D30, 65D32, 11K38

Additional Information

**Vasile Sinescu**

Affiliation:
Department of Mathematics, University of Waikato, Hamilton, New Zealand

Email:
vs27@waikato.ac.nz

**Stephen Joe**

Affiliation:
Department of Mathematics, University of Waikato, Hamilton, New Zealand

Email:
stephenj@math.waikato.ac.nz

DOI:
https://doi.org/10.1090/S0025-5718-06-01943-0

Keywords:
Rank-$1$ lattice rules,
weighted star discrepancy,
component-by-component construction

Received by editor(s):
August 23, 2005

Received by editor(s) in revised form:
April 20, 2006

Published electronically:
December 12, 2006

Article copyright:
© Copyright 2006
American Mathematical Society

The copyright for this article reverts to public domain 28 years after publication.