Package org.apache.commons.math.distribution

Examples of org.apache.commons.math.distribution.PascalDistributionImpl

348
349
350
351
352
353
354
    return d(new BinomialDistributionImpl(size, prob), x, log);
  }

  @DataParallel @Internal
  public static double dnbinom(@Recycle double x, @Recycle int size, @Recycle double prob, boolean log) {
    return d(new PascalDistributionImpl(size, prob), x, log);
  }
View Full Code Here
363
364
365
366
367
368
369
    return p(new BinomialDistributionImpl(size, prob), x, lowerTail, logP);
  }

  @DataParallel @Internal
  public static double pnbinom(@Recycle double x, @Recycle int size, @Recycle double prob, boolean lowerTail, boolean logP) {
    return p(new PascalDistributionImpl(size, prob), x, lowerTail, logP);
  }
View Full Code Here
639
640
641
642
643
644
645
     * @return random value sampled from the Pascal(r, p) distribution
     * @throws MathException if an error occurs generating the random value
     * @since 2.2
     */
    public int nextPascal(int r, double p) throws MathException {
        return nextInversionDeviate(new PascalDistributionImpl(r, p));
    }
View Full Code Here
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
        PascalDistributionTest testInstance = new PascalDistributionTest("");
        int[] densityPoints = testInstance.makeDensityTestPoints();
        double[] densityValues = testInstance.makeDensityTestValues();
        int sampleSize = 1000;
        int length = TestUtils.eliminateZeroMassPoints(densityPoints, densityValues);
        PascalDistributionImpl distribution = (PascalDistributionImpl) testInstance.makeDistribution();
        double[] expectedCounts = new double[length];
        long[] observedCounts = new long[length];
        for (int i = 0; i < length; i++) {
            expectedCounts[i] = sampleSize * densityValues[i];
        }
        randomData.reSeed(1000);
        for (int i = 0; i < sampleSize; i++) {
          int value = randomData.nextPascal(distribution.getNumberOfSuccesses(), distribution.getProbabilityOfSuccess());
          for (int j = 0; j < length; j++) {
              if (value == densityPoints[j]) {
                  observedCounts[j]++;
              }
          }
View Full Code Here
TOP

Related Classes of org.apache.commons.math.distribution.PascalDistributionImpl

  • org.apache.commons.math.random.RandomDataImpl
  • org.apache.commons.math.random.RandomDataTest
  • org.renjin.stats.internals.Distributions
    • Copyright © 2018 www.massapicom. 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.