Average Error: 0.2 → 0.2
Time: 4.2s
Precision: binary64
\[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]
↓
\[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
↓
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
double code(double x, double y, double z) {
	return ((double) (((double) (1.0 / 2.0)) * ((double) (x + ((double) (y * ((double) sqrt(z))))))));
}
↓
double code(double x, double y, double z) {
	return ((double) (((double) (1.0 / 2.0)) * ((double) (x + ((double) (y * ((double) sqrt(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.2

    \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]

  2. Final simplification0.2

    \[\leadsto \frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]

Reproduce

herbie shell --seed 2020150 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
  :precision binary64
  (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))