Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-08T07:26:58.714Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of lattice rules having given invariants

Published online by Cambridge University Press:  17 April 2009

Stephen Joe  and
David C. Hunt
Stephen Joe
Affiliation:
Department of Mathematics and Statistics, The University of Waikato, Hamilton, New Zealand
David C. Hunt
Affiliation:
School of Mathematics, University of New South Wales, Sydney NSW 2033, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A lattice rule is a quadrature rule used for the approximation of integrals over the s-dimensional unit cube. Every lattice rule may be characterised by an integer r called the rank of the rule and a set of r positive integers called the invariants. By exploiting the group-theoretic structure of lattice rules we determine the number of distinct lattice rules having given invariants. Some numerical results supporting the theoretical results are included. These numerical results are obtained by calculating the Smith normal form of certain integer matrices.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 46 , Issue 3 , December 1992 , pp. 479 - 495
Copyright
Copyright © Australian Mathematical Society 1992

References

[1]Blyth, T.S., Module theory (Clarendon Press, Oxford, 1977).Google Scholar
[2]Burnside, W., Theory of groups of finite order (Dover Publications, New York, 1955).Google Scholar
[3]Hlawka, E., ‘Zur angenäherten Berechnung mehrfacher Integrale’, Monatsh. Math. 66 (1962), 140–151.CrossRefGoogle Scholar
[4]Iliopoulos, C.S., ‘Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix’, SIAM J. Comput. 18 (1989), 658–669.CrossRefGoogle Scholar
[5]Korobov, N.M., ‘The approximate computation of multiple integrals’, (in Russian), Dokl. Akad. Nauk SSSR 124 (1959), 1207–1210.Google Scholar
[6]Langtry, T.N., ‘The determination of canonical forms for lattice quadrature rules’, (preprint).Google Scholar
[7]Ledermann, W., Introduction to the theory of finite groups (Oliver and Boyd, Edinburgh, 1964).Google Scholar
[8]Lyness, J.N. and Keast, P., ‘Application of the Smith normal form to the structure of lattice rules’, (preprint).Google Scholar
[9]Lyness, J.N. and Sørevik, T., ‘The number of lattice rules’, BIT 29 (1989), 527–534.CrossRefGoogle Scholar
[10]Salkin, H.M. and Mathur, K., Foundations of integer programming (North-Holland, New York, 1989).Google Scholar
[11]Sloan, I.H. and Lyness, J.N., ‘The representation of lattice quadrature rules as multiple sums’, Math. Comp. 52 (1989), 81–94.CrossRefGoogle Scholar
[12]Turnbull, H.W. and Aitken, A.C., An introduction to the theory of canonical matrices (Blackie & Son, London, 1932).Google Scholar