Multiplicative, congruential random-number generators with multiplier +/-2(k1)+/-2(k2) and modulus 2(p)-1

檔案

日期

1997-06-01

作者

期刊名稱

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

摘要

The demand for random numbers in scientific applications is increasing. However, the most widely used multiplicative, congruential random-number generators with modulus 2(31) - 1 have a cycle length of about 2.1 X 10(9). Moreover, developing portable and efficient generators with a larger modulus such as 2(61) - 1 is more difficult than those with modulus 2(31) - 1. This article presents the development of multiplicative, congruential generators with modulus m = 2(p) - 1 and four forms of multipliers: 2(k1) - 2(k2), 2(k1) + 2(k2), m - 2(k1) + 2(k2), and m - 2(k1) - 2(k2), k1 > k2. The multipliers for modulus 2(31) - 1 and 2(61) - 1 are measured by spectral tests, and the best ones are presented. The generators with these multipliers are portable and very fast. They have also passed several empirical tests, including the frequency test, the run test, and the maximum-of-t test.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Wu, P. (1997). Multiplicative, congruential random-number generators with multiplier +/-2(k1)+/-2(k2) and modulus 2(p)-1. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 23(2), 255–265. https://ir.lib.nycu.edu.tw/handle/11536/515

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/515