✦ LIBER ✦

Pseudorandom number generators for personal computers II

✍ Scribed by Kenneth G. Hamilton

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 693 KB
Volume: 78
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(93)90152-3

No coin nor oath required. For personal study only.

✦ Synopsis

A previous article [Comput. Phys. Commun. 75 (1993) 105] compared and analyzed the pseudorandom number generators that are delivered with off-the-shelf Fortran compilers for personal computers. Since the writing of that article, Microsoft has released a new 32-bit protected mode compiler which includes a rewritten generator. The new routine is examined, and the Tausworthe and lagged-Fibonacci routines from the previous article are updated to provide support for this product.

📜 SIMILAR VOLUMES

Pseudorandom number generators for Salfo

Pseudorandom number generators for Salford FTN77

✍ Kenneth G. Hamilton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Previous articles compared and analyzed the pseudorandom number generators that are delivered with offthe-shelf Fortran compilers for personal computers, and updated two CPC library elements to support multiple Fortran compilers. In the current work, the standard generator that is provided with Salf

Lagged Fibonacci Random Number Generator

Lagged Fibonacci Random Number Generators for Distributed Memory Parallel Computers

✍ Srinivas Aluru 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 192 KB

To parallelize applications that require the use of random numbers, an efficient and good quality parallel random number generator is required. In this paper, we study the parallelization of lagged Fibonacci generators for distributed memory parallel computers. Two popular ways of generating a rando

The Multiple-Recursive Matrix Method for

The Multiple-Recursive Matrix Method for Pseudorandom Number Generation

✍ H. Niederreiter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 859 KB

We carry out an in-depth analysis of the multiple-recursive matrix method for uniform pseudorandom number generation which was introduced in an earlier paper of the author. This method yields much larger period lengths than the GFSR method with the same order of the recursion and the same precision.

A universal GFSR random number generator

A universal GFSR random number generator for personal computers [Comput. Phys. Commun. 85 (1995) 127–152]

✍ Kenneth G. Hamilton 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 43 KB

In the final composition of my article, all five of the figures were pasted in with the wrong sides up. In Fig. 1, the image should be rotated 90 degrees (either to the left or to the right), so that the dark diagonal band runs from lower-left to upper-right. This demonstrates the serial correlation

On the number of generators for certain

On the number of generators for certain finite groups, II

✍ Richard M Thomas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Improved Bounds in the Multiple-Recursiv

Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation

✍ Harold Niederreiter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 275 KB

The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on -splitting subspaces of f