Average Error: 0.0 → 0.0
Time: 8.8s
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 0.001000000000000000020816681711721685132943\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[\mathsf{fma}\left(b, \mathsf{fma}\left(a, 2, b\right), a \cdot a\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\mathsf{fma}\left(b, \mathsf{fma}\left(a, 2, b\right), a \cdot a\right)
double f(double a, double b) {
        double r102864 = a;
        double r102865 = b;
        double r102866 = r102864 + r102865;
        double r102867 = r102866 * r102866;
        return r102867;
}
↓
double f(double a, double b) {
        double r102868 = b;
        double r102869 = a;
        double r102870 = 2.0;
        double r102871 = fma(r102869, r102870, r102868);
        double r102872 = r102869 * r102869;
        double r102873 = fma(r102868, r102871, r102872);
        return r102873;
}

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(2 \cdot \left(a \cdot b\right) + {b}^{2}\right)}\]

  3. Simplified0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019306 +o rules:numerics
(FPCore (a b)
  :name "Expression 4, p15"
  :precision binary64
  :pre (and (<= 5 a 10) (<= 0.0 b 1e-3))

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

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