Average Error: 15.3 → 0.9
Time: 7.5s
Precision: binary64
\[\sqrt[3]{\frac{g}{2 \cdot a}}\]
↓
\[\sqrt[3]{g} \cdot \frac{\sqrt[3]{0.5}}{\sqrt[3]{a}}\]
\sqrt[3]{\frac{g}{2 \cdot a}}
↓
\sqrt[3]{g} \cdot \frac{\sqrt[3]{0.5}}{\sqrt[3]{a}}
(FPCore (g a) :precision binary64 (cbrt (/ g (* 2.0 a))))
↓
(FPCore (g a) :precision binary64 (* (cbrt g) (/ (cbrt 0.5) (cbrt 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(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 15.3

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

  3. Applied div-inv_binary64_382615.3

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

  4. Applied cbrt-prod_binary64_38600.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. Taylor expanded around 0 34.9

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

  7. Simplified0.9

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

  8. Final simplification0.9

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

Reproduce

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