
(FPCore (g h a) :precision binary64 (let* ((t_0 (/ 1.0 (* 2.0 a))) (t_1 (sqrt (- (* g g) (* h h))))) (+ (cbrt (* t_0 (+ (- g) t_1))) (cbrt (* t_0 (- (- g) t_1))))))
double code(double g, double h, double a) {
double t_0 = 1.0 / (2.0 * a);
double t_1 = sqrt(((g * g) - (h * h)));
return cbrt((t_0 * (-g + t_1))) + cbrt((t_0 * (-g - t_1)));
}
public static double code(double g, double h, double a) {
double t_0 = 1.0 / (2.0 * a);
double t_1 = Math.sqrt(((g * g) - (h * h)));
return Math.cbrt((t_0 * (-g + t_1))) + Math.cbrt((t_0 * (-g - t_1)));
}
function code(g, h, a) t_0 = Float64(1.0 / Float64(2.0 * a)) t_1 = sqrt(Float64(Float64(g * g) - Float64(h * h))) return Float64(cbrt(Float64(t_0 * Float64(Float64(-g) + t_1))) + cbrt(Float64(t_0 * Float64(Float64(-g) - t_1)))) end
code[g_, h_, a_] := Block[{t$95$0 = N[(1.0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(g * g), $MachinePrecision] - N[(h * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, N[(N[Power[N[(t$95$0 * N[((-g) + t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + N[Power[N[(t$95$0 * N[((-g) - t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{1}{2 \cdot a}\\
t_1 := \sqrt{g \cdot g - h \cdot h}\\
\sqrt[3]{t\_0 \cdot \left(\left(-g\right) + t\_1\right)} + \sqrt[3]{t\_0 \cdot \left(\left(-g\right) - t\_1\right)}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (g h a) :precision binary64 (let* ((t_0 (/ 1.0 (* 2.0 a))) (t_1 (sqrt (- (* g g) (* h h))))) (+ (cbrt (* t_0 (+ (- g) t_1))) (cbrt (* t_0 (- (- g) t_1))))))
double code(double g, double h, double a) {
double t_0 = 1.0 / (2.0 * a);
double t_1 = sqrt(((g * g) - (h * h)));
return cbrt((t_0 * (-g + t_1))) + cbrt((t_0 * (-g - t_1)));
}
public static double code(double g, double h, double a) {
double t_0 = 1.0 / (2.0 * a);
double t_1 = Math.sqrt(((g * g) - (h * h)));
return Math.cbrt((t_0 * (-g + t_1))) + Math.cbrt((t_0 * (-g - t_1)));
}
function code(g, h, a) t_0 = Float64(1.0 / Float64(2.0 * a)) t_1 = sqrt(Float64(Float64(g * g) - Float64(h * h))) return Float64(cbrt(Float64(t_0 * Float64(Float64(-g) + t_1))) + cbrt(Float64(t_0 * Float64(Float64(-g) - t_1)))) end
code[g_, h_, a_] := Block[{t$95$0 = N[(1.0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(g * g), $MachinePrecision] - N[(h * h), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, N[(N[Power[N[(t$95$0 * N[((-g) + t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + N[Power[N[(t$95$0 * N[((-g) - t$95$1), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{1}{2 \cdot a}\\
t_1 := \sqrt{g \cdot g - h \cdot h}\\
\sqrt[3]{t\_0 \cdot \left(\left(-g\right) + t\_1\right)} + \sqrt[3]{t\_0 \cdot \left(\left(-g\right) - t\_1\right)}
\end{array}
\end{array}
(FPCore (g h a) :precision binary64 (/ (cbrt (- g)) (cbrt a)))
double code(double g, double h, double a) {
return cbrt(-g) / cbrt(a);
}
public static double code(double g, double h, double a) {
return Math.cbrt(-g) / Math.cbrt(a);
}
function code(g, h, a) return Float64(cbrt(Float64(-g)) / cbrt(a)) end
code[g_, h_, a_] := N[(N[Power[(-g), 1/3], $MachinePrecision] / N[Power[a, 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt[3]{-g}}{\sqrt[3]{a}}
\end{array}
Initial program 40.5%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.6
Simplified27.6%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.8
Simplified71.8%
cbrt-divN/A
lift-cbrt.f64N/A
associate-*l/N/A
lift-cbrt.f64N/A
cbrt-prodN/A
*-commutativeN/A
neg-mul-1N/A
lift-neg.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6495.3
Applied egg-rr95.3%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* a 2.0)) 5e-286) (/ 1.0 (cbrt (- (/ a g)))) (* (cbrt (- g)) (pow a -0.3333333333333333))))
double code(double g, double h, double a) {
double tmp;
if ((1.0 / (a * 2.0)) <= 5e-286) {
tmp = 1.0 / cbrt(-(a / g));
} else {
tmp = cbrt(-g) * pow(a, -0.3333333333333333);
}
return tmp;
}
public static double code(double g, double h, double a) {
double tmp;
if ((1.0 / (a * 2.0)) <= 5e-286) {
tmp = 1.0 / Math.cbrt(-(a / g));
} else {
tmp = Math.cbrt(-g) * Math.pow(a, -0.3333333333333333);
}
return tmp;
}
function code(g, h, a) tmp = 0.0 if (Float64(1.0 / Float64(a * 2.0)) <= 5e-286) tmp = Float64(1.0 / cbrt(Float64(-Float64(a / g)))); else tmp = Float64(cbrt(Float64(-g)) * (a ^ -0.3333333333333333)); end return tmp end
code[g_, h_, a_] := If[LessEqual[N[(1.0 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], 5e-286], N[(1.0 / N[Power[(-N[(a / g), $MachinePrecision]), 1/3], $MachinePrecision]), $MachinePrecision], N[(N[Power[(-g), 1/3], $MachinePrecision] * N[Power[a, -0.3333333333333333], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{a \cdot 2} \leq 5 \cdot 10^{-286}:\\
\;\;\;\;\frac{1}{\sqrt[3]{-\frac{a}{g}}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{-g} \cdot {a}^{-0.3333333333333333}\\
\end{array}
\end{array}
if (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) < 5.00000000000000037e-286Initial program 42.7%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.1
Simplified27.1%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6472.1
Simplified72.1%
lift-/.f64N/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
*-commutativeN/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
clear-numN/A
clear-numN/A
cbrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
lower-neg.f64N/A
lower-/.f6472.5
Applied egg-rr72.5%
if 5.00000000000000037e-286 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 38.1%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6428.2
Simplified28.2%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.3
Simplified71.3%
lift-/.f64N/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
*-commutativeN/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
div-invN/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
cbrt-prodN/A
pow1/3N/A
lower-*.f64N/A
lower-cbrt.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
lower-pow.f64N/A
metadata-eval89.2
Applied egg-rr89.2%
Final simplification80.3%
(FPCore (g h a) :precision binary64 (if (<= (* a 2.0) -1e-307) (* (pow (- a) -0.3333333333333333) (cbrt g)) (* (cbrt (- g)) (pow a -0.3333333333333333))))
double code(double g, double h, double a) {
double tmp;
if ((a * 2.0) <= -1e-307) {
tmp = pow(-a, -0.3333333333333333) * cbrt(g);
} else {
tmp = cbrt(-g) * pow(a, -0.3333333333333333);
}
return tmp;
}
public static double code(double g, double h, double a) {
double tmp;
if ((a * 2.0) <= -1e-307) {
tmp = Math.pow(-a, -0.3333333333333333) * Math.cbrt(g);
} else {
tmp = Math.cbrt(-g) * Math.pow(a, -0.3333333333333333);
}
return tmp;
}
function code(g, h, a) tmp = 0.0 if (Float64(a * 2.0) <= -1e-307) tmp = Float64((Float64(-a) ^ -0.3333333333333333) * cbrt(g)); else tmp = Float64(cbrt(Float64(-g)) * (a ^ -0.3333333333333333)); end return tmp end
code[g_, h_, a_] := If[LessEqual[N[(a * 2.0), $MachinePrecision], -1e-307], N[(N[Power[(-a), -0.3333333333333333], $MachinePrecision] * N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision], N[(N[Power[(-g), 1/3], $MachinePrecision] * N[Power[a, -0.3333333333333333], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot 2 \leq -1 \cdot 10^{-307}:\\
\;\;\;\;{\left(-a\right)}^{-0.3333333333333333} \cdot \sqrt[3]{g}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{-g} \cdot {a}^{-0.3333333333333333}\\
\end{array}
\end{array}
if (*.f64 #s(literal 2 binary64) a) < -9.99999999999999909e-308Initial program 43.3%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.2
Simplified27.2%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.5
Simplified71.5%
lift-/.f64N/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
*-commutativeN/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
clear-numN/A
associate-/r/N/A
cbrt-prodN/A
pow1/3N/A
lower-*.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
lower-pow.f64N/A
metadata-evalN/A
lower-cbrt.f6489.8
Applied egg-rr89.8%
if -9.99999999999999909e-308 < (*.f64 #s(literal 2 binary64) a) Initial program 37.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6428.0
Simplified28.0%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6472.0
Simplified72.0%
lift-/.f64N/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
*-commutativeN/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
div-invN/A
distribute-lft-neg-inN/A
lift-neg.f64N/A
cbrt-prodN/A
pow1/3N/A
lower-*.f64N/A
lower-cbrt.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
metadata-evalN/A
lower-pow.f64N/A
metadata-eval89.1
Applied egg-rr89.1%
Final simplification89.4%
(FPCore (g h a) :precision binary64 (/ 1.0 (cbrt (- (/ a g)))))
double code(double g, double h, double a) {
return 1.0 / cbrt(-(a / g));
}
public static double code(double g, double h, double a) {
return 1.0 / Math.cbrt(-(a / g));
}
function code(g, h, a) return Float64(1.0 / cbrt(Float64(-Float64(a / g)))) end
code[g_, h_, a_] := N[(1.0 / N[Power[(-N[(a / g), $MachinePrecision]), 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{1}{\sqrt[3]{-\frac{a}{g}}}
\end{array}
Initial program 40.5%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.6
Simplified27.6%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.8
Simplified71.8%
lift-/.f64N/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
*-commutativeN/A
lift-cbrt.f64N/A
lift-cbrt.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
clear-numN/A
clear-numN/A
cbrt-divN/A
metadata-evalN/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
lower-neg.f64N/A
lower-/.f6472.4
Applied egg-rr72.4%
Final simplification72.4%
(FPCore (g h a) :precision binary64 (- (cbrt (/ g a))))
double code(double g, double h, double a) {
return -cbrt((g / a));
}
public static double code(double g, double h, double a) {
return -Math.cbrt((g / a));
}
function code(g, h, a) return Float64(-cbrt(Float64(g / a))) end
code[g_, h_, a_] := (-N[Power[N[(g / a), $MachinePrecision], 1/3], $MachinePrecision])
\begin{array}{l}
\\
-\sqrt[3]{\frac{g}{a}}
\end{array}
Initial program 40.5%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.6
Simplified27.6%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.8
Simplified71.8%
Taylor expanded in a around -inf
rem-cube-cbrtN/A
*-commutativeN/A
mul-1-negN/A
lower-neg.f64N/A
lower-cbrt.f64N/A
lower-/.f6471.8
Simplified71.8%
(FPCore (g h a) :precision binary64 (pow (/ g a) 0.3333333333333333))
double code(double g, double h, double a) {
return pow((g / a), 0.3333333333333333);
}
real(8) function code(g, h, a)
real(8), intent (in) :: g
real(8), intent (in) :: h
real(8), intent (in) :: a
code = (g / a) ** 0.3333333333333333d0
end function
public static double code(double g, double h, double a) {
return Math.pow((g / a), 0.3333333333333333);
}
def code(g, h, a): return math.pow((g / a), 0.3333333333333333)
function code(g, h, a) return Float64(g / a) ^ 0.3333333333333333 end
function tmp = code(g, h, a) tmp = (g / a) ^ 0.3333333333333333; end
code[g_, h_, a_] := N[Power[N[(g / a), $MachinePrecision], 0.3333333333333333], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{g}{a}\right)}^{0.3333333333333333}
\end{array}
Initial program 40.5%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.6
Simplified27.6%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.8
Simplified71.8%
lift-/.f64N/A
cbrt-unprodN/A
pow1/3N/A
*-commutativeN/A
neg-mul-1N/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lift-/.f64N/A
sqr-powN/A
pow-prod-downN/A
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
lift-/.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
lift-/.f64N/A
sqr-negN/A
pow-prod-downN/A
sqr-powN/A
lower-pow.f641.4
Applied egg-rr1.4%
(FPCore (g h a) :precision binary64 (cbrt (/ g a)))
double code(double g, double h, double a) {
return cbrt((g / a));
}
public static double code(double g, double h, double a) {
return Math.cbrt((g / a));
}
function code(g, h, a) return cbrt(Float64(g / a)) end
code[g_, h_, a_] := N[Power[N[(g / a), $MachinePrecision], 1/3], $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{g}{a}}
\end{array}
Initial program 40.5%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.6
Simplified27.6%
Taylor expanded in g around inf
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f6471.8
Simplified71.8%
lift-/.f64N/A
cbrt-unprodN/A
pow1/3N/A
*-commutativeN/A
neg-mul-1N/A
lift-/.f64N/A
distribute-frac-neg2N/A
lift-neg.f64N/A
lift-/.f64N/A
sqr-powN/A
pow-prod-downN/A
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
lift-/.f64N/A
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-neg2N/A
lift-/.f64N/A
sqr-negN/A
pow-prod-downN/A
sqr-powN/A
pow1/3N/A
lift-cbrt.f641.4
Applied egg-rr1.4%
herbie shell --seed 2024210
(FPCore (g h a)
:name "2-ancestry mixing, positive discriminant"
:precision binary64
(+ (cbrt (* (/ 1.0 (* 2.0 a)) (+ (- g) (sqrt (- (* g g) (* h h)))))) (cbrt (* (/ 1.0 (* 2.0 a)) (- (- g) (sqrt (- (* g g) (* h h))))))))