首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 106 毫秒
1.
One of the alternatives to linear congruential pseudorandom number generators with their known deficiencies is the inversive congruential method with prime power modulus. Recently, it was proved that pairs of inversive congruential pseudorandom numbers have nice statistical independence properties. In the present paper it is shown that a similar result cannot be obtained fork-tuples withk≥3 since their discrepancy is too large. The method of proof relies on the evaluation of certain exponential sums. In view of the present result the inversive congruential method with prime power modulus seems to be not absolutely suitable for generating uniform pseudorandom numbers.  相似文献   

2.
 The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present the first nontrivial bounds on the multidimensional discrepancy of individual sequences of inversive congruential pseudorandom numbers in parts of the period. The proof is based on a new bound for certain incomplete exponential sums. (Received 3 December 1998)  相似文献   

3.
The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. The authors have recently introduced a new method for obtaining nontrivial upper bounds on the multidimensional discrepancy of inversive congruential pseudorandom numbers in parts of the period. This method has also been used to study the multidimensional distribution of several other similar families of pseudorandom numbers. Here we apply this method to show that, “on average” over all initial values, much stronger results than those known for “individual” sequences can be obtained.  相似文献   

4.
This paper deals with the inversive congruential method with power of two modulusm for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown that there exist parameters in the inversive congruential method such that the discrepancy of the corresponding point sets in the unit cube is of an order of magnitude at leastm –1/3. The method of proof relies on a detailed analysis of certain rational exponential sums.  相似文献   

5.
 Inversive methods are interesting alternatives to linear methods for pseudorandom number generation. A particularly attractive method is the compound inversive congruential method introduced and analyzed by Huber and Eichenauer-Herrmann. We present the first nontrivial worst-case results on the distribution of sequences of compound inversive congruential pseudorandom numbers in parts of the period. The proofs are based on new bounds for certain exponential sums. (Received 2 March 2000; in revised form 22 November 2000)  相似文献   

6.
The inversive congruential method for generating uniform pseudorandom numbers has been introduced recently as an alternative to linear congruential generators with their coarse lattice structure. In the present paper the statistical independence properties of pairs of consecutive pseudorandom numbers obtained from an inversive congruential generator with prime power modulus are analysed by means of the serial test. Upper bounds for the discrepancy of these pairs are established which are essentially best possible. The results show that the inversive congruential method with prime power modulus performs uniformly satisfactorily under the serial test. The methods of proof rely heavily on the evaluation of certain exponential sums which resemble Kloosterman sums.  相似文献   

7.
The inversive congruential method for generating uniform pseudorandom numbers is a particularly attractive alternative to linear congruential generators with their well-known inherent deficiencies like the unfavourable coarse lattice structure in higher dimensions. In the present paper the modulus in the inversive congruential method is chosen as a power of an arbitrary odd prime. The existence of inversive congruential generators with maximal period length is proved by a new constructive characterization of these generators.  相似文献   

8.
A nonlinear congruential pseudorandom number generator with modulus is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.

  相似文献   


9.
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.

  相似文献   


10.
Inversive methods are attractive alternatives to the linear method for pseudorandom number generation. A particularly attractive method is the digital explicit inversive method recently introduced by the authors. We establish some new results on the statistical properties of parallel streams of pseudorandom numbers generated by this method. In particular, we extend the results of the first author on the statistical properties of pseudorandom numbers generated by the explicit inversive congruential method introduced by Eichenauer-Herrmann. These results demonstrate that the new method is eminently suitable for the generation of parallel streams of pseudorandom numbers with desirable properties.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号