Cubic critical, wide range

Percentage Accurate: 18.2% → 99.4%

Time: 12.5s

Alternatives: 5

Speedup: 23.2×

Specification

\[\left(\left(4.930380657631324 \cdot 10^{-32} < a \land a < 2.028240960365167 \cdot 10^{+31}\right) \land \left(4.930380657631324 \cdot 10^{-32} < b \land b < 2.028240960365167 \cdot 10^{+31}\right)\right) \land \left(4.930380657631324 \cdot 10^{-32} < c \land c < 2.028240960365167 \cdot 10^{+31}\right)\]

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - ((3.0d0 * a) * c)))) / (3.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(3.0 * a) * c)))) / Float64(3.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(3.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 18.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - ((3.0d0 * a) * c)))) / (3.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(3.0 * a) * c)))) / Float64(3.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - ((3.0 * a) * c)))) / (3.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(3.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{\left({\left(-b\right)}^{2} - {b}^{2}\right) + c \cdot \left(a \cdot 3\right)}{\left(-b\right) - \sqrt{{b}^{2} + -3 \cdot \left(c \cdot a\right)}}}{a \cdot 3} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (/
  (/
   (+ (- (pow (- b) 2.0) (pow b 2.0)) (* c (* a 3.0)))
   (- (- b) (sqrt (+ (pow b 2.0) (* -3.0 (* c a))))))
  (* a 3.0)))

C

double code(double a, double b, double c) {
	return (((pow(-b, 2.0) - pow(b, 2.0)) + (c * (a * 3.0))) / (-b - sqrt((pow(b, 2.0) + (-3.0 * (c * a)))))) / (a * 3.0);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = ((((-b ** 2.0d0) - (b ** 2.0d0)) + (c * (a * 3.0d0))) / (-b - sqrt(((b ** 2.0d0) + ((-3.0d0) * (c * a)))))) / (a * 3.0d0)
end function

Java

public static double code(double a, double b, double c) {
	return (((Math.pow(-b, 2.0) - Math.pow(b, 2.0)) + (c * (a * 3.0))) / (-b - Math.sqrt((Math.pow(b, 2.0) + (-3.0 * (c * a)))))) / (a * 3.0);
}

Python

def code(a, b, c):
	return (((math.pow(-b, 2.0) - math.pow(b, 2.0)) + (c * (a * 3.0))) / (-b - math.sqrt((math.pow(b, 2.0) + (-3.0 * (c * a)))))) / (a * 3.0)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(Float64((Float64(-b) ^ 2.0) - (b ^ 2.0)) + Float64(c * Float64(a * 3.0))) / Float64(Float64(-b) - sqrt(Float64((b ^ 2.0) + Float64(-3.0 * Float64(c * a)))))) / Float64(a * 3.0))
end

MATLAB

function tmp = code(a, b, c)
	tmp = ((((-b ^ 2.0) - (b ^ 2.0)) + (c * (a * 3.0))) / (-b - sqrt(((b ^ 2.0) + (-3.0 * (c * a)))))) / (a * 3.0);
end

Wolfram

code[a_, b_, c_] := N[(N[(N[(N[(N[Power[(-b), 2.0], $MachinePrecision] - N[Power[b, 2.0], $MachinePrecision]), $MachinePrecision] + N[(c * N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[((-b) - N[Sqrt[N[(N[Power[b, 2.0], $MachinePrecision] + N[(-3.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.2%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. expm1-log1p-u 18.2%

      \[\leadsto \frac{\left(-b\right) + \sqrt{b \cdot b - \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\left(3 \cdot a\right) \cdot c\right)\right)}}}{3 \cdot a} \]

   2. expm1-udef 12.8%

      \[\leadsto \frac{\left(-b\right) + \sqrt{b \cdot b - \color{blue}{\left(e^{\mathsf{log1p}\left(\left(3 \cdot a\right) \cdot c\right)} - 1\right)}}}{3 \cdot a} \]

   3. associate-*l* 12.8%

      \[\leadsto \frac{\left(-b\right) + \sqrt{b \cdot b - \left(e^{\mathsf{log1p}\left(\color{blue}{3 \cdot \left(a \cdot c\right)}\right)} - 1\right)}}{3 \cdot a} \]

4. Applied egg-rr 12.8%

   \[\leadsto \frac{\left(-b\right) + \sqrt{b \cdot b - \color{blue}{\left(e^{\mathsf{log1p}\left(3 \cdot \left(a \cdot c\right)\right)} - 1\right)}}}{3 \cdot a} \]
5. Step-by-step derivation

   1. flip-+ 12.7%

      \[\leadsto \frac{\color{blue}{\frac{\left(-b\right) \cdot \left(-b\right) - \sqrt{b \cdot b - \left(e^{\mathsf{log1p}\left(3 \cdot \left(a \cdot c\right)\right)} - 1\right)} \cdot \sqrt{b \cdot b - \left(e^{\mathsf{log1p}\left(3 \cdot \left(a \cdot c\right)\right)} - 1\right)}}{\left(-b\right) - \sqrt{b \cdot b - \left(e^{\mathsf{log1p}\left(3 \cdot \left(a \cdot c\right)\right)} - 1\right)}}}}{3 \cdot a} \]

6. Applied egg-rr 18.6%

   \[\leadsto \frac{\color{blue}{\frac{{\left(-b\right)}^{2} - \left({b}^{2} - 3 \cdot \left(a \cdot c\right)\right)}{\left(-b\right) - \sqrt{{b}^{2} - 3 \cdot \left(a \cdot c\right)}}}}{3 \cdot a} \]
7. Step-by-step derivation

   1. associate--r- 99.2%

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

   2. associate-*r* 99.4%

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

   3. *-commutative 99.4%

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

   4. *-commutative 99.4%

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

   5. cancel-sign-sub-inv 99.4%

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

   6. metadata-eval 99.4%

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

   7. *-commutative 99.4%

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

8. Simplified 99.4%

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

9. Final simplification 99.4%

   \[\leadsto \frac{\frac{\left({\left(-b\right)}^{2} - {b}^{2}\right) + c \cdot \left(a \cdot 3\right)}{\left(-b\right) - \sqrt{{b}^{2} + -3 \cdot \left(c \cdot a\right)}}}{a \cdot 3} \]
10. Add Preprocessing

Alternative 2: 90.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 3\right)} - b}{a \cdot 3} \leq -5 \cdot 10^{-12}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, a \cdot \left(c \cdot -3\right)\right)} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= (/ (- (sqrt (- (* b b) (* c (* a 3.0)))) b) (* a 3.0)) -5e-12)
   (/ (- (sqrt (fma b b (* a (* c -3.0)))) b) (* a 3.0))
   (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (((sqrt(((b * b) - (c * (a * 3.0)))) - b) / (a * 3.0)) <= -5e-12) {
		tmp = (sqrt(fma(b, b, (a * (c * -3.0)))) - b) / (a * 3.0);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 3.0)))) - b) / Float64(a * 3.0)) <= -5e-12)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(a * Float64(c * -3.0)))) - b) / Float64(a * 3.0));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision], -5e-12], N[(N[(N[Sqrt[N[(b * b + N[(a * N[(c * -3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 3 a) c)))) (*.f64 3 a)) < -4.9999999999999997e-12

   1. Initial program 66.6%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
   2. Step-by-step derivation

      1. +-commutative 66.6%

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

      2. sqr-neg 66.6%

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

      3. unsub-neg 66.6%

         \[\leadsto \frac{\color{blue}{\sqrt{\left(-b\right) \cdot \left(-b\right) - \left(3 \cdot a\right) \cdot c} - b}}{3 \cdot a} \]

      4. div-sub 65.7%

         \[\leadsto \color{blue}{\frac{\sqrt{\left(-b\right) \cdot \left(-b\right) - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} - \frac{b}{3 \cdot a}} \]

      5. --rgt-identity 65.7%

         \[\leadsto \frac{\color{blue}{\sqrt{\left(-b\right) \cdot \left(-b\right) - \left(3 \cdot a\right) \cdot c} - 0}}{3 \cdot a} - \frac{b}{3 \cdot a} \]

      6. div-sub 66.6%

         \[\leadsto \color{blue}{\frac{\left(\sqrt{\left(-b\right) \cdot \left(-b\right) - \left(3 \cdot a\right) \cdot c} - 0\right) - b}{3 \cdot a}} \]

   3. Simplified 66.7%

      \[\leadsto \color{blue}{\frac{\sqrt{\mathsf{fma}\left(b, b, a \cdot \left(c \cdot -3\right)\right)} - b}{3 \cdot a}} \]
   4. Add Preprocessing

   if -4.9999999999999997e-12 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 3 a) c)))) (*.f64 3 a))

   1. Initial program 5.2%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf 99.2%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 3\right)} - b}{a \cdot 3} \leq -5 \cdot 10^{-12}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, a \cdot \left(c \cdot -3\right)\right)} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 90.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 3\right)} - b}{a \cdot 3}\\ \mathbf{if}\;t_0 \leq -5 \cdot 10^{-12}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (- (sqrt (- (* b b) (* c (* a 3.0)))) b) (* a 3.0))))
   (if (<= t_0 -5e-12) t_0 (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double t_0 = (sqrt(((b * b) - (c * (a * 3.0)))) - b) / (a * 3.0);
	double tmp;
	if (t_0 <= -5e-12) {
		tmp = t_0;
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (sqrt(((b * b) - (c * (a * 3.0d0)))) - b) / (a * 3.0d0)
    if (t_0 <= (-5d-12)) then
        tmp = t_0
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (Math.sqrt(((b * b) - (c * (a * 3.0)))) - b) / (a * 3.0);
	double tmp;
	if (t_0 <= -5e-12) {
		tmp = t_0;
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = (math.sqrt(((b * b) - (c * (a * 3.0)))) - b) / (a * 3.0)
	tmp = 0
	if t_0 <= -5e-12:
		tmp = t_0
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	t_0 = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 3.0)))) - b) / Float64(a * 3.0))
	tmp = 0.0
	if (t_0 <= -5e-12)
		tmp = t_0;
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = (sqrt(((b * b) - (c * (a * 3.0)))) - b) / (a * 3.0);
	tmp = 0.0;
	if (t_0 <= -5e-12)
		tmp = t_0;
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-12], t$95$0, N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 3 a) c)))) (*.f64 3 a)) < -4.9999999999999997e-12

   1. Initial program 66.6%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
   2. Add Preprocessing

   if -4.9999999999999997e-12 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 3 a) c)))) (*.f64 3 a))

   1. Initial program 5.2%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf 99.2%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.3%

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

Alternative 4: 95.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ -0.5 \cdot \frac{c}{b} + -0.375 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (+ (* -0.5 (/ c b)) (* -0.375 (/ (* a (pow c 2.0)) (pow b 3.0)))))

C

double code(double a, double b, double c) {
	return (-0.5 * (c / b)) + (-0.375 * ((a * pow(c, 2.0)) / pow(b, 3.0)));
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = ((-0.5d0) * (c / b)) + ((-0.375d0) * ((a * (c ** 2.0d0)) / (b ** 3.0d0)))
end function

Java

public static double code(double a, double b, double c) {
	return (-0.5 * (c / b)) + (-0.375 * ((a * Math.pow(c, 2.0)) / Math.pow(b, 3.0)));
}

Python

def code(a, b, c):
	return (-0.5 * (c / b)) + (-0.375 * ((a * math.pow(c, 2.0)) / math.pow(b, 3.0)))

Julia

function code(a, b, c)
	return Float64(Float64(-0.5 * Float64(c / b)) + Float64(-0.375 * Float64(Float64(a * (c ^ 2.0)) / (b ^ 3.0))))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-0.5 * (c / b)) + (-0.375 * ((a * (c ^ 2.0)) / (b ^ 3.0)));
end

Wolfram

code[a_, b_, c_] := N[(N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision] + N[(-0.375 * N[(N[(a * N[Power[c, 2.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.2%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
2. Add Preprocessing

3. Taylor expanded in b around inf 95.1%

   \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b} + -0.375 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}}} \]

4. Final simplification 95.1%

   \[\leadsto -0.5 \cdot \frac{c}{b} + -0.375 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} \]
5. Add Preprocessing

Alternative 5: 90.1% accurate, 23.2× speedup

Math

\[\begin{array}{l} \\ -0.5 \cdot \frac{c}{b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (* -0.5 (/ c b)))

C

double code(double a, double b, double c) {
	return -0.5 * (c / b);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-0.5d0) * (c / b)
end function

Java

public static double code(double a, double b, double c) {
	return -0.5 * (c / b);
}

Python

def code(a, b, c):
	return -0.5 * (c / b)

Julia

function code(a, b, c)
	return Float64(-0.5 * Float64(c / b))
end

MATLAB

function tmp = code(a, b, c)
	tmp = -0.5 * (c / b);
end

Wolfram

code[a_, b_, c_] := N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.2%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c}}{3 \cdot a} \]
2. Add Preprocessing

3. Taylor expanded in b around inf 90.1%

   \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b}} \]

4. Final simplification 90.1%

   \[\leadsto -0.5 \cdot \frac{c}{b} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024010 
(FPCore (a b c)
  :name "Cubic critical, wide range"
  :precision binary64
  :pre (and (and (and (< 4.930380657631324e-32 a) (< a 2.028240960365167e+31)) (and (< 4.930380657631324e-32 b) (< b 2.028240960365167e+31))) (and (< 4.930380657631324e-32 c) (< c 2.028240960365167e+31)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))