Package cern.jet.random.engine

Examples of cern.jet.random.engine.RandomEngine.raw()

143
144
145
146
147
148
149
150
151
152
153
      p0 = p;
      //for (k=pp.length; --k >=0; ) pp[k] = 0;
    }
    m = (my > 1.0) ? (int)my : 1;
    for(;;) {
      u = gen.raw();           // Step U. Uniform sample
      k = 0;
      if (u <= p0) return(k);
      if (llll != 0) {              // Step T. Table comparison
        i = (u > 0.458) ? Math.min(llll,m) : 1;
        for (k = i; k <=llll; k++) if (u <= pp[k]) return(k);
View Full Code Here
222
223
224
225
226
227
228
229
230
231
232
    } // end set-up

    for (;;) {
      // generate uniform number U -- U(0, p6)                               
      // case distinction corresponding to U                                 
      if ((U = gen.raw() * p6) < p2) {         // centre left     

        // immediate acceptance region R2 = [k2, m) *[0, f2),  X = k2, ... m -1
        if ((V = U - p1) < 0.0)  return(k2 + (int)(U/f2));
        // immediate acceptance region R1 = [k1, k2)*[0, f1),  X = k1, ... k2-1
        if ((W = V / dl) < f1 )  return(k1 + (int)(V/f1));
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
        // immediate acceptance region R1 = [k1, k2)*[0, f1),  X = k1, ... k2-1
        if ((W = V / dl) < f1 )  return(k1 + (int)(V/f1));

        // computation of candidate X < k2, and its counterpart Y > k2         
        // either squeeze-acceptance of X or acceptance-rejection of Y         
        Dk = (int)(dl * gen.raw()) + 1;
        if (W <= f2 - Dk * (f2 - f2/r2)) {            // quick accept of 
          return(k2 - Dk);                          // X = k2 - Dk     
        }
        if ((V = f2 + f2 - W) < 1.0) {                // quick reject of Y
          Y = k2 + Dk;
View Full Code Here
252
253
254
255
256
257
258
259
260
261
262
        // immediate acceptance region R4 = [k4+1, k5+1)*[0, f5)               
        if ((W = V / dr) < f5 )  return(k5 - (int)(V/f5));

        // computation of candidate X > k4, and its counterpart Y < k4         
        // either squeeze-acceptance of X or acceptance-rejection of Y         
        Dk = (int)(dr * gen.raw()) + 1;
        if (W <= f4 - Dk * (f4 - f4*r4)) {             // quick accept of 
          return(k4 + Dk);                           // X = k4 + Dk     
        }
        if ((V = f4 + f4 - W) < 1.0) {                 // quick reject of Y
          Y = k4 - Dk;
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
          if (V <= f(Y, l_my, c_pm))  return(Y);    // final accept of Y
        }
        X = k4 + Dk;
      }
      else {
        W = gen.raw();
        if (U < p5)  {                                  // expon. tail left
          Dk = (int)(1.0 - Math.log(W)/ll);
          if ((X = k1 - Dk) < 0)  continue;          // 0 <= X <= k1 - 1
          W *= (U - p4) * ll;                        // W -- U(0, h(x)) 
          if (W <= f1 - Dk * (f1 - f1/r1))  return(X); // quick accept of X
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
    RandomEngine rand = this.randomGenerator;
    do {
      double y;
      do {
        y = Math.tan(Math.PI*rand.raw());
        em = sq*y + xm;
      } while (em < 0.0);
      em = (double) (int)(em); // faster than em = Math.floor(em); (em>=0.0)
      t = 0.9*(1.0 + y*y)* Math.exp(em*alxm - logGamma(em + 1.0) - g);
    } while (rand.raw() > t);
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
        y = Math.tan(Math.PI*rand.raw());
        em = sq*y + xm;
      } while (em < 0.0);
      em = (double) (int)(em); // faster than em = Math.floor(em); (em>=0.0)
      t = 0.9*(1.0 + y*y)* Math.exp(em*alxm - logGamma(em + 1.0) - g);
    } while (rand.raw() > t);
    return (int) em;
  }
  else { // mean is too large
    return (int) xm;
  }
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
    RandomEngine rand = this.randomGenerator;
    do {
      double y;
      do {
        y = Math.tan(Math.PI*rand.raw());
        em = sq*y + xm;
      } while (em < 0.0);
      em = (double) (int)(em); // faster than em = Math.floor(em); (em>=0.0)
      t = 0.9*(1.0 + y*y)* Math.exp(em*alxm - logGamma(em + 1.0) - g);
    } while (rand.raw() > t);
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
        y = Math.tan(Math.PI*rand.raw());
        em = sq*y + xm;
      } while (em < 0.0);
      em = (double) (int)(em); // faster than em = Math.floor(em); (em>=0.0)
      t = 0.9*(1.0 + y*y)* Math.exp(em*alxm - logGamma(em + 1.0) - g);
    } while (rand.raw() > t);
    return (int) em;
  }
  else { // mean is too large
    return (int) xm;
  }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
      p0 = p;
      //for (k=pp.length; --k >=0; ) pp[k] = 0;
    }
    m = (my > 1.0) ? (int)my : 1;
    for(;;) {
      u = gen.raw();           // Step U. Uniform sample
      k = 0;
      if (u <= p0) return(k);
      if (llll != 0) {              // Step T. Table comparison
        i = (u > 0.458) ? Math.min(llll,m) : 1;
        for (k = i; k <=llll; k++) if (u <= pp[k]) return(k);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.