Journal
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
Volume 29, Issue 2, Pages 95-109Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/779359.779360
Keywords
algorithms; scrambling; digital net
Ask authors/readers for more resources
Random scrambling of deterministic (t, m, s)-nets and (t, s)-sequences eliminates their inherent bias while retaining their low-discrepancy properties. This article describes an implementation of two types of random scrambling, one proposed by Owen and another proposed by Faure and Tezuka. The four different constructions of digital sequences implemented are those proposed by Sobol', Faure, Niederreiter, and Niederreiter and Xing. Because the random scrambling involves manipulating all digits of each point, the code must be written carefully to minimize the execution time. Computed root mean square discrepancies of the scrambled sequences are compared to known theoretical results. Furthermore, the performances of these sequences on various test problems are discussed.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available