Quadratic roots, full range

Average Error: 53.25% → 16.03%

Time: 17.7s

Precision: binary64

Cost: 7624

Math

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

↓

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

FPCore

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

↓

(FPCore (a b c)
 :precision binary64
 (if (<= b -9.5e+60)
   (- (/ c b) (/ b a))
   (if (<= b 2.5e-50)
     (/ (- (sqrt (+ (* b b) (* c (* a -4.0)))) b) (* a 2.0))
     (/ (- c) b))))

C

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

↓

double code(double a, double b, double c) {
	double tmp;
	if (b <= -9.5e+60) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.5e-50) {
		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
    code = (-b + sqrt(((b * b) - ((4.0d0 * a) * c)))) / (2.0d0 * a)
end function

↓

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+60)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.5d-50) 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) {
	return (-b + Math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
}

↓

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -9.5e+60) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.5e-50) {
		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):
	return (-b + math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a)

↓

def code(a, b, c):
	tmp = 0
	if b <= -9.5e+60:
		tmp = (c / b) - (b / a)
	elif b <= 2.5e-50:
		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)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))) / Float64(2.0 * a))
end

↓

function code(a, b, c)
	tmp = 0.0
	if (b <= -9.5e+60)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.5e-50)
		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 = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
end

↓

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -9.5e+60)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.5e-50)
		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_] := 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]

↓

code[a_, b_, c_] := If[LessEqual[b, -9.5e+60], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.5e-50], 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 < -9.49999999999999988e60

   1. Initial program 63.51

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

   2. Simplified 63.51

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

      [Start] 63.51	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
      *-commutative [=>] 63.51	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{a \cdot 2}} \]

   3. Taylor expanded in b around -inf 8.68

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

   4. Simplified 8.68

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

      [Start] 8.68	\[ \frac{c}{b} + -1 \cdot \frac{b}{a} \]
      mul-1-neg [=>] 8.68	\[ \frac{c}{b} + \color{blue}{\left(-\frac{b}{a}\right)} \]
      unsub-neg [=>] 8.68	\[ \color{blue}{\frac{c}{b} - \frac{b}{a}} \]

   if -9.49999999999999988e60 < b < 2.49999999999999984e-50

   1. Initial program 22.11

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

   if 2.49999999999999984e-50 < b

   1. Initial program 85.08

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

   2. Simplified 85.08

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

      [Start] 85.08	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
      *-commutative [=>] 85.08	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{a \cdot 2}} \]

   3. Taylor expanded in b around inf 12.55

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

   4. Simplified 12.55

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

      [Start] 12.55	\[ -1 \cdot \frac{c}{b} \]
      mul-1-neg [=>] 12.55	\[ \color{blue}{-\frac{c}{b}} \]
      distribute-neg-frac [=>] 12.55	\[ \color{blue}{\frac{-c}{b}} \]

3. Recombined 3 regimes into one program.

4. Final simplification 16.03

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -9.5 \cdot 10^{+60}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.5 \cdot 10^{-50}:\\ \;\;\;\;\frac{\sqrt{b \cdot b + c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternatives

Alternative 1
Error	16.16%
Cost	7624

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

Alternative 2
Error	21.3%
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -3.6 \cdot 10^{-116}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.92 \cdot 10^{-50}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{c \cdot \left(a \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 3
Error	21.25%
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -3.6 \cdot 10^{-116}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-50}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4
Error	61.78%
Cost	388

\[\begin{array}{l} \mathbf{if}\;b \leq -2.1 \cdot 10^{-302}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 5
Error	35.8%
Cost	388

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

Alternative 6
Error	88.36%
Cost	64

\[0 \]

Reproduce

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