
(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 8 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 (/ -1.0 a)) (cbrt g)))
double code(double g, double h, double a) {
return cbrt((-1.0 / a)) * cbrt(g);
}
public static double code(double g, double h, double a) {
return Math.cbrt((-1.0 / a)) * Math.cbrt(g);
}
function code(g, h, a) return Float64(cbrt(Float64(-1.0 / a)) * cbrt(g)) end
code[g_, h_, a_] := N[(N[Power[N[(-1.0 / a), $MachinePrecision], 1/3], $MachinePrecision] * N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{-1}{a}} \cdot \sqrt[3]{g}
\end{array}
Initial program 43.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.2
Simplified26.2%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6475.2
Simplified75.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-negN/A
cbrt-divN/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f64N/A
neg-lowering-neg.f64N/A
cbrt-lowering-cbrt.f6496.0
Applied egg-rr96.0%
cbrt-undivN/A
neg-mul-1N/A
associate-/l*N/A
div-invN/A
*-commutativeN/A
cbrt-unprodN/A
pow1/3N/A
unpow-prod-downN/A
associate-*r*N/A
pow1/3N/A
pow-prod-downN/A
neg-mul-1N/A
*-lowering-*.f64N/A
pow1/3N/A
cbrt-lowering-cbrt.f64N/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
pow1/3N/A
cbrt-lowering-cbrt.f6496.2
Applied egg-rr96.2%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* a 2.0)) -5e-308) (* (cbrt g) (pow (- a) -0.3333333333333333)) (* (cbrt (- g)) (pow a -0.3333333333333333))))
double code(double g, double h, double a) {
double tmp;
if ((1.0 / (a * 2.0)) <= -5e-308) {
tmp = cbrt(g) * pow(-a, -0.3333333333333333);
} 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-308) {
tmp = Math.cbrt(g) * Math.pow(-a, -0.3333333333333333);
} 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-308) tmp = Float64(cbrt(g) * (Float64(-a) ^ -0.3333333333333333)); 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-308], N[(N[Power[g, 1/3], $MachinePrecision] * N[Power[(-a), -0.3333333333333333], $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^{-308}:\\
\;\;\;\;\sqrt[3]{g} \cdot {\left(-a\right)}^{-0.3333333333333333}\\
\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)) < -4.99999999999999955e-308Initial program 47.0%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.5
Simplified26.5%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6476.2
Simplified76.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-neg2N/A
clear-numN/A
associate-/r/N/A
cbrt-prodN/A
pow1/3N/A
*-lowering-*.f64N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
neg-lowering-neg.f64N/A
cbrt-lowering-cbrt.f6491.1
Applied egg-rr91.1%
if -4.99999999999999955e-308 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 40.2%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6425.9
Simplified25.9%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6474.1
Simplified74.1%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
div-invN/A
distribute-lft-neg-inN/A
cbrt-prodN/A
pow1/3N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
neg-lowering-neg.f64N/A
pow-lowering-pow.f6488.9
Applied egg-rr88.9%
Final simplification90.0%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* a 2.0)) 40000000000000.0) (cbrt (/ g (- a))) (* (cbrt (- g)) (pow a -0.3333333333333333))))
double code(double g, double h, double a) {
double tmp;
if ((1.0 / (a * 2.0)) <= 40000000000000.0) {
tmp = cbrt((g / -a));
} 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)) <= 40000000000000.0) {
tmp = Math.cbrt((g / -a));
} 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)) <= 40000000000000.0) tmp = cbrt(Float64(g / Float64(-a))); 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], 40000000000000.0], N[Power[N[(g / (-a)), $MachinePrecision], 1/3], $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 40000000000000:\\
\;\;\;\;\sqrt[3]{\frac{g}{-a}}\\
\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)) < 4e13Initial program 44.9%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6427.5
Simplified27.5%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6482.1
Simplified82.1%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-neg2N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6482.1
Applied egg-rr82.1%
if 4e13 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 39.7%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6422.4
Simplified22.4%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6454.5
Simplified54.5%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
div-invN/A
distribute-lft-neg-inN/A
cbrt-prodN/A
pow1/3N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
neg-lowering-neg.f64N/A
pow-lowering-pow.f6488.4
Applied egg-rr88.4%
Final simplification83.6%
(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 43.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.2
Simplified26.2%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6475.2
Simplified75.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-negN/A
cbrt-divN/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f64N/A
neg-lowering-neg.f64N/A
cbrt-lowering-cbrt.f6496.0
Applied egg-rr96.0%
(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(a / Float64(-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 43.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.2
Simplified26.2%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6475.2
Simplified75.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-negN/A
cbrt-divN/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f64N/A
neg-lowering-neg.f64N/A
cbrt-lowering-cbrt.f6496.0
Applied egg-rr96.0%
clear-numN/A
/-lowering-/.f64N/A
cbrt-undivN/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6475.3
Applied egg-rr75.3%
(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 / Float64(-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 43.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.2
Simplified26.2%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6475.2
Simplified75.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-neg2N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6475.2
Applied egg-rr75.2%
(FPCore (g h a) :precision binary64 (pow (/ a g) -0.3333333333333333))
double code(double g, double h, double a) {
return pow((a / g), -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 = (a / g) ** (-0.3333333333333333d0)
end function
public static double code(double g, double h, double a) {
return Math.pow((a / g), -0.3333333333333333);
}
def code(g, h, a): return math.pow((a / g), -0.3333333333333333)
function code(g, h, a) return Float64(a / g) ^ -0.3333333333333333 end
function tmp = code(g, h, a) tmp = (a / g) ^ -0.3333333333333333; end
code[g_, h_, a_] := N[Power[N[(a / g), $MachinePrecision], -0.3333333333333333], $MachinePrecision]
\begin{array}{l}
\\
{\left(\frac{a}{g}\right)}^{-0.3333333333333333}
\end{array}
Initial program 43.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.2
Simplified26.2%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6475.2
Simplified75.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-neg2N/A
pow1/3N/A
sqr-powN/A
pow-prod-downN/A
distribute-frac-neg2N/A
distribute-frac-neg2N/A
sqr-negN/A
pow-prod-downN/A
sqr-powN/A
clear-numN/A
inv-powN/A
pow-powN/A
metadata-evalN/A
pow-lowering-pow.f64N/A
/-lowering-/.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 43.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
neg-lowering-neg.f6426.2
Simplified26.2%
Taylor expanded in g around inf
*-lowering-*.f64N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f64N/A
cbrt-lowering-cbrt.f6475.2
Simplified75.2%
*-commutativeN/A
cbrt-unprodN/A
neg-mul-1N/A
distribute-frac-neg2N/A
pow1/3N/A
sqr-powN/A
pow-prod-downN/A
distribute-frac-neg2N/A
distribute-frac-neg2N/A
sqr-negN/A
pow-prod-downN/A
sqr-powN/A
pow1/3N/A
cbrt-lowering-cbrt.f64N/A
/-lowering-/.f641.3
Applied egg-rr1.3%
herbie shell --seed 2024204
(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))))))))