quadm (p42, negative)

Average Error: 33.9 → 10.2

Time: 14.0s

Precision: binary64

Cost: 7688

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;b \leq -1.5 \cdot 10^{-69}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 10^{+140}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(c \cdot a\right)}}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-\frac{b}{a}\\ \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 -1.5e-69)
   (/ (- c) b)
   (if (<= b 1e+140)
     (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* c a))))) (* a 2.0))
     (- (/ b a)))))

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 <= -1.5e-69) {
		tmp = -c / b;
	} else if (b <= 1e+140) {
		tmp = (-b - sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	} else {
		tmp = -(b / a);
	}
	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 <= (-1.5d-69)) then
        tmp = -c / b
    else if (b <= 1d+140) then
        tmp = (-b - sqrt(((b * b) - (4.0d0 * (c * a))))) / (a * 2.0d0)
    else
        tmp = -(b / a)
    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 <= -1.5e-69) {
		tmp = -c / b;
	} else if (b <= 1e+140) {
		tmp = (-b - Math.sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	} else {
		tmp = -(b / a);
	}
	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 <= -1.5e-69:
		tmp = -c / b
	elif b <= 1e+140:
		tmp = (-b - math.sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0)
	else:
		tmp = -(b / a)
	return tmp

Julia

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

↓

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.5e-69)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 1e+140)
		tmp = Float64(Float64(Float64(-b) - sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(c * a))))) / Float64(a * 2.0));
	else
		tmp = Float64(-Float64(b / a));
	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 <= -1.5e-69)
		tmp = -c / b;
	elseif (b <= 1e+140)
		tmp = (-b - sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	else
		tmp = -(b / a);
	end
	tmp_2 = tmp;
end

Wolfram

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

↓

code[a_, b_, c_] := If[LessEqual[b, -1.5e-69], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 1e+140], N[(N[((-b) - N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], (-N[(b / a), $MachinePrecision])]]

Target

Original	33.9
Target	20.9
Herbie	10.2

\[\begin{array}{l} \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{c}{a \cdot \frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \end{array} \]

Derivation

1. Split input into 3 regimes

2. if b < -1.49999999999999995e-69

   1. Initial program 53.0

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

   2. Taylor expanded in b around -inf 9.0

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

   3. Simplified 9.0

      \[\leadsto \color{blue}{\frac{-c}{b}} \]
      Proof
      (/.f64 (neg.f64 c) b): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 c)) b): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-*r/_binary64 (*.f64 -1 (/.f64 c b))): 0 points increase in error, 0 points decrease in error

   if -1.49999999999999995e-69 < b < 1.00000000000000006e140

   1. Initial program 13.0

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

   if 1.00000000000000006e140 < b

   1. Initial program 58.9

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

   2. Taylor expanded in b around inf 2.6

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

   3. Simplified 2.6

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
      Proof
      (/.f64 (neg.f64 b) a): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 b)) a): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-*r/_binary64 (*.f64 -1 (/.f64 b a))): 0 points increase in error, 0 points decrease in error
3. Recombined 3 regimes into one program.

4. Final simplification 10.2

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

Alternatives

Alternative 1
Error	10.3
Cost	7624

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

Alternative 2
Error	14.0
Cost	7496

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

Alternative 3
Error	14.0
Cost	7368

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

Alternative 4
Error	22.8
Cost	580

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

Alternative 5
Error	22.8
Cost	388

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

Alternative 6
Error	39.9
Cost	256

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

Alternative 7
Error	56.6
Cost	192

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

Reproduce

herbie shell --seed 2022308 
(FPCore (a b c)
  :name "quadm (p42, negative)"
  :precision binary64

  :herbie-target
  (if (< b 0.0) (/ c (* a (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))) (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

  (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))