Home | History | Annotate | Download | only in math

Lines Matching refs:expm1

21 // expm1(x)
33 // 2. Approximating expm1(r) by a special rational function on
59 // expm1(r) = exp(r)-1 is then computed by the following
63 // expm1(r) = r + --- + --- * [--------------------]
67 // expm1(r+c) = expm1(r) + c + expm1(r)*c
68 // ~ expm1(r) + c + r*c
70 // expm1(r+c). Now rearrange the term to avoid optimization
74 // expm1(r+c)~r - ({r*(--- * [--------------------]-c)-c} - --- )
79 // 3. Scale back to obtain expm1(x):
81 // expm1(x) = either 2**k*[expm1(r)+1] - 1
82 // = or 2**k*[expm1(r) + (1-2**-k)]
86 // (B). To achieve maximum accuracy, we compute expm1(x) by
97 // expm1(INF) is INF, expm1(NaN) is NaN;
98 // expm1(-INF) is -1, and
99 // for finite argument, only expm1(0)=0 is exact.
107 // if x > 7.09782712893383973096e+02 then expm1(x) overflow
116 // Expm1 returns e**x - 1, the base-e exponential of x minus 1.
120 // Expm1(+Inf) = +Inf
121 // Expm1(-Inf) = -1
122 // Expm1(NaN) = NaN
124 func Expm1(x float64) float64
126 func expm1(x float64) float64 {
136 // scaled coefficients related to expm1