DiscShift1.java

/*
 * Class:        DiscShift1
 * Description:  computes a discrepancy for the randomly shifted points of a set
 * Environment:  Java
 * Software:     SSJ 
 * Copyright (C) 2001  Pierre L'Ecuyer and Universite de Montreal
 * Organization: DIRO, Universite de Montreal
 * @author       Richard Simard
 * @since        January 2009
 
 * SSJ is free software: you can redistribute it and/or modify it under
 * the terms of the GNU General Public License (GPL) as published by the
 * Free Software Foundation, either version 3 of the License, or
 * any later version.
 
 * SSJ is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * A copy of the GNU General Public License is available at
   <a href="http://www.gnu.org/licenses">GPL licence site</a>.
 */
package umontreal.ssj.discrepancy;
 
import umontreal.ssj.hups.PointSet;
import umontreal.ssj.util.Num;

public class DiscShift1 extends Discrepancy {
 
   static protected void setC(double[] C1, double[] gam, int s) {
      for (int i = 0; i < s; i++)
         C1[i] = gam[i] * gam[i];
   }

   public DiscShift1(double[][] points, int n, int s) {
      super(points, n, s);
   }

   public DiscShift1(double[][] points, int n, int s, double[] gamma) {
      super(points, n, s, gamma);
   }

   public DiscShift1(int n, int s, double[] gamma) {
      super(n, s, gamma);
   }

   public DiscShift1(PointSet set) {
      super(set);
   }

   public DiscShift1() {
   }

   public double compute(double[][] points, int n, int s) {
      setONES(s);
      return compute(points, n, s, ONES);
   }

   public double compute(double[][] points, int n, int s, double[] gamma) {
      double[] C1 = new double[s]; // gamma_r^2
      setC(C1, gamma, s);
 
      double pol1 = UNSIX; // BernoulliPoly(2, 0);
      double prod = 1.0;
      for (int r = 0; r < s; ++r)
         prod *= (1.0 + C1[r] * pol1);
      double disc = prod / n;
 
      double sum = 0.0;
      for (int i = 0; i < n - 1; ++i) {
         for (int j = i + 1; j < n; ++j) {
            prod = 1.0;
            for (int r = 0; r < s; ++r) {
               double u = points[i][r] - points[j][r];
               if (u < 0.0)
                  u += 1.0;
               pol1 = u * (u - 1.0) + UNSIX; // Bernoulli(2, u)
               prod *= 1.0 + C1[r] * pol1;
            }
            sum += prod;
         }
      }
 
      disc += 2.0 * sum / ((long) n * n) - 1.0;
      if (disc < 0.0)
         return -1.0;
      return Math.sqrt(disc);
   }

   public double compute(double[] T, int n) {
      double pol1 = UNSIX; // BernoulliPoly(2, 0);
      double disc = pol1 / n;
 
      double sum = 0.0;
      for (int i = 0; i < n - 1; ++i) {
         for (int j = i + 1; j < n; ++j) {
            double h = T[i] - T[j];
            if (h < 0.0)
               h += 1.0;
            pol1 = h * (h - 1.0) + UNSIX; // Bernoulli(2, h)
            sum += pol1;
         }
      }
 
      disc += 2.0 * sum / ((long) n * n);
      if (disc < 0.0)
         return -1.0;
      return Math.sqrt(disc);
   }
 
}