Average Error: 0.0 → 0.0
Time: 33.2s
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 \cdot b, a, \mathsf{fma}\left(a, a, b \cdot b\right)\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
\mathsf{fma}\left(2 \cdot b, a, \mathsf{fma}\left(a, a, b \cdot b\right)\right)
double f(double a, double b) {
        double r2221942 = a;
        double r2221943 = b;
        double r2221944 = r2221942 + r2221943;
        double r2221945 = r2221944 * r2221944;
        return r2221945;
}
↓
double f(double a, double b) {
        double r2221946 = 2.0;
        double r2221947 = b;
        double r2221948 = r2221946 * r2221947;
        double r2221949 = a;
        double r2221950 = r2221947 * r2221947;
        double r2221951 = fma(r2221949, r2221949, r2221950);
        double r2221952 = fma(r2221948, r2221949, r2221951);
        return r2221952;
}

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

  4. Final simplification0.0

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

Reproduce

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