2-ancestry mixing, positive discriminant

Percentage Accurate: 43.7% → 95.9%

Time: 53.1s

Alternatives: 6

Speedup: 2.1×

Specification

Math

\[\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

(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))))))

C

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)));
}

Java

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)));
}

Julia

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

Wolfram

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]]]

Initial Program: 43.7% accurate, 1.0× speedup

Math

\[\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

(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))))))

C

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)));
}

Java

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)));
}

Julia

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

Wolfram

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]]]

Alternative 1: 95.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} - \frac{\sqrt[3]{g}}{\sqrt[3]{a}} \end{array} \]

FPCore

(FPCore (g h a)
 :precision binary64
 (- (cbrt (* (/ 0.5 a) (- g g))) (/ (cbrt g) (cbrt a))))

C

double code(double g, double h, double a) {
	return cbrt(((0.5 / a) * (g - g))) - (cbrt(g) / cbrt(a));
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt(((0.5 / a) * (g - g))) - (Math.cbrt(g) / Math.cbrt(a));
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(Float64(0.5 / a) * Float64(g - g))) - Float64(cbrt(g) / cbrt(a)))
end

Wolfram

code[g_, h_, a_] := N[(N[Power[N[(N[(0.5 / a), $MachinePrecision] * N[(g - g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] - N[(N[Power[g, 1/3], $MachinePrecision] / N[Power[a, 1/3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.3%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

3. Simplified 43.3%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
4. Add Preprocessing

5. Taylor expanded in g around inf 27.3%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]
6. Step-by-step derivation

   1. associate-*r/ 27.3%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\color{blue}{\frac{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot -0.5}{a}}} \]

   2. cbrt-div 30.2%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\frac{\sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot -0.5}}{\sqrt[3]{a}}} \]

   3. pow2 30.2%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\sqrt[3]{\left(g + \sqrt{\color{blue}{{g}^{2}} - h \cdot h}\right) \cdot -0.5}}{\sqrt[3]{a}} \]

   4. pow2 30.2%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\sqrt[3]{\left(g + \sqrt{{g}^{2} - \color{blue}{{h}^{2}}}\right) \cdot -0.5}}{\sqrt[3]{a}} \]

7. Applied egg-rr 30.2%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\frac{\sqrt[3]{\left(g + \sqrt{{g}^{2} - {h}^{2}}\right) \cdot -0.5}}{\sqrt[3]{a}}} \]

8. Taylor expanded in g around inf 96.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\sqrt[3]{\left(g + \color{blue}{g}\right) \cdot -0.5}}{\sqrt[3]{a}} \]

9. Taylor expanded in g around -inf 96.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\color{blue}{-1 \cdot \sqrt[3]{g}}}{\sqrt[3]{a}} \]
10. Step-by-step derivation

    1. mul-1-neg 96.8%

       \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\color{blue}{-\sqrt[3]{g}}}{\sqrt[3]{a}} \]

11. Simplified 96.8%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\color{blue}{-\sqrt[3]{g}}}{\sqrt[3]{a}} \]

12. Final simplification 96.8%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} - \frac{\sqrt[3]{g}}{\sqrt[3]{a}} \]
13. Add Preprocessing

Alternative 2: 73.9% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + g\right) \cdot \frac{-0.5}{a}} \end{array} \]

FPCore

(FPCore (g h a)
 :precision binary64
 (+ (cbrt (* (/ 0.5 a) (- g g))) (cbrt (* (+ g g) (/ -0.5 a)))))

C

double code(double g, double h, double a) {
	return cbrt(((0.5 / a) * (g - g))) + cbrt(((g + g) * (-0.5 / a)));
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt(((0.5 / a) * (g - g))) + Math.cbrt(((g + g) * (-0.5 / a)));
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(Float64(0.5 / a) * Float64(g - g))) + cbrt(Float64(Float64(g + g) * Float64(-0.5 / a))))
end

Wolfram

code[g_, h_, a_] := N[(N[Power[N[(N[(0.5 / a), $MachinePrecision] * N[(g - g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + N[Power[N[(N[(g + g), $MachinePrecision] * N[(-0.5 / a), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.3%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

3. Simplified 43.3%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
4. Add Preprocessing

5. Taylor expanded in g around inf 27.3%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]

6. Taylor expanded in g around inf 71.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + \color{blue}{g}\right) \cdot \frac{-0.5}{a}} \]

7. Final simplification 71.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + g\right) \cdot \frac{-0.5}{a}} \]
8. Add Preprocessing

Alternative 3: 7.9% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)}\\ \mathbf{if}\;a \leq -5 \cdot 10^{-309}:\\ \;\;\;\;t\_0 + \sqrt[3]{g}\\ \mathbf{else}:\\ \;\;\;\;t\_0 - \sqrt[3]{g}\\ \end{array} \end{array} \]

FPCore

(FPCore (g h a)
 :precision binary64
 (let* ((t_0 (cbrt (* (/ 0.5 a) (- g g)))))
   (if (<= a -5e-309) (+ t_0 (cbrt g)) (- t_0 (cbrt g)))))

C

double code(double g, double h, double a) {
	double t_0 = cbrt(((0.5 / a) * (g - g)));
	double tmp;
	if (a <= -5e-309) {
		tmp = t_0 + cbrt(g);
	} else {
		tmp = t_0 - cbrt(g);
	}
	return tmp;
}

Java

public static double code(double g, double h, double a) {
	double t_0 = Math.cbrt(((0.5 / a) * (g - g)));
	double tmp;
	if (a <= -5e-309) {
		tmp = t_0 + Math.cbrt(g);
	} else {
		tmp = t_0 - Math.cbrt(g);
	}
	return tmp;
}

Julia

function code(g, h, a)
	t_0 = cbrt(Float64(Float64(0.5 / a) * Float64(g - g)))
	tmp = 0.0
	if (a <= -5e-309)
		tmp = Float64(t_0 + cbrt(g));
	else
		tmp = Float64(t_0 - cbrt(g));
	end
	return tmp
end

Wolfram

code[g_, h_, a_] := Block[{t$95$0 = N[Power[N[(N[(0.5 / a), $MachinePrecision] * N[(g - g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]}, If[LessEqual[a, -5e-309], N[(t$95$0 + N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision], N[(t$95$0 - N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -4.9999999999999995e-309

   1. Initial program 44.5%

      \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

   3. Simplified 44.5%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in g around inf 28.3%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]

   6. Taylor expanded in g around inf 69.5%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + \color{blue}{g}\right) \cdot \frac{-0.5}{a}} \]

   7. Taylor expanded in g around 0 69.6%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\color{blue}{-1 \cdot \frac{g}{a}}} \]

   9. Simplified 7.8%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\color{blue}{g}} \]

   if -4.9999999999999995e-309 < a

   1. Initial program 41.7%

      \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

   3. Simplified 41.7%

      \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
   4. Add Preprocessing

   5. Taylor expanded in g around inf 25.8%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]

   6. Taylor expanded in g around inf 74.9%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + \color{blue}{g}\right) \cdot \frac{-0.5}{a}} \]

   7. Taylor expanded in g around 0 74.9%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\sqrt[3]{\frac{g}{a}} \cdot \sqrt[3]{-1}} \]

   9. Simplified 7.7%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\left(-\sqrt[3]{g}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 7.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -5 \cdot 10^{-309}:\\ \;\;\;\;\sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{g}\\ \mathbf{else}:\\ \;\;\;\;\sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} - \sqrt[3]{g}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 73.9% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} - \sqrt[3]{\frac{g}{a}} \end{array} \]

FPCore

(FPCore (g h a)
 :precision binary64
 (- (cbrt (* (/ 0.5 a) (- g g))) (cbrt (/ g a))))

C

double code(double g, double h, double a) {
	return cbrt(((0.5 / a) * (g - g))) - cbrt((g / a));
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt(((0.5 / a) * (g - g))) - Math.cbrt((g / a));
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(Float64(0.5 / a) * Float64(g - g))) - cbrt(Float64(g / a)))
end

Wolfram

code[g_, h_, a_] := N[(N[Power[N[(N[(0.5 / a), $MachinePrecision] * N[(g - g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] - N[Power[N[(g / a), $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.3%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

3. Simplified 43.3%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
4. Add Preprocessing

5. Taylor expanded in g around inf 27.3%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]
6. Step-by-step derivation

   1. associate-*r/ 27.3%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\color{blue}{\frac{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot -0.5}{a}}} \]

   2. cbrt-div 30.2%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\frac{\sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot -0.5}}{\sqrt[3]{a}}} \]

   3. pow2 30.2%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\sqrt[3]{\left(g + \sqrt{\color{blue}{{g}^{2}} - h \cdot h}\right) \cdot -0.5}}{\sqrt[3]{a}} \]

   4. pow2 30.2%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\sqrt[3]{\left(g + \sqrt{{g}^{2} - \color{blue}{{h}^{2}}}\right) \cdot -0.5}}{\sqrt[3]{a}} \]

7. Applied egg-rr 30.2%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\frac{\sqrt[3]{\left(g + \sqrt{{g}^{2} - {h}^{2}}\right) \cdot -0.5}}{\sqrt[3]{a}}} \]

8. Taylor expanded in g around inf 96.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \frac{\sqrt[3]{\left(g + \color{blue}{g}\right) \cdot -0.5}}{\sqrt[3]{a}} \]

9. Taylor expanded in g around -inf 71.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{-1 \cdot \sqrt[3]{\frac{g}{a}}} \]
10. Step-by-step derivation

    1. mul-1-neg 71.8%

       \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\left(-\sqrt[3]{\frac{g}{a}}\right)} \]

11. Simplified 71.8%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\left(-\sqrt[3]{\frac{g}{a}}\right)} \]

12. Final simplification 71.8%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} - \sqrt[3]{\frac{g}{a}} \]
13. Add Preprocessing

Alternative 5: 4.6% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{g} \end{array} \]

FPCore

(FPCore (g h a) :precision binary64 (+ (cbrt (* (/ 0.5 a) (- g g))) (cbrt g)))

C

double code(double g, double h, double a) {
	return cbrt(((0.5 / a) * (g - g))) + cbrt(g);
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt(((0.5 / a) * (g - g))) + Math.cbrt(g);
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(Float64(0.5 / a) * Float64(g - g))) + cbrt(g))
end

Wolfram

code[g_, h_, a_] := N[(N[Power[N[(N[(0.5 / a), $MachinePrecision] * N[(g - g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + N[Power[g, 1/3], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 43.3%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

3. Simplified 43.3%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
4. Add Preprocessing

5. Taylor expanded in g around inf 27.3%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]

6. Taylor expanded in g around inf 71.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + \color{blue}{g}\right) \cdot \frac{-0.5}{a}} \]

7. Taylor expanded in g around 0 71.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\color{blue}{-1 \cdot \frac{g}{a}}} \]

9. Simplified 5.1%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\color{blue}{g}} \]

10. Final simplification 5.1%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{g} \]
11. Add Preprocessing

Alternative 6: 4.5% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + -1 \end{array} \]

FPCore

(FPCore (g h a) :precision binary64 (+ (cbrt (* (/ 0.5 a) (- g g))) -1.0))

C

double code(double g, double h, double a) {
	return cbrt(((0.5 / a) * (g - g))) + -1.0;
}

Java

public static double code(double g, double h, double a) {
	return Math.cbrt(((0.5 / a) * (g - g))) + -1.0;
}

Julia

function code(g, h, a)
	return Float64(cbrt(Float64(Float64(0.5 / a) * Float64(g - g))) + -1.0)
end

Wolfram

code[g_, h_, a_] := N[(N[Power[N[(N[(0.5 / a), $MachinePrecision] * N[(g - g), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision] + -1.0), $MachinePrecision]

Derivation

1. Initial program 43.3%

   \[\sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) + \sqrt{g \cdot g - h \cdot h}\right)} + \sqrt[3]{\frac{1}{2 \cdot a} \cdot \left(\left(-g\right) - \sqrt{g \cdot g - h \cdot h}\right)} \]

3. Simplified 43.3%

   \[\leadsto \color{blue}{\sqrt[3]{\frac{0.5}{a} \cdot \left(\sqrt{g \cdot g - h \cdot h} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}}} \]
4. Add Preprocessing

5. Taylor expanded in g around inf 27.3%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(\color{blue}{g} - g\right)} + \sqrt[3]{\left(g + \sqrt{g \cdot g - h \cdot h}\right) \cdot \frac{-0.5}{a}} \]

6. Taylor expanded in g around inf 71.8%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \sqrt[3]{\left(g + \color{blue}{g}\right) \cdot \frac{-0.5}{a}} \]
7. Step-by-step derivation

   1. cbrt-prod 96.8%

      \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\sqrt[3]{g + g} \cdot \sqrt[3]{\frac{-0.5}{a}}} \]

8. Applied egg-rr 0.0%

   \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{\frac{0}{0} \cdot \sqrt[3]{\frac{-0.5}{a}}} \]

10. Simplified 4.6%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + \color{blue}{-1} \]

11. Final simplification 4.6%

    \[\leadsto \sqrt[3]{\frac{0.5}{a} \cdot \left(g - g\right)} + -1 \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2024053 
(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))))))))