Quadratic roots, narrow range

Percentage Accurate: 55.7% → 90.7%

Time: 15.1s

Alternatives: 10

Speedup: 29.0×

Specification

\[\left(\left(1.0536712127723509 \cdot 10^{-8} < a \land a < 94906265.62425156\right) \land \left(1.0536712127723509 \cdot 10^{-8} < b \land b < 94906265.62425156\right)\right) \land \left(1.0536712127723509 \cdot 10^{-8} < c \land c < 94906265.62425156\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: 55.7% 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: 90.7% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 55.0%

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

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

3. Simplified 55.0%

   \[\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 a around 0 93.1%

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

   1. +-commutative 93.1%

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

   2. mul-1-neg 93.1%

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

   3. unsub-neg 93.1%

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

7. Simplified 93.1%

   \[\leadsto \color{blue}{a \cdot \left(a \cdot \mathsf{fma}\left(-2, \frac{{c}^{3}}{{b}^{5}}, \left(a \cdot \left(\frac{\frac{{c}^{4}}{{b}^{6}}}{b} \cdot 20\right)\right) \cdot -0.25\right) - \frac{{c}^{2}}{{b}^{3}}\right) - \frac{c}{b}} \]

8. Taylor expanded in c around inf 93.1%

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

   1. associate-*r/ 93.1%

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

   2. metadata-eval 93.1%

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

   3. *-commutative 93.1%

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

10. Simplified 93.1%

    \[\leadsto a \cdot \left(a \cdot \color{blue}{\left({c}^{4} \cdot \left(-5 \cdot \frac{a}{{b}^{7}} - \frac{2}{c \cdot {b}^{5}}\right)\right)} - \frac{{c}^{2}}{{b}^{3}}\right) - \frac{c}{b} \]
11. Add Preprocessing

Alternative 2: 90.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ c \cdot \mathsf{fma}\left(c, a \cdot \left(a \cdot \left(-5 \cdot \frac{a \cdot \left(c \cdot c\right)}{{b}^{7}} + -2 \cdot \frac{c}{{b}^{5}}\right) + \frac{-1}{{b}^{3}}\right), \frac{-1}{b}\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 55.0%

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

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

3. Simplified 55.0%

   \[\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 c around 0 93.0%

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

   1. fma-neg 93.0%

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

7. Simplified 93.0%

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

8. Taylor expanded in a around 0 93.0%

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

   1. unpow2 93.0%

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

10. Applied egg-rr 93.0%

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

11. Final simplification 93.0%

    \[\leadsto c \cdot \mathsf{fma}\left(c, a \cdot \left(a \cdot \left(-5 \cdot \frac{a \cdot \left(c \cdot c\right)}{{b}^{7}} + -2 \cdot \frac{c}{{b}^{5}}\right) + \frac{-1}{{b}^{3}}\right), \frac{-1}{b}\right) \]
12. Add Preprocessing

Alternative 3: 85.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0)) -0.01)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (- (/ c (- b)) (* a (/ (pow c 2.0) (pow b 3.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (((sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)) <= -0.01) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (c / -b) - (a * (pow(c, 2.0) / pow(b, 3.0)));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0)) <= -0.01)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(c / Float64(-b)) - Float64(a * Float64((c ^ 2.0) / (b ^ 3.0))));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[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], -0.01], 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[(N[(c / (-b)), $MachinePrecision] - N[(a * N[(N[Power[c, 2.0], $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) < -0.0100000000000000002

   1. Initial program 79.6%

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

   3. Simplified 79.7%

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

   if -0.0100000000000000002 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a))

   1. Initial program 46.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 46.4%

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

   3. Simplified 46.4%

      \[\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 a around 0 90.3%

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

      1. mul-1-neg 90.3%

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

      2. unsub-neg 90.3%

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

      3. mul-1-neg 90.3%

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

      4. distribute-neg-frac2 90.3%

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

      5. associate-/l* 90.3%

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

   7. Simplified 90.3%

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

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2} \leq -0.01:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.9% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0)) -0.01)
   (/ (- (sqrt (fma a (* c -4.0) (* b b))) b) (* a 2.0))
   (- (/ c (- b)) (* a (/ (pow c 2.0) (pow b 3.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (((sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)) <= -0.01) {
		tmp = (sqrt(fma(a, (c * -4.0), (b * b))) - b) / (a * 2.0);
	} else {
		tmp = (c / -b) - (a * (pow(c, 2.0) / pow(b, 3.0)));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0)) <= -0.01)
		tmp = Float64(Float64(sqrt(fma(a, Float64(c * -4.0), Float64(b * b))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(c / Float64(-b)) - Float64(a * Float64((c ^ 2.0) / (b ^ 3.0))));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[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], -0.01], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(c / (-b)), $MachinePrecision] - N[(a * N[(N[Power[c, 2.0], $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) < -0.0100000000000000002

   1. Initial program 79.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 79.6%

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

   3. Simplified 79.6%

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

   if -0.0100000000000000002 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a))

   1. Initial program 46.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 46.4%

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

   3. Simplified 46.4%

      \[\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 a around 0 90.3%

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

      1. mul-1-neg 90.3%

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

      2. unsub-neg 90.3%

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

      3. mul-1-neg 90.3%

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

      4. distribute-neg-frac2 90.3%

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

      5. associate-/l* 90.3%

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

   7. Simplified 90.3%

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

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2} \leq -0.01:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(a, c \cdot -4, b \cdot b\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 84.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))))
   (if (<= t_0 -0.01) t_0 (- (/ c (- b)) (* a (/ (pow c 2.0) (pow b 3.0)))))))

C

double code(double a, double b, double c) {
	double t_0 = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = t_0;
	} else {
		tmp = (c / -b) - (a * (pow(c, 2.0) / pow(b, 3.0)));
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    if (t_0 <= (-0.01d0)) then
        tmp = t_0
    else
        tmp = (c / -b) - (a * ((c ** 2.0d0) / (b ** 3.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = t_0;
	} else {
		tmp = (c / -b) - (a * (Math.pow(c, 2.0) / Math.pow(b, 3.0)));
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	tmp = 0
	if t_0 <= -0.01:
		tmp = t_0
	else:
		tmp = (c / -b) - (a * (math.pow(c, 2.0) / math.pow(b, 3.0)))
	return tmp

Julia

function code(a, b, c)
	t_0 = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = t_0;
	else
		tmp = Float64(Float64(c / Float64(-b)) - Float64(a * Float64((c ^ 2.0) / (b ^ 3.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	tmp = 0.0;
	if (t_0 <= -0.01)
		tmp = t_0;
	else
		tmp = (c / -b) - (a * ((c ^ 2.0) / (b ^ 3.0)));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -0.01], t$95$0, N[(N[(c / (-b)), $MachinePrecision] - N[(a * N[(N[Power[c, 2.0], $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) < -0.0100000000000000002

   1. Initial program 79.6%

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

   if -0.0100000000000000002 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a))

   1. Initial program 46.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 46.4%

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

   3. Simplified 46.4%

      \[\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 a around 0 90.3%

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

      1. mul-1-neg 90.3%

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

      2. unsub-neg 90.3%

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

      3. mul-1-neg 90.3%

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

      4. distribute-neg-frac2 90.3%

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

      5. associate-/l* 90.3%

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

   7. Simplified 90.3%

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

4. Final simplification 87.5%

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

Alternative 6: 87.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 55.0%

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

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

3. Simplified 55.0%

   \[\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 a around 0 93.1%

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

   1. +-commutative 93.1%

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

   2. mul-1-neg 93.1%

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

   3. unsub-neg 93.1%

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

7. Simplified 93.1%

   \[\leadsto \color{blue}{a \cdot \left(a \cdot \mathsf{fma}\left(-2, \frac{{c}^{3}}{{b}^{5}}, \left(a \cdot \left(\frac{\frac{{c}^{4}}{{b}^{6}}}{b} \cdot 20\right)\right) \cdot -0.25\right) - \frac{{c}^{2}}{{b}^{3}}\right) - \frac{c}{b}} \]

8. Taylor expanded in c around 0 90.0%

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

   1. associate-*r/ 90.0%

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

   2. *-commutative 90.0%

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

   3. associate-*r* 90.0%

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

   4. *-commutative 90.0%

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

10. Simplified 90.0%

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

11. Final simplification 90.0%

    \[\leadsto a \cdot \left({c}^{2} \cdot \left(\frac{a \cdot \left(c \cdot -2\right)}{{b}^{5}} + \frac{-1}{{b}^{3}}\right)\right) - \frac{c}{b} \]
12. Add Preprocessing

Alternative 7: 87.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 55.0%

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

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

3. Simplified 55.0%

   \[\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 c around 0 93.0%

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

   1. fma-neg 93.0%

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

7. Simplified 93.0%

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

8. Taylor expanded in a around 0 89.9%

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

   1. associate-*r/ 89.9%

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

   2. *-commutative 89.9%

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

   3. associate-*r* 89.9%

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

   4. *-commutative 89.9%

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

10. Simplified 89.9%

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

11. Final simplification 89.9%

    \[\leadsto c \cdot \mathsf{fma}\left(c, a \cdot \left(\frac{a \cdot \left(c \cdot -2\right)}{{b}^{5}} + \frac{-1}{{b}^{3}}\right), \frac{-1}{b}\right) \]
12. Add Preprocessing

Alternative 8: 84.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{if}\;t\_0 \leq -0.01:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-c\right) - a \cdot {\left(\frac{c}{-b}\right)}^{2}}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))))
   (if (<= t_0 -0.01) t_0 (/ (- (- c) (* a (pow (/ c (- b)) 2.0))) b))))

C

double code(double a, double b, double c) {
	double t_0 = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = t_0;
	} else {
		tmp = (-c - (a * pow((c / -b), 2.0))) / 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) :: t_0
    real(8) :: tmp
    t_0 = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    if (t_0 <= (-0.01d0)) then
        tmp = t_0
    else
        tmp = (-c - (a * ((c / -b) ** 2.0d0))) / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	double tmp;
	if (t_0 <= -0.01) {
		tmp = t_0;
	} else {
		tmp = (-c - (a * Math.pow((c / -b), 2.0))) / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	tmp = 0
	if t_0 <= -0.01:
		tmp = t_0
	else:
		tmp = (-c - (a * math.pow((c / -b), 2.0))) / b
	return tmp

Julia

function code(a, b, c)
	t_0 = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0))
	tmp = 0.0
	if (t_0 <= -0.01)
		tmp = t_0;
	else
		tmp = Float64(Float64(Float64(-c) - Float64(a * (Float64(c / Float64(-b)) ^ 2.0))) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	tmp = 0.0;
	if (t_0 <= -0.01)
		tmp = t_0;
	else
		tmp = (-c - (a * ((c / -b) ^ 2.0))) / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -0.01], t$95$0, N[(N[((-c) - N[(a * N[Power[N[(c / (-b)), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) < -0.0100000000000000002

   1. Initial program 79.6%

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

   if -0.0100000000000000002 < (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a))

   1. Initial program 46.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 46.4%

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

   3. Simplified 46.4%

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

   5. Taylor expanded in a around inf 45.9%

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

   6. Taylor expanded in b around inf 90.2%

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

      1. neg-mul-1 90.2%

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

      2. mul-1-neg 90.2%

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

      3. unsub-neg 90.2%

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

      4. associate-/l* 90.2%

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

      5. unpow2 90.2%

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

      6. unpow2 90.2%

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

      7. times-frac 90.2%

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

      8. sqr-neg 90.2%

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

      9. unpow1 90.2%

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

      10. pow-plus 90.2%

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

      11. distribute-neg-frac2 90.2%

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

      12. metadata-eval 90.2%

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

   8. Simplified 90.2%

      \[\leadsto \color{blue}{\frac{\left(-c\right) - a \cdot {\left(\frac{c}{-b}\right)}^{2}}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.5%

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

Alternative 9: 81.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 55.0%

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

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

3. Simplified 55.0%

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

5. Taylor expanded in a around inf 54.4%

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

6. Taylor expanded in b around inf 83.5%

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

   1. neg-mul-1 83.5%

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

   2. mul-1-neg 83.5%

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

   3. unsub-neg 83.5%

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

   4. associate-/l* 83.5%

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

   5. unpow2 83.5%

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

   6. unpow2 83.5%

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

   7. times-frac 83.5%

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

   8. sqr-neg 83.5%

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

   9. unpow1 83.5%

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

   10. pow-plus 83.5%

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

   11. distribute-neg-frac2 83.5%

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

   12. metadata-eval 83.5%

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

8. Simplified 83.5%

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

Alternative 10: 64.2% 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(c / Float64(-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 55.0%

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

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

3. Simplified 55.0%

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

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

   1. associate-*r/ 65.3%

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

   2. mul-1-neg 65.3%

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

7. Simplified 65.3%

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

8. Final simplification 65.3%

   \[\leadsto \frac{c}{-b} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024119 
(FPCore (a b c)
  :name "Quadratic roots, narrow range"
  :precision binary64
  :pre (and (and (and (< 1.0536712127723509e-8 a) (< a 94906265.62425156)) (and (< 1.0536712127723509e-8 b) (< b 94906265.62425156))) (and (< 1.0536712127723509e-8 c) (< c 94906265.62425156)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))