On the step-by-step construction of quasi-Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces

Authors:
I. H. Sloan, F. Y. Kuo and S. Joe

Journal:
Math. Comp. **71** (2002), 1609-1640

MSC (2000):
Primary 65D30, 65D32; Secondary 68Q25

DOI:
https://doi.org/10.1090/S0025-5718-02-01420-5

Published electronically:
March 20, 2002

MathSciNet review:
1933047

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We develop and justify an algorithm for the construction of quasi-Monte Carlo (QMC) rules for integration in weighted Sobolev spaces; the rules so constructed are shifted rank-1 lattice rules. The parameters characterising the shifted lattice rule are found ``component-by-component'': the ()-th component of the generator vector and the shift are obtained by successive -dimensional searches, with the previous components kept unchanged. The rules constructed in this way are shown to achieve a strong tractability error bound in weighted Sobolev spaces. A search for -point rules with prime and all dimensions 1 to requires a total cost of operations. This may be reduced to operations at the expense of storage. Numerical values of parameters and worst-case errors are given for dimensions up to 40 and up to a few thousand. The worst-case errors for these rules are found to be much smaller than the theoretical bounds.

**1.**Hickernell, F.J. (1998).*A generalized discrepancy and quadrature error bound*, Math. Comp.,**67**, 299-322. MR**98c:65032****2.**Hickernell, F. J. (1998).*Lattice rules: How well do they measure up?*, Random and Quasi-Random Point Sets (P. Hellekalek and G. Larcher, eds.), Lecture Notes in Statistics, vol. 138, Springer-Verlag, New York, 109-166. MR**2000b:65007****3.**Hickernell, F. J. and Wozniakowski, H. (2000).*Integration and approximation in arbitrary dimensions*, Adv. Comput. Math.,**12**, 25-58. MR**2001d:65007****4.**Novak, E. and Wozniakowski, H. (2001),*Intractability results for integration and discrepancy*, J. Complexity,**17**, 388-441.**5.**Niederreiter, H. (1992).*Random Number Generation and Quasi-Monte Carlo Methods*, SIAM, Philadelphia. MR**93h:65008****6.**Sloan, I. H. and Joe, S. (1994).*Lattice Methods for Multiple Integration*, Clarendon Press, Oxford. MR**98a:65026****7.**Sloan, I. H. and Reztsov, A. V. (2002).*Component-by-component construction of good lattice rules*, Math. Comp.,**17**, 263-273.**8.**Sloan, I. H. and Wozniakowski, H. (1998).*When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?*, J. Complexity,**14**, 1-33. MR**99d:65184****9.**Sloan, I. H. and Wozniakowski, H. (2001).*Tractability of multivariate integration for weighted Korobov classes*, J. Complexity,**17**, 697-721.**10.**Wozniakowski, H. (1999),*Efficiency of quasi-Monte Carlo algorithms for high-dimensional integrals*, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds.), Springer-Verlag, Berlin, 114-136.

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

Retrieve articles in all journals with MSC (2000): 65D30, 65D32, 68Q25

Additional Information

**I. H. Sloan**

Affiliation:
School of Mathematics, University of New South Wales, Sydney, New South Wales 2052, Australia

Email:
sloan@maths.unsw.edu.au

**F. Y. Kuo**

Affiliation:
Department of Mathematics, University of Waikato, Private Bag 3105, Hamilton, New Zealand

Email:
f.kuo@math.waikato.ac.nz

**S. Joe**

Affiliation:
Department of Mathematics, University of Waikato, Private Bag 3105, Hamilton, New Zealand

Email:
stephenj@math.waikato.ac.nz

DOI:
https://doi.org/10.1090/S0025-5718-02-01420-5

Received by editor(s):
October 30, 2000

Published electronically:
March 20, 2002

Article copyright:
© Copyright 2002
American Mathematical Society