Abstract
Halton's low discrepancy sequence is still very popular in spite of its shortcomings with respect to the correlation between points of two-dimensional projections for large dimensions. As a remedy, several types of scrambling and/or randomization for this sequence have been proposed. We examine empirically some of these by calculating their L ∞ - and L 2 -discrepancies ( D ∗ resp. T ∗ ), and by performing integration tests. Most investigated sequence types give practically equivalent results for D ∗ , T ∗ , and the integration error, with two exceptions: random shift sequences are in some cases less efficient, and the shuffled Halton sequence is no more efficient than a pseudo-random one. However, the correlation mentioned above can only be broken with digit-scrambling methods, even though the average correlation of many randomized sequences tends to zero.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
