Component-by-component construction of good lattice rules

Sloan, I.; Reztsov, A.

doi:10.1090/S0025-5718-01-01342-4

Component-by-component construction of good lattice rules
HTML articles powered by AMS MathViewer

by I. H. Sloan and A. V. Reztsov;

Math. Comp. 71 (2002), 263-273

DOI: https://doi.org/10.1090/S0025-5718-01-01342-4

Published electronically: October 4, 2001

PDF | Request permission

Abstract:

This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit $s$-dimensional cube. Theorems are proved which justify the construction of good lattice rules one component at a time—that is, the lattice rule for dimension $s+1$ is obtained from the rule for dimension $s$ by searching over all possible choices of the $(s+1)$th component, while keeping all the existing components unchanged. The construction, which goes against accepted wisdom, is illustrated by numerical examples. The construction is particularly useful if the components of the integrand are ordered, in the sense that the first component is more important than the second, and so on.

References

N. S. Bahvalov, Approximate computation of multiple integrals, Vestnik Moskov. Univ. Ser. Mat. Meh. Astr. Fiz. Him. 1959 (1959), no. 4, 3–18 (Russian). MR 115275
Shaun Disney and Ian H. Sloan, Error bounds for the method of good lattice points, Math. Comp. 56 (1991), no. 193, 257–266. MR 1052090, DOI 10.1090/S0025-5718-1991-1052090-6
Seymour Haber, Experiments on optimal coefficients, Applications of number theory to numerical analysis (Proc. Sympos., Univ. Montréal, Montreal, Que., 1971) Academic Press, New York-London, 1972, pp. 11–37. MR 391479
Hardy, G.H., Littlewood, J.E. and Polya, G. (1934) Inequalities. Cambridge University Press, Cambridge.
N. M. Korobov, Teoretiko-chislovye metody v priblizhennom analize, Gosudarstv. Izdat. Fiz.-Mat. Lit., Moscow, 1963 (Russian). MR 157483
Arnold R. Krommer and Christoph W. Ueberhuber, Computational integration, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1998. MR 1625683, DOI 10.1137/1.9781611971460
J. N. Lyness and T. Sørevik, A search program for finding optimal integration lattices, Computing 47 (1991), no. 2, 103–120 (English, with German summary). MR 1139431, DOI 10.1007/BF02253429
Dominique Maisonneuve, Recherche et utilisation des “bons treillis”. Programmation et résultats numériques, Applications of number theory to numerical analysis (Proc. Sympos., Univ. Montréal, Montreal, Que., 1971) Academic Press, New York-London, 1972, pp. 121–201 (French, with English summary). MR 343529
Harald Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84 (1978), no. 6, 957–1041. MR 508447, DOI 10.1090/S0002-9904-1978-14532-7
A. I. Saltykov, Tables for evaluating multiple integrals by the method of optimal coefficients, Ž. Vyčisl. Mat i Mat. Fiz. 3 (1963), 181–186 (Russian). MR 150976
Sharygin. I.F. (1963) A lower estimate for the error of quadrature formulas for certain class of functions. (Russian) Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki. English translation: U.S.S.R. Computational Mathematics and Mathematical Physics. 3. pp. 489–497.
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
Sloan, I.H. and Reztsov, A.V. (2000) Component-by-component construction of good lattice rules. Applied Mathematics Report AMR00/8, School of Mathematics, University of New South Wales. Also see WWW-version of this report at http://www.maths.unsw.edu.au/applied/reports/amr00.html.