Pseudo-random trees: Multiple independent sequence generators for parallel and branching computations

DOI10.1016/0021-9991(89)90180-0zbMath0687.65005OpenAlexW1981336853MaRDI QIDQ1263215

John H. Halton

Publication date: 1989

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(89)90180-0

zbMATH Keywords

algorithmsrandom walksefficiencyMonte Carlo methoduniformitycomputational resultsbranchingcoarsenessrandom binary treesconsonancemultiple random number generationbranching modelC program for branching random number sequencesgeneration of random treesindependencyLehmer's sequencesoperational complexityparticle streams with collisionssimulation of particle streams through matter

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Transport processes in time-dependent statistical mechanics (82C70) Random number generation in numerical analysis (65C10) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items

Sequential Monto Carlo techniques for the solution of linear systems ⋮ A generalization of Kakutani's splitting procedure ⋮ Evaluation of splittable pseudo-random generators ⋮ Random numbers for parallel computers: requirements and methods, with emphasis on gpus

Cites Work

• Pseudo-random trees in Monte Carlo
• Good lattic points, discrepancy, and numerical integration
• MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
• Random Number Generators
• Quasi-Monte Carlo methods and pseudo-random numbers
• Deterministic Simulation of Random Processes
• Random Numbers Generated by Linear Recurrence Modulo Two
• Method in randomness
• A Retrospective and Prospective Survey of the Monte Carlo Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item