Searching for extensible Korobov rules
Journal of Complexity
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Shifted lattice rules based on a general weighted discrepancy for integrals over Euclidean space
Journal of Computational and Applied Mathematics
Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
Journal of Computational Physics
Weighted compound integration rules with higher order convergence for all N
Numerical Algorithms
Variance bounds and existence results for randomly shifted lattice rules
Journal of Computational and Applied Mathematics
Constructing adapted lattice rules using problem-dependent criteria
Proceedings of the Winter Simulation Conference
Parametric dominant pole algorithm for parametric model order reduction
Journal of Computational and Applied Mathematics
| Hi-index | 0.01 |
Lattice rules are a family of equal-weight cubature formulae for approximating high-dimensional integrals. By now it is well established that good generating vectors for lattice rules having $n$ points can be constructed component-by-component for integrands belonging to certain weighted function spaces, and that they can achieve the optimal rate of convergence. Although the lattice rules constructed this way are extensible in dimension, they are not extensible in $n$; thus when $n$ is changed the generating vector needs to be constructed anew. In this paper we introduce a new algorithm for constructing good generating vectors for embedded lattice rules which can be used for a range of $n$ while still being extensible in dimension. By using an adaptation of the fast component-by-component construction algorithm (which makes use of fast Fourier transforms), we are able to obtain good generating vectors for thousands of dimensions and millions of points, under both product weight and order-dependent weight settings, at the cost of $\calO(d n (\log (n))^2)$ operations. With a sufficiently large number of points and good overall quality, these embedded lattice rules can be used for practical purposes in the same way as a low-discrepancy sequence. We show for a range of weight settings in an unanchored Sobolev space that our embedded lattice rules achieve the same (optimal) rate of convergence $\calO(n^{-1+\delta})$, $\delta0$, as those constructed for a fixed number of points, and that the implied constant gains only a factor of 1.30 to 1.55.