Cubic critical

Percentage Accurate: 51.3% → 84.6%

Time: 10.2s

Alternatives: 7

Speedup: 11.6×

Specification

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: 51.3% 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: 84.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.2 \cdot 10^{+123}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 9 \cdot 10^{-104}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 3 \cdot \left(a \cdot c\right)} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.2e+123)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 9e-104)
     (/ (- (sqrt (- (* b b) (* 3.0 (* a c)))) b) (* 3.0 a))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.2e+123) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 9e-104) {
		tmp = (sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a);
	} 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) :: tmp
    if (b <= (-3.2d+123)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 9d-104) then
        tmp = (sqrt(((b * b) - (3.0d0 * (a * c)))) - b) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.2e+123) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 9e-104) {
		tmp = (Math.sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.2e+123:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 9e-104:
		tmp = (math.sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.2e+123)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 9e-104)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(3.0 * Float64(a * c)))) - b) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3.2e+123)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 9e-104)
		tmp = (sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.2e+123], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9e-104], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(3.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.20000000000000005e123

   1. Initial program 54.2%

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

   3. Simplified 54.2%

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

   5. Taylor expanded in b around -inf 96.2%

      \[\leadsto \frac{\color{blue}{-2 \cdot b}}{3 \cdot a} \]
   6. Step-by-step derivation

      1. *-commutative 96.2%

         \[\leadsto \frac{\color{blue}{b \cdot -2}}{3 \cdot a} \]

   7. Simplified 96.2%

      \[\leadsto \frac{\color{blue}{b \cdot -2}}{3 \cdot a} \]

   if -3.20000000000000005e123 < b < 8.9999999999999995e-104

   1. Initial program 79.1%

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

      1. sqr-neg 79.1%

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

      2. sqr-neg 79.1%

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

      3. associate-*l* 79.1%

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

   3. Simplified 79.1%

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

   if 8.9999999999999995e-104 < b

   1. Initial program 16.5%

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

   3. Simplified 16.5%

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

   5. Taylor expanded in b around inf 91.1%

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

4. Final simplification 87.1%

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

Alternative 2: 79.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{-77}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 6.8 \cdot 10^{-105}:\\ \;\;\;\;\frac{\sqrt{\left(a \cdot c\right) \cdot -3} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-77)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 6.8e-105)
     (/ (- (sqrt (* (* a c) -3.0)) b) (* 3.0 a))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-77) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 6.8e-105) {
		tmp = (sqrt(((a * c) * -3.0)) - b) / (3.0 * a);
	} 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) :: tmp
    if (b <= (-1d-77)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 6.8d-105) then
        tmp = (sqrt(((a * c) * (-3.0d0))) - b) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-77) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 6.8e-105) {
		tmp = (Math.sqrt(((a * c) * -3.0)) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1e-77:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 6.8e-105:
		tmp = (math.sqrt(((a * c) * -3.0)) - b) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-77)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 6.8e-105)
		tmp = Float64(Float64(sqrt(Float64(Float64(a * c) * -3.0)) - b) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e-77)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 6.8e-105)
		tmp = (sqrt(((a * c) * -3.0)) - b) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e-77], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6.8e-105], N[(N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -3.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -9.9999999999999993e-78

   1. Initial program 69.7%

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

   3. Simplified 69.6%

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

   5. Taylor expanded in b around -inf 85.1%

      \[\leadsto \frac{\color{blue}{-2 \cdot b}}{3 \cdot a} \]
   6. Step-by-step derivation

      1. *-commutative 85.1%

         \[\leadsto \frac{\color{blue}{b \cdot -2}}{3 \cdot a} \]

   7. Simplified 85.1%

      \[\leadsto \frac{\color{blue}{b \cdot -2}}{3 \cdot a} \]

   if -9.9999999999999993e-78 < b < 6.79999999999999984e-105

   1. Initial program 72.8%

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

   3. Simplified 72.8%

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

   5. Taylor expanded in b around 0 63.2%

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

   if 6.79999999999999984e-105 < b

   1. Initial program 16.5%

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

   3. Simplified 16.5%

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

   5. Taylor expanded in b around inf 91.1%

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

4. Final simplification 81.9%

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

Alternative 3: 67.5% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2e-310) (/ (* b -2.0) (* 3.0 a)) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-310) {
		tmp = (b * -2.0) / (3.0 * a);
	} 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) :: tmp
    if (b <= (-2d-310)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-310) {
		tmp = (b * -2.0) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2e-310:
		tmp = (b * -2.0) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e-310)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2e-310)
		tmp = (b * -2.0) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2e-310], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.999999999999994e-310

   1. Initial program 71.1%

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

   3. Simplified 71.1%

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

   5. Taylor expanded in b around -inf 69.7%

      \[\leadsto \frac{\color{blue}{-2 \cdot b}}{3 \cdot a} \]
   6. Step-by-step derivation

      1. *-commutative 69.7%

         \[\leadsto \frac{\color{blue}{b \cdot -2}}{3 \cdot a} \]

   7. Simplified 69.7%

      \[\leadsto \frac{\color{blue}{b \cdot -2}}{3 \cdot a} \]

   if -1.999999999999994e-310 < b

   1. Initial program 29.1%

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

   3. Simplified 29.1%

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

   5. Taylor expanded in b around inf 73.3%

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

Alternative 4: 67.5% accurate, 11.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\frac{b}{a} \cdot -0.6666666666666666\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2e-310) (* (/ b a) -0.6666666666666666) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-310) {
		tmp = (b / a) * -0.6666666666666666;
	} 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) :: tmp
    if (b <= (-2d-310)) then
        tmp = (b / a) * (-0.6666666666666666d0)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-310) {
		tmp = (b / a) * -0.6666666666666666;
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2e-310:
		tmp = (b / a) * -0.6666666666666666
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e-310)
		tmp = Float64(Float64(b / a) * -0.6666666666666666);
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2e-310)
		tmp = (b / a) * -0.6666666666666666;
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2e-310], N[(N[(b / a), $MachinePrecision] * -0.6666666666666666), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.999999999999994e-310

   1. Initial program 71.1%

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

   3. Simplified 71.1%

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

   5. Taylor expanded in b around -inf 69.6%

      \[\leadsto \color{blue}{-0.6666666666666666 \cdot \frac{b}{a}} \]
   6. Step-by-step derivation

      1. *-commutative 69.6%

         \[\leadsto \color{blue}{\frac{b}{a} \cdot -0.6666666666666666} \]

   7. Simplified 69.6%

      \[\leadsto \color{blue}{\frac{b}{a} \cdot -0.6666666666666666} \]

   if -1.999999999999994e-310 < b

   1. Initial program 29.1%

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

   3. Simplified 29.1%

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

   5. Taylor expanded in b around inf 73.3%

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

Alternative 5: 67.5% accurate, 11.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2 \cdot 10^{-310}:\\ \;\;\;\;b \cdot \frac{-0.6666666666666666}{a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2e-310) (* b (/ -0.6666666666666666 a)) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-310) {
		tmp = b * (-0.6666666666666666 / a);
	} 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) :: tmp
    if (b <= (-2d-310)) then
        tmp = b * ((-0.6666666666666666d0) / a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-310) {
		tmp = b * (-0.6666666666666666 / a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2e-310:
		tmp = b * (-0.6666666666666666 / a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e-310)
		tmp = Float64(b * Float64(-0.6666666666666666 / a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2e-310)
		tmp = b * (-0.6666666666666666 / a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2e-310], N[(b * N[(-0.6666666666666666 / a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.999999999999994e-310

   1. Initial program 71.1%

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

   3. Simplified 71.1%

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

   5. Taylor expanded in b around -inf 69.6%

      \[\leadsto \color{blue}{-0.6666666666666666 \cdot \frac{b}{a}} \]
   6. Step-by-step derivation

      1. *-commutative 69.6%

         \[\leadsto \color{blue}{\frac{b}{a} \cdot -0.6666666666666666} \]

   7. Simplified 69.6%

      \[\leadsto \color{blue}{\frac{b}{a} \cdot -0.6666666666666666} \]

   8. Taylor expanded in b around 0 69.6%

      \[\leadsto \color{blue}{-0.6666666666666666 \cdot \frac{b}{a}} \]
   9. Step-by-step derivation

      1. *-commutative 69.6%

         \[\leadsto \color{blue}{\frac{b}{a} \cdot -0.6666666666666666} \]

      2. associate-*l/ 69.6%

         \[\leadsto \color{blue}{\frac{b \cdot -0.6666666666666666}{a}} \]

      3. associate-/l* 69.6%

         \[\leadsto \color{blue}{b \cdot \frac{-0.6666666666666666}{a}} \]

   10. Simplified 69.6%

       \[\leadsto \color{blue}{b \cdot \frac{-0.6666666666666666}{a}} \]

   if -1.999999999999994e-310 < b

   1. Initial program 29.1%

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

   3. Simplified 29.1%

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

   5. Taylor expanded in b around inf 73.3%

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

Alternative 6: 35.7% 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 50.3%

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

3. Simplified 50.3%

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

5. Taylor expanded in b around inf 37.5%

   \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b}} \]
6. Add Preprocessing

Alternative 7: 11.3% accurate, 38.7× speedup

Math

\[\begin{array}{l} \\ \frac{0}{a} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ 0.0 a))

C

double code(double a, double b, double c) {
	return 0.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 = 0.0d0 / a
end function

Java

public static double code(double a, double b, double c) {
	return 0.0 / a;
}

Python

def code(a, b, c):
	return 0.0 / a

Julia

function code(a, b, c)
	return Float64(0.0 / a)
end

MATLAB

function tmp = code(a, b, c)
	tmp = 0.0 / a;
end

Wolfram

code[a_, b_, c_] := N[(0.0 / a), $MachinePrecision]

Derivation

1. Initial program 50.3%

   \[\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. add-cbrt-cube 42.8%

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

   2. cbrt-prod 47.9%

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

   3. distribute-rgt-neg-in 47.9%

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

   4. cbrt-prod 47.6%

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

   5. pow2 47.6%

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

4. Applied egg-rr 47.6%

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

5. Taylor expanded in a around 0 10.2%

   \[\leadsto \color{blue}{0.3333333333333333 \cdot \frac{b + -1 \cdot b}{a}} \]
6. Step-by-step derivation

   1. associate-*r/ 10.2%

      \[\leadsto \color{blue}{\frac{0.3333333333333333 \cdot \left(b + -1 \cdot b\right)}{a}} \]

   2. distribute-rgt1-in 10.2%

      \[\leadsto \frac{0.3333333333333333 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot b\right)}}{a} \]

   3. metadata-eval 10.2%

      \[\leadsto \frac{0.3333333333333333 \cdot \left(\color{blue}{0} \cdot b\right)}{a} \]

   4. mul0-lft 10.2%

      \[\leadsto \frac{0.3333333333333333 \cdot \color{blue}{0}}{a} \]

   5. metadata-eval 10.2%

      \[\leadsto \frac{\color{blue}{0}}{a} \]

7. Simplified 10.2%

   \[\leadsto \color{blue}{\frac{0}{a}} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024185 
(FPCore (a b c)
  :name "Cubic critical"
  :precision binary64
  (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))