1 /* e_jnf.c -- float version of e_jn.c.
2 * Conversion to float by Ian Lance Taylor, Cygnus Support, ian@cygnus.com.
6 * ====================================================
7 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
9 * Developed at SunPro, a Sun Microsystems, Inc. business.
10 * Permission to use, copy, modify, and distribute this
11 * software is freely granted, provided that this notice
13 * ====================================================
15 * $NetBSD: e_jnf.c,v 1.9 2002/05/26 22:01:50 wiz Exp $
16 * $DragonFly: src/lib/libm/src/e_jnf.c,v 1.1 2005/07/26 21:15:20 joerg Exp $
20 #include "math_private.h"
24 invsqrtpi
= 5.6418961287e-01, /* 0x3f106ebb */
26 two
= 2.0000000000e+00, /* 0x40000000 */
27 one
= 1.0000000000e+00; /* 0x3F800000 */
29 static const float zero
= 0.0000000000e+00;
38 /* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x)
39 * Thus, J(-n,x) = J(n,-x)
43 /* if J(n,NaN) is NaN */
44 if(ix
>0x7f800000) return x
+x
;
50 if(n
==0) return(j0f(x
));
51 if(n
==1) return(j1f(x
));
52 sgn
= (n
&1)&(hx
>>31); /* even n -- 0, odd n -- sign(x) */
54 if(ix
==0||ix
>=0x7f800000) /* if x is 0 or inf */
56 else if((float)n
<=x
) {
57 /* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */
62 b
= b
*((float)(i
+i
)/x
) - a
; /* avoid underflow */
66 if(ix
<0x30800000) { /* x < 2**-29 */
67 /* x is tiny, return the first Taylor expansion of J(n,x)
68 * J(n,x) = 1/n!*(x/2)^n - ...
70 if(n
>33) /* underflow */
73 temp
= x
*(float)0.5; b
= temp
;
74 for (a
=one
,i
=2;i
<=n
;i
++) {
75 a
*= (float)i
; /* a = n! */
76 b
*= temp
; /* b = (x/2)^n */
81 /* use backward recurrence */
83 * J(n,x)/J(n-1,x) = ---- ------ ------ .....
84 * 2n - 2(n+1) - 2(n+2)
87 * (for large x) = ---- ------ ------ .....
89 * -- - ------ - ------ -
92 * Let w = 2n/x and h=2/x, then the above quotient
93 * is equal to the continued fraction:
95 * = -----------------------
97 * w - -----------------
102 * To determine how many terms needed, let
103 * Q(0) = w, Q(1) = w(w+h) - 1,
104 * Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
105 * When Q(k) > 1e4 good for single
106 * When Q(k) > 1e9 good for double
107 * When Q(k) > 1e17 good for quadruple
111 float q0
,q1
,h
,tmp
; int32_t k
,m
;
112 w
= (n
+n
)/(float)x
; h
= (float)2.0/(float)x
;
113 q0
= w
; z
= w
+h
; q1
= w
*z
- (float)1.0; k
=1;
114 while(q1
<(float)1.0e9
) {
121 for(t
=zero
, i
= 2*(n
+k
); i
>=m
; i
-= 2) t
= one
/(i
/x
-t
);
124 /* estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n)
125 * Hence, if n*(log(2n/x)) > ...
126 * single 8.8722839355e+01
127 * double 7.09782712893383973096e+02
128 * long double 1.1356523406294143949491931077970765006170e+04
129 * then recurrent value may overflow and the result is
130 * likely underflow to zero
134 tmp
= tmp
*logf(fabsf(v
*tmp
));
135 if(tmp
<(float)8.8721679688e+01) {
136 for(i
=n
-1,di
=(float)(i
+i
);i
>0;i
--){
144 for(i
=n
-1,di
=(float)(i
+i
);i
>0;i
--){
150 /* scale b to avoid spurious overflow */
161 if(sgn
==1) return -b
; else return b
;
171 GET_FLOAT_WORD(hx
,x
);
173 /* if Y(n,NaN) is NaN */
174 if(ix
>0x7f800000) return x
+x
;
175 if(ix
==0) return -one
/zero
;
176 if(hx
<0) return zero
/zero
;
180 sign
= 1 - ((n
&1)<<1);
182 if(n
==0) return(y0f(x
));
183 if(n
==1) return(sign
*y1f(x
));
184 if(ix
==0x7f800000) return zero
;
188 /* quit if b is -inf */
189 GET_FLOAT_WORD(ib
,b
);
190 for(i
=1;i
<n
&&ib
!=0xff800000;i
++){
192 b
= ((float)(i
+i
)/x
)*b
- a
;
193 GET_FLOAT_WORD(ib
,b
);
196 if(sign
>0) return b
; else return -b
;