Average Error: 4.0 → 4.0
Time: 13.4s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double kx, double ky, double th) {
	return ((double) (((double) (((double) sin(ky)) / ((double) sqrt(((double) (((double) pow(((double) sin(kx)), 2.0)) + ((double) pow(((double) sin(ky)), 2.0)))))))) * ((double) sin(th))));
}

↓
double code(double kx, double ky, double th) {
	return ((double) (((double) sin(ky)) * ((double) (((double) sin(th)) / ((double) sqrt(((double) (((double) pow(((double) sin(kx)), 2.0)) + ((double) pow(((double) sin(ky)), 2.0))))))))));
}

Error
Bits error versus kx
Bits error versus ky
Bits error versus th
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 4.0
    \[\]
  2. Simplified4.0
    \[\leadsto \]
  3. Final simplification4.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (kx ky th)
  :name "Toniolo and Linder, Equation (3b), real"
  :precision binary64
  (* (/ (sin ky) (sqrt (+ (pow (sin kx) 2.0) (pow (sin ky) 2.0)))) (sin th)))