Efficient generation of parallel quasirandom faure sequences via scrambling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4487 LNCS, Issue , 2007, Pages 723-730

  Chi, Hongmei ^a,b   Mascagni, Michael ^a,c  

^a FLORIDA STATE UNIVERSITY   (United States)

^b FLORIDA A AND M UNIVERSITY   (United States)

^c Florida State University   (United States)

Author keywords

Faure sequence; Optimal sequences; Parallel computing; Quasi Monte Carlo; Scrambling

Indexed keywords

COMPUTATION THEORY; MATRIX ALGEBRA; MONTE CARLO METHODS; RANDOM PROCESSES;

FAURE SEQUENCE; OPTIMAL SEQUENCES; SCRAMBLING;

PARALLEL PROCESSING SYSTEMS;

EID: 37349079133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72584-8_96     Document Type: Conference Paper

References (23)

1. P. Beerli and H. Chi. Quasi-markov chain Monte Carlo to improve inference of population genetic parameters. Mathematics and Computers in Simulation, page In press, 2007.
2. B.C. Bromley. Quasirandom number generators for parallel Monte Carlo algorithms. Journal of Parallel and Distributed Computing, 38(1):101-104, 1996.
3. H. Chi, M. Mascagni, and T. Warnock. On the optimal Halton sequences. Mathematics and Computers in Simulation, 70/1:9-21, 2005.
4. H. Faure. Discrepancy of sequences associated with a number system(in dimension s). Acta. Arith, 41(4):337-351, 1982[French].
5. H. Faure. Variations on(0,s)-sequences. Journal of Complexity, 17(4):741-753, 2001.
6. B. Fox. Implementation and relative efficiency of quasirandom sequence generators. ACM Trans. on Mathematical Software, 12:362-376, 1986.
7. W. Jank. Efficient simulated maximum likelihood with an application to online retailing. Statistics and Computing, 16:111-124, 2006.
8. L. Kocis and W. Whiten. Computational investigations of low discrepancy sequences. ACM Trans. Mathematical software, 23:266-294, 1997.
9. Y. Li and M. Mascagni. Analysis of large-scale grid-based Monte Carlo applications. International Journal of High Performance Computing Applications, 17(4):369-382, 2003.
10. K. Liu and F. J. Hickernell. A scalable low discrepancy point generator for parallel computing. In Lecture Notes in Computer Science 3358, volume 3358, pages 257-262, 2004.
11. W. L. Loh. On the asymptotic distribution of scrambled net quadrature. Annals of Statistics, 31:1282-1324, 2003.
12. M. Mascagni and H. Chi. Parallel linear congruential generators with Sophie-Germain moduli. Parallel Computing, 30:1217-1231, 2004.
13. M. Mascagni and A. Srinivasan. Algorithm 806: SPRNG: A scalable library for pseudorandom number generation. ACM Transactions on Mathematical Software, 26:436-461, 2000.
14. H. Niederreiter. Random number generation and quasi-Monte Carlo methods. SIAM, Philadephia, 1992.
15. A. B. Owen. Randomly permuted (t,m, s)-nets and (t, s)-sequences. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, 106 in Lecture Notes in Statistics:299-317, 1995.
16. A. B. Owen and S. Tribble. A quasi-Monte Carlo metroplis algorithm. Proceedings of the National Academy of Sciences of the United States of America, 102:8844-8849, 2005.
17. A. Papageorgiou and J. Traub. Beating Monte Carlo. RISK, 9:63-65, 1997.
18. W. Schmid and A. Uhl. Techniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems. Math. Comput. Simulat, 55(1-3):249-257, 2001.
19. I. M. Soboĺ Uniformly distributed sequences with additional uniformity properties. USSR Comput. Math. and Math. Phy., 16:236-242, 1976.
20. S. Tezuka. Uniform Random Numbers, Theory and Practice. Kluwer Academic Publishers, IBM Japan, 1995.
21. S. Tezuka and H. Faure. I-binomial scrambling of digital nets and sequences. Journal of Complexity, 19(6):744-757, 2003.
22. S. Tezuka and T. Tokuyama. A note on polynomial arithmetic analogue of Halton sequences. ACM Trans. on Modelling and Computer Simulation, 4:279-284, 1994.
23. X. Wang and K.T. Fang. The effective dimension and quasi-monte carlo. Journal of Complexity, 19(2):101-124, 2003.