naginterfaces.library.rand.init_​skipahead

naginterfaces.library.rand.init_skipahead(n, statecomm)

init_skipahead allows for the generation of multiple, independent, sequences of pseudorandom numbers using the skip-ahead method.

The base pseudorandom number sequence defined by $statecomm$[‘state’] is advanced $n$ places.

For full information please refer to the NAG Library document for g05kj

https://www.nag.com/numeric/nl/nagdoc_29.3/flhtml/g05/g05kjf.html

Parameters

nint

$n$, the number of places to skip ahead.

statecommdict, RNG communication object, modified in place

RNG communication structure.

This argument must have been initialized by a prior call to init_repeat() or init_nonrepeat().

Raises

NagValueError

(errno $1$)

On entry, $n=⟨value⟩$.

Constraint: $n\ge 0$.

(errno $2$)

On entry, $statecomm$[‘state’] vector has been corrupted or not initialized.

(errno $3$)

On entry, cannot use skip-ahead with the base generator defined by $statecomm$[‘state’].

(errno $4$)

On entry, the base generator is Mersenne Twister, but the $statecomm$[‘state’] vector defined on initialization is not large enough to perform a skip ahead. See the initialization function init_repeat() or init_nonrepeat().

Notes

init_skipahead adjusts a base generator to allow multiple, independent, sequences of pseudorandom numbers to be generated via the skip-ahead method (see the G05 Introduction for details).

If, prior to calling init_skipahead the base generator defined by $statecomm$[‘state’] would produce random numbers $x_1,x_2,x_3,\dots$, then after calling init_skipahead the generator will produce random numbers $x_{n+1},x_{n+2},x_{n+3},\dots$.

One of the initialization functions init_repeat() (for a repeatable sequence if computed sequentially) or init_nonrepeat() (for a non-repeatable sequence) must be called prior to the first call to init_skipahead.

The skip-ahead algorithm can be used in conjunction with any of the six base generators discussed in submodule rand.

References

Haramoto, H, Matsumoto, M, Nishimura, T, Panneton, F and L’Ecuyer, P, 2008, Efficient jump ahead for F2-linear random number generators, INFORMS J. on Computing (20(3)), 385–390

Knuth, D E, 1981, The Art of Computer Programming (Volume 2), (2nd Edition), Addison–Wesley