Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces
arXiv:1306.4573 · doi:10.1016/j.cam.2015.02.041
Abstract
Quadrature rules using higher order digital nets and sequences are known to exploit the smoothness of a function for numerical integration and to achieve an improved rate of convergence as compared to classical digital nets and sequences for smooth functions. A construction principle of higher order digital nets and sequences based on a digit interlacing function was introduced in [J. Dick, SIAM J. Numer. Anal., 45 (2007) pp.~2141--2176], which interlaces classical digital nets or sequences whose number of components is a multiple of the dimension. In this paper, we study the use of polynomial lattice point sets for interlaced components. We call quadrature rules using such point sets {\em interlaced polynomial lattice rules}. We consider weighted Walsh spaces containing smooth functions and derive two upper bounds on the worst-case error for interlaced polynomial lattice rules, both of which can be employed as a quality criterion for the construction of interlaced polynomial lattice rules. We investigate the component-by-component construction and the Korobov construction as a means of explicit constructions of good interlaced polynomial lattice rules that achieve the optimal rate of the worst-case error. Through this approach we are able to obtain a good dependence of the worst-case error bounds on the dimension under certain conditions on the weights, while significantly reducing the construction cost as compared to higher order polynomial lattice rules.
References in corpus (6)
- Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high order
- On Wavelet-Galerkin methods for Semilinear Parabolic Equations with Additive Noise
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Explicit constructions of quasi-Monte Carlo rules for the numerical integration of high dimensional periodic functions
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
Cited by in corpus (15)
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Higher order Quasi-Monte Carlo integration for Bayesian Estimation
- Embeddings of Weighted Hilbert Spaces and Applications to Multivariate and Infinite-Dimensional Integration
- A universal median quasi-Monte Carlo integration
- Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration
- Richardson extrapolation of polynomial lattice rules
- MDFEM: Multivariate decomposition finite element method for elliptic PDEs with lognormal diffusion coefficients using higher-order QMC and FEM
- Recent advances in higher order quasi-Monte Carlo methods
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- Multi-level higher order QMC Galerkin discretization for affine parametric operator equations
- MDFEM: Multivariate decomposition finite element method for elliptic PDEs with uniform random diffusion coefficients using higher-order QMC and FEM
- Richardson extrapolation allows truncation of higher order digital nets and sequences
- Constructing good higher order polynomial lattice rules with modulus of reduced degree
- Higher order Quasi-Monte Carlo integration for holomorphic, parametric operator equations
- On a projection-corrected component-by-component construction