Lattice rules by component scaling

Mathematics of Computation

Volumn 61, Issue 204, 1993, Pages 799-820

  Lyness, J N ^a   Sorevik, T ^b  

^a ARGONNE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Figure of merit; Lattice rules; Number theoretic rules; Scaled lattice; Zaremba index

Indexed keywords

EID: 21344489794     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1993-1185247-6     Document Type: Article

References (10)

1. M. Bourdeau and A. Pitre, Tables of good lattices in four and five dimensions, Numer. Math. 47(1985), 39-43.
2. G. Kedem and S. K. Zaremba, A table of good lattice points in three dimensions, Numer. Math. 23 (1974), 175-180.
3. J. N. Lyness and T. Serevik, A search program for finding optimal integration lattices, Computing 47 (1991), 103-120.
4. J. N. Lyness and T. Serevik, An algorithm for finding optimal integration lattices of composite order, BIT 32 (1992), 665-675.
5. D. Maisonneuve, Recherche et utilisation des bons treillis, programmation et résultats numériques, Applications of Number Theory to Numerical Analysis (S. K. Zaremba, ed.), Academic Press, London, 1972, pp. 121-201.
6. H. Niederreiter, Quasi-Monte Carlo methods for multidimensional numerical integration, Numerical Integration III (G. Hämmerlin and H. Brass, eds.), Birkhäuser Verlag, Boston, 1988, pp. 157-171.
7. H. Niederreiter, The existence of efficient lattice rules for multidimensional numerical integration, Math. Comp. 58 (1992), 305-314, S7-S16.
8. I. H. Sloan and J. N. Lyness, The representation of lattice quadrature rules as multiple sums, Math. Comp. 52 (1989), 81-94.
9. S. K. Zaremba, Good lattice points, discrepancy and numerical integration, Ann. Mat. Pura Appl. 73(1966), 293-317.
10. S. K. Zaremba, Good lattice points modulo composite numbers, Monatsh. Math. 78 (1974), 446-460.