gsl_randist__gausstail.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. /* randist/gausstail.c
  2. *
  3. * Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 James Theiler, Brian Gough
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 3 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  18. */
  19. #include "gsl__config.h"
  20. #include <math.h>
  21. #include "gsl_math.h"
  22. #include "gsl_rng.h"
  23. #include "gsl_randist.h"
  24. #include "gsl_sf_erf.h"
  25. double
  26. gsl_ran_gaussian_tail (const gsl_rng * r, const double a, const double sigma)
  27. {
  28. /* Returns a gaussian random variable larger than a
  29. * This implementation does one-sided upper-tailed deviates.
  30. */
  31. double s = a / sigma;
  32. if (s < 1)
  33. {
  34. /* For small s, use a direct rejection method. The limit s < 1
  35. can be adjusted to optimise the overall efficiency */
  36. double x;
  37. do
  38. {
  39. x = gsl_ran_gaussian (r, 1.0);
  40. }
  41. while (x < s);
  42. return x * sigma;
  43. }
  44. else
  45. {
  46. /* Use the "supertail" deviates from the last two steps
  47. * of Marsaglia's rectangle-wedge-tail method, as described
  48. * in Knuth, v2, 3rd ed, pp 123-128. (See also exercise 11, p139,
  49. * and the solution, p586.)
  50. */
  51. double u, v, x;
  52. do
  53. {
  54. u = gsl_rng_uniform (r);
  55. do
  56. {
  57. v = gsl_rng_uniform (r);
  58. }
  59. while (v == 0.0);
  60. x = sqrt (s * s - 2 * log (v));
  61. }
  62. while (x * u > s);
  63. return x * sigma;
  64. }
  65. }
  66. double
  67. gsl_ran_gaussian_tail_pdf (const double x, const double a, const double sigma)
  68. {
  69. if (x < a)
  70. {
  71. return 0;
  72. }
  73. else
  74. {
  75. double N, p;
  76. double u = x / sigma ;
  77. double f = gsl_sf_erfc (a / (sqrt (2.0) * sigma));
  78. N = 0.5 * f;
  79. p = (1 / (N * sqrt (2 * M_PI) * sigma)) * exp (-u * u / 2);
  80. return p;
  81. }
  82. }
  83. double
  84. gsl_ran_ugaussian_tail (const gsl_rng * r, const double a)
  85. {
  86. return gsl_ran_gaussian_tail (r, a, 1.0) ;
  87. }
  88. double
  89. gsl_ran_ugaussian_tail_pdf (const double x, const double a)
  90. {
  91. return gsl_ran_gaussian_tail_pdf (x, a, 1.0) ;
  92. }