page_title: MIXMAX generator
hierarchical_section_title: MIXMAX generator
context_page_description: The MIXMAX generator is a family of pseudorandom number generators and is based on Anosov C-systems and Kolmogorov K-systems. It was introduced in a 1986 preprint by G. Savvidy and N. Ter-Arutyunyan-Savvidy and published in 1991.
  A fast implementation in C/C++ of the generator was developed by Konstantin Savvidy. The period of the generator is and the Kolmogorov entropy is for the matrix size. That generator occupies less than 2 kb, and if a smaller generator state is required, a N = 17 version with less than 200 bytes memory requirement also exists.
  The generator works on most 64-bit systems, including 64-bit Linux flavors and Intel Mac. It has also been tested on PPC and ARM architectures. The latest version also runs on 32-bit systems and on Windows. The generator is equally usable with C++ programs, has been chosen as the default generator in CLHEP for use in Geant4 and there exists a ROOT interface. It has been recently tested extensively on very wide variety of platforms, as part of the CLHEP/Geant4 release.
context_section_description: The MIXMAX generator is a family of pseudorandom number generators (PRNG) and is based on Anosov C-systems (Anosov diffeomorphism) and Kolmogorov K-systems (Kolmogorov automorphism). It was introduced in a 1986 preprint by G. Savvidy and N. Ter-Arutyunyan-Savvidy and published in 1991.
  A fast implementation in C/C++ of the generator was developed by Konstantin Savvidy. The period of the generator is  and the Kolmogorov entropy is  for the matrix size . That generator occupies less than 2 kb, and if a smaller generator state is required, a N = 17 version with less than 200 bytes memory requirement also exists.
  The generator works on most 64-bit systems, including 64-bit Linux flavors and Intel Mac. It has also been tested on PPC and ARM architectures. The latest version also runs on 32-bit systems and on Windows. The generator is equally usable with C++ programs, has been chosen as the default generator in CLHEP  for use in Geant4  and  there exists a ROOT interface.   It has been recently tested extensively on very wide variety of platforms, as part of the CLHEP/Geant4 release.
  An analysis by L’Ecuyer, Wambergue and Bourceret, see also, showed that MIXMAX generators, just as all other Multiple Recursive Generators and linear congruential generators, has a lattice structure and that the produced random numbers, when considered as coordinate in a n > N - dimensional space, lie on a set of parallel hyperplanes and determined the maximum distance between the covering hyperplanes.
caption: A pseudorandom number generator.
exif: {}