THE MULTIPLE PRIME RANDOM NUMBER GENERATOR

被引:10
|
作者
HAAS, A [1 ]
机构
[1] MERCURY CONSOLIDATED INC,CINCINNATI,OH
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 1987年 / 13卷 / 04期
关键词
COMPUTER PROGRAMMING - Algorithms - COMPUTER PROGRAMMING LANGUAGES - FORTRAN;
D O I
10.1145/35078.214349
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A new pseudorandom number generator, the Multiple Prime Random Number Generator, has been developed; it is efficient, conceptually-simple, flexible, and easy to program. The generator utilizes cycles around prime numbers to guarantee the length of the period, which can easily be programmed to surpass the maximum period of any other presently available random number generator. There are minimum limits placed on the seed values of the variables because the period of the generator is not a function of the initial values of the variables. The generator passes thirteen standard random number generator tests. It requires only about fifteen lines of FORTRAN code to program and utilizes programming language constructs found in most major languages. Finally, it compares very favorably to the fastest of the other available generators.
引用
收藏
页码:368 / 381
页数:14
相关论文
共 50 条