Average Error: 0.1 → 0.1
Time: 996.0ms
Precision: 64
\[x \cdot x - \left(y \cdot 4\right) \cdot z\]
↓
\[\mathsf{fma}\left(x, x, -z \cdot \left(y \cdot 4\right)\right) + \left(y \cdot 4\right) \cdot \left(\left(-z\right) + z\right)\]
x \cdot x - \left(y \cdot 4\right) \cdot z
↓
\mathsf{fma}\left(x, x, -z \cdot \left(y \cdot 4\right)\right) + \left(y \cdot 4\right) \cdot \left(\left(-z\right) + z\right)
double code(double x, double y, double z) {
	return ((x * x) - ((y * 4.0) * z));
}
↓
double code(double x, double y, double z) {
	return (fma(x, x, -(z * (y * 4.0))) + ((y * 4.0) * (-z + 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 prod-diff0.1

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

  4. Simplified0.1

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

  5. Final simplification0.1

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

Reproduce

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