Five-dimensional 𝐾-optimal lattice rules

Lyness, J.; Sørevik, Tor

doi:10.1090/S0025-5718-06-01845-X

Five-dimensional $K$-optimal lattice rules
HTML articles powered by AMS MathViewer

by J. N. Lyness and Tor Sørevik PDF

Math. Comp. 75 (2006), 1467-1480 Request permission

Abstract:

A major search program is described that has been used to determine a set of five-dimensional $K$-optimal lattice rules of enhanced trigonometric degrees up to 12. The program involved a distributed search, in which approximately 190 CPU-years were shared between more than 1,400 computers in many parts of the world.

References

Ronald Cools and Hilde Govaert, Five- and six-dimensional lattice rules generated by structured matrices, J. Complexity 19 (2003), no. 6, 715–729. Information-Based Complexity Workshop (Minneapolis, MN, 2002). MR 2039626, DOI 10.1016/j.jco.2003.08.001
Ronald Cools and James N. Lyness, Three- and four-dimensional $K$-optimal lattice rules of moderate trigonometric degree, Math. Comp. 70 (2001), no. 236, 1549–1567. MR 1836918, DOI 10.1090/S0025-5718-01-01326-6
Ronald Cools and Ian H. Sloan, Minimal cubature formulae of trigonometric degree, Math. Comp. 65 (1996), no. 216, 1583–1600. MR 1361806, DOI 10.1090/S0025-5718-96-00767-3
J. N. Lyness, An introduction to lattice rules and their generator matrices, IMA J. Numer. Anal. 9 (1989), no. 3, 405–419. MR 1011399, DOI 10.1093/imanum/9.3.405
J. N. Lyness, Notes on lattice rules, J. Complexity 19 (2003), no. 3, 321–331. Numerical integration and its complexity (Oberwolfach, 2001). MR 1984117, DOI 10.1016/S0885-064X(03)00005-0
J. N. Lyness and R. Cools, Notes on a search for optimal lattice rules, in Cubature Formulae and Their Applications (M. V. Noskov, ed.), 259–273, Krasnoyarsk STU, 2000. Also available as Argonne National Laboratory Preprint ANL/MCS-P829-0600.
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
J. N. Lyness and T. Sørevik, An algorithm for finding optimal integration lattices of composite order, BIT 32 (1992), no. 4, 665–675. MR 1191020, DOI 10.1007/BF01994849
J. N. Lyness and T. Sørevik, Lattice rules by component scaling, Math. Comp. 61 (1993), no. 204, 799–820. MR 1185247, DOI 10.1090/S0025-5718-1993-1185247-6
J. N. Lyness and T. Sørevik, Four-dimensional lattice rules generated by skew-circulant matrices, Math. Comp. 73 (2004), no. 245, 279–295. MR 2034122, DOI 10.1090/S0025-5718-03-01534-5
H. Minkowski, Gesammelte Abhandlungen, reprint (originally published in 2 volumes, Leipzig, 1911), Chelsea Publishing Company, 1967.
H. M. Möller, Lower bounds for the number of nodes in cubature formulae, Numerische Integration (Tagung, Math. Forschungsinst., Oberwolfach, 1978) Internat. Ser. Numer. Math., vol. 45, Birkhäuser, Basel-Boston, Mass., 1979, pp. 221–230. MR 561295
I. P. Mysovskikh, Cubature formulas that are exact for trigonometric polynomials, Metody Vychisl. 15 (1988), 7–19, 178 (Russian). MR 967440
M. V. Noskov, Cubature formulas for functions that are periodic with respect to some of the variables, Zh. Vychisl. Mat. i Mat. Fiz. 31 (1991), no. 9, 1414–1419 (Russian); English transl., Comput. Math. Math. Phys. 31 (1991), no. 9, 110–114 (1992). MR 1145212
T. Sørevik and J. F. Myklebust, GRISK: An Internet based search for K-optimal lattice rules, in Proceedings of PARA2000, Lecture Notes in Computer Science 1947, 196–205, Springer Verlag, 2001.