Average Error: 0.1 → 0.1
Time: 885.0ms
Precision: 64
\[x \cdot x - \left(y \cdot 4\right) \cdot z\]
↓
\[\mathsf{fma}\left(x, x, -\left(y \cdot 4\right) \cdot z\right)\]
x \cdot x - \left(y \cdot 4\right) \cdot z
↓
\mathsf{fma}\left(x, x, -\left(y \cdot 4\right) \cdot z\right)
double code(double x, double y, double z) {
	return ((double) (((double) (x * x)) - ((double) (((double) (y * 4.0)) * z))));
}
↓
double code(double x, double y, double z) {
	return ((double) fma(x, x, ((double) -(((double) (((double) (y * 4.0)) * z))))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[x \cdot x - \left(y \cdot 4\right) \cdot z\]
  2. Using strategy rm

  3. Applied fma-neg0.1

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -\left(y \cdot 4\right) \cdot z\right)}\]

  4. Final simplification0.1

    \[\leadsto \mathsf{fma}\left(x, x, -\left(y \cdot 4\right) \cdot z\right)\]

Reproduce

herbie shell --seed 2020123 +o rules:numerics
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4) z)))