2 * ====================================================
3 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
5 * Developed at SunSoft, a Sun Microsystems, Inc. business.
6 * Permission to use, copy, modify, and distribute this
7 * software is freely granted, provided that this notice
9 * ====================================================
14 * floating point Bessel's function of the 1st and 2nd kind
18 * y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
19 * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
20 * Note 2. About jn(n,x), yn(n,x)
21 * For n=0, j0(x) is called.
22 * For n=1, j1(x) is called.
23 * For n<x, forward recursion is used starting
24 * from values of j0(x) and j1(x).
25 * For n>x, a continued fraction approximation to
26 * j(n,x)/j(n-1,x) is evaluated and then backward
27 * recursion is used starting from a supposed value
28 * for j(n,x). The resulting values of j(0,x) or j(1,x) are
29 * compared with the actual values to correct the
30 * supposed value of j(n,x).
32 * yn(n,x) is similar in all respects, except
33 * that forward recursion is used for all
38 #include "math_private.h"
40 static const volatile double vone = 1, vzero = 0;
43 invsqrtpi= 5.64189583547756279280e-01, /* 0x3FE20DD7, 0x50429B6D */
44 two = 2.00000000000000000000e+00, /* 0x40000000, 0x00000000 */
45 one = 1.00000000000000000000e+00; /* 0x3FF00000, 0x00000000 */
47 static const double zero = 0.00000000000000000000e+00;
52 int32_t i,hx,ix,lx, sgn;
53 double a, b, c, s, temp, di;
56 /* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x)
57 * Thus, J(-n,x) = J(n,-x)
59 EXTRACT_WORDS(hx,lx,x);
61 /* if J(n,NaN) is NaN */
62 if((ix|((u_int32_t)(lx|-lx))>>31)>0x7ff00000) return x+x;
68 if(n==0) return(j0(x));
69 if(n==1) return(j1(x));
70 sgn = (n&1)&(hx>>31); /* even n -- 0, odd n -- sign(x) */
72 if((ix|lx)==0||ix>=0x7ff00000) /* if x is 0 or inf */
74 else if((double)n<=x) {
75 /* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */
76 if(ix>=0x52D00000) { /* x > 2**302 */
78 * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
79 * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
80 * Let s=sin(x), c=cos(x),
81 * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2), then
83 * n sin(xn)*sqt2 cos(xn)*sqt2
84 * ----------------------------------
92 case 0: temp = c+s; break;
93 case 1: temp = -c+s; break;
94 case 2: temp = -c-s; break;
95 case 3: temp = c-s; break;
97 b = invsqrtpi*temp/sqrt(x);
103 b = b*((double)(i+i)/x) - a; /* avoid underflow */
108 if(ix<0x3e100000) { /* x < 2**-29 */
109 /* x is tiny, return the first Taylor expansion of J(n,x)
110 * J(n,x) = 1/n!*(x/2)^n - ...
112 if(n>33) /* underflow */
115 temp = x*0.5; b = temp;
116 for (a=one,i=2;i<=n;i++) {
117 a *= (double)i; /* a = n! */
118 b *= temp; /* b = (x/2)^n */
123 /* use backward recurrence */
125 * J(n,x)/J(n-1,x) = ---- ------ ------ .....
126 * 2n - 2(n+1) - 2(n+2)
129 * (for large x) = ---- ------ ------ .....
131 * -- - ------ - ------ -
134 * Let w = 2n/x and h=2/x, then the above quotient
135 * is equal to the continued fraction:
137 * = -----------------------
139 * w - -----------------
144 * To determine how many terms needed, let
145 * Q(0) = w, Q(1) = w(w+h) - 1,
146 * Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
147 * When Q(k) > 1e4 good for single
148 * When Q(k) > 1e9 good for double
149 * When Q(k) > 1e17 good for quadruple
153 double q0,q1,h,tmp; int32_t k,m;
154 w = (n+n)/(double)x; h = 2.0/(double)x;
155 q0 = w; z = w+h; q1 = w*z - 1.0; k=1;
163 for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t);
166 /* estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n)
167 * Hence, if n*(log(2n/x)) > ...
168 * single 8.8722839355e+01
169 * double 7.09782712893383973096e+02
170 * long double 1.1356523406294143949491931077970765006170e+04
171 * then recurrent value may overflow and the result is
172 * likely underflow to zero
176 tmp = tmp*log(fabs(v*tmp));
177 if(tmp<7.09782712893383973096e+02) {
178 for(i=n-1,di=(double)(i+i);i>0;i--){
186 for(i=n-1,di=(double)(i+i);i>0;i--){
192 /* scale b to avoid spurious overflow */
202 if (fabs(z) >= fabs(w))
208 if(sgn==1) return -b; else return b;
216 double a, b, c, s, temp;
218 EXTRACT_WORDS(hx,lx,x);
220 /* yn(n,NaN) = NaN */
221 if((ix|((u_int32_t)(lx|-lx))>>31)>0x7ff00000) return x+x;
222 /* yn(n,+-0) = -inf and raise divide-by-zero exception. */
223 if((ix|lx)==0) return -one/vzero;
224 /* yn(n,x<0) = NaN and raise invalid exception. */
225 if(hx<0) return vzero/vzero;
229 sign = 1 - ((n&1)<<1);
231 if(n==0) return(y0(x));
232 if(n==1) return(sign*y1(x));
233 if(ix==0x7ff00000) return zero;
234 if(ix>=0x52D00000) { /* x > 2**302 */
236 * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
237 * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
238 * Let s=sin(x), c=cos(x),
239 * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2), then
241 * n sin(xn)*sqt2 cos(xn)*sqt2
242 * ----------------------------------
250 case 0: temp = s-c; break;
251 case 1: temp = -s-c; break;
252 case 2: temp = -s+c; break;
253 case 3: temp = s+c; break;
255 b = invsqrtpi*temp/sqrt(x);
260 /* quit if b is -inf */
261 GET_HIGH_WORD(high,b);
262 for(i=1;i<n&&high!=0xfff00000;i++){
264 b = ((double)(i+i)/x)*b - a;
265 GET_HIGH_WORD(high,b);
269 if(sign>0) return b; else return -b;