Linear.Quaternion:$clog from linear-1.19.1.3

Average Error: 21.3 → 0.1

Time: 3.0s

Precision: binary64

Cost: 6984

Math

\[\sqrt{x \cdot x + y} \]

↓

\[\begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{+155}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+129}:\\ \;\;\;\;\sqrt{x \cdot x + y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (sqrt (+ (* x x) y)))

↓

(FPCore (x y)
 :precision binary64
 (if (<= x -5e+155) (- x) (if (<= x 2e+129) (sqrt (+ (* x x) y)) x)))

C

double code(double x, double y) {
	return sqrt(((x * x) + y));
}

↓

double code(double x, double y) {
	double tmp;
	if (x <= -5e+155) {
		tmp = -x;
	} else if (x <= 2e+129) {
		tmp = sqrt(((x * x) + y));
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = sqrt(((x * x) + y))
end function

↓

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-5d+155)) then
        tmp = -x
    else if (x <= 2d+129) then
        tmp = sqrt(((x * x) + y))
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	return Math.sqrt(((x * x) + y));
}

↓

public static double code(double x, double y) {
	double tmp;
	if (x <= -5e+155) {
		tmp = -x;
	} else if (x <= 2e+129) {
		tmp = Math.sqrt(((x * x) + y));
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	return math.sqrt(((x * x) + y))

↓

def code(x, y):
	tmp = 0
	if x <= -5e+155:
		tmp = -x
	elif x <= 2e+129:
		tmp = math.sqrt(((x * x) + y))
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	return sqrt(Float64(Float64(x * x) + y))
end

↓

function code(x, y)
	tmp = 0.0
	if (x <= -5e+155)
		tmp = Float64(-x);
	elseif (x <= 2e+129)
		tmp = sqrt(Float64(Float64(x * x) + y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp = code(x, y)
	tmp = sqrt(((x * x) + y));
end

↓

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -5e+155)
		tmp = -x;
	elseif (x <= 2e+129)
		tmp = sqrt(((x * x) + y));
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]

↓

code[x_, y_] := If[LessEqual[x, -5e+155], (-x), If[LessEqual[x, 2e+129], N[Sqrt[N[(N[(x * x), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision], x]]

Target

Original	21.3
Target	0.4
Herbie	0.1

\[\begin{array}{l} \mathbf{if}\;x < -1.5097698010472593 \cdot 10^{+153}:\\ \;\;\;\;-\left(0.5 \cdot \frac{y}{x} + x\right)\\ \mathbf{elif}\;x < 5.582399551122541 \cdot 10^{+57}:\\ \;\;\;\;\sqrt{x \cdot x + y}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y}{x} + x\\ \end{array} \]

Derivation

1. Split input into 3 regimes

2. if x < -4.9999999999999999e155

   1. Initial program 64.0

      \[\sqrt{x \cdot x + y} \]

   2. Taylor expanded in x around -inf 0

      \[\leadsto \color{blue}{-1 \cdot x} \]

   3. Simplified 0

      \[\leadsto \color{blue}{-x} \]
      Proof
      (neg.f64 x): 0 points increase in error, 0 points decrease in error
      (Rewrite<= mul-1-neg_binary64 (*.f64 -1 x)): 0 points increase in error, 0 points decrease in error

   if -4.9999999999999999e155 < x < 2e129

   1. Initial program 0.2

      \[\sqrt{x \cdot x + y} \]

   if 2e129 < x

   1. Initial program 55.4

      \[\sqrt{x \cdot x + y} \]

   2. Taylor expanded in x around inf 0.1

      \[\leadsto \color{blue}{x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 0.1

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{+155}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+129}:\\ \;\;\;\;\sqrt{x \cdot x + y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternatives

Alternative 1
Error	7.2
Cost	6728

\[\begin{array}{l} \mathbf{if}\;x \leq -1.4 \cdot 10^{-107}:\\ \;\;\;\;\frac{y}{x} \cdot -0.5 - x\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{-48}:\\ \;\;\;\;\sqrt{y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{x} \cdot 0.5\\ \end{array} \]

Alternative 2
Error	20.6
Cost	580

\[\begin{array}{l} \mathbf{if}\;x \leq 2.8 \cdot 10^{-227}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{x} \cdot 0.5\\ \end{array} \]

Alternative 3
Error	20.6
Cost	580

\[\begin{array}{l} \mathbf{if}\;x \leq -1.65 \cdot 10^{-294}:\\ \;\;\;\;\frac{y}{x} \cdot -0.5 - x\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{x} \cdot 0.5\\ \end{array} \]

Alternative 4
Error	20.6
Cost	260

\[\begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-310}:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 5
Error	41.3
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022331 
(FPCore (x y)
  :name "Linear.Quaternion:$clog from linear-1.19.1.3"
  :precision binary64

  :herbie-target
  (if (< x -1.5097698010472593e+153) (- (+ (* 0.5 (/ y x)) x)) (if (< x 5.582399551122541e+57) (sqrt (+ (* x x) y)) (+ (* 0.5 (/ y x)) x)))

  (sqrt (+ (* x x) y)))