Richardson extrapolation allows truncation of higher order digital nets and sequences
arXiv:1805.09490 · doi:10.1093/imanum/drz017
Abstract
We study numerical integration of smooth functions defined over the -dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of convergence for numerical integration and can be constructed by the fast component-by-component search algorithm with smaller computational costs as compared to interlaced polynomial lattice rules. In this paper we prove that, instead of polynomial lattice point sets, truncated higher order digital nets and sequences can be used within the same algorithmic framework to explicitly construct good quadrature rules achieving the almost optimal rate of convergence. The major advantage of our new approach compared to original higher order digital nets is that we can significantly reduce the precision of points, i.e., the number of digits necessary to describe each quadrature node. This finding has a practically useful implication when either the number of points or the smoothness parameter is so large that original higher order digital nets require more than the available finite-precision floating point representations.
References in corpus (13)
- Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high order
- Higher order QMC Galerkin discretization for parametric operator equations
- 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
- Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces
- The decay of the Walsh coefficients of smooth functions
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions
- Optimal order quasi-Monte Carlo integration in weighted Sobolev spaces of arbitrary smoothness
- Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration
- Optimal order quadrature error bounds for infinite-dimensional higher order digital sequences
- Richardson extrapolation of polynomial lattice rules
- Quasi-Monte Carlo integration using digital nets with antithetics