Average Error: 58.7 → 0.4
Time: 2.6s
Precision: 64
\[-1.7 \cdot 10^{-4} \lt x\]
\[e^{x} - 1\]
↓
\[{x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x\]
e^{x} - 1
↓
{x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x
double f(double x) {
        double r86557 = x;
        double r86558 = exp(r86557);
        double r86559 = 1.0;
        double r86560 = r86558 - r86559;
        return r86560;
}
↓
double f(double x) {
        double r86561 = x;
        double r86562 = 2.0;
        double r86563 = pow(r86561, r86562);
        double r86564 = 0.16666666666666666;
        double r86565 = r86561 * r86564;
        double r86566 = 0.5;
        double r86567 = r86565 + r86566;
        double r86568 = r86563 * r86567;
        double r86569 = r86568 + r86561;
        return r86569;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original58.7
Target0.5
Herbie0.4
\[x \cdot \left(\left(1 + \frac{x}{2}\right) + \frac{x \cdot x}{6}\right)\]

Derivation

  1. Initial program 58.7

    \[e^{x} - 1\]

  2. Taylor expanded around 0 0.5

    \[\leadsto \color{blue}{\frac{1}{2} \cdot {x}^{2} + \left(\frac{1}{6} \cdot {x}^{3} + x\right)}\]

  3. Simplified0.4

    \[\leadsto \color{blue}{{x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x}\]

  4. Final simplification0.4

    \[\leadsto {x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x\]

Reproduce

herbie shell --seed 2020034 
(FPCore (x)
  :name "expm1 (example 3.7)"
  :precision binary64
  :pre (< -0.00017 x)

  :herbie-target
  (* x (+ (+ 1 (/ x 2)) (/ (* x x) 6)))

  (- (exp x) 1))