Full metadata record
DC FieldValueLanguage
dc.contributor.authorDeng, Lih-Yuanen_US
dc.contributor.authorShiau, Jyh-Jen Horngen_US
dc.contributor.authorLu, Henry Horng-Shingen_US
dc.date.accessioned2014-12-08T15:22:32Z-
dc.date.available2014-12-08T15:22:32Z-
dc.date.issued2012-07-01en_US
dc.identifier.issn0377-0427en_US
dc.identifier.urihttp://hdl.handle.net/11536/15937-
dc.description.abstractUtilizing some results in number theory, we propose an efficient method to speed up the computer search of large-order maximum-period Multiple Recursive Generators (MRGs). We conduct the computer search and identify many efficient and portable MRGs of order up to 25,013, which have the equi-distribution property in up to 25,013 dimensions and the period lengths up to 10(233,361) approximately. In addition, a theoretical test is adopted to further evaluate and compare these generators. An extensive empirical study shows that these generators behave well when tested with the stringent Crush battery of the test package TestU01. (C) 2012 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectEmpirical testsen_US
dc.subjectEqui-distributionen_US
dc.subjectFactorizationen_US
dc.subjectPortable and efficient generatorsen_US
dc.subjectDX/DL/DS generatorsen_US
dc.subjectPrimality testingen_US
dc.titleEfficient computer search of large-order multiple recursive pseudo-random number generatorsen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICSen_US
dc.citation.volume236en_US
dc.citation.issue13en_US
dc.citation.epage3228en_US
dc.contributor.department統計學研究所zh_TW
dc.contributor.departmentInstitute of Statisticsen_US
dc.identifier.wosnumberWOS:000303700000013-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000303700000013.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.