1 /* @(#)e_jn.c 5.1 93/09/24 */
3 * ====================================================
4 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
6 * Developed at SunPro, a Sun Microsystems, Inc. business.
7 * Permission to use, copy, modify, and distribute this
8 * software is freely granted, provided that this notice
10 * ====================================================
14 * __ieee754_jn(n, x), __ieee754_yn(n, x)
15 * floating point Bessel's function of the 1st and 2nd kind
19 * y0(0)=y1(0)=yn(n,0) = -inf with overflow signal;
20 * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
21 * Note 2. About jn(n,x), yn(n,x)
22 * For n=0, j0(x) is called,
23 * for n=1, j1(x) is called,
24 * for n<x, forward recursion us used starting
25 * from values of j0(x) and j1(x).
26 * for n>x, a continued fraction approximation to
27 * j(n,x)/j(n-1,x) is evaluated and then backward
28 * recursion is used starting from a supposed value
29 * for j(n,x). The resulting value of j(0,x) is
30 * compared with the actual value to correct the
31 * supposed value of j(n,x).
33 * yn(n,x) is similar in all respects, except
34 * that forward recursion is used for all
42 #include <math_private.h>
45 invsqrtpi
= 5.64189583547756279280e-01, /* 0x3FE20DD7, 0x50429B6D */
46 two
= 2.00000000000000000000e+00, /* 0x40000000, 0x00000000 */
47 one
= 1.00000000000000000000e+00; /* 0x3FF00000, 0x00000000 */
49 static const double zero
= 0.00000000000000000000e+00;
52 __ieee754_jn (int n
, double x
)
54 int32_t i
, hx
, ix
, lx
, sgn
;
55 double a
, b
, temp
, di
, ret
;
58 /* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x)
59 * Thus, J(-n,x) = J(n,-x)
61 EXTRACT_WORDS (hx
, lx
, x
);
63 /* if J(n,NaN) is NaN */
64 if (__glibc_unlikely ((ix
| ((u_int32_t
) (lx
| -lx
)) >> 31) > 0x7ff00000))
73 return (__ieee754_j0 (x
));
75 return (__ieee754_j1 (x
));
76 sgn
= (n
& 1) & (hx
>> 31); /* even n -- 0, odd n -- sign(x) */
79 SET_RESTORE_ROUND (FE_TONEAREST
);
80 if (__glibc_unlikely ((ix
| lx
) == 0 || ix
>= 0x7ff00000))
81 /* if x is 0 or inf */
82 return sgn
== 1 ? -zero
: zero
;
83 else if ((double) n
<= x
)
85 /* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */
86 if (ix
>= 0x52D00000) /* x > 2**302 */
88 * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
89 * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
90 * Let s=sin(x), c=cos(x),
91 * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
93 * n sin(xn)*sqt2 cos(xn)*sqt2
94 * ----------------------------------
102 __sincos (x
, &s
, &c
);
105 case 0: temp
= c
+ s
; break;
106 case 1: temp
= -c
+ s
; break;
107 case 2: temp
= -c
- s
; break;
108 case 3: temp
= c
- s
; break;
110 b
= invsqrtpi
* temp
/ __ieee754_sqrt (x
);
114 a
= __ieee754_j0 (x
);
115 b
= __ieee754_j1 (x
);
116 for (i
= 1; i
< n
; i
++)
119 b
= b
* ((double) (i
+ i
) / x
) - a
; /* avoid underflow */
126 if (ix
< 0x3e100000) /* x < 2**-29 */
127 { /* x is tiny, return the first Taylor expansion of J(n,x)
128 * J(n,x) = 1/n!*(x/2)^n - ...
130 if (n
> 33) /* underflow */
134 temp
= x
* 0.5; b
= temp
;
135 for (a
= one
, i
= 2; i
<= n
; i
++)
137 a
*= (double) i
; /* a = n! */
138 b
*= temp
; /* b = (x/2)^n */
145 /* use backward recurrence */
147 * J(n,x)/J(n-1,x) = ---- ------ ------ .....
148 * 2n - 2(n+1) - 2(n+2)
151 * (for large x) = ---- ------ ------ .....
153 * -- - ------ - ------ -
156 * Let w = 2n/x and h=2/x, then the above quotient
157 * is equal to the continued fraction:
159 * = -----------------------
161 * w - -----------------
166 * To determine how many terms needed, let
167 * Q(0) = w, Q(1) = w(w+h) - 1,
168 * Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
169 * When Q(k) > 1e4 good for single
170 * When Q(k) > 1e9 good for double
171 * When Q(k) > 1e17 good for quadruple
175 double q0
, q1
, h
, tmp
; int32_t k
, m
;
176 w
= (n
+ n
) / (double) x
; h
= 2.0 / (double) x
;
177 q0
= w
; z
= w
+ h
; q1
= w
* z
- 1.0; k
= 1;
186 for (t
= zero
, i
= 2 * (n
+ k
); i
>= m
; i
-= 2)
187 t
= one
/ (i
/ x
- t
);
190 /* estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n)
191 * Hence, if n*(log(2n/x)) > ...
192 * single 8.8722839355e+01
193 * double 7.09782712893383973096e+02
194 * long double 1.1356523406294143949491931077970765006170e+04
195 * then recurrent value may overflow and the result is
196 * likely underflow to zero
200 tmp
= tmp
* __ieee754_log (fabs (v
* tmp
));
201 if (tmp
< 7.09782712893383973096e+02)
203 for (i
= n
- 1, di
= (double) (i
+ i
); i
> 0; i
--)
214 for (i
= n
- 1, di
= (double) (i
+ i
); i
> 0; i
--)
221 /* scale b to avoid spurious overflow */
230 /* j0() and j1() suffer enormous loss of precision at and
231 * near zero; however, we know that their zero points never
232 * coincide, so just choose the one further away from zero.
234 z
= __ieee754_j0 (x
);
235 w
= __ieee754_j1 (x
);
236 if (fabs (z
) >= fabs (w
))
248 ret
= __copysign (DBL_MIN
, ret
) * DBL_MIN
;
251 strong_alias (__ieee754_jn
, __jn_finite
)
254 __ieee754_yn (int n
, double x
)
256 int32_t i
, hx
, ix
, lx
;
258 double a
, b
, temp
, ret
;
260 EXTRACT_WORDS (hx
, lx
, x
);
261 ix
= 0x7fffffff & hx
;
262 /* if Y(n,NaN) is NaN */
263 if (__glibc_unlikely ((ix
| ((u_int32_t
) (lx
| -lx
)) >> 31) > 0x7ff00000))
265 if (__glibc_unlikely ((ix
| lx
) == 0))
266 return -HUGE_VAL
+ x
;
267 /* -inf and overflow exception. */;
268 if (__glibc_unlikely (hx
< 0))
269 return zero
/ (zero
* x
);
274 sign
= 1 - ((n
& 1) << 1);
277 return (__ieee754_y0 (x
));
279 SET_RESTORE_ROUND (FE_TONEAREST
);
282 ret
= sign
* __ieee754_y1 (x
);
285 if (__glibc_unlikely (ix
== 0x7ff00000))
287 if (ix
>= 0x52D00000) /* x > 2**302 */
289 * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
290 * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
291 * Let s=sin(x), c=cos(x),
292 * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
294 * n sin(xn)*sqt2 cos(xn)*sqt2
295 * ----------------------------------
303 __sincos (x
, &s
, &c
);
306 case 0: temp
= s
- c
; break;
307 case 1: temp
= -s
- c
; break;
308 case 2: temp
= -s
+ c
; break;
309 case 3: temp
= s
+ c
; break;
311 b
= invsqrtpi
* temp
/ __ieee754_sqrt (x
);
316 a
= __ieee754_y0 (x
);
317 b
= __ieee754_y1 (x
);
318 /* quit if b is -inf */
319 GET_HIGH_WORD (high
, b
);
320 for (i
= 1; i
< n
&& high
!= 0xfff00000; i
++)
323 b
= ((double) (i
+ i
) / x
) * b
- a
;
324 GET_HIGH_WORD (high
, b
);
327 /* If B is +-Inf, set up errno accordingly. */
329 __set_errno (ERANGE
);
338 ret
= __copysign (DBL_MAX
, ret
) * DBL_MAX
;
341 strong_alias (__ieee754_yn
, __yn_finite
)