L_p- and S_{p,q}^rB-discrepancy of (order 2) digital nets
arXiv:1402.4424 · doi:10.4064/aa168-2-4
Abstract
Dick proved that all order digital nets satisfy optimal upper bounds of the -discrepancy. We give an alternative proof for this fact using Haar bases. Furthermore, we prove that all digital nets satisfy optimal upper bounds of the -discrepancy for a certain parameter range and enlarge that range for order digitals nets. -, - and -discrepancy is considered as well.
Cited by in corpus (4)
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions
- Optimal -discrepancy bounds for second order digital sequences
- The curse of dimensionality for the -discrepancy with finite
- The -adic symmetrization of digital nets for quasi-Monte Carlo integration