Average Error: 0.0 → 0.0
Time: 8.6s
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(\left(\mathsf{fma}\left(2, a, b\right)\right), b, \left(a \cdot a\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\mathsf{fma}\left(\left(\mathsf{fma}\left(2, a, b\right)\right), b, \left(a \cdot a\right)\right)
double f(double a, double b) {
        double r29784159 = a;
        double r29784160 = b;
        double r29784161 = r29784159 + r29784160;
        double r29784162 = r29784161 * r29784161;
        return r29784162;
}
↓
double f(double a, double b) {
        double r29784163 = 2.0;
        double r29784164 = a;
        double r29784165 = b;
        double r29784166 = fma(r29784163, r29784164, r29784165);
        double r29784167 = r29784164 * r29784164;
        double r29784168 = fma(r29784166, r29784165, r29784167);
        return r29784168;
}

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

  4. Final simplification0.0

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

Reproduce

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