Quadratic roots, medium range

Percentage Accurate: 31.3% → 95.3%

Time: 12.3s

Alternatives: 6

Speedup: 29.0×

Specification

\[\left(\left(1.1102230246251565 \cdot 10^{-16} < a \land a < 9007199254740992\right) \land \left(1.1102230246251565 \cdot 10^{-16} < b \land b < 9007199254740992\right)\right) \land \left(1.1102230246251565 \cdot 10^{-16} < c \land c < 9007199254740992\right)\]

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: 31.3% 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: 95.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(\left(-0.25 \cdot \left(\frac{{\left(a \cdot c\right)}^{4}}{a} \cdot \frac{20}{{b}^{7}}\right) - \frac{a \cdot {c}^{2}}{{b}^{3}}\right) - \frac{c}{b}\right) \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (+
  (* -2.0 (/ (* (pow a 2.0) (pow c 3.0)) (pow b 5.0)))
  (-
   (-
    (* -0.25 (* (/ (pow (* a c) 4.0) a) (/ 20.0 (pow b 7.0))))
    (/ (* a (pow c 2.0)) (pow b 3.0)))
   (/ c b))))

C

double code(double a, double b, double c) {
	return (-2.0 * ((pow(a, 2.0) * pow(c, 3.0)) / pow(b, 5.0))) + (((-0.25 * ((pow((a * c), 4.0) / a) * (20.0 / pow(b, 7.0)))) - ((a * pow(c, 2.0)) / pow(b, 3.0))) - (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 = ((-2.0d0) * (((a ** 2.0d0) * (c ** 3.0d0)) / (b ** 5.0d0))) + ((((-0.25d0) * ((((a * c) ** 4.0d0) / a) * (20.0d0 / (b ** 7.0d0)))) - ((a * (c ** 2.0d0)) / (b ** 3.0d0))) - (c / b))
end function

Java

public static double code(double a, double b, double c) {
	return (-2.0 * ((Math.pow(a, 2.0) * Math.pow(c, 3.0)) / Math.pow(b, 5.0))) + (((-0.25 * ((Math.pow((a * c), 4.0) / a) * (20.0 / Math.pow(b, 7.0)))) - ((a * Math.pow(c, 2.0)) / Math.pow(b, 3.0))) - (c / b));
}

Python

def code(a, b, c):
	return (-2.0 * ((math.pow(a, 2.0) * math.pow(c, 3.0)) / math.pow(b, 5.0))) + (((-0.25 * ((math.pow((a * c), 4.0) / a) * (20.0 / math.pow(b, 7.0)))) - ((a * math.pow(c, 2.0)) / math.pow(b, 3.0))) - (c / b))

Julia

function code(a, b, c)
	return Float64(Float64(-2.0 * Float64(Float64((a ^ 2.0) * (c ^ 3.0)) / (b ^ 5.0))) + Float64(Float64(Float64(-0.25 * Float64(Float64((Float64(a * c) ^ 4.0) / a) * Float64(20.0 / (b ^ 7.0)))) - Float64(Float64(a * (c ^ 2.0)) / (b ^ 3.0))) - Float64(c / b)))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-2.0 * (((a ^ 2.0) * (c ^ 3.0)) / (b ^ 5.0))) + (((-0.25 * ((((a * c) ^ 4.0) / a) * (20.0 / (b ^ 7.0)))) - ((a * (c ^ 2.0)) / (b ^ 3.0))) - (c / b));
end

Wolfram

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

Derivation

1. Initial program 30.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 30.4%

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

3. Simplified 30.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 96.6%

   \[\leadsto \color{blue}{-2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{16 \cdot \left({a}^{4} \cdot {c}^{4}\right) + {\left(-2 \cdot \left({a}^{2} \cdot {c}^{2}\right)\right)}^{2}}{a \cdot {b}^{7}}\right)\right)} \]

5. Taylor expanded in c around 0 96.6%

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

   1. distribute-rgt-out 96.6%

      \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{{c}^{4} \cdot \color{blue}{\left({a}^{4} \cdot \left(4 + 16\right)\right)}}{a \cdot {b}^{7}}\right)\right) \]

   2. associate-*l* 96.6%

      \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{\color{blue}{\left({c}^{4} \cdot {a}^{4}\right) \cdot \left(4 + 16\right)}}{a \cdot {b}^{7}}\right)\right) \]

   3. *-commutative 96.6%

      \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \frac{\color{blue}{\left({a}^{4} \cdot {c}^{4}\right)} \cdot \left(4 + 16\right)}{a \cdot {b}^{7}}\right)\right) \]

   4. times-frac 96.6%

      \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \color{blue}{\left(\frac{{a}^{4} \cdot {c}^{4}}{a} \cdot \frac{4 + 16}{{b}^{7}}\right)}\right)\right) \]

7. Simplified 96.6%

   \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(-1 \cdot \frac{c}{b} + \left(-1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}} + -0.25 \cdot \color{blue}{\left(\frac{{\left(a \cdot c\right)}^{4}}{a} \cdot \frac{20}{{b}^{7}}\right)}\right)\right) \]

8. Final simplification 96.6%

   \[\leadsto -2 \cdot \frac{{a}^{2} \cdot {c}^{3}}{{b}^{5}} + \left(\left(-0.25 \cdot \left(\frac{{\left(a \cdot c\right)}^{4}}{a} \cdot \frac{20}{{b}^{7}}\right) - \frac{a \cdot {c}^{2}}{{b}^{3}}\right) - \frac{c}{b}\right) \]

Alternative 2: 93.8% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 30.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 30.4%

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

3. Simplified 30.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 95.4%

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

   1. associate-+r+ 95.4%

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

   2. mul-1-neg 95.4%

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

   3. unsub-neg 95.4%

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

   4. mul-1-neg 95.4%

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

   5. unsub-neg 95.4%

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

   6. associate-*r/ 95.4%

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

   7. associate-/l* 95.4%

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

   8. *-commutative 95.4%

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

   9. associate-/l* 95.4%

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

   10. associate-/r/ 95.4%

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

6. Simplified 95.4%

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

7. Final simplification 95.4%

   \[\leadsto \left(\frac{-2}{\frac{{b}^{5}}{{a}^{2} \cdot {c}^{3}}} - \frac{c}{b}\right) - {c}^{2} \cdot \frac{a}{{b}^{3}} \]

Alternative 3: 90.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 30.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 30.4%

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

3. Simplified 30.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 92.9%

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

   1. mul-1-neg 92.9%

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

   2. unsub-neg 92.9%

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

   3. mul-1-neg 92.9%

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

   4. distribute-neg-frac 92.9%

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

   5. associate-/l* 92.9%

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

   6. associate-/r/ 92.9%

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

6. Simplified 92.9%

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

7. Final simplification 92.9%

   \[\leadsto \frac{-c}{b} - {c}^{2} \cdot \frac{a}{{b}^{3}} \]

Alternative 4: 90.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 30.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 30.4%

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

3. Simplified 30.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 92.6%

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

   1. distribute-lft-out 92.6%

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

   2. associate-/l* 92.6%

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

   3. associate-/l* 92.6%

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

6. Simplified 92.6%

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

7. Taylor expanded in a around 0 92.6%

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

   1. unpow2 92.6%

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

   2. unpow2 92.6%

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

   3. swap-sqr 92.6%

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

   4. unpow2 92.6%

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

9. Simplified 92.6%

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

    1. unpow2 92.6%

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

11. Applied egg-rr 92.6%

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

12. Final simplification 92.6%

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

Alternative 5: 82.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.95 \cdot 10^{-5}:\\ \;\;\;\;\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 2.95e-5)
   (/ (- (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 <= 2.95e-5) {
		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 <= 2.95d-5) 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 <= 2.95e-5) {
		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 <= 2.95e-5:
		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 <= 2.95e-5)
		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 <= 2.95e-5)
		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, 2.95e-5], 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 2 regimes

2. if b < 2.9499999999999999e-5

   1. Initial program 78.1%

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

   if 2.9499999999999999e-5 < b

   1. Initial program 27.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 27.7%

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

   3. Simplified 27.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 84.8%

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

      1. mul-1-neg 84.8%

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

      2. distribute-neg-frac 84.8%

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

   6. Simplified 84.8%

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

4. Final simplification 84.5%

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

Alternative 6: 81.4% accurate, 29.0× 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(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 30.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 30.4%

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

3. Simplified 30.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 82.6%

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

   1. mul-1-neg 82.6%

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

   2. distribute-neg-frac 82.6%

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

6. Simplified 82.6%

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

7. Final simplification 82.6%

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

Reproduce

herbie shell --seed 2023335 
(FPCore (a b c)
  :name "Quadratic roots, medium range"
  :precision binary64
  :pre (and (and (and (< 1.1102230246251565e-16 a) (< a 9007199254740992.0)) (and (< 1.1102230246251565e-16 b) (< b 9007199254740992.0))) (and (< 1.1102230246251565e-16 c) (< c 9007199254740992.0)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))