skip to main content
article

Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator

Published:01 March 2003Publication History
Skip Abstract Section

Abstract

An algorithm to generate Sobol' sequences to approximate integrals in up to 40 dimensions has been previously given by Bratley and Fox in Algorithm 659. Here, we provide more primitive polynomials and "direction numbers" so as to allow the generation of Sobol' sequences to approximate integrals in up to 1111 dimensions. The direction numbers given generate Sobol' sequences that satisfy Sobol's so-called Property A.

References

  1. Acworth, P. A., Broadie, M., and Glasserman, P. 1998. A comparison of some Monte Carlo and quasi-Monte Carlo techniques for option pricing. In Monte Carlo and Quasi-Monte Carlo Methods 1996, H. Niederreiter, P. Hellekalek, G. Larcher, and P. Zinterhof, Eds. Lecture Notes in Statistics, vol. 127. Springer, New York, 1--18.]]Google ScholarGoogle Scholar
  2. Antonov, I. A. and Saleev, V. M. 1979. An economic method of computing LPτ-sequences. Zh. v&ymacr;chisl. Mat. mat. Fiz. 19, 243--245. English translation: U.S.S.R. Comput. Maths. Math. Phys. 19, 252--256.]]Google ScholarGoogle Scholar
  3. Bratley, P. and Fox, B. L. 1988. Algorithm 659: Implementing Sobol's quasirandom sequence generator. ACM Trans. Math. Softw. 14, 88--100.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Cheng, J. and Druzdzel, M. J. 2000. Computational investigation of low-discrepancy sequences in simulation algorithms for Bayesian networks. In Proceedings of the 16th Annual Conference on Uncertainty in Artificial Intelligence, C. Boutilier and M. Goldszmidt, Eds. Morgan-Kaufmann, San Francisco, Calif., 72--81.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Fox, B. L. 1986. Algorithm 647: Implementation and relative efficiency of quasirandom sequence generators. ACM Trans. Math. Softw. 12, 362--376.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Morokoff, W. J. and Caflisch, R. E. 1994. Quasi-random sequences and their discrepancies. SIAM J. Sci. Comput. 15, 1251--1279.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Niederreiter, H. 1992. Random Number Generation and Quasi-Monte Carlo methods. SIAM, Philadelphia, Pa.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Paskov, S. H. and Traub, J. F. 1995. Faster valuation of financial derivatives. J. Portf. Manage. 22, 113--120.]]Google ScholarGoogle ScholarCross RefCross Ref
  9. Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P. 1992. Numerical Recipes in Fortran 77: The Art of Scientific Computing, 2nd ed. Cambridge University Press, Cambridge, U.K.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sloan, I. H., Kuo, F. Y., and Joe, S. 2002. Constructing randomly shifted lattice rules in weighted Sobolev spaces. SIAM J. Numer. Anal. 40, 1650--1665.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Sobol', I. M. 1967. On the distribution of points in a cube and the approximate evaluation of integrals. Zh. v&ymacr;chisl. Mat. mat. Fiz. 7, 784--802. English translation: U.S.S.R. Comput. Maths. Math. Phys. 7, 86--112.]]Google ScholarGoogle Scholar
  12. Sobol', I. M. 1976. Uniformly distributed sequences with an additional uniform property. Zh. v&ymacr;chisl. Mat. mat. Fiz. 16, 1332--1337. English translation: U.S.S.R. Comput. Maths. Math. Phys. 16, 236--242.]]Google ScholarGoogle Scholar
  13. Sobol', I. M. and Levitan, Y. L. 1976. The production of points uniformly distributed in a multidimensional cube. Tech. Rep. 40, Institute of Applied Mathematics, USSR Academy of Sciences. (In Russian).]]Google ScholarGoogle Scholar
  14. Wang, X. and Fang, K.-T. 2002. The effective dimensions and quasi-Monte Carlo integration. J. Complexity, submitted for publication.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Mathematical Software
      ACM Transactions on Mathematical Software  Volume 29, Issue 1
      March 2003
      94 pages
      ISSN:0098-3500
      EISSN:1557-7295
      DOI:10.1145/641876
      Issue’s Table of Contents

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 March 2003
      Published in toms Volume 29, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader