Skip to main content

Monte Carlo Methods Using New Class of Congruential Generators

  • Conference paper
ICT Innovations 2011 (ICT Innovations 2011)

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 150))

Included in the following conference series:

Abstract

In this paper we propose a new class of congruential pseudo random number generator based on sequences generating permutations. These sequences have been developed for other applications but our analysis and experiments show that they are appropriate for approximation of multiple integrals and integral equations.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Broy, M.: Software engineering — from auxiliary to key technologies. In: Broy, M., Dener, E. (eds.) Software Pioneers, pp. 10–13. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Dod, J.: Effective substances. In: The Dictionary of Substances and Their Effects. Royal Society of Chemistry (1999), DIALOG, http://www.rsc.org/dose/titleofsubordinatedocument. (cited January 15, 1999)

  3. Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer, Boston (1992)

    Book  MATH  Google Scholar 

  4. Hamburger, C.: Quasimonotonicity, regularity and duality for nonlinear systems of partial differential equations. Ann. Mat. Pura. Appl. 169, 321–354 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Atanassov, E., Karaivanova, A., Gurov, T., Ivanovska, S., Durchova, M., Dimitrov, D.: Quasi-Monte Carlo integration on the grid for sensevity studies. Earth Sci. Inform. 3, 289–296 (2010)

    Article  Google Scholar 

  6. Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13, 850–864 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Goldreich, O.: Pseudorandomness. Notices 46(10), 1209–1216 (1999)

    MathSciNet  MATH  Google Scholar 

  8. Gurov, T.V., Dimov, I.T.: A Parallel Monte Carlo Method for Electron Quantum Kinetic Equation. In: Lirkov, I., Margenov, S., Waśniewski, J., Yalamov, P. (eds.) LSSC 2003. LNCS, vol. 2907, pp. 153–161. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Kolmogorov, A.: Three approaches to the concept of the amount of information. Probl. Inf. Transm. 1(1), 1–7 (1965)

    MathSciNet  Google Scholar 

  10. L’Ecuyer, P.: Uniform random number generation. Annals of Operations Research 53, 77–120 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. L’Ecuyer, P.: Uniform random number generation. In: Henderson, S.G., Nelson, B.L. (eds.) Ch. 3, Simulation, Handbooks in Operations Research and Management Science, pp. 55–81. Elsevier, Amsterdam (2006)

    Google Scholar 

  12. L’Ecuyer, P.: Pseudorandom Number Generators, in Encyclopedia of Quantitative Finance. In: Cont, R. (ed.) Simulation Methods in Financial Engineering, pp. 1431–1437. John Wiley, Chichester (2010)

    Google Scholar 

  13. Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York (1993)

    Book  MATH  Google Scholar 

  14. Manev, N.: Sequences generating permutations. Applied Mathematics and Computation 216, 708–718 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nedjalkov, M., Gurov, T.V., Kosina, H., Whitlock, P.A.: Statistical Algorithms for Simulation of Electron Quantum Kinetics in Semiconductors - Part II. In: Margenov, S., Waśniewski, J., Yalamov, P. (eds.) LSSC 2001. LNCS, vol. 2179, pp. 183–190. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Owen, A.: The dimension distribution and quadrature test functions. Stat. Sin. 13, 1–17 (2003)

    MathSciNet  MATH  Google Scholar 

  17. Schmid, W., Uhl, A.: Techniques for parallel quasi-Monte Carlo integration with digital sequences and associated problems. Math. Comp. Sim. 55, 249–257 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to T. Gurov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Gurov, T., Ivanovska, S., Karaivanova, A., Manev, N. (2012). Monte Carlo Methods Using New Class of Congruential Generators. In: Kocarev, L. (eds) ICT Innovations 2011. ICT Innovations 2011. Advances in Intelligent and Soft Computing, vol 150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28664-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28664-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28663-6

  • Online ISBN: 978-3-642-28664-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics