๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pseudorandom number generators for Salford FTN77

โœ Scribed by Kenneth G. Hamilton

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
794 KB
Volume
81
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 Salford Software's FTN77 compiler is examined, and the two existing CPC generators are migrated to use that compiler's in-line assembler feature. Statistical analyses are presented that pertain to both the current software, and to that of the previous articles.

๐Ÿ“œ SIMILAR VOLUMES

Pseudorandom number generators for perso
Pseudorandom number generators for personal computers II
โœ Kenneth G. Hamilton ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 693 KB

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 inclu

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.

Random number generators for microcomput
Random number generators for microcomputers
โœ Wilfred Rosenbaum; John Syrotuik; Richard Gordon ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science โš– 331 KB

The feasibility of random number generation using microcomputers is discussed and the appropriateness of alternative algorithms is evaluated on the basis of several criteria of statistical randomness. The relative deficiencies of each algorithm are cited and a modified Fibonacci generator is recomme

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