Average Error: 0.0 → 0.0
Time: 1.9s
Precision: binary64
\[x + \left(y - x\right) \cdot z \]
↓
\[\left(y \cdot z + x\right) - z \cdot x \]
x + \left(y - x\right) \cdot z
↓
\left(y \cdot z + x\right) - z \cdot x

(FPCore (x y z) :precision binary64 (+ x (* (- y x) z)))
↓
(FPCore (x y z) :precision binary64 (- (+ (* y z) x) (* z x)))
double code(double x, double y, double z) {
	return x + ((y - x) * z);
}
↓
double code(double x, double y, double z) {
	return ((y * z) + x) - (z * x);
}

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.0

    \[x + \left(y - x\right) \cdot z \]

  2. Simplified0.0

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

  3. Taylor expanded in y around 0 0.0

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

  4. Final simplification0.0

    \[\leadsto \left(y \cdot z + x\right) - z \cdot x \]

Reproduce

herbie shell --seed 2021275 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))