Average Error: 16.0 → 0.8
Time: 4.9s
Precision: binary64
\[\sqrt[3]{\frac{g}{2 \cdot a}}\]
↓
\[\sqrt[3]{g} \cdot \left(\sqrt[3]{0.5} \cdot \sqrt[3]{\frac{1}{a}}\right)\]
\sqrt[3]{\frac{g}{2 \cdot a}}
↓
\sqrt[3]{g} \cdot \left(\sqrt[3]{0.5} \cdot \sqrt[3]{\frac{1}{a}}\right)
(FPCore (g a) :precision binary64 (cbrt (/ g (* 2.0 a))))
↓
(FPCore (g a) :precision binary64 (* (cbrt g) (* (cbrt 0.5) (cbrt (/ 1.0 a)))))
double code(double g, double a) {
	return cbrt(g / (2.0 * a));
}
↓
double code(double g, double a) {
	return cbrt(g) * (cbrt(0.5) * cbrt(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.0

    \[\sqrt[3]{\frac{g}{2 \cdot a}}\]
  2. Using strategy rm

  3. Applied div-inv_binary64_246216.0

    \[\leadsto \sqrt[3]{\color{blue}{g \cdot \frac{1}{2 \cdot a}}}\]

  4. Applied cbrt-prod_binary64_24960.9

    \[\leadsto \color{blue}{\sqrt[3]{g} \cdot \sqrt[3]{\frac{1}{2 \cdot a}}}\]

  5. Simplified0.8

    \[\leadsto \sqrt[3]{g} \cdot \color{blue}{\sqrt[3]{\frac{0.5}{a}}}\]
  6. Using strategy rm

  7. Applied div-inv_binary64_24620.8

    \[\leadsto \sqrt[3]{g} \cdot \sqrt[3]{\color{blue}{0.5 \cdot \frac{1}{a}}}\]

  8. Applied cbrt-prod_binary64_24960.8

    \[\leadsto \sqrt[3]{g} \cdot \color{blue}{\left(\sqrt[3]{0.5} \cdot \sqrt[3]{\frac{1}{a}}\right)}\]

  9. Final simplification0.8

    \[\leadsto \sqrt[3]{g} \cdot \left(\sqrt[3]{0.5} \cdot \sqrt[3]{\frac{1}{a}}\right)\]

Reproduce

herbie shell --seed 2021046 
(FPCore (g a)
  :name "2-ancestry mixing, zero discriminant"
  :precision binary64
  (cbrt (/ g (* 2.0 a))))