base/math/e_j0.c

Go to the documentation of this file.
00001 /* @(#)e_j0.c 5.1 93/09/24 */ 00002 /* 00003 * ==================================================== 00004 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved. 00005 * 00006 * Developed at SunPro, a Sun Microsystems, Inc. business. 00007 * Permission to use, copy, modify, and distribute this 00008 * software is freely granted, provided that this notice 00009 * is preserved. 00010 * ==================================================== 00011 */ 00012 00013 #if defined(LIBM_SCCS) && !defined(lint) 00014 static char rcsid[] = "$NetBSD: e_j0.c,v 1.8 1995/05/10 20:45:23 jtc Exp $"; 00015 #endif 00016 00017 /* __ieee754_j0(x), __ieee754_y0(x) 00018 * Bessel function of the first and second kinds of order zero. 00019 * Method -- j0(x): 00020 * 1. For tiny x, we use j0(x) = 1 - x^2/4 + x^4/64 - ... 00021 * 2. Reduce x to |x| since j0(x)=j0(-x), and 00022 * for x in (0,2) 00023 * j0(x) = 1-z/4+ z^2*R0/S0, where z = x*x; 00024 * (precision: |j0-1+z/4-z^2R0/S0 |<2**-63.67 ) 00025 * for x in (2,inf) 00026 * j0(x) = sqrt(2/(pi*x))*(p0(x)*cos(x0)-q0(x)*sin(x0)) 00027 * where x0 = x-pi/4. It is better to compute sin(x0),cos(x0) 00028 * as follow: 00029 * cos(x0) = cos(x)cos(pi/4)+sin(x)sin(pi/4) 00030 * = 1/sqrt(2) * (cos(x) + sin(x)) 00031 * sin(x0) = sin(x)cos(pi/4)-cos(x)sin(pi/4) 00032 * = 1/sqrt(2) * (sin(x) - cos(x)) 00033 * (To avoid cancellation, use 00034 * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x)) 00035 * to compute the worse one.) 00036 * 00037 * 3 Special cases 00038 * j0(nan)= nan 00039 * j0(0) = 1 00040 * j0(inf) = 0 00041 * 00042 * Method -- y0(x): 00043 * 1. For x<2. 00044 * Since 00045 * y0(x) = 2/pi*(j0(x)*(ln(x/2)+Euler) + x^2/4 - ...) 00046 * therefore y0(x)-2/pi*j0(x)*ln(x) is an even function. 00047 * We use the following function to approximate y0, 00048 * y0(x) = U(z)/V(z) + (2/pi)*(j0(x)*ln(x)), z= x^2 00049 * where 00050 * U(z) = u00 + u01*z + ... + u06*z^6 00051 * V(z) = 1 + v01*z + ... + v04*z^4 00052 * with absolute approximation error bounded by 2**-72. 00053 * Note: For tiny x, U/V = u0 and j0(x)~1, hence 00054 * y0(tiny) = u0 + (2/pi)*ln(tiny), (choose tiny<2**-27) 00055 * 2. For x>=2. 00056 * y0(x) = sqrt(2/(pi*x))*(p0(x)*cos(x0)+q0(x)*sin(x0)) 00057 * where x0 = x-pi/4. It is better to compute sin(x0),cos(x0) 00058 * by the method mentioned above. 00059 * 3. Special cases: y0(0)=-inf, y0(x<0)=NaN, y0(inf)=0. 00060 */ 00061 00062 #include "math.h" 00063 #include "mathP.h" 00064 00065 #ifdef __STDC__ 00066 static double pzero(double), qzero(double); 00067 #else 00068 static double pzero(), qzero(); 00069 #endif 00070 00071 #ifdef __STDC__ 00072 static const double 00073 #else 00074 static double 00075 #endif 00076 huge = 1e300, 00077 one = 1.0, 00078 invsqrtpi= 5.64189583547756279280e-01, /* 0x3FE20DD7, 0x50429B6D */ 00079 tpi = 6.36619772367581382433e-01, /* 0x3FE45F30, 0x6DC9C883 */ 00080 /* R0/S0 on [0, 2.00] */ 00081 R02 = 1.56249999999999947958e-02, /* 0x3F8FFFFF, 0xFFFFFFFD */ 00082 R03 = -1.89979294238854721751e-04, /* 0xBF28E6A5, 0xB61AC6E9 */ 00083 R04 = 1.82954049532700665670e-06, /* 0x3EBEB1D1, 0x0C503919 */ 00084 R05 = -4.61832688532103189199e-09, /* 0xBE33D5E7, 0x73D63FCE */ 00085 S01 = 1.56191029464890010492e-02, /* 0x3F8FFCE8, 0x82C8C2A4 */ 00086 S02 = 1.16926784663337450260e-04, /* 0x3F1EA6D2, 0xDD57DBF4 */ 00087 S03 = 5.13546550207318111446e-07, /* 0x3EA13B54, 0xCE84D5A9 */ 00088 S04 = 1.16614003333790000205e-09; /* 0x3E1408BC, 0xF4745D8F */ 00089 00090 #ifdef __STDC__ 00091 static const double zero = 0.0; 00092 #else 00093 static double zero = 0.0; 00094 #endif 00095 00096 #ifdef __STDC__ 00097 double __ieee754_j0(double x) 00098 #else 00099 double __ieee754_j0(x) 00100 double x; 00101 #endif 00102 { 00103 double z, s,c,ss,cc,r,u,v; 00104 int32_t hx,ix; 00105 00106 GET_HIGH_WORD(hx,x); 00107 ix = hx&0x7fffffff; 00108 if(ix>=0x7ff00000) return one/(x*x); 00109 x = fabs(x); 00110 if(ix >= 0x40000000) { /* |x| >= 2.0 */ 00111 s = sin(x); 00112 c = cos(x); 00113 ss = s-c; 00114 cc = s+c; 00115 if(ix<0x7fe00000) { /* make sure x+x not overflow */ 00116 z = -cos(x+x); 00117 if ((s*c)<zero) cc = z/ss; 00118 else ss = z/cc; 00119 } 00120 /* 00121 * j0(x) = 1/sqrt(pi) * (P(0,x)*cc - Q(0,x)*ss) / sqrt(x) 00122 * y0(x) = 1/sqrt(pi) * (P(0,x)*ss + Q(0,x)*cc) / sqrt(x) 00123 */ 00124 if(ix>0x48000000) z = (invsqrtpi*cc)/sqrt(x); 00125 else { 00126 u = pzero(x); v = qzero(x); 00127 z = invsqrtpi*(u*cc-v*ss)/sqrt(x); 00128 } 00129 return z; 00130 } 00131 if(ix<0x3f200000) { /* |x| < 2**-13 */ 00132 if(huge+x>one) { /* raise inexact if x != 0 */ 00133 if(ix<0x3e400000) return one; /* |x|<2**-27 */ 00134 else return one - 0.25*x*x; 00135 } 00136 } 00137 z = x*x; 00138 r = z*(R02+z*(R03+z*(R04+z*R05))); 00139 s = one+z*(S01+z*(S02+z*(S03+z*S04))); 00140 if(ix < 0x3FF00000) { /* |x| < 1.00 */ 00141 return one + z*(-0.25+(r/s)); 00142 } else { 00143 u = 0.5*x; 00144 return((one+u)*(one-u)+z*(r/s)); 00145 } 00146 } 00147 00148 #ifdef __STDC__ 00149 static const double 00150 #else 00151 static double 00152 #endif 00153 u00 = -7.38042951086872317523e-02, /* 0xBFB2E4D6, 0x99CBD01F */ 00154 u01 = 1.76666452509181115538e-01, /* 0x3FC69D01, 0x9DE9E3FC */ 00155 u02 = -1.38185671945596898896e-02, /* 0xBF8C4CE8, 0xB16CFA97 */ 00156 u03 = 3.47453432093683650238e-04, /* 0x3F36C54D, 0x20B29B6B */ 00157 u04 = -3.81407053724364161125e-06, /* 0xBECFFEA7, 0x73D25CAD */ 00158 u05 = 1.95590137035022920206e-08, /* 0x3E550057, 0x3B4EABD4 */ 00159 u06 = -3.98205194132103398453e-11, /* 0xBDC5E43D, 0x693FB3C8 */ 00160 v01 = 1.27304834834123699328e-02, /* 0x3F8A1270, 0x91C9C71A */ 00161 v02 = 7.60068627350353253702e-05, /* 0x3F13ECBB, 0xF578C6C1 */ 00162 v03 = 2.59150851840457805467e-07, /* 0x3E91642D, 0x7FF202FD */ 00163 v04 = 4.41110311332675467403e-10; /* 0x3DFE5018, 0x3BD6D9EF */ 00164 00165 #ifdef __STDC__ 00166 double __ieee754_y0(double x) 00167 #else 00168 double __ieee754_y0(x) 00169 double x; 00170 #endif 00171 { 00172 double z, s,c,ss,cc,u,v; 00173 int32_t hx,ix,lx; 00174 00175 EXTRACT_WORDS(hx,lx,x); 00176 ix = 0x7fffffff&hx; 00177 /* Y0(NaN) is NaN, y0(-inf) is Nan, y0(inf) is 0 */ 00178 if(ix>=0x7ff00000) return one/(x+x*x); 00179 if((ix|lx)==0) return -one/zero; 00180 if(hx<0) return zero/zero; 00181 if(ix >= 0x40000000) { /* |x| >= 2.0 */ 00182 /* y0(x) = sqrt(2/(pi*x))*(p0(x)*sin(x0)+q0(x)*cos(x0)) 00183 * where x0 = x-pi/4 00184 * Better formula: 00185 * cos(x0) = cos(x)cos(pi/4)+sin(x)sin(pi/4) 00186 * = 1/sqrt(2) * (sin(x) + cos(x)) 00187 * sin(x0) = sin(x)cos(3pi/4)-cos(x)sin(3pi/4) 00188 * = 1/sqrt(2) * (sin(x) - cos(x)) 00189 * To avoid cancellation, use 00190 * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x)) 00191 * to compute the worse one. 00192 */ 00193 s = sin(x); 00194 c = cos(x); 00195 ss = s-c; 00196 cc = s+c; 00197 /* 00198 * j0(x) = 1/sqrt(pi) * (P(0,x)*cc - Q(0,x)*ss) / sqrt(x) 00199 * y0(x) = 1/sqrt(pi) * (P(0,x)*ss + Q(0,x)*cc) / sqrt(x) 00200 */ 00201 if(ix<0x7fe00000) { /* make sure x+x not overflow */ 00202 z = -cos(x+x); 00203 if ((s*c)<zero) cc = z/ss; 00204 else ss = z/cc; 00205 } 00206 if(ix>0x48000000) z = (invsqrtpi*ss)/sqrt(x); 00207 else { 00208 u = pzero(x); v = qzero(x); 00209 z = invsqrtpi*(u*ss+v*cc)/sqrt(x); 00210 } 00211 return z; 00212 } 00213 if(ix<=0x3e400000) { /* x < 2**-27 */ 00214 return(u00 + tpi*__ieee754_log(x)); 00215 } 00216 z = x*x; 00217 u = u00+z*(u01+z*(u02+z*(u03+z*(u04+z*(u05+z*u06))))); 00218 v = one+z*(v01+z*(v02+z*(v03+z*v04))); 00219 return(u/v + tpi*(__ieee754_j0(x)*__ieee754_log(x))); 00220 } 00221 00222 /* The asymptotic expansions of pzero is 00223 * 1 - 9/128 s^2 + 11025/98304 s^4 - ..., where s = 1/x. 00224 * For x >= 2, We approximate pzero by 00225 * pzero(x) = 1 + (R/S) 00226 * where R = pR0 + pR1*s^2 + pR2*s^4 + ... + pR5*s^10 00227 * S = 1 + pS0*s^2 + ... + pS4*s^10 00228 * and 00229 * | pzero(x)-1-R/S | <= 2 ** ( -60.26) 00230 */ 00231 #ifdef __STDC__ 00232 static const double pR8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 00233 #else 00234 static double pR8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 00235 #endif 00236 0.00000000000000000000e+00, /* 0x00000000, 0x00000000 */ 00237 -7.03124999999900357484e-02, /* 0xBFB1FFFF, 0xFFFFFD32 */ 00238 -8.08167041275349795626e+00, /* 0xC02029D0, 0xB44FA779 */ 00239 -2.57063105679704847262e+02, /* 0xC0701102, 0x7B19E863 */ 00240 -2.48521641009428822144e+03, /* 0xC0A36A6E, 0xCD4DCAFC */ 00241 -5.25304380490729545272e+03, /* 0xC0B4850B, 0x36CC643D */ 00242 }; 00243 #ifdef __STDC__ 00244 static const double pS8[5] = { 00245 #else 00246 static double pS8[5] = { 00247 #endif 00248 1.16534364619668181717e+02, /* 0x405D2233, 0x07A96751 */ 00249 3.83374475364121826715e+03, /* 0x40ADF37D, 0x50596938 */ 00250 4.05978572648472545552e+04, /* 0x40E3D2BB, 0x6EB6B05F */ 00251 1.16752972564375915681e+05, /* 0x40FC810F, 0x8F9FA9BD */ 00252 4.76277284146730962675e+04, /* 0x40E74177, 0x4F2C49DC */ 00253 }; 00254 00255 #ifdef __STDC__ 00256 static const double pR5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ 00257 #else 00258 static double pR5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ 00259 #endif 00260 -1.14125464691894502584e-11, /* 0xBDA918B1, 0x47E495CC */ 00261 -7.03124940873599280078e-02, /* 0xBFB1FFFF, 0xE69AFBC6 */ 00262 -4.15961064470587782438e+00, /* 0xC010A370, 0xF90C6BBF */ 00263 -6.76747652265167261021e+01, /* 0xC050EB2F, 0x5A7D1783 */ 00264 -3.31231299649172967747e+02, /* 0xC074B3B3, 0x6742CC63 */ 00265 -3.46433388365604912451e+02, /* 0xC075A6EF, 0x28A38BD7 */ 00266 }; 00267 #ifdef __STDC__ 00268 static const double pS5[5] = { 00269 #else 00270 static double pS5[5] = { 00271 #endif 00272 6.07539382692300335975e+01, /* 0x404E6081, 0x0C98C5DE */ 00273 1.05125230595704579173e+03, /* 0x40906D02, 0x5C7E2864 */ 00274 5.97897094333855784498e+03, /* 0x40B75AF8, 0x8FBE1D60 */ 00275 9.62544514357774460223e+03, /* 0x40C2CCB8, 0xFA76FA38 */ 00276 2.40605815922939109441e+03, /* 0x40A2CC1D, 0xC70BE864 */ 00277 }; 00278 00279 #ifdef __STDC__ 00280 static const double pR3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ 00281 #else 00282 static double pR3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ 00283 #endif 00284 -2.54704601771951915620e-09, /* 0xBE25E103, 0x6FE1AA86 */ 00285 -7.03119616381481654654e-02, /* 0xBFB1FFF6, 0xF7C0E24B */ 00286 -2.40903221549529611423e+00, /* 0xC00345B2, 0xAEA48074 */ 00287 -2.19659774734883086467e+01, /* 0xC035F74A, 0x4CB94E14 */ 00288 -5.80791704701737572236e+01, /* 0xC04D0A22, 0x420A1A45 */ 00289 -3.14479470594888503854e+01, /* 0xC03F72AC, 0xA892D80F */ 00290 }; 00291 #ifdef __STDC__ 00292 static const double pS3[5] = { 00293 #else 00294 static double pS3[5] = { 00295 #endif 00296 3.58560338055209726349e+01, /* 0x4041ED92, 0x84077DD3 */ 00297 3.61513983050303863820e+02, /* 0x40769839, 0x464A7C0E */ 00298 1.19360783792111533330e+03, /* 0x4092A66E, 0x6D1061D6 */ 00299 1.12799679856907414432e+03, /* 0x40919FFC, 0xB8C39B7E */ 00300 1.73580930813335754692e+02, /* 0x4065B296, 0xFC379081 */ 00301 }; 00302 00303 #ifdef __STDC__ 00304 static const double pR2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ 00305 #else 00306 static double pR2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ 00307 #endif 00308 -8.87534333032526411254e-08, /* 0xBE77D316, 0xE927026D */ 00309 -7.03030995483624743247e-02, /* 0xBFB1FF62, 0x495E1E42 */ 00310 -1.45073846780952986357e+00, /* 0xBFF73639, 0x8A24A843 */ 00311 -7.63569613823527770791e+00, /* 0xC01E8AF3, 0xEDAFA7F3 */ 00312 -1.11931668860356747786e+01, /* 0xC02662E6, 0xC5246303 */ 00313 -3.23364579351335335033e+00, /* 0xC009DE81, 0xAF8FE70F */ 00314 }; 00315 #ifdef __STDC__ 00316 static const double pS2[5] = { 00317 #else 00318 static double pS2[5] = { 00319 #endif 00320 2.22202997532088808441e+01, /* 0x40363865, 0x908B5959 */ 00321 1.36206794218215208048e+02, /* 0x4061069E, 0x0EE8878F */ 00322 2.70470278658083486789e+02, /* 0x4070E786, 0x42EA079B */ 00323 1.53875394208320329881e+02, /* 0x40633C03, 0x3AB6FAFF */ 00324 1.46576176948256193810e+01, /* 0x402D50B3, 0x44391809 */ 00325 }; 00326 00327 #ifdef __STDC__ 00328 static double pzero(double x) 00329 #else 00330 static double pzero(x) 00331 double x; 00332 #endif 00333 { 00334 #ifdef __STDC__ 00335 const double *p = 0,*q = 0; 00336 #else 00337 double *p = 0,*q = 0; 00338 #endif 00339 double z,r,s; 00340 int32_t ix; 00341 GET_HIGH_WORD(ix,x); 00342 ix &= 0x7fffffff; 00343 if(ix>=0x40200000) {p = pR8; q= pS8;} 00344 else if(ix>=0x40122E8B){p = pR5; q= pS5;} 00345 else if(ix>=0x4006DB6D){p = pR3; q= pS3;} 00346 else if(ix>=0x40000000){p = pR2; q= pS2;} 00347 z = one/(x*x); 00348 r = p[0]+z*(p[1]+z*(p[2]+z*(p[3]+z*(p[4]+z*p[5])))); 00349 s = one+z*(q[0]+z*(q[1]+z*(q[2]+z*(q[3]+z*q[4])))); 00350 return one+ r/s; 00351 } 00352 00353 00354 /* For x >= 8, the asymptotic expansions of qzero is 00355 * -1/8 s + 75/1024 s^3 - ..., where s = 1/x. 00356 * We approximate pzero by 00357 * qzero(x) = s*(-1.25 + (R/S)) 00358 * where R = qR0 + qR1*s^2 + qR2*s^4 + ... + qR5*s^10 00359 * S = 1 + qS0*s^2 + ... + qS5*s^12 00360 * and 00361 * | qzero(x)/s +1.25-R/S | <= 2 ** ( -61.22) 00362 */ 00363 #ifdef __STDC__ 00364 static const double qR8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 00365 #else 00366 static double qR8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 00367 #endif 00368 0.00000000000000000000e+00, /* 0x00000000, 0x00000000 */ 00369 7.32421874999935051953e-02, /* 0x3FB2BFFF, 0xFFFFFE2C */ 00370 1.17682064682252693899e+01, /* 0x40278952, 0x5BB334D6 */ 00371 5.57673380256401856059e+02, /* 0x40816D63, 0x15301825 */ 00372 8.85919720756468632317e+03, /* 0x40C14D99, 0x3E18F46D */ 00373 3.70146267776887834771e+04, /* 0x40E212D4, 0x0E901566 */ 00374 }; 00375 #ifdef __STDC__ 00376 static const double qS8[6] = { 00377 #else 00378 static double qS8[6] = { 00379 #endif 00380 1.63776026895689824414e+02, /* 0x406478D5, 0x365B39BC */ 00381 8.09834494656449805916e+03, /* 0x40BFA258, 0x4E6B0563 */ 00382 1.42538291419120476348e+05, /* 0x41016652, 0x54D38C3F */ 00383 8.03309257119514397345e+05, /* 0x412883DA, 0x83A52B43 */ 00384 8.40501579819060512818e+05, /* 0x4129A66B, 0x28DE0B3D */ 00385 -3.43899293537866615225e+05, /* 0xC114FD6D, 0x2C9530C5 */ 00386 }; 00387 00388 #ifdef __STDC__ 00389 static const double qR5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ 00390 #else 00391 static double qR5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ 00392 #endif 00393 1.84085963594515531381e-11, /* 0x3DB43D8F, 0x29CC8CD9 */ 00394 7.32421766612684765896e-02, /* 0x3FB2BFFF, 0xD172B04C */ 00395 5.83563508962056953777e+00, /* 0x401757B0, 0xB9953DD3 */ 00396 1.35111577286449829671e+02, /* 0x4060E392, 0x0A8788E9 */ 00397 1.02724376596164097464e+03, /* 0x40900CF9, 0x9DC8C481 */ 00398 1.98997785864605384631e+03, /* 0x409F17E9, 0x53C6E3A6 */ 00399 }; 00400 #ifdef __STDC__ 00401 static const double qS5[6] = { 00402 #else 00403 static double qS5[6] = { 00404 #endif 00405 8.27766102236537761883e+01, /* 0x4054B1B3, 0xFB5E1543 */ 00406 2.07781416421392987104e+03, /* 0x40A03BA0, 0xDA21C0CE */ 00407 1.88472887785718085070e+04, /* 0x40D267D2, 0x7B591E6D */ 00408 5.67511122894947329769e+04, /* 0x40EBB5E3, 0x97E02372 */ 00409 3.59767538425114471465e+04, /* 0x40E19118, 0x1F7A54A0 */ 00410 -5.35434275601944773371e+03, /* 0xC0B4EA57, 0xBEDBC609 */ 00411 }; 00412 00413 #ifdef __STDC__ 00414 static const double qR3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ 00415 #else 00416 static double qR3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ 00417 #endif 00418 4.37741014089738620906e-09, /* 0x3E32CD03, 0x6ADECB82 */ 00419 7.32411180042911447163e-02, /* 0x3FB2BFEE, 0x0E8D0842 */ 00420 3.34423137516170720929e+00, /* 0x400AC0FC, 0x61149CF5 */ 00421 4.26218440745412650017e+01, /* 0x40454F98, 0x962DAEDD */ 00422 1.70808091340565596283e+02, /* 0x406559DB, 0xE25EFD1F */ 00423 1.66733948696651168575e+02, /* 0x4064D77C, 0x81FA21E0 */ 00424 }; 00425 #ifdef __STDC__ 00426 static const double qS3[6] = { 00427 #else 00428 static double qS3[6] = { 00429 #endif 00430 4.87588729724587182091e+01, /* 0x40486122, 0xBFE343A6 */ 00431 7.09689221056606015736e+02, /* 0x40862D83, 0x86544EB3 */ 00432 3.70414822620111362994e+03, /* 0x40ACF04B, 0xE44DFC63 */ 00433 6.46042516752568917582e+03, /* 0x40B93C6C, 0xD7C76A28 */ 00434 2.51633368920368957333e+03, /* 0x40A3A8AA, 0xD94FB1C0 */ 00435 -1.49247451836156386662e+02, /* 0xC062A7EB, 0x201CF40F */ 00436 }; 00437 00438 #ifdef __STDC__ 00439 static const double qR2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ 00440 #else 00441 static double qR2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ 00442 #endif 00443 1.50444444886983272379e-07, /* 0x3E84313B, 0x54F76BDB */ 00444 7.32234265963079278272e-02, /* 0x3FB2BEC5, 0x3E883E34 */ 00445 1.99819174093815998816e+00, /* 0x3FFFF897, 0xE727779C */ 00446 1.44956029347885735348e+01, /* 0x402CFDBF, 0xAAF96FE5 */ 00447 3.16662317504781540833e+01, /* 0x403FAA8E, 0x29FBDC4A */ 00448 1.62527075710929267416e+01, /* 0x403040B1, 0x71814BB4 */ 00449 }; 00450 #ifdef __STDC__ 00451 static const double qS2[6] = { 00452 #else 00453 static double qS2[6] = { 00454 #endif 00455 3.03655848355219184498e+01, /* 0x403E5D96, 0xF7C07AED */ 00456 2.69348118608049844624e+02, /* 0x4070D591, 0xE4D14B40 */ 00457 8.44783757595320139444e+02, /* 0x408A6645, 0x22B3BF22 */ 00458 8.82935845112488550512e+02, /* 0x408B977C, 0x9C5CC214 */ 00459 2.12666388511798828631e+02, /* 0x406A9553, 0x0E001365 */ 00460 -5.31095493882666946917e+00, /* 0xC0153E6A, 0xF8B32931 */ 00461 }; 00462 00463 #ifdef __STDC__ 00464 static double qzero(double x) 00465 #else 00466 static double qzero(x) 00467 double x; 00468 #endif 00469 { 00470 #ifdef __STDC__ 00471 const double *p = 0,*q = 0; 00472 #else 00473 double *p = 0,*q = 0; 00474 #endif 00475 double s,r,z; 00476 int32_t ix; 00477 GET_HIGH_WORD(ix,x); 00478 ix &= 0x7fffffff; 00479 if(ix>=0x40200000) {p = qR8; q= qS8;} 00480 else if(ix>=0x40122E8B){p = qR5; q= qS5;} 00481 else if(ix>=0x4006DB6D){p = qR3; q= qS3;} 00482 else if(ix>=0x40000000){p = qR2; q= qS2;} 00483 z = one/(x*x); 00484 r = p[0]+z*(p[1]+z*(p[2]+z*(p[3]+z*(p[4]+z*p[5])))); 00485 s = one+z*(q[0]+z*(q[1]+z*(q[2]+z*(q[3]+z*(q[4]+z*q[5]))))); 00486 return (-.125 + r/s)/x; 00487 }

Generated on Thu Nov 20 11:49:51 2008 for RTAI API by doxygen 1.3.8