Conversion of mersenne twister to double-precision floating-point numbers
From MaRDI portal
Publication:1997560
DOI10.1016/j.matcom.2018.08.006OpenAlexW2745639462MaRDI QIDQ1997560
Publication date: 2 March 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.06018
Related Items (2)
An efficient weak Euler-Maruyama type approximation scheme of very high dimensional SDEs by orthogonal random variables ⋮ On testing pseudorandom generators via statistical tests based on the arcsine law
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient lattice reduction method for \(\mathbf F_2\)-linear pseudorandom number generators using Mulders and Storjohann algorithm
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- A Non-empirical Test on the Second to the Sixth Least Significant Bits of Pseudorandom Number Generators
- On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators
- A PRNG Specialized in Double Precision Floating Point Numbers Using an Affine Transition
- TestU01
- Tables of maximally equidistributed combined LFSR generators
- Mersenne twister
- Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences
- Beware of linear congruential generators with multipliers of the form a = ±2 q ±2 r
- Close-Point Spatial Tests and Their Application to Random Number Generators
- Tables of 64-bit Mersenne twisters
- Implementing 64-bit Maximally Equidistributed F 2 -Linear Generators with Mersenne Prime Period
- Sparse Serial Tests of Uniformity for Random Number Generators
- Lattice computations for random numbers
- An Asymptotically Random Tausworthe Sequence
- On the performance of birthday spacings tests with certain families of random number generators
This page was built for publication: Conversion of mersenne twister to double-precision floating-point numbers
