Abstract

Digital nets are among the most successful methods to construct low-discrepancy point sets for quasi-Monte Carlo integration. Their quality is traditionally assessed by a measure called the t-value. A refinement computes the t-value of the projections over subsets of coordinates and takes a weighted average (or some other function) of these values. It is also of interest to compute the t-values of embedded nets obtained by taking subsets of the points. In this paper, we propose an efficient algorithm to compute such measures and we compare our approach with previously proposed methods both empirically and in terms of computational complexity.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.