Abstract

The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the $d$-dimensional unit cube ${[0,1]}^d$. The figures of merit are three different variants of the $L_2$ discrepancy. Theoretical results along with numerical experiments suggest that the resulting sequences have excellent distribution properties. The approach we follow here is motivated by recent work of Steinerberger and Pausinger who consider similar greedy algorithms, where they minimize functionals that can be related to the star discrepancy or energy of point sets. In contrast to many greedy algorithms, where the resulting elements of the sequence can only be given numerically, we will find that in the one-dimensional case our algorithms yield rational numbers which we can describe precisely. In particular, we will observe that any initial segment of a sequence in $[0,1)$ can be naturally extended to a uniformly distributed sequence where all subsequent elements are of the form $x_N=(2n-1)∕(2N)$ for some $n\in \{1,\dots <!--FUNCTION\; APPLICATION-->,N\}$. We will also investigate the dependence of the $L_2$ discrepancy of the resulting sequences on the dimension $d$.

Keywords

Mathematical Subject Classification

Milestones

Authors