bug366, discussion (missed optimization)

Average Error: 31.6 → 0.7

Time: 3.3s

Precision: binary64

Cost: 708

Math

\[\sqrt{a \cdot a - b \cdot b} \]

↓

\[\begin{array}{l} \mathbf{if}\;a \leq -3.789088746216938 \cdot 10^{-239}:\\ \;\;\;\;\frac{0.5 \cdot b}{\frac{a}{b}} - a\\ \mathbf{else}:\\ \;\;\;\;a + \frac{b \cdot -0.5}{\frac{a}{b}}\\ \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (sqrt (- (* a a) (* b b))))

↓

(FPCore (a b)
 :precision binary64
 (if (<= a -3.789088746216938e-239)
   (- (/ (* 0.5 b) (/ a b)) a)
   (+ a (/ (* b -0.5) (/ a b)))))

C

double code(double a, double b) {
	return sqrt(((a * a) - (b * b)));
}

↓

double code(double a, double b) {
	double tmp;
	if (a <= -3.789088746216938e-239) {
		tmp = ((0.5 * b) / (a / b)) - a;
	} else {
		tmp = a + ((b * -0.5) / (a / b));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = sqrt(((a * a) - (b * b)))
end function

↓

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-3.789088746216938d-239)) then
        tmp = ((0.5d0 * b) / (a / b)) - a
    else
        tmp = a + ((b * (-0.5d0)) / (a / b))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	return Math.sqrt(((a * a) - (b * b)));
}

↓

public static double code(double a, double b) {
	double tmp;
	if (a <= -3.789088746216938e-239) {
		tmp = ((0.5 * b) / (a / b)) - a;
	} else {
		tmp = a + ((b * -0.5) / (a / b));
	}
	return tmp;
}

Python

def code(a, b):
	return math.sqrt(((a * a) - (b * b)))

↓

def code(a, b):
	tmp = 0
	if a <= -3.789088746216938e-239:
		tmp = ((0.5 * b) / (a / b)) - a
	else:
		tmp = a + ((b * -0.5) / (a / b))
	return tmp

Julia

function code(a, b)
	return sqrt(Float64(Float64(a * a) - Float64(b * b)))
end

↓

function code(a, b)
	tmp = 0.0
	if (a <= -3.789088746216938e-239)
		tmp = Float64(Float64(Float64(0.5 * b) / Float64(a / b)) - a);
	else
		tmp = Float64(a + Float64(Float64(b * -0.5) / Float64(a / b)));
	end
	return tmp
end

MATLAB

function tmp = code(a, b)
	tmp = sqrt(((a * a) - (b * b)));
end

↓

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -3.789088746216938e-239)
		tmp = ((0.5 * b) / (a / b)) - a;
	else
		tmp = a + ((b * -0.5) / (a / b));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := N[Sqrt[N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

↓

code[a_, b_] := If[LessEqual[a, -3.789088746216938e-239], N[(N[(N[(0.5 * b), $MachinePrecision] / N[(a / b), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision], N[(a + N[(N[(b * -0.5), $MachinePrecision] / N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Target

Original	31.6
Target	0.5
Herbie	0.7

\[\sqrt{\left|a\right| + \left|b\right|} \cdot \sqrt{\left|a\right| - \left|b\right|} \]

Derivation

1. Split input into 2 regimes

2. if a < -3.789088746216938e-239

   1. Initial program 31.3

      \[\sqrt{a \cdot a - b \cdot b} \]

   2. Taylor expanded in a around -inf 4.7

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

   3. Simplified 0.4

      \[\leadsto \color{blue}{\frac{0.5 \cdot b}{\frac{a}{b}} - a} \]
      Proof
      (-.f64 (/.f64 (*.f64 1/2 b) (/.f64 a b)) a): 0 points increase in error, 0 points decrease in error
      (-.f64 (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (*.f64 1/2 b) b) a)) a): 26 points increase in error, 0 points decrease in error
      (-.f64 (/.f64 (Rewrite<= associate-*r*_binary64 (*.f64 1/2 (*.f64 b b))) a) a): 0 points increase in error, 0 points decrease in error
      (-.f64 (Rewrite<= associate-*r/_binary64 (*.f64 1/2 (/.f64 (*.f64 b b) a))) a): 0 points increase in error, 0 points decrease in error
      (-.f64 (*.f64 1/2 (/.f64 (Rewrite<= unpow2_binary64 (pow.f64 b 2)) a)) a): 0 points increase in error, 0 points decrease in error
      (Rewrite<= unsub-neg_binary64 (+.f64 (*.f64 1/2 (/.f64 (pow.f64 b 2) a)) (neg.f64 a))): 0 points increase in error, 0 points decrease in error
      (+.f64 (*.f64 1/2 (/.f64 (pow.f64 b 2) a)) (Rewrite<= mul-1-neg_binary64 (*.f64 -1 a))): 0 points increase in error, 0 points decrease in error

   if -3.789088746216938e-239 < a

   1. Initial program 31.8

      \[\sqrt{a \cdot a - b \cdot b} \]

   2. Taylor expanded in a around inf 5.1

      \[\leadsto \color{blue}{a + -0.5 \cdot \frac{{b}^{2}}{a}} \]

   3. Simplified 5.1

      \[\leadsto \color{blue}{a + -0.5 \cdot \frac{b \cdot b}{a}} \]
      Proof
      (+.f64 a (*.f64 -1/2 (/.f64 (*.f64 b b) a))): 0 points increase in error, 0 points decrease in error
      (+.f64 a (*.f64 -1/2 (/.f64 (Rewrite<= unpow2_binary64 (pow.f64 b 2)) a))): 0 points increase in error, 0 points decrease in error

   4. Applied egg-rr 0.9

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

4. Final simplification 0.7

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -3.789088746216938 \cdot 10^{-239}:\\ \;\;\;\;\frac{0.5 \cdot b}{\frac{a}{b}} - a\\ \mathbf{else}:\\ \;\;\;\;a + \frac{b \cdot -0.5}{\frac{a}{b}}\\ \end{array} \]

Alternatives

Alternative 1
Error	0.8
Cost	708

\[\begin{array}{l} \mathbf{if}\;a \leq -3.789088746216938 \cdot 10^{-239}:\\ \;\;\;\;-a\\ \mathbf{else}:\\ \;\;\;\;a + \frac{b \cdot -0.5}{\frac{a}{b}}\\ \end{array} \]

Alternative 2
Error	1.0
Cost	260

\[\begin{array}{l} \mathbf{if}\;a \leq -3.789088746216938 \cdot 10^{-239}:\\ \;\;\;\;-a\\ \mathbf{else}:\\ \;\;\;\;a\\ \end{array} \]

Alternative 3
Error	31.4
Cost	64

\[a \]

Reproduce

herbie shell --seed 2022332 
(FPCore (a b)
  :name "bug366, discussion (missed optimization)"
  :precision binary64

  :herbie-target
  (* (sqrt (+ (fabs a) (fabs b))) (sqrt (- (fabs a) (fabs b))))

  (sqrt (- (* a a) (* b b))))