Constructions of general polynomial lattice rules based on the weighted star discrepancy (Q2467335): Difference between revisions

The authors study algorithms for constructing polynomial lattice rules modulo arbitrary polynomials. This yields new constructions of digital nets and thus point sequences on the unit cube with small discrepancy. In an earlier paper algorithms were presented for lattice rules with respect to an irreducible polynomial, in the present paper arbitrary polynomials are considered. The authors present two types of constructions: a component by component one and a Korobov-type one. Numerical examples suggest that there is no essential difference between irreducible and reducible polynomials in this context.