IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v47y1999i1p159-164.html
   My bibliography  Save this article

Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators

Author

Listed:
  • Pierre L'Ecuyer

    (Université de Montréal, Montréal, Québec, Canada)

Abstract

Combining parallel multiple recursive sequences provides an efficient way of implementing random number generators with long periods and good structural properties. Such generators are statistically more robust than simple linear congruential generators that fit into a computer word. We made extensive computer searches for good parameter sets, with respect to the spectral test, for combined multiple recursive generators of different sizes. We also compare different implementations and give a specific code in C that is faster than previous implementations of similar generators.

Suggested Citation

  • Pierre L'Ecuyer, 1999. "Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators," Operations Research, INFORMS, vol. 47(1), pages 159-164, February.
    • Handle: RePEc:inm:oropre:v:47:y:1999:i:1:p:159-164
    DOI: 10.1287/opre.47.1.159
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.47.1.159
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.47.1.159?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Pierre L'Ecuyer & Raymond Couture, 1997. "An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 9(2), pages 206-217, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dwyer, Gerald Jr. & Williams, K. B., 2003. "Portable random number generators," Journal of Economic Dynamics and Control, Elsevier, vol. 27(4), pages 645-650, February.
    2. Schlottmann, Frank & Seese, Detlef, 2004. "A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 373-399, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pierre L'Ecuyer & Christiane Lemieux, 2000. "Variance Reduction via Lattice Rules," Management Science, INFORMS, vol. 46(9), pages 1214-1235, September.
    2. Pierre L'Ecuyer & Richard Simard, 2014. "On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 449-460, August.
    3. L'Ecuyer, Pierre & Andres, Terry H., 1997. "A random number generator based on the combination of four LCGs," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 44(1), pages 99-107.
    4. Hui-Chin Tang & Chiang Kao, 2004. "Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 284-290, August.
    5. L’Ecuyer, Pierre & Granger-Piché, Jacinthe, 2003. "Combined generators with components from different families," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 62(3), pages 395-404.
    6. Tang, Hui-Chin, 2005. "Reverse multiple recursive random number generators," European Journal of Operational Research, Elsevier, vol. 164(2), pages 402-405, July.
    7. L'Ecuyer, Pierre, 2004. "Random number generation," Papers 2004,21, Humboldt University of Berlin, Center for Applied Statistics and Economics (CASE).
    8. L’Ecuyer, Pierre & Simard, Richard, 2001. "On the performance of birthday spacings tests with certain families of random number generators," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 55(1), pages 131-137.
    9. Pierre L’Ecuyer & Paul Wambergue & Erwan Bourceret, 2020. "Spectral Analysis of the MIXMAX Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 135-144, January.
    10. Tang, Hui-Chin, 2006. "Theoretical analyses of forward and backward heuristics of multiple recursive random number generators," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1760-1768, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:47:y:1999:i:1:p:159-164. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.