Average Error: 16.3 → 0.8
Time: 4.0s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double g, double a) {
	return ((double) cbrt(((double) (g / ((double) (2.0 * a))))));
}

↓
double code(double g, double a) {
	return ((double) (((double) cbrt(g)) * ((double) (((double) cbrt(-0.5)) * ((double) cbrt(((double) (-1.0 / a))))))));
}

Error
Bits error versus g
Bits error versus a
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 16.3
    \[\]
  2. Using strategy rm
  3. Applied div-inv16.3
    \[\leadsto \]
  4. Applied cbrt-prod0.9
    \[\leadsto \]
  5. Taylor expanded around -inf 34.9
    \[\leadsto \]
  6. Simplified0.8
    \[\leadsto \]
  7. Final simplification0.8
    \[\leadsto \]
Reproduce
herbie shell --seed 2020181 
(FPCore (g a)
  :name "2-ancestry mixing, zero discriminant"
  :precision binary64
  (cbrt (/ g (* 2.0 a))))