Average Error: 0.0 → 0.0
Time: 842.0ms
Precision: 64
\[a \cdot a - b \cdot b\]
↓
\[\mathsf{fma}\left(a, a, -b \cdot b\right)\]
a \cdot a - b \cdot b
↓
\mathsf{fma}\left(a, a, -b \cdot b\right)
double f(double a, double b) {
        double r95560 = a;
        double r95561 = r95560 * r95560;
        double r95562 = b;
        double r95563 = r95562 * r95562;
        double r95564 = r95561 - r95563;
        return r95564;
}
↓
double f(double a, double b) {
        double r95565 = a;
        double r95566 = b;
        double r95567 = r95566 * r95566;
        double r95568 = -r95567;
        double r95569 = fma(r95565, r95565, r95568);
        return r95569;
}

Error

Bits error versus a

Bits error versus b

Target

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

Derivation

  1. Initial program 0.0

    \[a \cdot a - b \cdot b\]
  2. Using strategy rm

  3. Applied fma-neg0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020049 +o rules:numerics
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

  (- (* a a) (* b b)))