IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2025i4p1100-1115.html
   My bibliography  Save this article

Efficient spectral tests for multiple recursive generators

Author

Listed:
  • Lih-Yuan Deng
  • Bryan R. Winter
  • Jyh-Jen Horng Shiau
  • Henry Horng-Shing Lu
  • Nirman Kumar
  • Ching-Chi Yang

Abstract

Large-order maximum-period Multiple Recursive Generators (MRGs) have become popular in the area of computer simulation. They have the nice properties of high-dimensional equi-distribution, generating efficiency, long period, and portability. The spectral test is a commonly used criterion for ranking pseudo-random number generators. Procedures for computing the spectral test values of MRGs are available in the literature but may not be efficient when the order of the MRG is large. In this article, we propose a novel method for the spectral test computation of MRGs that is simple, intuitive, and particularly efficient for MRGs with few non zero terms. With the proposed method, we are able to provide a list of ready-to-use “better” generators with respect to the spectral test performance among the DX generators of order k for various values of k.

Suggested Citation

  • Lih-Yuan Deng & Bryan R. Winter & Jyh-Jen Horng Shiau & Henry Horng-Shing Lu & Nirman Kumar & Ching-Chi Yang, 2025. "Efficient spectral tests for multiple recursive generators," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(4), pages 1100-1115, February.
    • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:4:p:1100-1115
    DOI: 10.1080/03610926.2024.2329772
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2329772
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2024.2329772?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:54:y:2025:i:4:p:1100-1115. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.