Documentation of 'umontreal.iro.lecuyer.hups.LCGPointSet' Java class
LCGPointSet
umontreal.iro.lecuyer.hups

Class LCGPointSet



  • public class LCGPointSet
    extends CycleBasedPointSet
    Implements a recurrence-based point set defined via a linear congruential recurrence of the form xi = axi-1mod n and ui = xi/n. The implementation is done by storing the values of ui over the set of all cycles of the recurrence.
    • Constructor Detail

      • LCGPointSet

        public LCGPointSet(int n,
                           int a)
        Constructs and stores the set of cycles for an LCG with modulus n and multiplier a. If the LCG has full period length n - 1, there are two cycles, the first one containing only 0 and the second one of period length n - 1.
        Parameters:
        n - required number of points and modulus of the LCG
        a - generator a of the LCG
      • LCGPointSet

        public LCGPointSet(int b,
                           int e,
                           int c,
                           int a)
        Constructs and stores the set of cycles for an LCG with modulus n = be + c and multiplier a.
    • Method Detail

      • toString

        public java.lang.String toString()
        Description copied from class: PointSet
        Formats a string that contains information about the point set.
        Overrides:
        toString in class CycleBasedPointSet
        Returns:
        string representation of the point set information
      • geta

        public int geta()
        Returns the value of the multiplier a.

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.