Search from over 60,000 research works

Advanced Search

Examining random number generators used in stochastic iteration algorithms

Full text not archived in this repository.
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Szirmay-Kalos, L., Liktor, G., Penzov, A.A., Dimov, I., Skala, K. and Szecsi, L. (2008) Examining random number generators used in stochastic iteration algorithms. In: International Conference Automatics and Informatics, Bulgaria.

Abstract/Summary

This paper investigates random number generators in stochastic iteration algorithms that require infinite uniform sequences. We take a simple model of the general transport equation and solve it with the application of a linear congruential generator, the Mersenne twister, the mother-of-all generators, and a true random number generator based on quantum effects. With this simple model we show that for reasonably contractive operators the theoretically not infinite-uniform sequences perform also well. Finally, we demonstrate the power of stochastic iteration for the solution of the light transport problem.

Item Type Conference or Workshop Item (Paper)
URI https://reading-clone.eprints-hosting.org/id/eprint/14881
Item Type Conference or Workshop Item
Divisions Science
Uncontrolled Keywords Monte Carlo methods, random number generators, stochastic iteration, transport problems
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar