Pseudo-random trees in Monte Carlo

✍ Scribed by Paul Frederickson; Robert Hiromoto; Thomas L. Jordan; Burton Smith; Tony Warnock

• Publisher: Elsevier Science
• Year: 1984
• Tongue: English
• Weight: 366 KB
• Volume: 1
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/s0167-8191(84)90072-3

✦ Synopsis

We present the concept of a pseudo-random tree, and generalize the Lehmer pseudo-random number generator as an efficient implementation of the concept. Pseudo-random trees can be used to give reproducibility, as well as speed, in Monte Carlo computations on parallel computers with either the SIMD architecture of the current generation of supercomputer or the MIMD architecture characteristic of the next generation. Monte Carlo simulations based on pseudo-random trees are free of certain pitfalls, even for sequential computers, which can make them considerably more useful.