Linear.Quaternion:$clog from linear-1.19.1.3

Average Error: 21.4 → 0.4

Time: 3.6s

Precision: binary64

Cost: 13256

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;x \leq -4.618988821803745 \cdot 10^{+155}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 4.2405064940455596 \cdot 10^{+86}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(x, x, y\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

FPCore

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

↓

(FPCore (x y)
 :precision binary64
 (if (<= x -4.618988821803745e+155)
   (- x)
   (if (<= x 4.2405064940455596e+86) (sqrt (fma 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 <= -4.618988821803745e+155) {
		tmp = -x;
	} else if (x <= 4.2405064940455596e+86) {
		tmp = sqrt(fma(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 <= -4.618988821803745e+155)
		tmp = Float64(-x);
	elseif (x <= 4.2405064940455596e+86)
		tmp = sqrt(fma(x, x, y));
	else
		tmp = x;
	end
	return tmp
end

Wolfram

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

↓

code[x_, y_] := If[LessEqual[x, -4.618988821803745e+155], (-x), If[LessEqual[x, 4.2405064940455596e+86], N[Sqrt[N[(x * x + y), $MachinePrecision]], $MachinePrecision], x]]

Target

Original	21.4
Target	0.5
Herbie	0.4

\[\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.61898882180374491e155

   1. Initial program 64.0

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

   2. Simplified 64.0

      \[\leadsto \color{blue}{\sqrt{\mathsf{fma}\left(x, x, y\right)}} \]
      Proof
      (sqrt.f64 (fma.f64 x x y)): 0 points increase in error, 0 points decrease in error
      (sqrt.f64 (Rewrite<= fma-def_binary64 (+.f64 (*.f64 x x) y))): 1 points increase in error, 0 points decrease in error

   3. Taylor expanded in x around -inf 0.0

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

   4. Simplified 0.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.61898882180374491e155 < x < 4.24050649404555962e86

   1. Initial program 0.2

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

   2. Simplified 0.2

      \[\leadsto \color{blue}{\sqrt{\mathsf{fma}\left(x, x, y\right)}} \]
      Proof
      (sqrt.f64 (fma.f64 x x y)): 0 points increase in error, 0 points decrease in error
      (sqrt.f64 (Rewrite<= fma-def_binary64 (+.f64 (*.f64 x x) y))): 1 points increase in error, 0 points decrease in error

   if 4.24050649404555962e86 < x

   1. Initial program 45.1

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

   2. Simplified 45.1

      \[\leadsto \color{blue}{\sqrt{\mathsf{fma}\left(x, x, y\right)}} \]
      Proof
      (sqrt.f64 (fma.f64 x x y)): 0 points increase in error, 0 points decrease in error
      (sqrt.f64 (Rewrite<= fma-def_binary64 (+.f64 (*.f64 x x) y))): 1 points increase in error, 0 points decrease in error

   3. Applied egg-rr 31.7

      \[\leadsto \color{blue}{\mathsf{hypot}\left(\sqrt{y}, x\right)} \]

   4. Taylor expanded in y around 0 1.2

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

4. Final simplification 0.4

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.618988821803745 \cdot 10^{+155}:\\ \;\;\;\;-x\\ \mathbf{elif}\;x \leq 4.2405064940455596 \cdot 10^{+86}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(x, x, y\right)}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternatives

Alternative 1
Error	7.6
Cost	6992

\[\begin{array}{l} t_0 := x + \frac{y}{x} \cdot 0.5\\ \mathbf{if}\;x \leq -2.85 \cdot 10^{-99}:\\ \;\;\;\;\frac{y}{x} \cdot -0.5 - x\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{-57}:\\ \;\;\;\;\sqrt{y}\\ \mathbf{elif}\;x \leq 7.6 \cdot 10^{+21}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 4 \cdot 10^{+36}:\\ \;\;\;\;\sqrt{y}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 2
Error	0.4
Cost	6984

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

Alternative 3
Error	20.6
Cost	580

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

Alternative 4
Error	20.6
Cost	580

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

Alternative 5
Error	20.7
Cost	260

\[\begin{array}{l} \mathbf{if}\;x \leq 0:\\ \;\;\;\;-x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 6
Error	42.2
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022294 
(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)))