The construction of good extensible Korobov rules
In this paper, we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such rules was recently shown by Niederreiter. Here we provide a feasible construction algorithm and an upper bound on the worst-case error in certain reproducing kernel Hilbert spaces for such quadrature rules. The proof is based on a sieve principle recently used by the authors to construct extensible lattice rules. We only treat classical lattice rules. The same ideas apply for polynomial lattice rules.
AMS Subject Classifications11K45 65C05 65D30
KeywordsQuasi-Monte Carlo methods Lattice rules Korobov rules
Unable to display preview. Download preview PDF.
- Dick, J.: The construction of extensible polynomial lattice rules with small weighted star discrepancy (submitted 2006).Google Scholar
- Dick, J., Pillichshammer, F., Waterhouse, B. J.: The construction of good extensible lattices (submitted 2006).Google Scholar
- Hickernell, F. J.: Lattice rules: how well do they measure up? In: Random and quasi-random point sets (Hellekalek, P. and Larcher, G., eds.). Lecture Notes in Statistics, vol. 138. New York: Springer, pp. 109–166 (1998).Google Scholar
- Niederreiter, H. 1992Random number generation and quasi-Monte Carlo methods. CBMS-NSF Series in Applied Mathematics, vol. 63SIAMPhiladelphiaGoogle Scholar