Computer implementation of random number generators

From MaRDI portal





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.











This page was built for publication: Computer implementation of random number generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916298)