A practical approach to testing random number generators in computer algebra systems

04/19/2020
by   Migran N. Gevorkyan, et al.
0

This paper has a practical aim. For a long time, implementations of pseudorandom number generators in standard libraries of programming languages had poor quality. The situation started to improve only recently. Up to now, a large number of libraries and weakly supported mathematical packages use outdated algorithms for random number generation. Four modern sets of statistical tests that can be used for verifying random number generators are described. It is proposed to use command line utilities, which makes it possible to avoid low-level programming in such languages as C or C++. Only free open source systems are considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2021

Benchmarking the Status of Default Pseudorandom Number Generators in Common Programming Languages

The ever-increasing need for random numbers is clear in many areas of co...
research
10/25/2018

Random Sampling: Practice Makes Imperfect

The pseudo-random number generators (PRNGs), sampling algorithms, and al...
research
03/01/2022

Parsing Randomness: Unifying and Differentiating Parsers and Random Generators

"A generator is a parser of randomness." This perspective on generators ...
research
04/01/2017

The Stochastic Processes Generation in OpenModelica

Background: Component-based modeling language Modelica (OpenModelica is ...
research
05/28/2018

Fast Random Integer Generation in an Interval

In simulations, probabilistic algorithms and statistical tests, we often...
research
11/16/2020

Opportunities and Challenges for Circuit Board Level Hardware Description Languages

Board-level hardware description languages (HDLs) are one approach to in...
research
07/26/2019

Lazy Stream Programming in Prolog

In recent years, stream processing has become a prominent approach for i...

Please sign up or login with your details

Forgot password? Click here to reset