Randomized Halton sequences

108Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

The Halton sequence is a well-known multi-dimensional low-discrepancy sequence. In this paper, we propose a new method for randomizing the Halton sequence. This randomization makes use of the description of Halton sequence using the von Neumann-Kakutani transformation. We randomize the starting point of the sequence. This method combines the potential accuracy advantage of Halton sequence in multi-dimensional integration with the practical error estimation advantage of Monte Carlo methods. Theoretically, using multiple randomized Halton sequences as a variance reduction technique we can obtain an efficiency improvement over standard Monte Carlo. Numerical results show that randomized Halton sequences have better performance not only than Monte Carlo, but also than randomly shifted Halton sequences. They have similar performance with the randomly digit-scrambled Halton sequences but require much less generating time. (C) 2000 Elsevier Science Ltd.

Cite

CITATION STYLE

APA

Wang, X., & Hickernell, F. J. (2000). Randomized Halton sequences. Mathematical and Computer Modelling, 32(7–8), 887–899. https://doi.org/10.1016/S0895-7177(00)00178-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free