Extensible hyperplane nets (Q640003): Difference between revisions

The authors give the construction algorithm for hyperplane nets (a generalization of polynomial lattice point sets), and prove that the constructed hyperplane nets are extensible and good with respect to a certain quality criterion. They also give some pure existence results for extensible hyperplane nets of good quality with respect to the worst-case integration error or the star discrepancy. Moreover, some numerical examples and discussions are also given.