Ralph Kritzinger

Ralph Kritzinger, Helene Laimer, Mario Neumüller

The weighted star discrepancy is a quantitative measure for the performance of point sets in quasi-Monte Carlo algorithms for numerical integration. We consider polynomial lattice point sets, whose generating vectors can be obtained by a component-by-component construction to ensure a small weighted star discre-pancy. Our aim is to significantly reduce the construction cost of such generating vectors by restricting the size of the set of polynomials from which we select the components of the vectors. To gain this reduction we exploit the fact that the weights of the spaces we consider decay very fast.

Ralph Kritzinger

We study the local discrepancy of a symmetrized version of the well-known van der Corput sequence and of modified two-dimensional Hammersley point sets in arbitrary base $b$. We give upper bounds on the norm of the local discrepancy in Besov spaces of dominating mixed smoothness $S_{pq}^rB([0,1)^s)$, which will also give us bounds on the $L_p$-discrepancy. Our sequence and point sets will achieve the known optimal order for the $L_p$- and $S_{pq}^rB$-discrepancy. The results in this paper generalize several previous results on $L_p$- and $S_{pq}^rB$-discrepancy estimates and provide a sharp upper bound on the $S_{pq}^rB$-discrepancy of one-dimensional sequences for $r>0$. We will use the $b$-adic Haar function system in the proofs.