Average Error: 0.0 → 0.0
Time: 3.5s
Precision: binary64
\[x + \left(y - x\right) \cdot z\]
↓
\[x + \left(z \cdot y - x \cdot z\right)\]
x + \left(y - x\right) \cdot z
↓
x + \left(z \cdot y - x \cdot z\right)
(FPCore (x y z) :precision binary64 (+ x (* (- y x) z)))
↓
(FPCore (x y z) :precision binary64 (+ x (- (* z y) (* x z))))
double code(double x, double y, double z) {
	return x + ((y - x) * z);
}
↓
double code(double x, double y, double z) {
	return x + ((z * y) - (x * 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.0

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

  2. Taylor expanded around 0 0.0

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

  3. Final simplification0.0

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

Reproduce

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