|
|
RanPak is a set of routines to sample quasi-random numbers from various probability density functions. The focus of the library is mainly on sampling (x,y,z) coordinates from various geometrical objects. Routines are also provided to sample direction vections from a cone or all 4PI directions.
CommentsAll of the above routines should work correctly on any computer system with a maximum integer greater than or equal to 2**31 - 1. The proper function of the routine can verified by checking to see that the random number seed after generating 10,000 random numbers is 1,043,618,065 (use an initial seed of 1). The algorithm(s) implemented in RanPak are based on the widely used (but by no means the absolute best) Linear congruential generator (originally proposed by Lehmer in 1948) described in the classic paper
| ||
|
Website maintained by Rob Stewart
(trebor@purdue.edu). Last Updated: 03-Nov-1999 Disclaimer | ||