Weighted integration over a cube based on digital nets and sequences

09/15/2020
by   Josef Dick, et al.
0

Quasi-Monte Carlo (QMC) methods are equal weight quadrature rules to approximate integrals over the unit cube with respect to the uniform measure. In this paper we discuss QMC integration with respect to general product measures defined on an arbitrary cube. We only require that the cumulative distribution function is invertible. We develop a worst-case error bound and study the dependence of the error on the number of points and the dimension for digital nets and sequences as well as polynomial lattice point sets, which are mapped to the domain using the inverse cumulative distribution function. We do not require any smoothness properties of the probability density function and the worst-case error does not depend on the particular choice of density function and its smoothness. The component-by-component construction of polynomial lattice rules is based on a criterion which depends only on the size of the cube but is otherwise independent of the product measure.

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
05/19/2023

The fast reduced QMC matrix-vector product

We study the approximation of integrals ∫_D f(x^⊤ A) dμ(x), where A is a...
research
12/23/2019

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...
research
10/12/2022

Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series

In this note, we prove that the following function space with absolutely...
research
04/28/2023

Quasi-Monte Carlo methods for mixture distributions and approximated distributions via piecewise linear interpolation

We study numerical integration over bounded regions in ℝ^s, s≥1 with res...
research
03/03/2023

The curse of dimensionality for the L_p-discrepancy with finite p

The L_p-discrepancy is a quantitative measure for the irregularity of di...
research
10/05/2019

An algorithm to compute the t-value of a digital net and of its projections

Digital nets are among the most successful methods to construct low-disc...

Please sign up or login with your details

Forgot password? Click here to reset