Average Error: 0.0 → 0
Time: 11.8s
Precision: 64
\[5 \le a \le 10 \land 0 \le b \le 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
\[\mathsf{fma}\left(a, a, \left(b \cdot \mathsf{fma}\left(a, 2, b\right)\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
\mathsf{fma}\left(a, a, \left(b \cdot \mathsf{fma}\left(a, 2, b\right)\right)\right)
double f(double a, double b) {
        double r2775382 = a;
        double r2775383 = b;
        double r2775384 = r2775382 + r2775383;
        double r2775385 = r2775384 * r2775384;
        return r2775385;
}

double f(double a, double b) {
        double r2775386 = a;
        double r2775387 = b;
        double r2775388 = 2.0;
        double r2775389 = fma(r2775386, r2775388, r2775387);
        double r2775390 = r2775387 * r2775389;
        double r2775391 = fma(r2775386, r2775386, r2775390);
        return r2775391;
}

Error

Bits error versus a

Bits error versus b

Target

Original0.0
Target0.0
Herbie0
\[\left(\left(b \cdot a + b \cdot b\right) + b \cdot a\right) + a \cdot a\]

Derivation

  1. Initial program 0.0

    \[\left(a + b\right) \cdot \left(a + b\right)\]
  2. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{{a}^{2} + \left({b}^{2} + 2 \cdot \left(a \cdot b\right)\right)}\]
  3. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(b, \left(\mathsf{fma}\left(a, 2, b\right)\right), \left(a \cdot a\right)\right)}\]
  4. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{{a}^{2} + \left({b}^{2} + 2 \cdot \left(a \cdot b\right)\right)}\]
  5. Simplified0

    \[\leadsto \color{blue}{\mathsf{fma}\left(a, a, \left(\mathsf{fma}\left(a, 2, b\right) \cdot b\right)\right)}\]
  6. Final simplification0

    \[\leadsto \mathsf{fma}\left(a, a, \left(b \cdot \mathsf{fma}\left(a, 2, b\right)\right)\right)\]

Reproduce

herbie shell --seed 2019133 +o rules:numerics
(FPCore (a b)
  :name "Expression 4, p15"
  :pre (and (<= 5 a 10) (<= 0 b 0.001))

  :herbie-target
  (+ (+ (+ (* b a) (* b b)) (* b a)) (* a a))

  (* (+ a b) (+ a b)))