Abstract
A class of uniform pseudorandom number generators is proposed for modeling and simulations on massively parallel computers. The algorithm is simple, nonrecursive, and is easily transported to serial or vector computers. We have tested the procedure for uniformity, independence, and correlations by several methods. Related, less complex sequences passed some of these tests well enough; however, inadequacies were revealed by tests for correlations and in an interesting application, namely, annealing from an initial lattice that is mechanically unstable. In the latter case, initial velocities chosen by a random number generator that is not sufficiently random lead quickly to unphysical regularity in grain structure. The new class of generators passes this dynamical diagnostic for unwanted correlations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.