Abstract
The continuing and widespread use of lattice rules for high-dimensional numerical quadrature is driving the development of a rich and detailed theory. Part of this theory is devoted to computer searches for rules, appropriate to particular situations.
In some applications, one is interested in obtaining the (lattice) rank of a lattice rule Q(Λ) directly from the elements of a generator matrix B (possibly in upper triangular lattice form) of the corresponding dual lattice Λ⊥. We treat this problem in detail, demonstrating the connections between this (lattice) rank and the conventional matrix rank deficiency of modulo p versions of B.
Similar content being viewed by others
References
M. Bourdeau and A. Pitre, Tables of good lattices in four and five dimensions, Numer. Math., 47 (1985), pp. 39–43.
R. Cools and J. N. Lyness, Three- and four-dimensional K-optimal lattice rules of moderate trigonometric degree, Math. Comput., 70 (2001), pp. 1549–1567.
G. Kedem and S. K. Zaremba, A table of good lattices in three dimensions, Numer. Math., 23 (1974), pp. 175–180.
T. N. Langtry, An application of Diophantine approximation to the construction of rank-1 lattice quadrature rules, Math. Comput., 65 (1996), pp. 1635–1662.
J. N. Lyness, An introduction to lattice rules and their generator matrices, IMA J. Numer. Anal., 9 (1989), pp. 405–419.
J. N. Lyness and S. Joe, The number of lattice rules of specified upper class and rank, BIT, 43 (2003), pp. 413–426.
J. N. Lyness and P. Keast, Application of the Smith normal form to the structure of lattice rules, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 218–231.
J. N. Lyness and T. Sørevik, A search program for finding optimal integration lattices, Computing, 47 (1991), pp. 103–120.
J. N. Lyness, T. Sørevik, and P. Keast, Notes on integration and integer sublattices, Math. Comput., 56 (1991), pp. 243–255.
D. Maisonneuve, Recherche et utilisation des ‘bons trellis’. Programmation et résultats numériques, in S. K. Zaremba, ed., Applications of Number Theory to Numerical Analysis, Academic Press, New York, 1972, pp. 121–201.
A. Schrijver, Theory of linear and integer programming, Wiley, New York, 1986.
I. H. Sloan and S. Joe, Lattice methods for multiple integration, Clarendon Press, Oxford, 1994.
I. H. Sloan and J. N. Lyness, The representation of lattice quadrature rules as multiple sums, Math. Comput., 52 (1989), pp. 81–94.
S. K. Zaremba, La méthode des ‘bons trellis’ pour le calcul des intégrales multiples, in S. K. Zaremba, ed., Applications of Number Theory to Numerical Analysis, Academic Press, New York, 1972, pp. 39–116.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification (2000)
65D30
Rights and permissions
About this article
Cite this article
Lyness, J., Joe, S. Determination of the rank of an integration lattice . Bit Numer Math 48, 79–93 (2008). https://doi.org/10.1007/s10543-008-0161-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-008-0161-4