Abstract
Lattice rules are quasi-Monte Carlo methods for estimating largedimensional integrals over the unit hypercube. In this paper, after briefly reviewing key ideas of quasi-Monte Carlo methods, we give an overview of recent results, generalize some of them, and provide new results, for lattice rules defined in spaces of polynomials and of formal series with coefficients in the finite ring ℤb. Some of the results are proved only for the case where b is a prime (so ℤb, is a finite field). We discuss basic properties, implementations, a randomized version, and quality criteria (i.e., measures of uniformity) for selecting the parameters. Two types of polynomial lattice rules are examined: dimensionwise lattices and resolutionwise lattices. These rules turn out to be special cases of digital net constructions, which we reinterpret as yet another type of lattice in a space of formal series. Our development underlines the connections between integration lattices and digital nets.
Submitted Version (
Free)
Published Version
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 call