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

01/24/2022
by   Takashi Goda, et al.
0

We study quasi-Monte Carlo (QMC) integration of smooth functions defined over the multi-dimensional unit cube. Inspired by a recent work of Pan and Owen, we study a new construction-free median QMC rule which can exploit the smoothness and the weights of function spaces adaptively. For weighted Korobov spaces, we draw a sample of r independent generating vectors of rank-1 lattice rules, compute the integral estimate for each, and approximate the true integral by the median of these r estimates. For weighted Sobolev spaces, we use the same approach but with the rank-1 lattice rules replaced by high-order polynomial lattice rules. A major advantage over the existing approaches is that we do not need to construct good generating vectors by a computer search algorithm, while our median QMC rule achieves almost the optimal worst-case error rate for the respective function space with any smoothness and weights, with a probability that converges to 1 exponentially fast as r increases. Numerical experiments illustrate and support our theoretical findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2022

A universal median quasi-Monte Carlo integration

We study quasi-Monte Carlo (QMC) integration over the multi-dimensional ...
research
09/23/2021

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

We study a randomized quadrature algorithm to approximate the integral o...
research
08/29/2022

A note on the CBC-DBD construction of lattice rules with general positive weights

Lattice rules are among the most prominently studied quasi-Monte Carlo m...
research
07/05/2019

Exploration of a Cosine Expansion Lattice Scheme

In this article, we combine a lattice sequence from Quasi-Monte Carlo ru...
research
04/20/2023

Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration

We show that a very simple randomised algorithm for numerical integratio...
research
12/22/2021

Preintegration is not smoothing when monotonicity fails

Preintegration is a technique for high-dimensional integration over d-di...

Please sign up or login with your details

Forgot password? Click here to reset