Skip to main content

Generating and Testing the Modified Halton Sequences

  • Conference paper
  • First Online:
Numerical Methods and Applications (NMA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2542))

Included in the following conference series:

Abstract

The Halton sequences are one of the most popular low-sdiscrepancy sequences, used for calculating multi-dimensional integrals or in quasi-Monte Carlo simulations. Various techniques for their randomization exist. One of the authors proved that for one such modification an estimate of the discrepancy with a very small constant before the leading term can be proved. In this paper we describe an efficient algorithm for generating these sequences on computers and show timing results, demonstrating the efficiency of the algorithm. We also compare the integration error of these sequences with that of the classical Halton sequences on families of functions widely used for such benchmarking purposes. The results demonstrate that the modified Halton sequences can be used successfully in quasi-Monte Carlo methods.

Supported by the project of European Commission — BIS 21 under contract ICA1- CT-2000-70016 and by the Ministry of Education and Science of Bulgaria under contract NSF I-1201/02 and NSF MM-902/99

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atanassov, E.I.: On the discrepancy of the Halton sequences. Mathematica Balkanika (accepted for publication).

    Google Scholar 

  2. Bratley, P., Fox, B.: Algorithm 659: Implementing Sobol’s quasirandom sequence generator. ACM Transactions on Mathematical Software (TOMS), Vol. 14, 1, ACM Press, New York, NY, USA (1988) 88–100.

    Google Scholar 

  3. Faure, H.: Discrépance de suites associées à un système de numéracion (en dimension un). H. Bull. Soc. Math. France, 109 (1981) 143–182.

    MATH  MathSciNet  Google Scholar 

  4. Halton, J.H.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. math. 2 (1960) 84–90. Error

    Article  MathSciNet  Google Scholar 

  5. Lecot, C.: An algorithm for generating low discrepancy sequences on vector computers. Parallel Computing, 11 (1989) 113–116.

    Article  MATH  Google Scholar 

  6. Ökten, G., Srinivasan, A.: Parallel Quasi-Monte Carlo Methods on a Heterogeneous Cluster. In: Fang, K. T., Hickernell, F. J., and Niederreiter, H. (eds.): Monte Carlo and Quasi-Monte Carlo Methods 2000. Springer-Verlag, Berlin (2002) 406–421

    Google Scholar 

  7. Schmidt, W. Ch., Uhl, A.: Tehniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems. Mathematics and Computers in Simulation, Vol. 55, 1-3, North-Holland (2001) 249–257.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atanassov, E.I., Durchova, M.K. (2003). Generating and Testing the Modified Halton Sequences. In: Dimov, I., Lirkov, I., Margenov, S., Zlatev, Z. (eds) Numerical Methods and Applications. NMA 2002. Lecture Notes in Computer Science, vol 2542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36487-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-36487-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00608-4

  • Online ISBN: 978-3-540-36487-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics