Good permutations for deterministic scrambled Halton sequences in terms of L2-discrepancy

作者:

Highlights:

摘要

One of the best known low-discrepancy sequences, used by many practitioners, is the Halton sequence. Unfortunately, there seems to exist quite some correlation between the points from the higher dimensions. A possible solution to this problem is the so-called scrambling.In this paper, we give an overview of known scrambling methods, and we propose a new way of scrambling which gives good results compared to the others in terms of L2-discrepancy. On top of that, our new scrambling method is very easy to implement.

论文关键词:Halton sequence,Low-discrepancy sequences,Numerical integration,(quasi)-Monte Carlo,Scrambling

论文评审过程:Received 16 September 2004, Available online 26 July 2005.

论文官网地址:https://doi.org/10.1016/j.cam.2005.05.022