Home/ Questions/Q 7932015
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-03T20:53:16+00:00

I am using MKL Intel for random number computation. I use Quasi random algo.

  • 0

I am using MKL Intel for random number computation. I use Quasi random algo. Also, it seems to me that number that are generated are not random at all. I understand that Quasi random algo will provide sampled points that maximize space occupation. Thus, they don’t need to be perfectly unexpected and random, but only to cover the space properly.

I would like to use this number in a random fashion, not to have them ordered on an expected way, so that before using these ‘random’ points, I permute them.

Am I not using MKL library properly? Or does it sound normal, because, as I mentionned, points are to cover whole space, not to be perfeclty random?

If some MKL or quasi random gen. users there, advice welcome.

Regards.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    In theory random permutation of any uniformly distributed sequence should result in random sample. Take 1, 2, 3, …, n, for example, and randomly permute it, and you get random uniform sample.

    The quality of random permutation algorithm becomes vital to the quality of the resulting sample.

    At the same time I wonder why you need quasi-random RNG from MKL at all. To me it looks a bit an overkill. If you need good pseudo-random sequence then it might make sense to use other RNGs from MKL, e.g. MT19937 or MT2203 or SFMT19937, which are fast and are of high quality. Can you please explain why you need a quasi-random sequence as the base for permutation?

    Regards,
    Sergey

    • 0