2 /* @(#)e_jn.c 1.4 95/01/18 */
4 * ====================================================
5 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
7 * Developed at SunSoft, a Sun Microsystems, Inc. business.
8 * Permission to use, copy, modify, and distribute this
9 * software is freely granted, provided that this notice
11 * ====================================================
14 #include <sys/cdefs.h>
15 __FBSDID("$FreeBSD$");
18 * __ieee754_jn(n, x), __ieee754_yn(n, x)
19 * floating point Bessel's function of the 1st and 2nd kind
23 * y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
24 * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
25 * Note 2. About jn(n,x), yn(n,x)
26 * For n=0, j0(x) is called,
27 * for n=1, j1(x) is called,
28 * for n<x, forward recursion us used starting
29 * from values of j0(x) and j1(x).
30 * for n>x, a continued fraction approximation to
31 * j(n,x)/j(n-1,x) is evaluated and then backward
32 * recursion is used starting from a supposed value
33 * for j(n,x). The resulting value of j(0,x) is
34 * compared with the actual value to correct the
35 * supposed value of j(n,x).
37 * yn(n,x) is similar in all respects, except
38 * that forward recursion is used for all
44 #include "math_private.h"
46 static const volatile double vone = 1, vzero = 0;
49 invsqrtpi= 5.64189583547756279280e-01, /* 0x3FE20DD7, 0x50429B6D */
50 two = 2.00000000000000000000e+00, /* 0x40000000, 0x00000000 */
51 one = 1.00000000000000000000e+00; /* 0x3FF00000, 0x00000000 */
53 static const double zero = 0.00000000000000000000e+00;
56 __ieee754_jn(int n, double x)
58 int32_t i,hx,ix,lx, sgn;
59 double a, b, temp, di;
62 /* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x)
63 * Thus, J(-n,x) = J(n,-x)
65 EXTRACT_WORDS(hx,lx,x);
67 /* if J(n,NaN) is NaN */
68 if((ix|((u_int32_t)(lx|-lx))>>31)>0x7ff00000) return x+x;
74 if(n==0) return(__ieee754_j0(x));
75 if(n==1) return(__ieee754_j1(x));
76 sgn = (n&1)&(hx>>31); /* even n -- 0, odd n -- sign(x) */
78 if((ix|lx)==0||ix>=0x7ff00000) /* if x is 0 or inf */
80 else if((double)n<=x) {
81 /* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */
82 if(ix>=0x52D00000) { /* x > 2**302 */
84 * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
85 * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
86 * Let s=sin(x), c=cos(x),
87 * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
89 * n sin(xn)*sqt2 cos(xn)*sqt2
90 * ----------------------------------
97 case 0: temp = cos(x)+sin(x); break;
98 case 1: temp = -cos(x)+sin(x); break;
99 case 2: temp = -cos(x)-sin(x); break;
100 case 3: temp = cos(x)-sin(x); break;
102 b = invsqrtpi*temp/sqrt(x);
108 b = b*((double)(i+i)/x) - a; /* avoid underflow */
113 if(ix<0x3e100000) { /* x < 2**-29 */
114 /* x is tiny, return the first Taylor expansion of J(n,x)
115 * J(n,x) = 1/n!*(x/2)^n - ...
117 if(n>33) /* underflow */
120 temp = x*0.5; b = temp;
121 for (a=one,i=2;i<=n;i++) {
122 a *= (double)i; /* a = n! */
123 b *= temp; /* b = (x/2)^n */
128 /* use backward recurrence */
130 * J(n,x)/J(n-1,x) = ---- ------ ------ .....
131 * 2n - 2(n+1) - 2(n+2)
134 * (for large x) = ---- ------ ------ .....
136 * -- - ------ - ------ -
139 * Let w = 2n/x and h=2/x, then the above quotient
140 * is equal to the continued fraction:
142 * = -----------------------
144 * w - -----------------
149 * To determine how many terms needed, let
150 * Q(0) = w, Q(1) = w(w+h) - 1,
151 * Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
152 * When Q(k) > 1e4 good for single
153 * When Q(k) > 1e9 good for double
154 * When Q(k) > 1e17 good for quadruple
158 double q0,q1,h,tmp; int32_t k,m;
159 w = (n+n)/(double)x; h = 2.0/(double)x;
160 q0 = w; z = w+h; q1 = w*z - 1.0; k=1;
168 for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t);
171 /* estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n)
172 * Hence, if n*(log(2n/x)) > ...
173 * single 8.8722839355e+01
174 * double 7.09782712893383973096e+02
175 * long double 1.1356523406294143949491931077970765006170e+04
176 * then recurrent value may overflow and the result is
177 * likely underflow to zero
181 tmp = tmp*__ieee754_log(fabs(v*tmp));
182 if(tmp<7.09782712893383973096e+02) {
183 for(i=n-1,di=(double)(i+i);i>0;i--){
191 for(i=n-1,di=(double)(i+i);i>0;i--){
197 /* scale b to avoid spurious overflow */
207 if (fabs(z) >= fabs(w))
213 if(sgn==1) return -b; else return b;
217 __ieee754_yn(int n, double x)
223 EXTRACT_WORDS(hx,lx,x);
225 /* yn(n,NaN) = NaN */
226 if((ix|((u_int32_t)(lx|-lx))>>31)>0x7ff00000) return x+x;
227 /* yn(n,+-0) = -inf and raise divide-by-zero exception. */
228 if((ix|lx)==0) return -one/vzero;
229 /* yn(n,x<0) = NaN and raise invalid exception. */
230 if(hx<0) return vzero/vzero;
234 sign = 1 - ((n&1)<<1);
236 if(n==0) return(__ieee754_y0(x));
237 if(n==1) return(sign*__ieee754_y1(x));
238 if(ix==0x7ff00000) return zero;
239 if(ix>=0x52D00000) { /* x > 2**302 */
241 * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
242 * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
243 * Let s=sin(x), c=cos(x),
244 * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
246 * n sin(xn)*sqt2 cos(xn)*sqt2
247 * ----------------------------------
254 case 0: temp = sin(x)-cos(x); break;
255 case 1: temp = -sin(x)-cos(x); break;
256 case 2: temp = -sin(x)+cos(x); break;
257 case 3: temp = sin(x)+cos(x); break;
259 b = invsqrtpi*temp/sqrt(x);
264 /* quit if b is -inf */
265 GET_HIGH_WORD(high,b);
266 for(i=1;i<n&&high!=0xfff00000;i++){
268 b = ((double)(i+i)/x)*b - a;
269 GET_HIGH_WORD(high,b);
273 if(sign>0) return b; else return -b;