
(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 4 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 (/ -1.0 a))))
double code(double g, double h, double a) {
return cbrt(g) * cbrt((-1.0 / a));
}
public static double code(double g, double h, double a) {
return Math.cbrt(g) * Math.cbrt((-1.0 / a));
}
function code(g, h, a) return Float64(cbrt(g) * cbrt(Float64(-1.0 / a))) end
code[g_, h_, a_] := N[(N[Power[g, 1/3], $MachinePrecision] * N[Power[N[(-1.0 / a), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sqrt[3]{g} \cdot \sqrt[3]{\frac{-1}{a}}
\end{array}
Initial program 43.3%
Simplified43.3%
Taylor expanded in g around -inf 28.0%
mul-1-neg28.0%
distribute-neg-frac228.0%
Simplified28.0%
pow1/311.2%
div-inv11.2%
unpow-prod-down3.3%
pow1/317.8%
Applied egg-rr17.8%
unpow1/333.5%
Simplified33.5%
Taylor expanded in g around -inf 96.3%
neg-mul-196.3%
Simplified96.3%
Taylor expanded in g around 0 96.3%
Final simplification96.3%
(FPCore (g h a) :precision binary64 (* (/ (cbrt g) (cbrt a)) -2.0))
double code(double g, double h, double a) {
return (cbrt(g) / cbrt(a)) * -2.0;
}
public static double code(double g, double h, double a) {
return (Math.cbrt(g) / Math.cbrt(a)) * -2.0;
}
function code(g, h, a) return Float64(Float64(cbrt(g) / cbrt(a)) * -2.0) end
code[g_, h_, a_] := N[(N[(N[Power[g, 1/3], $MachinePrecision] / N[Power[a, 1/3], $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]
\begin{array}{l}
\\
\frac{\sqrt[3]{g}}{\sqrt[3]{a}} \cdot -2
\end{array}
Initial program 43.3%
Simplified43.3%
Taylor expanded in g around -inf 28.0%
mul-1-neg28.0%
distribute-neg-frac228.0%
Simplified28.0%
Taylor expanded in g around inf 15.1%
Taylor expanded in g around -inf 15.1%
*-commutative15.1%
Simplified15.1%
cbrt-div18.8%
Applied egg-rr18.8%
(FPCore (g h a) :precision binary64 (* -2.0 (/ 1.0 (cbrt (/ a g)))))
double code(double g, double h, double a) {
return -2.0 * (1.0 / cbrt((a / g)));
}
public static double code(double g, double h, double a) {
return -2.0 * (1.0 / Math.cbrt((a / g)));
}
function code(g, h, a) return Float64(-2.0 * Float64(1.0 / cbrt(Float64(a / g)))) end
code[g_, h_, a_] := N[(-2.0 * N[(1.0 / N[Power[N[(a / g), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-2 \cdot \frac{1}{\sqrt[3]{\frac{a}{g}}}
\end{array}
Initial program 43.3%
Simplified43.3%
Taylor expanded in g around -inf 28.0%
mul-1-neg28.0%
distribute-neg-frac228.0%
Simplified28.0%
Taylor expanded in g around inf 15.1%
Taylor expanded in g around -inf 15.1%
*-commutative15.1%
Simplified15.1%
clear-num14.9%
cbrt-div15.2%
metadata-eval15.2%
Applied egg-rr15.2%
Final simplification15.2%
(FPCore (g h a) :precision binary64 (* -2.0 (cbrt (/ g a))))
double code(double g, double h, double a) {
return -2.0 * cbrt((g / a));
}
public static double code(double g, double h, double a) {
return -2.0 * Math.cbrt((g / a));
}
function code(g, h, a) return Float64(-2.0 * cbrt(Float64(g / a))) end
code[g_, h_, a_] := N[(-2.0 * N[Power[N[(g / a), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-2 \cdot \sqrt[3]{\frac{g}{a}}
\end{array}
Initial program 43.3%
Simplified43.3%
Taylor expanded in g around -inf 28.0%
mul-1-neg28.0%
distribute-neg-frac228.0%
Simplified28.0%
Taylor expanded in g around inf 15.1%
Taylor expanded in g around -inf 15.1%
*-commutative15.1%
Simplified15.1%
Final simplification15.1%
herbie shell --seed 2024113
(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))))))))