Fast K System Generators of Pseudorandom Numbers
N. Z. Akopov, E. M. Madounts, A. B. Nersesian, G. K. Savvidy, W. Greiner
Abstract
We suggest fast algorithm for the matrix generator of pseudorandom numbers based on Kolmogorov-Anosov K systems which has been proposed earlier. This algorithm reduces N2 operation of the matrix generator to NlnN and essentially reduces the generation time. It also clarifies the algebraic structure of this type of K system generators.
Create a lesson
Related papers
Simulating a chiral gauge theory
Laurens Lootens, Hersh Singh
Quantum Computing for Entanglement Asymmetry and the Quantum Mpemba Effect in Field Theory
Keisuke Fujii, Harunobu Fujimura, Masazumi Honda et al.
Finite-volume Analysis of On-shell Subtraction in the Luescher formalism
Wanchen Lei, Yuting Wang, Jin-Yi Pang
A Note On Lattice Definition of Gauge Theories With Chiral Fermions
Edward Witten
Can multi-level Monte-Carlo address the sign problem in a finite-density Bose gas?
Rajatha Ranpatige, Finn M. Stokes
Confining strings in the reconfined phase of trace deformed three dimensional SU(2) Yang-Mills theory
Claudio Bonati, Michele Caselle, Alessio Negro et al.