Tractability properties of the discrepancy in Orlicz norms

@article{Dick2020TractabilityPO,
title={Tractability properties of the discrepancy in Orlicz norms},
author={Josef Dick and Aicke Hinrichs and Friedrich Pillichshammer and Joscha Prochno},
journal={J. Complex.},
year={2020},
volume={61},
pages={101468}
}

We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, e) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at most… Expand

This paper considers the worst case error of a quasi-Monte Carlo algorithm over the unit ball of a normed space of functions of d variables and indicates for which spaces of functions there exist quasi-monte Carlo algorithms whose worst case errors go to zero polynomially in n -1 and are independent of d or polynomial dependent on d.Expand

( 1 ) {xn}z= Xn--Z_I Zin-Ztn-I is uniformly distributed mod 1, i.e., if ( 2 ) lim (1/N)A(x, N, {xn}z)-x (0x<_ 1), where A(x, N, {Xn)) denotes the number of indices n, l<=n<=N such that {x} is less… Expand

The discrepancy function of a point set in the d-dimensional unit cube is a normalized measure for the deviation of the proportion of the number of points of the point set in an axes-parallel box… Expand

This comprehensive treatment of contemporary quasi-Monte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in research.Expand