
(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 6 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 (* (pow 4.0 0.16666666666666666) (* (cbrt -0.5) (* (cbrt (/ -1.0 a)) (cbrt (- g))))))
double code(double g, double h, double a) {
return pow(4.0, 0.16666666666666666) * (cbrt(-0.5) * (cbrt((-1.0 / a)) * cbrt(-g)));
}
public static double code(double g, double h, double a) {
return Math.pow(4.0, 0.16666666666666666) * (Math.cbrt(-0.5) * (Math.cbrt((-1.0 / a)) * Math.cbrt(-g)));
}
function code(g, h, a) return Float64((4.0 ^ 0.16666666666666666) * Float64(cbrt(-0.5) * Float64(cbrt(Float64(-1.0 / a)) * cbrt(Float64(-g))))) end
code[g_, h_, a_] := N[(N[Power[4.0, 0.16666666666666666], $MachinePrecision] * N[(N[Power[-0.5, 1/3], $MachinePrecision] * N[(N[Power[N[(-1.0 / a), $MachinePrecision], 1/3], $MachinePrecision] * N[Power[(-g), 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
{4}^{0.16666666666666666} \cdot \left(\sqrt[3]{-0.5} \cdot \left(\sqrt[3]{\frac{-1}{a}} \cdot \sqrt[3]{-g}\right)\right)
\end{array}
Initial program 48.1%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites50.1%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6476.4
Applied rewrites76.4%
Applied rewrites95.0%
Applied rewrites95.6%
Final simplification95.6%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* 2.0 a)) -4e-306) (* (pow (- a) -0.3333333333333333) (cbrt g)) (* (pow a -0.3333333333333333) (cbrt (- g)))))
double code(double g, double h, double a) {
double tmp;
if ((1.0 / (2.0 * a)) <= -4e-306) {
tmp = pow(-a, -0.3333333333333333) * cbrt(g);
} else {
tmp = pow(a, -0.3333333333333333) * cbrt(-g);
}
return tmp;
}
public static double code(double g, double h, double a) {
double tmp;
if ((1.0 / (2.0 * a)) <= -4e-306) {
tmp = Math.pow(-a, -0.3333333333333333) * Math.cbrt(g);
} else {
tmp = Math.pow(a, -0.3333333333333333) * Math.cbrt(-g);
}
return tmp;
}
function code(g, h, a) tmp = 0.0 if (Float64(1.0 / Float64(2.0 * a)) <= -4e-306) tmp = Float64((Float64(-a) ^ -0.3333333333333333) * cbrt(g)); else tmp = Float64((a ^ -0.3333333333333333) * cbrt(Float64(-g))); end return tmp end
code[g_, h_, a_] := If[LessEqual[N[(1.0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], -4e-306], N[(N[Power[(-a), -0.3333333333333333], $MachinePrecision] * N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision], N[(N[Power[a, -0.3333333333333333], $MachinePrecision] * N[Power[(-g), 1/3], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{2 \cdot a} \leq -4 \cdot 10^{-306}:\\
\;\;\;\;{\left(-a\right)}^{-0.3333333333333333} \cdot \sqrt[3]{g}\\
\mathbf{else}:\\
\;\;\;\;{a}^{-0.3333333333333333} \cdot \sqrt[3]{-g}\\
\end{array}
\end{array}
if (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) < -4.00000000000000011e-306Initial program 51.9%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites52.6%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6483.6
Applied rewrites83.6%
Applied rewrites96.9%
Applied rewrites90.6%
if -4.00000000000000011e-306 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 44.5%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites47.7%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6469.5
Applied rewrites69.5%
Applied rewrites94.4%
Applied rewrites88.4%
Final simplification89.5%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* 2.0 a)) -5e+156) (* (pow (- a) -0.3333333333333333) (cbrt g)) (cbrt (* (/ -1.0 a) g))))
double code(double g, double h, double a) {
double tmp;
if ((1.0 / (2.0 * a)) <= -5e+156) {
tmp = pow(-a, -0.3333333333333333) * cbrt(g);
} else {
tmp = cbrt(((-1.0 / a) * g));
}
return tmp;
}
public static double code(double g, double h, double a) {
double tmp;
if ((1.0 / (2.0 * a)) <= -5e+156) {
tmp = Math.pow(-a, -0.3333333333333333) * Math.cbrt(g);
} else {
tmp = Math.cbrt(((-1.0 / a) * g));
}
return tmp;
}
function code(g, h, a) tmp = 0.0 if (Float64(1.0 / Float64(2.0 * a)) <= -5e+156) tmp = Float64((Float64(-a) ^ -0.3333333333333333) * cbrt(g)); else tmp = cbrt(Float64(Float64(-1.0 / a) * g)); end return tmp end
code[g_, h_, a_] := If[LessEqual[N[(1.0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], -5e+156], N[(N[Power[(-a), -0.3333333333333333], $MachinePrecision] * N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(-1.0 / a), $MachinePrecision] * g), $MachinePrecision], 1/3], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\frac{1}{2 \cdot a} \leq -5 \cdot 10^{+156}:\\
\;\;\;\;{\left(-a\right)}^{-0.3333333333333333} \cdot \sqrt[3]{g}\\
\mathbf{else}:\\
\;\;\;\;\sqrt[3]{\frac{-1}{a} \cdot g}\\
\end{array}
\end{array}
if (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) < -4.99999999999999992e156Initial program 44.1%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites44.2%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6448.3
Applied rewrites48.3%
Applied rewrites95.8%
Applied rewrites88.4%
if -4.99999999999999992e156 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 48.6%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites50.8%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6479.9
Applied rewrites79.9%
Applied rewrites80.7%
Applied rewrites80.8%
Final simplification81.7%
(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 48.1%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites50.1%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6476.4
Applied rewrites76.4%
Applied rewrites95.6%
(FPCore (g h a) :precision binary64 (cbrt (* (/ -1.0 a) g)))
double code(double g, double h, double a) {
return cbrt(((-1.0 / a) * g));
}
public static double code(double g, double h, double a) {
return Math.cbrt(((-1.0 / a) * g));
}
function code(g, h, a) return cbrt(Float64(Float64(-1.0 / a) * g)) end
code[g_, h_, a_] := N[Power[N[(N[(-1.0 / a), $MachinePrecision] * g), $MachinePrecision], 1/3], $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{\frac{-1}{a} \cdot g}
\end{array}
Initial program 48.1%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites50.1%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6476.4
Applied rewrites76.4%
Applied rewrites77.3%
Applied rewrites77.3%
Final simplification77.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(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 48.1%
lift-cbrt.f64N/A
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
cbrt-divN/A
*-lft-identityN/A
pow1/3N/A
lower-/.f64N/A
Applied rewrites50.1%
Taylor expanded in g around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f6476.4
Applied rewrites76.4%
Applied rewrites77.3%
herbie shell --seed 2024240
(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))))))))