/
ndtr.c
338 lines (294 loc) · 6.67 KB
/
ndtr.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
/* ndtr.c
*
* Normal distribution function
*
*
*
* SYNOPSIS:
*
* double x, y, ndtr();
*
* y = ndtr( x );
*
*
*
* DESCRIPTION:
*
* Returns the area under the Gaussian probability density
* function, integrated from minus infinity to x:
*
* x
* -
* 1 | | 2
* ndtr(x) = --------- | exp( - t /2 ) dt
* sqrt(2pi) | |
* -
* -inf.
*
* = ( 1 + erf(z) ) / 2
* = erfc(z) / 2
*
* where z = x/sqrt(2). Computation is via the functions
* erf and erfc.
*
*
* ACCURACY:
*
* Relative error:
* arithmetic domain # trials peak rms
* IEEE -13,0 30000 3.4e-14 6.7e-15
*
*
* ERROR MESSAGES:
*
* message condition value returned
* erfc underflow x > 37.519379347 0.0
*
*/
/* erf.c
*
* Error function
*
*
*
* SYNOPSIS:
*
* double x, y, erf();
*
* y = erf( x );
*
*
*
* DESCRIPTION:
*
* The integral is
*
* x
* -
* 2 | | 2
* erf(x) = -------- | exp( - t ) dt.
* sqrt(pi) | |
* -
* 0
*
* For 0 <= |x| < 1, erf(x) = x * P4(x**2)/Q5(x**2); otherwise
* erf(x) = 1 - erfc(x).
*
*
*
* ACCURACY:
*
* Relative error:
* arithmetic domain # trials peak rms
* IEEE 0,1 30000 3.7e-16 1.0e-16
*
*/
/* erfc.c
*
* Complementary error function
*
*
*
* SYNOPSIS:
*
* double x, y, erfc();
*
* y = erfc( x );
*
*
*
* DESCRIPTION:
*
*
* 1 - erf(x) =
*
* inf.
* -
* 2 | | 2
* erfc(x) = -------- | exp( - t ) dt
* sqrt(pi) | |
* -
* x
*
*
* For small x, erfc(x) = 1 - erf(x); otherwise rational
* approximations are computed.
*
*
*
* ACCURACY:
*
* Relative error:
* arithmetic domain # trials peak rms
* IEEE 0,26.6417 30000 5.7e-14 1.5e-14
*/
/*
* Cephes Math Library Release 2.2: June, 1992
* Copyright 1984, 1987, 1988, 1992 by Stephen L. Moshier
* Direct inquiries to 30 Frost Street, Cambridge, MA 02140
*/
#include <float.h> /* DBL_EPSILON */
#include "mconf.h"
extern double MAXLOG;
static double P[] = {
2.46196981473530512524E-10,
5.64189564831068821977E-1,
7.46321056442269912687E0,
4.86371970985681366614E1,
1.96520832956077098242E2,
5.26445194995477358631E2,
9.34528527171957607540E2,
1.02755188689515710272E3,
5.57535335369399327526E2
};
static double Q[] = {
/* 1.00000000000000000000E0, */
1.32281951154744992508E1,
8.67072140885989742329E1,
3.54937778887819891062E2,
9.75708501743205489753E2,
1.82390916687909736289E3,
2.24633760818710981792E3,
1.65666309194161350182E3,
5.57535340817727675546E2
};
static double R[] = {
5.64189583547755073984E-1,
1.27536670759978104416E0,
5.01905042251180477414E0,
6.16021097993053585195E0,
7.40974269950448939160E0,
2.97886665372100240670E0
};
static double S[] = {
/* 1.00000000000000000000E0, */
2.26052863220117276590E0,
9.39603524938001434673E0,
1.20489539808096656605E1,
1.70814450747565897222E1,
9.60896809063285878198E0,
3.36907645100081516050E0
};
static double T[] = {
9.60497373987051638749E0,
9.00260197203842689217E1,
2.23200534594684319226E3,
7.00332514112805075473E3,
5.55923013010394962768E4
};
static double U[] = {
/* 1.00000000000000000000E0, */
3.35617141647503099647E1,
5.21357949780152679795E2,
4.59432382970980127987E3,
2.26290000613890934246E4,
4.92673942608635921086E4
};
#define UTHRESH 37.519379347
double ndtr(double a)
{
double x, y, z;
if (cephes_isnan(a)) {
mtherr("ndtr", DOMAIN);
return (NPY_NAN);
}
x = a * NPY_SQRT1_2;
z = fabs(x);
if (z < NPY_SQRT1_2)
y = 0.5 + 0.5 * erf(x);
else {
y = 0.5 * erfc(z);
if (x > 0)
y = 1.0 - y;
}
return (y);
}
double erfc(double a)
{
double p, q, x, y, z;
if (cephes_isnan(a)) {
mtherr("erfc", DOMAIN);
return (NPY_NAN);
}
if (a < 0.0)
x = -a;
else
x = a;
if (x < 1.0)
return (1.0 - erf(a));
z = -a * a;
if (z < -MAXLOG) {
under:
mtherr("erfc", UNDERFLOW);
if (a < 0)
return (2.0);
else
return (0.0);
}
z = exp(z);
if (x < 8.0) {
p = polevl(x, P, 8);
q = p1evl(x, Q, 8);
}
else {
p = polevl(x, R, 5);
q = p1evl(x, S, 6);
}
y = (z * p) / q;
if (a < 0)
y = 2.0 - y;
if (y == 0.0)
goto under;
return (y);
}
double erf(double x)
{
double y, z;
if (cephes_isnan(x)) {
mtherr("erf", DOMAIN);
return (NPY_NAN);
}
if (fabs(x) > 1.0)
return (1.0 - erfc(x));
z = x * x;
y = x * polevl(z, T, 4) / p1evl(z, U, 5);
return (y);
}
/*
* double log_ndtr(double a)
*
* For a > -20, use the existing ndtr technique and take a log.
* for a <= -20, we use the Taylor series approximation of erf to compute
* the log CDF directly. The Taylor series consists of two parts which we will name "left"
* and "right" accordingly. The right part involves a summation which we compute until the
* difference in terms falls below the machine-specific EPSILON.
*
* \Phi(z) &=&
* \frac{e^{-z^2/2}}{-z\sqrt{2\pi}} * [1 + \sum_{n=1}^{N-1} (-1)^n \frac{(2n-1)!!}{(z^2)^n}]
* + O(z^{-2N+2})
* = [\mbox{LHS}] * [\mbox{RHS}] + \mbox{error}.
*
*/
double log_ndtr(double a)
{
double log_LHS, /* we compute the left hand side of the approx (LHS) in one shot */
last_total = 0, /* variable used to check for convergence */
right_hand_side = 1, /* includes first term from the RHS summation */
numerator = 1, /* numerator for RHS summand */
denom_factor = 1, /* use reciprocal for denominator to avoid division */
denom_cons = 1.0 / (a * a); /* the precomputed division we use to adjust the denominator */
long sign = 1, i = 0;
if (a > -20) {
return log(ndtr(a));
}
log_LHS = -0.5 * a * a - log(-a) - 0.5 * log(2 * M_PI);
while (fabs(last_total - right_hand_side) > DBL_EPSILON) {
i += 1;
last_total = right_hand_side;
sign = -sign;
denom_factor *= denom_cons;
numerator *= 2 * i - 1;
right_hand_side += sign * numerator * denom_factor;
}
return log_LHS + log(right_hand_side);
}