Sequential random integer generator

Published: 1 January 1976| Version 1 | DOI: 10.17632/xwcgrnbm22.1
C.T.K. Kuo, T.W. Cadman, R.J. Arsenault


Title of program: SRNG Catalogue Id: ACIE_v1_0 Nature of problem An algorithm to generate a subset of random integers from a larger set of integers has been developed to minimize both the computing time and the memory space. The algorithm deals with the whole array at the same time, generates a subset of random integers for a given percentage of the range, and the generated subset of random integers is obtained as sequentially increasing numbers. Such random integers are used to specify thepositions of randomly dispersed impurity atoms or solute atoms in many ... Versions of this program held in the CPC repository in Mendeley Data ACIE_v1_0; SRNG; 10.1016/0010-4655(76)90065-5 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method