Computer implementation of random number generators (Q916298)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4153767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computer implementation of random number generators |
scientific article; zbMATH DE number 4153767 |
Statements
Computer implementation of random number generators (English)
0 references
1990
0 references
Good theoretical work on algorithms is often defeated by a poor computer implementation. This is particularly true of random number generators for two reasons: the overwhelming concern for speed and the inherent ill- conditioning of the problem. The author concentrates on the coding considerations of a multiplicative congruential generator with properly chosen multiplier and modulus. Implementation of recursive generators on vector processors is also addressed.
0 references
random number generators
0 references
multiplicative congruential generator
0 references
recursive generators
0 references
vector processors
0 references
0.8697395920753479
0 references
0.8549799919128418
0 references
0.8490376472473145
0 references
0.83953857421875
0 references
