Randomized Halton Sequences

نویسندگان

  • Xiaoqun Wang
  • Fred J. Hickernell
چکیده

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: we randomize the start point of each component 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 eeciency improvement over standard Monte Carlo under rather general conditions. Numerical results show that randomized Halton sequences have better performance than not only Monte Carlo, but also randomly shifted Halton sequences and (single long) purely deterministic skipped Halton sequence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation Estimation of Mixed Discrete Choice Models Using Randomized and Scrambled Halton Sequences

The use of simulation techniques has been increasing in recent years in the transportation and related fields to accommodate flexible and behaviorally realistic structures for analysis of decision processes. This paper proposes a randomized and scrambled version of the Halton sequence for use in simulation estimation of discrete choice models. The scrambling of the Halton sequence is motivated ...

متن کامل

A note on corner avoidance of random-start Halton sequences

Recently, the analysis of quasi-Monte Carlo (QMC) sampling of integrands with singularities gained considerable interest. In this setting error bounds for QMC integration, in addition to discrepancy, include a measure how well the singularities are avoided by the utilized sequences. The article aims to generalize results for the corner avoidance of the classical Halton sequence to Halton sequen...

متن کامل

Random and Deterministic Digit Permutations of the Halton Sequence*

The Halton sequence is one of the classical low-discrepancy sequences. It is effectively used in numerical integration when the dimension is small, however, for larger dimensions, the uniformity of the sequence quickly degrades. As a remedy, generalized (scrambled) Halton sequences have been introduced by several researchers since the 1970s. In a generalized Halton sequence, the digits of the o...

متن کامل

Generating and Testing the Modified Halton Sequences

The Halton sequences are one of the most popular lowdiscrepancy sequences, used for calculating multi-dimensional integrals or in quasi-Monte Carlo simulations. Various techniques for their randomization exist. One of the authors proved that for one such modification an estimate of the discrepancy with a very small constant before the leading term can be proved. In this paper we describe an eff...

متن کامل

Extensions of Atanassov’s methods for Halton sequences

We extend Atanassov’s methods for Halton sequences in two different directions: (1) in the direction of Niederreiter (t,s)−sequences, (2) in the direction of generating matrices for Halton sequences. It is quite remarkable that Atanassov’s method for classical Halton sequences applies almost “word for word” to (t,s)−sequences and gives an upper bound quite comparable to those of Sobol’, Faure a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000