Computer implementation of random number generators (Q916298): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q809509 |
Created claim: Wikidata QID (P12): Q126407971, #quickstatements; #temporary_batch_1722799621482 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Sotirios Loukas / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126407971 / rank | |||
Normal rank | |||
Latest revision as of 21:27, 4 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computer implementation of random number generators |
scientific article |
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
