
(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 5 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 42.3%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6429.0
Applied rewrites29.0%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6471.7
Applied rewrites71.7%
lift-/.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
distribute-frac-negN/A
cbrt-divN/A
lower-/.f64N/A
lower-cbrt.f64N/A
lower-neg.f64N/A
lower-cbrt.f6496.9
Applied rewrites96.9%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* a 2.0)) -5e-309) (* (pow (- a) -0.3333333333333333) (cbrt g)) (* (cbrt (- g)) (pow a -0.3333333333333333))))
double code(double g, double h, double a) {
double tmp;
if ((1.0 / (a * 2.0)) <= -5e-309) {
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 ((1.0 / (a * 2.0)) <= -5e-309) {
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(1.0 / Float64(a * 2.0)) <= -5e-309) 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[(1.0 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], -5e-309], 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}\;\frac{1}{a \cdot 2} \leq -5 \cdot 10^{-309}:\\
\;\;\;\;{\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 1 binary64) (*.f64 #s(literal 2 binary64) a)) < -4.9999999999999995e-309Initial program 43.7%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6427.5
Applied rewrites27.5%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6472.5
Applied rewrites72.5%
lift-/.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
inv-powN/A
pow-powN/A
metadata-evalN/A
sqr-powN/A
lift-cbrt.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-pow.f64N/A
metadata-evalN/A
lower-*.f64N/A
lower-pow.f64N/A
metadata-eval90.6
Applied rewrites90.6%
lift-neg.f64N/A
lift-pow.f64N/A
lift-neg.f64N/A
lift-pow.f64N/A
lift-cbrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-upN/A
metadata-evalN/A
lower-pow.f6490.6
Applied rewrites90.6%
if -4.9999999999999995e-309 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 40.6%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6430.8
Applied rewrites30.8%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
lift-/.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
div-invN/A
distribute-lft-neg-inN/A
cbrt-prodN/A
pow1/3N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
sqr-powN/A
pow-prod-downN/A
sqr-negN/A
lift-neg.f64N/A
lift-neg.f64N/A
pow-prod-downN/A
sqr-powN/A
lift-pow.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-neg.f640.0
lift-pow.f64N/A
sqr-powN/A
pow-prod-downN/A
Applied rewrites90.5%
Final simplification90.5%
(FPCore (g h a) :precision binary64 (if (<= (/ 1.0 (* a 2.0)) 2e+63) (- (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)) <= 2e+63) {
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)) <= 2e+63) {
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)) <= 2e+63) tmp = Float64(-cbrt(Float64(g / 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], 2e+63], (-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 2 \cdot 10^{+63}:\\
\;\;\;\;-\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)) < 2.00000000000000012e63Initial program 47.9%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6431.6
Applied rewrites31.6%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6480.1
Applied rewrites80.1%
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-/.f6480.1
Applied rewrites80.1%
if 2.00000000000000012e63 < (/.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) a)) Initial program 19.0%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6418.4
Applied rewrites18.4%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6436.8
Applied rewrites36.8%
lift-/.f64N/A
cbrt-unprodN/A
neg-mul-1N/A
lift-/.f64N/A
div-invN/A
distribute-lft-neg-inN/A
cbrt-prodN/A
pow1/3N/A
inv-powN/A
pow-powN/A
metadata-evalN/A
sqr-powN/A
pow-prod-downN/A
sqr-negN/A
lift-neg.f64N/A
lift-neg.f64N/A
pow-prod-downN/A
sqr-powN/A
lift-pow.f64N/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-neg.f640.0
lift-pow.f64N/A
sqr-powN/A
pow-prod-downN/A
Applied rewrites88.2%
Final simplification81.7%
(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 42.3%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6429.0
Applied rewrites29.0%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6471.7
Applied rewrites71.7%
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.7
Applied rewrites71.7%
(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 42.3%
Taylor expanded in g around inf
mul-1-negN/A
distribute-neg-frac2N/A
lower-/.f64N/A
lower-neg.f6429.0
Applied rewrites29.0%
Taylor expanded in g around inf
*-commutativeN/A
lower-*.f64N/A
lower-cbrt.f64N/A
lower-cbrt.f64N/A
lower-/.f6471.7
Applied rewrites71.7%
lift-/.f64N/A
cbrt-unprodN/A
pow1/3N/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.3
Applied rewrites1.3%
herbie shell --seed 2024214
(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))))))))