| The inversive congruential method for generating
uniform pseudorandom numbers is a particularly promising alternative to
linear congruential generators with their well known deficiencies.It
was introduced by Eichenauer and Lehn in 1986. Many important results appeared
on the theoretical analysis and generalizations of these generators in
the last decade.
In this thesis, recent result on the period length of inversive pseudorandom numbers, generalization to pseudorandom vector generation and and algorithm which enables fast implementation are given. Key word: Compound inversive method, digital pseudorandom number, discrepancy, inversive congruential method, uniform pseudorandom vector, statical independence. |