quad2p (problem 3.2.1, positive)

Average Error: 33.8 → 13.8

Time: 16.8s

Precision: binary64

Cost: 35792

Math

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

↓

\[\begin{array}{l} t_0 := -0.5 \cdot \frac{c}{b_2}\\ t_1 := \frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{if}\;t_1 \leq -\infty:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_1 \leq -1 \cdot 10^{-226}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_1 \leq 0:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_1 \leq 10^{+301}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

↓

(FPCore (a b_2 c)
 :precision binary64
 (let* ((t_0 (* -0.5 (/ c b_2)))
        (t_1 (/ (- (sqrt (- (* b_2 b_2) (* a c))) b_2) a)))
   (if (<= t_1 (- INFINITY))
     t_0
     (if (<= t_1 -1e-226)
       t_1
       (if (<= t_1 0.0) t_0 (if (<= t_1 1e+301) t_1 t_0))))))

C

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

↓

double code(double a, double b_2, double c) {
	double t_0 = -0.5 * (c / b_2);
	double t_1 = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = t_0;
	} else if (t_1 <= -1e-226) {
		tmp = t_1;
	} else if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+301) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

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

↓

public static double code(double a, double b_2, double c) {
	double t_0 = -0.5 * (c / b_2);
	double t_1 = (Math.sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = t_0;
	} else if (t_1 <= -1e-226) {
		tmp = t_1;
	} else if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+301) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

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

↓

def code(a, b_2, c):
	t_0 = -0.5 * (c / b_2)
	t_1 = (math.sqrt(((b_2 * b_2) - (a * c))) - b_2) / a
	tmp = 0
	if t_1 <= -math.inf:
		tmp = t_0
	elif t_1 <= -1e-226:
		tmp = t_1
	elif t_1 <= 0.0:
		tmp = t_0
	elif t_1 <= 1e+301:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

↓

function code(a, b_2, c)
	t_0 = Float64(-0.5 * Float64(c / b_2))
	t_1 = Float64(Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c))) - b_2) / a)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = t_0;
	elseif (t_1 <= -1e-226)
		tmp = t_1;
	elseif (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+301)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(a, b_2, c)
	t_0 = -0.5 * (c / b_2);
	t_1 = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = t_0;
	elseif (t_1 <= -1e-226)
		tmp = t_1;
	elseif (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+301)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) + N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

↓

code[a_, b$95$2_, c_] := Block[{t$95$0 = N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$0, If[LessEqual[t$95$1, -1e-226], t$95$1, If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, 1e+301], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (neg.f64 b_2) (sqrt.f64 (-.f64 (*.f64 b_2 b_2) (*.f64 a c)))) a) < -inf.0 or -9.99999999999999921e-227 < (/.f64 (+.f64 (neg.f64 b_2) (sqrt.f64 (-.f64 (*.f64 b_2 b_2) (*.f64 a c)))) a) < 0.0 or 1.00000000000000005e301 < (/.f64 (+.f64 (neg.f64 b_2) (sqrt.f64 (-.f64 (*.f64 b_2 b_2) (*.f64 a c)))) a)

   1. Initial program 59.8

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

   2. Taylor expanded in b_2 around inf 22.2

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b_2}} \]

   if -inf.0 < (/.f64 (+.f64 (neg.f64 b_2) (sqrt.f64 (-.f64 (*.f64 b_2 b_2) (*.f64 a c)))) a) < -9.99999999999999921e-227 or 0.0 < (/.f64 (+.f64 (neg.f64 b_2) (sqrt.f64 (-.f64 (*.f64 b_2 b_2) (*.f64 a c)))) a) < 1.00000000000000005e301

   1. Initial program 4.3

      \[\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]
3. Recombined 2 regimes into one program.

4. Final simplification 13.8

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a} \leq -\infty:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a} \leq -1 \cdot 10^{-226}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{elif}\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a} \leq 0:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a} \leq 10^{+301}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \end{array} \]

Alternatives

Alternative 1
Error	13.4
Cost	7176

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -7.1 \cdot 10^{-71}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + \frac{c}{b_2} \cdot 0.5\\ \mathbf{elif}\;b_2 \leq 1.4 \cdot 10^{-88}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(-a\right)} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \end{array} \]

Alternative 2
Error	22.7
Cost	836

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -7.5 \cdot 10^{-300}:\\ \;\;\;\;\frac{c}{b_2} \cdot 0.5 + \frac{-2}{\frac{a}{b_2}}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \end{array} \]

Alternative 3
Error	22.6
Cost	836

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -7.5 \cdot 10^{-300}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + \frac{c}{b_2} \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \end{array} \]

Alternative 4
Error	39.3
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -8.8 \cdot 10^{-300}:\\ \;\;\;\;b_2 \cdot \frac{-2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{a}\\ \end{array} \]

Alternative 5
Error	39.3
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -8.8 \cdot 10^{-300}:\\ \;\;\;\;\frac{-2}{\frac{a}{b_2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{a}\\ \end{array} \]

Alternative 6
Error	23.0
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 1.95 \cdot 10^{-223}:\\ \;\;\;\;\frac{-2}{\frac{a}{b_2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-0.5}{\frac{b_2}{c}}\\ \end{array} \]

Alternative 7
Error	23.0
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 1.95 \cdot 10^{-223}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-0.5}{\frac{b_2}{c}}\\ \end{array} \]

Alternative 8
Error	22.7
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 1.95 \cdot 10^{-223}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{-0.5}{b_2}\\ \end{array} \]

Alternative 9
Error	22.7
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 1.95 \cdot 10^{-223}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \end{array} \]

Alternative 10
Error	53.4
Cost	388

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -1.6 \cdot 10^{-292}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{a}\\ \end{array} \]

Alternative 11
Error	56.5
Cost	192

\[\frac{0}{a} \]

Reproduce

herbie shell --seed 2022317 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))