Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. A new algorithm called Mersenne twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of parameters, the algorithm provides a super astronomical period of 2 19937 -1 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words. This is a new variant of the previously proposed generators, TGFSR, modified so as to admit a Mersenne-prime period. The characteristic polynomial has many terms. The distribution up to v bits accuracy for 1≤v≤32 is also shown to be good. An algorithm is also given that checks the primitivity of the characteristic polynomial of MT with computational complexity O(p 2 ) where p is the degree of the polynomial. We implemented this generator in portable C-code. It passed several stringent statistical tests, including diehard. Its speed is comparable to other modern generators. Its merits are due to the efficient algorithms that are unique to polynomial calculations over the two-element field. (Source:

References in zbMATH (referenced in 229 articles , 2 standard articles )

Showing results 1 to 20 of 229.
Sorted by year (citations)

1 2 3 ... 10 11 12 next

  1. Kuschel, Torben; Bock, Stefan: Solving the weighted capacitated planned maintenance problem and its variants (2019)
  2. Adler, Michael C.; Gonzalez, David R.; Stack, Cory M.; Gaitonde, Datta V.: Synthetic generation of equilibrium boundary layer turbulence from modeled statistics (2018)
  3. Bakiri, Mohammed; Guyeux, Christophe; Couchot, Jean-François; Oudjida, Abdelkrim Kamel: Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses (2018)
  4. de Andrade, Bernardo B.; Souza, Geraldo S.: Likelihood computation in the normal-gamma stochastic frontier model (2018)
  5. Fernández de Bustos, I.; García-Marina, V.; Urkullu, G.; Abasolo, M.: An efficient LDU algorithm for the minimal least squares solution of linear systems (2018)
  6. Gori, Giacomo; Viti, Jacopo: Four-point boundary connectivities in critical two-dimensional percolation from conformal invariance (2018)
  7. Henderson, Nélio; de Sá R^ego, Marroni; Imbiriba, Janaína; de Sá R^ego, Márlison; Sacco, Wagner F.: Testing the topographical global initialization strategy in the framework of an unconstrained optimization method (2018)
  8. Howard, C. Douglas: It’s puzzling (2018)
  9. Ito, Daisuke; Ueta, Tetsushi; Aihara, Kazuyuki: Bifurcation analysis of eight coupled degenerate optical parametric oscillators (2018)
  10. Jäntschi, Lorentz; Bolboacă, Sorana D.: Computation of probability associated with Anderson-Darling statistic (2018)
  11. Kneusel, Ronald T.: Random numbers and computers (2018)
  12. Lin, Y.; Wang, F.; Liu, B.: Random number generators for large-scale parallel Monte Carlo simulations on FPGA (2018)
  13. Mak, Simon; Joseph, V. Roshan: Support points (2018)
  14. Murakami, Keisuke: A generalized model and a heuristic algorithm for the large-scale covering tour problem (2018)
  15. Rose, Gregory G.: KISS: a bit too simple (2018)
  16. Savvidy, George; Savvidy, Konstantin: Exponential decay of correlations functions in MIXMAX generator of pseudorandom numbers (2018)
  17. Segredo, Eduardo; Paechter, Ben; Segura, Carlos; González-Vila, Carlos I.: On the comparison of initialisation strategies in differential evolution for large scale optimisation (2018)
  18. Yianni, Panayioti C.; Neves, Luis C.; Rama, Dovile; Andrews, John D.: Accelerating Petri-net simulations using NVIDIA graphics processing units (2018)
  19. Beebe, Nelson H. F.: The mathematical-function computation handbook. Programming using the MathCW portable software library (2017)
  20. Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal: Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics (2017)

1 2 3 ... 10 11 12 next