Average Error: 0.0 → 0.0
Time: 3.7s
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(2, b \cdot a, \mathsf{fma}\left(b, b, a \cdot a\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\mathsf{fma}\left(2, b \cdot a, \mathsf{fma}\left(b, b, a \cdot a\right)\right)
double f(double a, double b) {
        double r3411728 = a;
        double r3411729 = b;
        double r3411730 = r3411728 + r3411729;
        double r3411731 = r3411730 * r3411730;
        return r3411731;
}
↓
double f(double a, double b) {
        double r3411732 = 2.0;
        double r3411733 = b;
        double r3411734 = a;
        double r3411735 = r3411733 * r3411734;
        double r3411736 = r3411734 * r3411734;
        double r3411737 = fma(r3411733, r3411733, r3411736);
        double r3411738 = fma(r3411732, r3411735, r3411737);
        return r3411738;
}

Error

Bits error versus a

Bits error versus b

Target

Original0.0
Target0.0
Herbie0.0
\[\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(2, a \cdot b, \mathsf{fma}\left(b, b, a \cdot a\right)\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019143 +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)))