The MIXMAX random number generator. In this paper, we study the randomness properties of unimodular matrix random number generators. Under well-known conditions, these discrete-time dynamical systems have the highly desirable K-mixing properties which guarantee high quality random numbers. It is found that some widely used random number generators have poor Kolmogorov entropy and consequently fail in empirical tests of randomness. These tests show that the lowest acceptable value of the Kolmogorov entropy is around 50. Next, we provide a solution to the problem of determining the maximal period of unimodular matrix generators of pseudo-random numbers. We formulate the necessary and sufficient condition to attain the maximum period and present a family of specific generators in the MIXMAX family with superior performance and excellent statistical properties. Finally, we construct three efficient algorithms for operations with the MIXMAX matrix which is a multi-dimensional generalization of the famous cat-map. First, allowing to compute the multiplication by the MIXMAX matrix with (O(N)) operations. Second, to recursively compute its characteristic polynomial with (O(N^2)) operations, and third, to apply skips of large number of steps (S) to the sequence in (O(N^2 log(S))) operations.
Keywords for this software
References in zbMATH (referenced in 4 articles , 2 standard articles )
Showing results 1 to 4 of 4.
- Poghosyan, H. R.; Babujian, H. M.; Savvidy, G. K.: Artin billiard: exponential decay of correlation functions (2018)
- Savvidy, George; Savvidy, Konstantin: Exponential decay of correlations functions in MIXMAX generator of pseudorandom numbers (2018)
- Savvidy, Konstantin; Savvidy, George: Spectrum and entropy of C-systems MIXMAX random number generator (2016)
- Savvidy, Konstantin G.: The MIXMAX random number generator (2015)