watsonue.c 1.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <math.h>
  4. #include "local_proto.h"
  5. double *Cdhc_watson_u2_exp(double *x, int n)
  6. {
  7. double *xcopy, mean = 0.0, zbar = 0.0, fn2, fx, sum4 = 0.0;
  8. static double y[2];
  9. int i;
  10. if ((xcopy = (double *)malloc(n * sizeof(double))) == NULL) {
  11. fprintf(stderr, "Memory error in Cdhc_watson_u2_exp\n");
  12. exit(EXIT_FAILURE);
  13. }
  14. for (i = 0; i < n; ++i) {
  15. xcopy[i] = x[i];
  16. mean += x[i];
  17. }
  18. mean /= n;
  19. qsort(xcopy, n, sizeof(double), Cdhc_dcmp);
  20. for (i = 0; i < n; ++i) {
  21. fx = 1 - exp(-xcopy[i] / mean);
  22. if (fx <= 1e-5)
  23. fx = 1e-5;
  24. if (fx >= 0.99999)
  25. fx = 0.99999;
  26. /* sum3 += 2 * (i + 1) * (log (fx) + log (1.0 - fx[n - i - 1])); */
  27. fn2 = (2.0 * i + 1.0) / (2.0 * n);
  28. sum4 += (fx - fn2) * (fx - fn2);
  29. fn2 = (2.0 * (i + 1) - 1.0) / (2.0 * n);
  30. zbar += fx;
  31. }
  32. zbar /= n;
  33. y[0] = (1.0 / (n * 12) + sum4) - n * (zbar - .5) * (zbar - .5);
  34. y[0] *= 1.0 + 0.16 / n;
  35. #ifdef NOISY
  36. fprintf(stdout, " TEST19 WU2(E) =%10.4f\n", y[0]);
  37. #endif /* NOISY */
  38. free(xcopy);
  39. return y;
  40. }