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

10/05/2019
by   Pierre Marion, et al.
0

Digital nets are among the most successful methods to construct low-discrepancy point sets for quasi-Monte Carlo integration. Their quality is traditionally assessed by a measure called the t-value. A refinement computes the t-value of the projections over subsets of coordinates and takes a weighted average (or some other function) of these values. It is also of interest to compute the t-values of embedded nets obtained by taking subsets of the points. In this paper, we propose an efficient algorithm to compute such measures and we compare our approach with previously proposed methods both empirically and in terms of computational complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2022

Digital Nets and Sequences for Quasi-Monte Carlo Methods

Quasi-Monte Carlo methods are a way of improving the efficiency of Monte...
research
02/25/2021

Digital almost nets

Digital nets (in base 2) are the subsets of [0,1]^d that contain the exp...
research
06/19/2021

The nonzero gain coefficients of Sobol's sequences are always powers of two

When a plain Monte Carlo estimate on n samples has variance σ^2/n, then ...
research
12/18/2020

A Tool for Custom Construction of QMC and RQMC Point Sets

We present LatNet Builder, a software tool to find good parameters for l...
research
09/15/2020

Weighted integration over a cube based on digital nets and sequences

Quasi-Monte Carlo (QMC) methods are equal weight quadrature rules to app...
research
12/18/2020

On the distribution of scrambled (0,m,s)-nets over unanchored boxes

We introduce a new quality measure to assess randomized low-discrepancy ...
research
07/11/2022

Improved bounds on the gain coefficients for digital nets in prime base

We study randomized quasi-Monte Carlo integration by scrambled nets. The...

Please sign up or login with your details

Forgot password? Click here to reset