4
* Copyright (c) 1998, 2003, Oracle and/or its affiliates. All rights reserved.
5
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
7
* This code is free software; you can redistribute it and/or modify it
8
* under the terms of the GNU General Public License version 2 only, as
9
* published by the Free Software Foundation. Oracle designates this
10
* particular file as subject to the "Classpath" exception as provided
11
* by Oracle in the LICENSE file that accompanied this code.
13
* This code is distributed in the hope that it will be useful, but WITHOUT
14
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16
* version 2 for more details (a copy is included in the LICENSE file that
17
* accompanied this code).
19
* You should have received a copy of the GNU General Public License version
20
* 2 along with this work; if not, write to the Free Software Foundation,
21
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
23
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
24
* or visit www.oracle.com if you need additional information or have any
28
/* double log1p(double x)
31
* 1. Argument Reduction: find k and f such that
33
* where sqrt(2)/2 < 1+f < sqrt(2) .
35
* Note. If k=0, then f=x is exact. However, if k!=0, then f
36
* may not be representable exactly. In that case, a correction
37
* term is need. Let u=1+x rounded. Let c = (1+x)-u, then
38
* log(1+x) - log(u) ~ c/u. Thus, we proceed to compute log(u),
39
* and add back the correction term c/u.
40
* (Note: when x > 2**53, one can simply return log(x))
42
* 2. Approximation of log1p(f).
43
* Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s)
44
* = 2s + 2/3 s**3 + 2/5 s**5 + .....,
46
* We use a special Reme algorithm on [0,0.1716] to generate
47
* a polynomial of degree 14 to approximate R The maximum error
48
* of this polynomial approximation is bounded by 2**-58.45. In
51
* R(z) ~ Lp1*s +Lp2*s +Lp3*s +Lp4*s +Lp5*s +Lp6*s +Lp7*s
52
* (the values of Lp1 to Lp7 are listed in the program)
55
* | Lp1*s +...+Lp7*s - R(z) | <= 2
57
* Note that 2s = f - s*f = f - hfsq + s*hfsq, where hfsq = f*f/2.
58
* In order to guarantee error in log below 1ulp, we compute log
60
* log1p(f) = f - (hfsq - s*(hfsq+R)).
62
* 3. Finally, log1p(x) = k*ln2 + log1p(f).
63
* = k*ln2_hi+(f-(hfsq-(s*(hfsq+R)+k*ln2_lo)))
64
* Here ln2 is split into two floating point number:
66
* where n*ln2_hi is always exact for |n| < 2000.
69
* log1p(x) is NaN with signal if x < -1 (including -INF) ;
70
* log1p(+INF) is +INF; log1p(-1) is -INF with signal;
71
* log1p(NaN) is that NaN with no signal.
74
* according to an error analysis, the error is always less than
75
* 1 ulp (unit in the last place).
78
* The hexadecimal values are the intended ones for the following
79
* constants. The decimal values may be used, provided that the
80
* compiler will convert from decimal to binary accurately enough
81
* to produce the hexadecimal values shown.
83
* Note: Assuming log() return accurate answer, the following
84
* algorithm can be used to compute log1p(x) to within a few ULP:
87
* if(u==1.0) return x ; else
88
* return log(u)*(x/(u-1.0));
90
* See HP-15C Advanced Functions Handbook, p.193.
93
static partial class fdlibm
95
internal static double log1p(double x)
98
ln2_hi = 6.93147180369123816490e-01, /* 3fe62e42 fee00000 */
99
ln2_lo = 1.90821492927058770002e-10, /* 3dea39ef 35793c76 */
100
two54 = 1.80143985094819840000e+16, /* 43500000 00000000 */
101
Lp1 = 6.666666666666735130e-01, /* 3FE55555 55555593 */
102
Lp2 = 3.999999999940941908e-01, /* 3FD99999 9997FA04 */
103
Lp3 = 2.857142874366239149e-01, /* 3FD24924 94229359 */
104
Lp4 = 2.222219843214978396e-01, /* 3FCC71C5 1D8E78AF */
105
Lp5 = 1.818357216161805012e-01, /* 3FC74664 96CB03DE */
106
Lp6 = 1.531383769920937332e-01, /* 3FC39A09 D078C69F */
107
Lp7 = 1.479819860511658591e-01; /* 3FC2F112 DF3E5244 */
109
const double zero = 0.0;
111
double hfsq,f=0,c=0,s,z,R,u;
114
hx = __HI(x); /* high word of x */
118
if (hx < 0x3FDA827A) { /* x < 0.41422 */
119
if(ax>=0x3ff00000) { /* x <= -1.0 */
121
* Added redundant test against hx to work around VC++
122
* code generation problem.
124
if(x==-1.0 && (hx==unchecked((int)0xbff00000))) /* log1p(-1)=-inf */
127
return (x-x)/(x-x); /* log1p(x<-1)=NaN */
129
if(ax<0x3e200000) { /* |x| < 2**-29 */
130
if(two54+x>zero /* raise inexact */
131
&&ax<0x3c900000) /* |x| < 2**-54 */
136
if(hx>0||hx<=(unchecked((int)0xbfd2bec3))) {
137
k=0;f=x;hu=1;} /* -0.2929<x<0.41422 */
139
if (hx >= 0x7ff00000) return x+x;
143
hu = __HI(u); /* high word of u */
145
c = (k>0)? 1.0-(u-x):x-(u-1.0);/* correction term */
149
hu = __HI(u); /* high word of u */
155
u = __HI(u, hu|0x3ff00000); /* normalize u */
158
u = __HI(u, hu|0x3fe00000); /* normalize u/2 */
159
hu = (0x00100000-hu)>>2;
164
if(hu==0) { /* |f| < 2**-20 */
165
if(f==zero) { if(k==0) return zero;
166
else {c += k*ln2_lo; return k*ln2_hi+c;}}
167
R = hfsq*(1.0-0.66666666666666666*f);
168
if(k==0) return f-R; else
169
return k*ln2_hi-((R-(k*ln2_lo+c))-f);
173
R = z*(Lp1+z*(Lp2+z*(Lp3+z*(Lp4+z*(Lp5+z*(Lp6+z*Lp7))))));
174
if(k==0) return f-(hfsq-s*(hfsq+R)); else
175
return k*ln2_hi-((hfsq-(s*(hfsq+R)+(k*ln2_lo+c)))-f);