Skip to main content
SpringerLink
Log in

Error bounds for rank 1 lattice quadrature rules modulo composites

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

Abstract

Improved estimates are established regarding the accuracy which can be achieved by a suitable choice of generator in a single-generator lattice quadrature rule (as used in the “method of good lattice points”) in the general case wherem, the number of quadrature points, is not necessarily prime. The result obtained for the general case is asymptotically the same as the best currently-known result for the prime case. However, it is also shown that when these rules are applied to some customary test functions the mean error (over different rules with the same number of points) can be arbitrarily large compared to the corresponding mean value for rules with a comparable but prime value ofm. These mean values are of interest in relation to computerised searches for good generators.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bourdeau, M., Pitre, A.: Tables of good lattices for four and five dimensions. Numer. Math.47, 39–43 (1985).

    Google Scholar 

  2. Disney, S., Sloan, I. H.: Error bounds for the method of good lattice points. Math. Comp. To appear.

  3. Hua, L. K., Wang, Y.: Applications of Number Theory to Numerical Analysis. Berlin-Heidelber-New York: Springer. 1981.

    Google Scholar 

  4. Kedem, G., Zaremba, S. K.: A table of good lattice points in three dimensions. Number. Math.23, 175–180 (1974).

    Google Scholar 

  5. Maisonneuve, D.: Recherche et utilisation des ‘Bon Treillis’. Programmation et résultats numeriques. In: Applications of Number Theory to Numerical Analysis (S. K. Zaremba, ed.), pp. 121–201. New York: Academic Press. 1972.

    Google Scholar 

  6. Niederreiter, H.: Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Soc.84, 957–1041 (1978).

    Google Scholar 

  7. Niederreiter, H.: Quasi-Monte Carlo methods for numerical integration. In: Numerical Integration III (H. Brass andG. Hämmerlin eds.), pp. 157–171. Basel: Birkhäuser. 1988.

    Google Scholar 

  8. Niederreiter, H.: Existence of good lattice points in the sense of Hlawka. Mh. Math.86, 203–219 (1978).

    Google Scholar 

  9. Saltykov, A. I.: Tables for computing multiple integrals by the methods of optimal coefficients. Ž. Vyčisl. Mat. i Mat. Fiz.3, 181–186 (1963), (=U.S.S.R. Computational Math. and Math. Phys.3, 235–242 (1963)).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of New South Wales, 2033, Sydney, NSW, Australia

    Shaun Disney

Authors
  1. Shaun Disney
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Disney, S. Error bounds for rank 1 lattice quadrature rules modulo composites. Monatshefte für Mathematik 110, 89–100 (1990). https://doi.org/10.1007/BF01302778

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation