Average Error: 39.2 → 0.0
Time: 1.5s
Precision: 64
\[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]
↓
\[\mathsf{fma}\left(x, 2, {x}^{2}\right)\]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
↓
\mathsf{fma}\left(x, 2, {x}^{2}\right)
double f(double x) {
        double r2110 = x;
        double r2111 = 1.0;
        double r2112 = r2110 + r2111;
        double r2113 = r2112 * r2112;
        double r2114 = r2113 - r2111;
        return r2114;
}
↓
double f(double x) {
        double r2115 = x;
        double r2116 = 2.0;
        double r2117 = 2.0;
        double r2118 = pow(r2115, r2117);
        double r2119 = fma(r2115, r2116, r2118);
        return r2119;
}

Error

Bits error versus x

Derivation

  1. Initial program 39.2

    \[\left(x + 1\right) \cdot \left(x + 1\right) - 1\]

  2. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{{x}^{2} + 2 \cdot x}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, 2, {x}^{2}\right)}\]

  4. Final simplification0.0

    \[\leadsto \mathsf{fma}\left(x, 2, {x}^{2}\right)\]

Reproduce

herbie shell --seed 2019347 +o rules:numerics
(FPCore (x)
  :name "Expanding a square"
  :precision binary64
  (- (* (+ x 1) (+ x 1)) 1))