Average Error: 0.9 → 0.9
Time: 9.6s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double l, double Om, double kx, double ky) {
	return ((double) sqrt(((double) (((double) (1.0 / 2.0)) * ((double) (1.0 + ((double) (1.0 / ((double) sqrt(((double) (1.0 + ((double) (((double) pow(((double) (((double) (2.0 * l)) / Om)), 2.0)) * ((double) (((double) pow(((double) sin(kx)), 2.0)) + ((double) pow(((double) sin(ky)), 2.0))))))))))))))))));
}

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

Error
Bits error versus l
Bits error versus Om
Bits error versus kx
Bits error versus ky
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.9
    \[\]
  2. Final simplification0.9
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (l Om kx ky)
  :name "Toniolo and Linder, Equation (3a)"
  :precision binary64
  (sqrt (* (/ 1.0 2.0) (+ 1.0 (/ 1.0 (sqrt (+ 1.0 (* (pow (/ (* 2.0 l) Om) 2.0) (+ (pow (sin kx) 2.0) (pow (sin ky) 2.0))))))))))