Quadratic roots, full range

Percentage Accurate: 52.2% → 85.3%

Time: 12.7s

Alternatives: 7

Speedup: 12.9×

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.2% 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: 85.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+150}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 3.7 \cdot 10^{-25}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(a \cdot 4\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e+150)
   (/ b (- a))
   (if (<= b 3.7e-25)
     (/ (- (sqrt (- (* b b) (* (* a 4.0) c))) b) (* a 2.0))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+150) {
		tmp = b / -a;
	} else if (b <= 3.7e-25) {
		tmp = (sqrt(((b * b) - ((a * 4.0) * c))) - 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 <= (-5d+150)) then
        tmp = b / -a
    else if (b <= 3.7d-25) then
        tmp = (sqrt(((b * b) - ((a * 4.0d0) * c))) - 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 <= -5e+150) {
		tmp = b / -a;
	} else if (b <= 3.7e-25) {
		tmp = (Math.sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5e+150:
		tmp = b / -a
	elif b <= 3.7e-25:
		tmp = (math.sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e+150)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 3.7e-25)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(Float64(a * 4.0) * c))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5e+150)
		tmp = b / -a;
	elseif (b <= 3.7e-25)
		tmp = (sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e+150], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 3.7e-25], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * c), $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.00000000000000009e150

   1. Initial program 44.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 44.5%

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

   3. Simplified 44.5%

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

   5. Taylor expanded in b around -inf 97.8%

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

      1. associate-*r/ 97.8%

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

      2. mul-1-neg 97.8%

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

   7. Simplified 97.8%

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

   if -5.00000000000000009e150 < b < 3.70000000000000009e-25

   1. Initial program 77.5%

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

   if 3.70000000000000009e-25 < b

   1. Initial program 13.1%

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

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

   3. Simplified 13.1%

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

   5. Taylor expanded in b around inf 95.0%

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

      1. associate-*r/ 95.0%

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

      2. mul-1-neg 95.0%

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

   7. Simplified 95.0%

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

4. Final simplification 86.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+150}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 3.7 \cdot 10^{-25}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(a \cdot 4\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{+148}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 4.2 \cdot 10^{-22}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{b \cdot b + a \cdot \left(c \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e+148)
   (/ b (- a))
   (if (<= b 4.2e-22)
     (* (/ 0.5 a) (- (sqrt (+ (* b b) (* a (* c -4.0)))) b))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e+148) {
		tmp = b / -a;
	} else if (b <= 4.2e-22) {
		tmp = (0.5 / a) * (sqrt(((b * b) + (a * (c * -4.0)))) - b);
	} 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 <= (-1.25d+148)) then
        tmp = b / -a
    else if (b <= 4.2d-22) then
        tmp = (0.5d0 / a) * (sqrt(((b * b) + (a * (c * (-4.0d0))))) - b)
    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 <= -1.25e+148) {
		tmp = b / -a;
	} else if (b <= 4.2e-22) {
		tmp = (0.5 / a) * (Math.sqrt(((b * b) + (a * (c * -4.0)))) - b);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.25e+148:
		tmp = b / -a
	elif b <= 4.2e-22:
		tmp = (0.5 / a) * (math.sqrt(((b * b) + (a * (c * -4.0)))) - b)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e+148)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 4.2e-22)
		tmp = Float64(Float64(0.5 / a) * Float64(sqrt(Float64(Float64(b * b) + Float64(a * Float64(c * -4.0)))) - b));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.25e+148)
		tmp = b / -a;
	elseif (b <= 4.2e-22)
		tmp = (0.5 / a) * (sqrt(((b * b) + (a * (c * -4.0)))) - b);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e+148], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 4.2e-22], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] + N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25000000000000006e148

   1. Initial program 44.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 44.5%

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

   3. Simplified 44.5%

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

   5. Taylor expanded in b around -inf 97.8%

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

      1. associate-*r/ 97.8%

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

      2. mul-1-neg 97.8%

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

   7. Simplified 97.8%

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

   if -1.25000000000000006e148 < b < 4.20000000000000016e-22

   1. Initial program 77.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 77.5%

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

   3. Simplified 77.5%

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

   6. Applied egg-rr 77.4%

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

      1. sub-neg 77.4%

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

      2. distribute-rgt-out-- 77.4%

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

   8. Simplified 77.4%

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

      1. fma-undefine 77.4%

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

   10. Applied egg-rr 77.4%

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

       1. unpow2 77.4%

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

   12. Applied egg-rr 77.4%

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

   if 4.20000000000000016e-22 < b

   1. Initial program 13.1%

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

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

   3. Simplified 13.1%

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

   5. Taylor expanded in b around inf 95.0%

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

      1. associate-*r/ 95.0%

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

      2. mul-1-neg 95.0%

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

   7. Simplified 95.0%

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

4. Final simplification 86.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{+148}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 4.2 \cdot 10^{-22}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{b \cdot b + a \cdot \left(c \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 80.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.35 \cdot 10^{-31}:\\ \;\;\;\;b \cdot \left(\frac{c}{{b}^{2}} + \frac{-1}{a}\right)\\ \mathbf{elif}\;b \leq 2.4 \cdot 10^{-25}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{a \cdot \left(c \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.35e-31)
   (* b (+ (/ c (pow b 2.0)) (/ -1.0 a)))
   (if (<= b 2.4e-25)
     (* (/ 0.5 a) (- (sqrt (* a (* c -4.0))) b))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.35e-31) {
		tmp = b * ((c / pow(b, 2.0)) + (-1.0 / a));
	} else if (b <= 2.4e-25) {
		tmp = (0.5 / a) * (sqrt((a * (c * -4.0))) - b);
	} 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 <= (-1.35d-31)) then
        tmp = b * ((c / (b ** 2.0d0)) + ((-1.0d0) / a))
    else if (b <= 2.4d-25) then
        tmp = (0.5d0 / a) * (sqrt((a * (c * (-4.0d0)))) - b)
    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 <= -1.35e-31) {
		tmp = b * ((c / Math.pow(b, 2.0)) + (-1.0 / a));
	} else if (b <= 2.4e-25) {
		tmp = (0.5 / a) * (Math.sqrt((a * (c * -4.0))) - b);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.35e-31:
		tmp = b * ((c / math.pow(b, 2.0)) + (-1.0 / a))
	elif b <= 2.4e-25:
		tmp = (0.5 / a) * (math.sqrt((a * (c * -4.0))) - b)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.35e-31)
		tmp = Float64(b * Float64(Float64(c / (b ^ 2.0)) + Float64(-1.0 / a)));
	elseif (b <= 2.4e-25)
		tmp = Float64(Float64(0.5 / a) * Float64(sqrt(Float64(a * Float64(c * -4.0))) - b));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.35e-31)
		tmp = b * ((c / (b ^ 2.0)) + (-1.0 / a));
	elseif (b <= 2.4e-25)
		tmp = (0.5 / a) * (sqrt((a * (c * -4.0))) - b);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.35e-31], N[(b * N[(N[(c / N[Power[b, 2.0], $MachinePrecision]), $MachinePrecision] + N[(-1.0 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.4e-25], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.35000000000000007e-31

   1. Initial program 68.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 68.9%

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

   3. Simplified 68.9%

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

   5. Taylor expanded in b around -inf 94.1%

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

      1. mul-1-neg 94.1%

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

      2. distribute-rgt-neg-in 94.1%

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

      3. +-commutative 94.1%

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

      4. mul-1-neg 94.1%

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

      5. unsub-neg 94.1%

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

   7. Simplified 94.1%

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

   if -1.35000000000000007e-31 < b < 2.40000000000000009e-25

   1. Initial program 69.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 69.5%

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

   3. Simplified 69.5%

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

   6. Applied egg-rr 69.5%

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

      1. sub-neg 69.5%

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

      2. distribute-rgt-out-- 69.5%

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

   8. Simplified 69.5%

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

   9. Taylor expanded in a around inf 61.3%

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

       1. *-commutative 61.3%

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

       2. associate-*r* 61.3%

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

   11. Simplified 61.3%

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

   if 2.40000000000000009e-25 < b

   1. Initial program 13.1%

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

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

   3. Simplified 13.1%

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

   5. Taylor expanded in b around inf 95.0%

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

      1. associate-*r/ 95.0%

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

      2. mul-1-neg 95.0%

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

   7. Simplified 95.0%

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

4. Final simplification 83.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.35 \cdot 10^{-31}:\\ \;\;\;\;b \cdot \left(\frac{c}{{b}^{2}} + \frac{-1}{a}\right)\\ \mathbf{elif}\;b \leq 2.4 \cdot 10^{-25}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{a \cdot \left(c \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.8% accurate, 12.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 73.2%

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

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

   3. Simplified 73.2%

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

   5. Taylor expanded in b around -inf 69.6%

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

      1. associate-*r/ 69.6%

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

      2. mul-1-neg 69.6%

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

   7. Simplified 69.6%

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

   if -4.999999999999985e-310 < b

   1. Initial program 28.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 28.5%

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

   3. Simplified 28.5%

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

   5. Taylor expanded in b around inf 71.4%

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

      1. associate-*r/ 71.4%

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

      2. mul-1-neg 71.4%

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

   7. Simplified 71.4%

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

4. Final simplification 70.5%

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

Alternative 5: 42.3% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 9.5e-5) (/ b (- a)) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 9.5e-5) {
		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 <= 9.5d-5) 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 <= 9.5e-5) {
		tmp = b / -a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 9.5000000000000005e-5

   1. Initial program 67.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 67.9%

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

   3. Simplified 67.9%

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

   5. Taylor expanded in b around -inf 51.2%

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

      1. associate-*r/ 51.2%

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

      2. mul-1-neg 51.2%

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

   7. Simplified 51.2%

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

   if 9.5000000000000005e-5 < b

   1. Initial program 12.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 12.5%

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

   3. Simplified 12.5%

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

   6. Applied egg-rr 2.4%

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

   7. Taylor expanded in b around -inf 34.6%

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

4. Final simplification 46.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 9.5 \cdot 10^{-5}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 10.3% accurate, 38.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 50.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 50.8%

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

3. Simplified 50.8%

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

6. Applied egg-rr 30.0%

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

7. Taylor expanded in b around -inf 12.9%

   \[\leadsto \color{blue}{\frac{c}{b}} \]
8. Add Preprocessing

Alternative 7: 2.5% 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 50.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 50.8%

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

3. Simplified 50.8%

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

6. Applied egg-rr 30.0%

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

7. Taylor expanded in a around 0 2.4%

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

Reproduce

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