I-binomial scrambling of digital nets and sequences

Journal of Complexity

Volumn 19, Issue 6, 2003, Pages 744-757

  Tezuka, Shu ^a   Faure, Henri ^b  

^a IBM RESEARCH TOKYO   (Japan)

^b AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Digital nets and sequences; Low discrepancy sequences; Randomized quasi Monte Carlo methods

Indexed keywords

EID: 0348233983     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0885-064X(03)00035-9     Document Type: Article

References (22)

1. H. Faure, Discrépance de suites associées à un système de numération en dimension s, Acta Arith. XLI (1982) 337-351.
2. H. Faure, Discrepancy lower bounds for special quasi-random sequences, in: H. Niederreiter, P. Hellekalek, G. Larcher, P. Zinterhof (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 1996, Springer, Berlin, 1998, pp. 232-237.
3. H. Faure, Variations on (0, s)-sequences, J. Complexity 17 (2001) 741-753.
4. H. Faure, S. Tezuka, Another random scrambling of digital (t, s)-sequences, in: K.T. Fang, F.J. Hickernell, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, Springer, Berlin, 2002, pp. 242-256.
5. S. Heinrich, F.Y. Hickernell, R.X. Yue, Optimal quadrature for Haar wavelet spaces, Math. Comp., to appear.
6. F.J. Hickernell, The mean square discrepancy of randomized nets, ACM Trans. Model. Comput. Simul. 6 (1996) 274-296.
7. F.J. Hickernell, H. Woźniakowski, The price of pessimism for multidimensional quadrature, J. Complexity 17 (2001) 625-659.
8. F.J. Hickernell, R.X. Yue, The mean square discrepancy of scrambled (t, s)-sequences, SIAM J. Numer. Anal. 38 (2001) 1089-1112.
9. 2-discrepancy for anchored boxes, J. Complexity 14 (1998) 527-556.
10. J. Matoušek, Geometric Discrepancy: An Illustrated Guide, Springer, Berlin, 1999.
11. H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, No. 63, SIAM, Philadelphia, 1992.
12. A.B. Owen, Monte Carlo variance of scrambled net quadrature, SIAM J. Numer. Anal. 34 (1997) 1884-1910.
13. A.B. Owen, Scrambled net variance for integrals of smooth functions. Ann. Statist. 25 (4) (1997) 1541-1562.
14. A.B. Owen, Monte Carlo, quasi-Monte Carlo, and randomized quasi-Monte Carlo, in: H. Niederreiter, J. Spanier (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 1998, Springer, Berlin, 2000, pp. 86-97.
15. I.H. Sloan, F. Kuo, S. Joe, On the step-by-step construction of quasi-Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces, Math. Comp., to appear.
16. I.H. Sloan, H. Woźniakowski, When are quasi-Monte Carlo algoritheorems efficient for high dimensional integrals?, J. Complexity 14 (1998) 1-33.
17. S. Tezuka, A generalization of Faure sequences and its efficient implementation, IBM Research Report, RT-0105, 1994.
18. S. Tezuka, Uniform Random Numbers: Theory and Practice, Kluwer Academic Publishers, Boston, 1995.
19. S. Tezuka, Quasi-Monte Carlo - discrepancy between theory and practice, in: K.T. Fang, F. Hickernell, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, Springer, Berlin, 2002, pp. 124-140.
20. J.F. Traub, A.G. Werschulz, Complexity and Information, Cambridge University Press, Cambridge, 1998.
21. H. Woźniakowski, Average case complexity of multidimensional integration, Bull. Amer. Math. Soc. 24 (1991) 185-194.
22. R.X. Yue, F.J. Hickernell, The discrepancy and gain coefficients of scrambled digital nets, J. Complexity 18 (2002) 135-151.