A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
[article]
2017
arXiv
pre-print
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
arXiv:1701.02525v1
fatcat:qoeyz6vksvaf5o7osgcnixo6be