# RandUtils Module file:RandUtils

## Interfaces Expand Interfaces

• RandRotation
• RandRotationS
• RandRotationD

## Subroutines Expand Arguments

• initRandom(i, i2)
• integer optional, intent(in) :: i
• integer optional, intent(in) :: i2
• RandIndices(nmax, n, indices)
• integer intent(in) :: nmax
• integer intent(in) :: n
• integer  :: indices(n)
• RandRotationD(N, R)

this is most certainly not the world's most efficient or robust random rotation generator

• integer intent(in) :: N
• double precision  :: R(N,N)
• RandRotationS(N, R)

this is most certainly not the world's most efficient or robust random rotation generator

• integer intent(in) :: N
• real  :: R(N,N)
• RMARIN()

This is the initialization routine for the random number generator RANMAR() NOTE: The seed variables can have values between: 0 <= IJ <= 31328 0 <= KL <= 30081 The random number sequences created by these two seeds are of sufficient length to complete an entire calculation with. For example, if sveral different groups are working on different parts of the same calculation, each group could be assigned its own IJ seed. This would leave each group with 30000 choices for the second seed. That is to say, this random number generator can create 900 million different subsequences -- with each subsequence having a length of approximately 10^30. Use IJ = 1802 & KL = 9373 to test the random number generator. The subroutine RANMAR should be used to generate 20000 random numbers. Then display the next six random numbers generated multiplied by 4096*4096 If the random number generator is working properly, the random numbers should be: 6533892.0 14220222.0 7275067.0 6172232.0 8354498.0 10633180.0

## Functions  Expand Arguments

• real RANDEXP1()

Random-number generator for the exponential distribution Algorithm EA from J. H. Ahrens and U. Dieter, Communications of the ACM, 31 (1988) 1330--1337. Coded by K. G. Hamilton, December 1996, with corrections.