Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate

by   Josef Dick, et al.

We study a randomized quadrature algorithm to approximate the integral of periodic functions defined over the high-dimensional unit cube. Recent work by Kritzer, Kuo, Nuyens and Ullrich (2019) shows that rank-1 lattice rules with a randomly chosen number of points and good generating vector achieve almost the optimal order of the randomized error in weighted Korobov spaces, and moreover, that the error is bounded independently of the dimension if the weight parameters satisfy the summability condition ∑_j=1^∞γ_j^1/α<∞. The argument is based on the existence result that at least half of the possible generating vectors yield almost the optimal order of the worst-case error in the same function spaces. In this paper we provide a component-by-component construction algorithm of such randomized rank-1 lattice rules, without any need to check whether the constructed generating vectors satisfy a desired worst-case error bound. Similarly to the above-mentioned work, we prove that our algorithm achieves almost the optimal order of the randomized error and that the error bound is independent of the dimension if the same condition ∑_j=1^∞γ_j^1/α<∞ holds. We also provide analogous results for tent-transformed lattice rules for weighted half-period cosine spaces and for polynomial lattice rules in weighted Walsh spaces, respectively.



There are no comments yet.


page 1

page 2

page 3

page 4


Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights

We study quasi-Monte Carlo (QMC) integration of smooth functions defined...

Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness

Lattice rules are among the most prominently studied quasi-Monte Carlo m...

Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm

We study quasi-Monte Carlo (QMC) methods for numerical integration of mu...

Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights

In a recent paper by the same authors, we provided a theoretical foundat...

A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications

Several more and more efficient component–by–component (CBC) constructio...

Weighted integration over a cube based on digital nets and sequences

Quasi-Monte Carlo (QMC) methods are equal weight quadrature rules to app...

Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters

This paper provides the theoretical foundation for the construction of l...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.