Monto Carlo extension of quasi-Monte Carlo
Proceedings of the 30th conference on Winter simulation
Measuring the Performance of a Power PC Cluster
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Monte Carlo and Quasi-Monte Carlo Algorithms for the Barker-Ferry Equation with Low Complexity
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
A hybrid Monte Carlo method for simulation of quantum transport
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Quasi-random approach in the grid application SALUTE
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
A quasi-monte carlo method for an elastic electron back-scattering problem
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
On the scrambled soboĺ sequence
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Tuning the generation of sobol sequence with owen scrambling
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Constructions of (t ,m,s)-nets and (t,s)-sequences
Finite Fields and Their Applications
Sensitivity study of heston stochastic volatility model using GPGPU
LSSC'11 Proceedings of the 8th international conference on Large-Scale Scientific Computing
| Hi-index | 0.00 |
The Sobol' sequence is the most widely deployed low-discrepancy sequence, and is used for calculating multi-dimensional integrals and in quasi-Monte Carlo simulation. Owen first proposed the idea of scrambling this sequence in a manner that maintained its low discrepancy. One of his motivations was to use these scrambled sequences to provide quasi-Monte Carlo methods with simple error estimates like those in normal Monte Carlo. In fact, it is now common for the Sobol' sequence as well as (t, m, s)-nets and (t, s)-sequences to be used with scrambling. However, many have pointed out that scrambling is often difficult to implement and time consuming. In this paper we describe a new generation algorithm that allows consecutive terms of the scrambled Sobol' sequence to be obtained with essentially only two operations per coordinate: one floating point addition and one bit-wise xor operation. Note: this omits operations that are needed only once per tuple. This scrambling is achieved at no additional computational cost over that of unscrambled generation as it is accomplished totally in the initialization. In addition, the terms of the sequence are obtained in their normal order, without the usual permutation introduced by Gray code ordering used to minimize the cost of computing the next Sobol' element. This algorithm is relatively simple and is quite suitable for parallelization and vectorization. An example implementation of the algorithm, written in pseudo-code is presented. Possible improvements of the algorithm are discussed along with the presentation of some timing results.