rngWELLScriptR

Integer. The length of the output sequence.

An 0,1-matrix representing the state of the required WELL generator
            as obtained by <code>getWELLState()</code>.

Character string. Name of the generator from the list
  <code>"512a", "521a", "521b", "607a", "607b", "800a", "800b", "1024a", "1024b", "19937a",
  "19937c", "19937b", "21701a", "23209a", "23209b", "44497a", "44497b"</code>.

generator

Logical. Controls, whether the output should contain
            the final internal state additionally to the numerical output or not.

includeState

An implementation of the recurrence of WELL generators in R language
  for testing purposes. It is too slow to be used for random number
  generation.

The package provides (1) pseudo random generators -
        general linear congruential generators (Park Miller) and
        multiple recursive generators (Knuth TAOCP), generalized
        feedback shift register (SF-Mersenne Twister algorithm and WELL
        generators); (2) quasi random generators - the Torus algorithm,
        the Sobol sequence, the Halton sequence (thus include Van der
        Corput sequence) and (3) some additional tests such as the gap
        test, the serial test, the poker test... The package depends on
        rngWELL package but it can be provided without this dependency
        on demand to the maintainer. For true random number generation,
        use the 'random' package, for Latin Hypercube Sampling (a
        hybrid QMC method), use the 'lhs' package, a number of RNGs and
        tests for RNGs are provided by 'RDieHarder', all available on
        CRAN. There is also a small stand-alone package 'rngwell19937'
        for the WELL19937a RNG.

rngWELLScriptR: An implementation of the recurrence of WELL generators in R language

Description

Usage

Arguments

Value

See Also

Examples