Skip to main content

A search for good lattice rules based on the reciprocal lattice generator matrix

  • Track 8: Numerical Analysis
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

Abstract

The search for cost-effective lattice rules is a time-consuming and difficult process. After a brief overview of some of the lattice theory relevant to these rules, a new approach to this search is suggested. This approach is based on a classification of lattice rules using “the upper triangular lattice form” of the reciprocal lattice generator matrix.

This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • G. H. Bradley, 1971. “Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations,” Math. Comput. 25 (1971), pp. 897–907.

    Article  MATH  MathSciNet  Google Scholar 

  • Marc Bourdeau and Alain Pitre, 1985. “Tables of good lattices in four and five dimensions,” Numer. Math. 47 (1985), pp. 39–43.

    Article  MATH  MathSciNet  Google Scholar 

  • J. W. S. Cassels, 1959. An Introduction to the Geometry of Numbers, Springer.

    Google Scholar 

  • E. Hlawka, 1962. “Zur angenäherten Berechnung mehrfacher Integrale,” Monatsh. Math. 66 (1962), pp. 140–151.

    Article  MATH  MathSciNet  Google Scholar 

  • Gershon Kedem and S. K. Zaremba, 1974. “A table of good lattice points in three dimensions,” Numer. Math. 23 (1974), pp. 175–180.

    Article  MATH  MathSciNet  Google Scholar 

  • N. M. Korobov, 1959. “The approximate computation of multiple integrals,” (in Russian), Dokl. Akad. Nauk. SSSR 124 (1959), pp. 1207–1210.

    MATH  MathSciNet  Google Scholar 

  • J. N. Lyness, 1988. “Some comments on quadrature rule construction criteria,” in International Series of Numerical Mathematics, vol. 85, Numerical Integration III, ed. G. Hämmerlin and H. Brass, Birkhauser Verlag, Basel, 1988, pp. 117–129.

    Google Scholar 

  • J. N. Lyness, 1989. “An introduction to lattice rules and their generator matrices,” to appear in IMA JNA (1989).

    Google Scholar 

  • J. N. Lyness and W. Newman, 1989. “A classification of lattice rules using the reciprocal lattice generator matrix,” (1989), Argonne National Laboratory Report ANL-89/20, Argonne, Illinois.

    Google Scholar 

  • J. N. Lyness and T. Sørevik, 1989. “The number of lattice rules,” BIT 29 (1989), 527–534.

    Article  MATH  MathSciNet  Google Scholar 

  • J. N. Lyness, T. Sørevik, and P. Keast, 1990. “Notes on integration and integer sublattices,” preprint MCS-P34-1288, Argonne National Laboratory; to appear in Math.Comput. (1990).

    Google Scholar 

  • J. N. Lyness and I. H. Sloan, 1989. “Some properties of rank-2 lattice rules,” to appear in Math. Comput. (1989).

    Google Scholar 

  • D. Maisonneuve, 1972. “Recherche et Utilisation des ‘Bons Treillis'. Programming et Resultats Numeriques,” in Applications of Number Theory in Numerical Analysis, S. K. Zaremba, ed., Academic Press (1972) [QA 297.S995], pp. 121–201.

    Google Scholar 

  • H. Niederreiter, 1988. “Quasi-Monte Carlo methods for multidimensional numerical integration,” in International Series of Numerical Mathematics, vol. 85, Numerical Integration III, ed. G. Hämmerlin and H. Brass, Birkhauser Verlag, Basel, 1988, pp. 157–171.

    Google Scholar 

  • A. Schrijver, 1986. Theory of Linear and Integer Programming, Wiley.

    Google Scholar 

  • I. H. Sloan and J. N. Lyness, 1989. “The representation of lattice quadrature rules as multiple sums,” Math. Comp. 52 (1989), pp. 81–94.

    Article  MATH  MathSciNet  Google Scholar 

  • I. H. Sloan and J. N. Lyness, 1990. “Lattice rules: projection regularity and unique representations,” Math. Comput. (to appear). Also MCS-P75-0489, Argonne National Laboratory.

    Google Scholar 

  • S. K. Zaremba, 1966. “Good lattice points, discrepancy and numerical integration,” Ann. Mat. Pura Appl. 73 (1966), pp. 293–317.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lyness, J.N., Newman, W. (1991). A search for good lattice rules based on the reciprocal lattice generator matrix. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038503

Download citation

  • DOI: https://doi.org/10.1007/BFb0038503

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics