Quadratic roots, full range

Percentage Accurate: 52.5% → 84.5%

Time: 12.2s

Alternatives: 7

Speedup: 19.1×

Specification

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.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) - ((4.0d0 * a) * c)))) / (2.0d0 * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 52.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.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) - ((4.0d0 * a) * c)))) / (2.0d0 * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.7 \cdot 10^{-7}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.26 \cdot 10^{-88}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.7e-7)
   (/ (- b) a)
   (if (<= b 1.26e-88)
     (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.7e-7) {
		tmp = -b / a;
	} else if (b <= 1.26e-88) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.7e-7)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.26e-88)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.7e-7], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.26e-88], N[(N[(N[Sqrt[N[(b * b + N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.7e-7

   1. Initial program 61.8%

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

      1. *-commutative 61.8%

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

   3. Simplified 61.8%

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

   4. Taylor expanded in b around -inf 93.0%

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

      1. associate-*r/ 93.0%

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

      2. mul-1-neg 93.0%

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

   6. Simplified 93.0%

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

   if -4.7e-7 < b < 1.25999999999999992e-88

   1. Initial program 75.5%

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

      1. sqr-neg 75.5%

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

      2. +-commutative 75.5%

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

      3. unsub-neg 75.5%

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

      4. sqr-neg 75.5%

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

      5. fma-neg 75.6%

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

      6. distribute-lft-neg-in 75.6%

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

      7. *-commutative 75.6%

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

      8. *-commutative 75.6%

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

      9. distribute-rgt-neg-in 75.6%

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

      10. metadata-eval 75.6%

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

      11. *-commutative 75.6%

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

   3. Simplified 75.6%

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

   if 1.25999999999999992e-88 < b

   1. Initial program 10.7%

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

      1. *-commutative 10.7%

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

   3. Simplified 10.7%

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

   4. Taylor expanded in b around inf 86.9%

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]
   5. Step-by-step derivation

      1. mul-1-neg 86.9%

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

      2. distribute-neg-frac 86.9%

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

   6. Simplified 86.9%

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

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.7 \cdot 10^{-7}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.26 \cdot 10^{-88}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 2: 84.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -6 \cdot 10^{-7}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 7.6 \cdot 10^{-91}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -6e-7)
   (/ (- b) a)
   (if (<= b 7.6e-91)
     (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -6e-7) {
		tmp = -b / a;
	} else if (b <= 7.6e-91) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = -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 <= (-6d-7)) then
        tmp = -b / a
    else if (b <= 7.6d-91) then
        tmp = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -6e-7) {
		tmp = -b / a;
	} else if (b <= 7.6e-91) {
		tmp = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -6e-7:
		tmp = -b / a
	elif b <= 7.6e-91:
		tmp = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -6e-7)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 7.6e-91)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -6e-7)
		tmp = -b / a;
	elseif (b <= 7.6e-91)
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -6e-7], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 7.6e-91], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.9999999999999997e-7

   1. Initial program 61.8%

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

      1. *-commutative 61.8%

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

   3. Simplified 61.8%

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

   4. Taylor expanded in b around -inf 93.0%

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

      1. associate-*r/ 93.0%

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

      2. mul-1-neg 93.0%

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

   6. Simplified 93.0%

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

   if -5.9999999999999997e-7 < b < 7.59999999999999957e-91

   1. Initial program 75.5%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]

   if 7.59999999999999957e-91 < b

   1. Initial program 10.7%

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

      1. *-commutative 10.7%

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

   3. Simplified 10.7%

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

   4. Taylor expanded in b around inf 86.9%

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]
   5. Step-by-step derivation

      1. mul-1-neg 86.9%

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

      2. distribute-neg-frac 86.9%

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

   6. Simplified 86.9%

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

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -6 \cdot 10^{-7}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 7.6 \cdot 10^{-91}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 3: 81.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8.5 \cdot 10^{-91}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.85 \cdot 10^{-95}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8.5e-91)
   (- (/ c b) (/ b a))
   (if (<= b 1.85e-95)
     (/ (- (sqrt (* a (* c -4.0))) b) (* a 2.0))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -8.5e-91) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.85e-95) {
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = -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 <= (-8.5d-91)) then
        tmp = (c / b) - (b / a)
    else if (b <= 1.85d-95) then
        tmp = (sqrt((a * (c * (-4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -8.5e-91) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.85e-95) {
		tmp = (Math.sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -8.5e-91:
		tmp = (c / b) - (b / a)
	elif b <= 1.85e-95:
		tmp = (math.sqrt((a * (c * -4.0))) - b) / (a * 2.0)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -8.5e-91)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 1.85e-95)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -8.5e-91)
		tmp = (c / b) - (b / a);
	elseif (b <= 1.85e-95)
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -8.5e-91], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.85e-95], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -8.49999999999999985e-91

   1. Initial program 66.4%

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

      1. *-commutative 66.4%

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

   3. Simplified 66.4%

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

   4. Taylor expanded in b around -inf 88.8%

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

      1. +-commutative 88.8%

         \[\leadsto \color{blue}{\frac{c}{b} + -1 \cdot \frac{b}{a}} \]

      2. mul-1-neg 88.8%

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

      3. unsub-neg 88.8%

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

   6. Simplified 88.8%

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

   if -8.49999999999999985e-91 < b < 1.84999999999999997e-95

   1. Initial program 72.9%

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

      1. *-commutative 72.9%

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

   3. Simplified 72.9%

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

   4. Taylor expanded in b around 0 68.8%

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

      1. *-commutative 68.8%

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

      2. associate-*r* 68.8%

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

   6. Simplified 68.8%

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

      1. +-commutative 68.8%

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

      2. unsub-neg 68.8%

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

   8. Applied egg-rr 68.8%

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

   if 1.84999999999999997e-95 < b

   1. Initial program 11.7%

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

      1. *-commutative 11.7%

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

   3. Simplified 11.7%

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

   4. Taylor expanded in b around inf 86.2%

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]
   5. Step-by-step derivation

      1. mul-1-neg 86.2%

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

      2. distribute-neg-frac 86.2%

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

   6. Simplified 86.2%

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

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8.5 \cdot 10^{-91}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.85 \cdot 10^{-95}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4: 68.4% accurate, 12.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e-310) (- (/ c b) (/ b a)) (/ (- c) b)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -3.999999999999988e-310

   1. Initial program 69.6%

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

      1. *-commutative 69.6%

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

   3. Simplified 69.6%

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

   4. Taylor expanded in b around -inf 67.3%

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

      1. +-commutative 67.3%

         \[\leadsto \color{blue}{\frac{c}{b} + -1 \cdot \frac{b}{a}} \]

      2. mul-1-neg 67.3%

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

      3. unsub-neg 67.3%

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

   6. Simplified 67.3%

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

   if -3.999999999999988e-310 < b

   1. Initial program 27.4%

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

      1. *-commutative 27.4%

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

   3. Simplified 27.4%

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

   4. Taylor expanded in b around inf 69.2%

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]
   5. Step-by-step derivation

      1. mul-1-neg 69.2%

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

      2. distribute-neg-frac 69.2%

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

   6. Simplified 69.2%

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

4. Final simplification 68.2%

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

Alternative 5: 68.2% accurate, 19.1× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e-310) (/ (- b) a) (/ (- c) b)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -3.999999999999988e-310

   1. Initial program 69.6%

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

      1. *-commutative 69.6%

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

   3. Simplified 69.6%

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

   4. Taylor expanded in b around -inf 67.0%

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

      1. associate-*r/ 67.0%

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

      2. mul-1-neg 67.0%

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

   6. Simplified 67.0%

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

   if -3.999999999999988e-310 < b

   1. Initial program 27.4%

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

      1. *-commutative 27.4%

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

   3. Simplified 27.4%

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

   4. Taylor expanded in b around inf 69.2%

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]
   5. Step-by-step derivation

      1. mul-1-neg 69.2%

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

      2. distribute-neg-frac 69.2%

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

   6. Simplified 69.2%

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

4. Final simplification 68.0%

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

Alternative 6: 35.9% accurate, 29.0× speedup

Math

\[\begin{array}{l} \\ \frac{-b}{a} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.5%

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

   1. *-commutative 49.5%

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

3. Simplified 49.5%

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

4. Taylor expanded in b around -inf 36.3%

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

   1. associate-*r/ 36.3%

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

   2. mul-1-neg 36.3%

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

6. Simplified 36.3%

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

7. Final simplification 36.3%

   \[\leadsto \frac{-b}{a} \]

Alternative 7: 2.6% accurate, 38.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.5%

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

   1. *-commutative 49.5%

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

3. Simplified 49.5%

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

5. Applied egg-rr 47.3%

   \[\leadsto \color{blue}{{\left(\frac{a \cdot -2}{b - \mathsf{hypot}\left(b, \sqrt{a \cdot \left(c \cdot -4\right)}\right)}\right)}^{-1}} \]
6. Step-by-step derivation

   1. unpow-1 47.3%

      \[\leadsto \color{blue}{\frac{1}{\frac{a \cdot -2}{b - \mathsf{hypot}\left(b, \sqrt{a \cdot \left(c \cdot -4\right)}\right)}}} \]

7. Simplified 47.3%

   \[\leadsto \color{blue}{\frac{1}{\frac{a \cdot -2}{b - \mathsf{hypot}\left(b, \sqrt{a \cdot \left(c \cdot -4\right)}\right)}}} \]

8. Taylor expanded in b around -inf 36.2%

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

   1. associate-*r/ 36.2%

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

   2. neg-mul-1 36.2%

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

10. Simplified 36.2%

    \[\leadsto \frac{1}{\color{blue}{\frac{-a}{b}}} \]
11. Step-by-step derivation

    1. expm1-log1p-u 18.8%

       \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{1}{\frac{-a}{b}}\right)\right)} \]

    2. expm1-udef 16.7%

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

    3. associate-/r/ 16.7%

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

    4. add-sqr-sqrt 2.5%

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

    5. sqrt-unprod 5.7%

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

    6. sqr-neg 5.7%

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

    7. sqrt-unprod 1.5%

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

    8. add-sqr-sqrt 3.5%

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

12. Applied egg-rr 3.5%

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

    1. expm1-def 1.9%

       \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{1}{a} \cdot b\right)\right)} \]

    2. expm1-log1p 2.4%

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

    3. associate-*l/ 2.4%

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

    4. *-lft-identity 2.4%

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

14. Simplified 2.4%

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

15. Final simplification 2.4%

    \[\leadsto \frac{b}{a} \]

Reproduce

herbie shell --seed 2023334 
(FPCore (a b c)
  :name "Quadratic roots, full range"
  :precision binary64
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))