Mathematics of Computation · 1996 · 15 citations · 13 references
Natural SciencesComputer ScienceMathematicsNumber TheoryProbability TheoryStatisticsGenerating FunctionsNumber-theoretic AlgorithmsRandom Number GenerationExponential SumsPseudo-random Number GenerationPseudo-random Number GeneratorsPseudorandom GeneratorsPseudorandomnessUpper Bound Computation
The present paper deals with the compound (or generalized) inversive congruential method for generating uniform pseudorandom numbers, which has been introduced recently. Equidistribution and statistical independence properties of the generated sequences over parts of the period are studied based on the discrepancy of certain point sets. The main result is an upper bound for the average value of these discrepancies. The method of proof is based on estimates for exponential sums.
13