DiscL2Unanchored.java

/*
 * Class:        DiscL2Unanchored
 * Description:  computes the L_2 unanchored discrepancy
 * 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;

public class DiscL2Unanchored extends Discrepancy {
 
   public double compute(double[][] points, int n, int s, double[] gamma) {
      return compute(points, n, s);
   }

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

   public DiscL2Unanchored(int n, int s) {
      super(null, n, s);
   }

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

   public DiscL2Unanchored() {
      super();
   }

   public double compute(double[][] points, int n, int s) {
      double sum = 0.0;
      for (int i = 0; i < n; ++i) {
         double prod = 1.0;
         for (int k = 0; k < s; ++k)
            prod *= points[i][k] * (1.0 - points[i][k]);
         sum += prod;
      }
      double disc = sum / n * (1.0 / n - Math.pow(0.5, (double) (s - 1)));
 
      sum = 0.0;
      for (int i = 0; i < n - 1; ++i) {
         for (int j = i + 1; j < n; ++j) {
            double prod = 1.0;
            for (int k = 0; k < s; ++k)
               prod *= Math.min(points[i][k], points[j][k]) - points[i][k] * points[j][k];
            sum += prod;
         }
      }
 
      disc += 2.0 * sum / ((long) n * n);
      disc += Math.pow(1.0 / 12.0, s);
      if (disc < 0.0)
         return -1.0;
      return Math.sqrt(disc);
   }

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