Abstract
Lattice rules are quasi-Monte Carlo methods for numerical multiple integration that are based on the selection of an s-dimensional integration lattice. The abscissa set is the intersection of the integration lattice with the unit hypercube. It is well-known that the abscissa set of a lattice rule can be generated by a number of fixed rational vectors. In general, different sets of generators produce different integration lattices and rules, and a given rule has many different generator sets. The rank of the rule is the minimum number of generators required to span the abscissa set. A lattice rule is usually specified by a generator set, and the quality of the rule varies with the choice of generator set. This paper describes a new method for the construction of generator sets for higher-rank rules that is based on techniques arising from the theory of simultaneous Diophantine approximation. The method extends techniques currently applied in the rank 1 case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
