Given's Rotation SVD example

Average Error: 13.0 → 5.5

Time: 8.1s

Precision: binary64

Cost: 20612

\[10^{-150} < \left|x\right| \land \left|x\right| < 10^{+150}\]

Math

\[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

↓

\[\begin{array}{l} \mathbf{if}\;\frac{x}{\sqrt{p \cdot \left(4 \cdot p\right) + x \cdot x}} \leq -1:\\ \;\;\;\;\sqrt{0.5 \cdot \left(2 \cdot \left(\frac{p}{x} \cdot \frac{p}{x}\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, p \cdot 2\right)}}\\ \end{array} \]

FPCore

(FPCore (p x)
 :precision binary64
 (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))

↓

(FPCore (p x)
 :precision binary64
 (if (<= (/ x (sqrt (+ (* p (* 4.0 p)) (* x x)))) -1.0)
   (sqrt (* 0.5 (* 2.0 (* (/ p x) (/ p x)))))
   (sqrt (+ 0.5 (* x (/ 0.5 (hypot x (* p 2.0))))))))

C

double code(double p, double x) {
	return sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
}

↓

double code(double p, double x) {
	double tmp;
	if ((x / sqrt(((p * (4.0 * p)) + (x * x)))) <= -1.0) {
		tmp = sqrt((0.5 * (2.0 * ((p / x) * (p / x)))));
	} else {
		tmp = sqrt((0.5 + (x * (0.5 / hypot(x, (p * 2.0))))));
	}
	return tmp;
}

Java

public static double code(double p, double x) {
	return Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p) * p) + (x * x)))))));
}

↓

public static double code(double p, double x) {
	double tmp;
	if ((x / Math.sqrt(((p * (4.0 * p)) + (x * x)))) <= -1.0) {
		tmp = Math.sqrt((0.5 * (2.0 * ((p / x) * (p / x)))));
	} else {
		tmp = Math.sqrt((0.5 + (x * (0.5 / Math.hypot(x, (p * 2.0))))));
	}
	return tmp;
}

Python

def code(p, x):
	return math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p) * p) + (x * x)))))))

↓

def code(p, x):
	tmp = 0
	if (x / math.sqrt(((p * (4.0 * p)) + (x * x)))) <= -1.0:
		tmp = math.sqrt((0.5 * (2.0 * ((p / x) * (p / x)))))
	else:
		tmp = math.sqrt((0.5 + (x * (0.5 / math.hypot(x, (p * 2.0))))))
	return tmp

Julia

function code(p, x)
	return sqrt(Float64(0.5 * Float64(1.0 + Float64(x / sqrt(Float64(Float64(Float64(4.0 * p) * p) + Float64(x * x)))))))
end

↓

function code(p, x)
	tmp = 0.0
	if (Float64(x / sqrt(Float64(Float64(p * Float64(4.0 * p)) + Float64(x * x)))) <= -1.0)
		tmp = sqrt(Float64(0.5 * Float64(2.0 * Float64(Float64(p / x) * Float64(p / x)))));
	else
		tmp = sqrt(Float64(0.5 + Float64(x * Float64(0.5 / hypot(x, Float64(p * 2.0))))));
	end
	return tmp
end

MATLAB

function tmp = code(p, x)
	tmp = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
end

↓

function tmp_2 = code(p, x)
	tmp = 0.0;
	if ((x / sqrt(((p * (4.0 * p)) + (x * x)))) <= -1.0)
		tmp = sqrt((0.5 * (2.0 * ((p / x) * (p / x)))));
	else
		tmp = sqrt((0.5 + (x * (0.5 / hypot(x, (p * 2.0))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[p_, x_] := N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(N[(N[(4.0 * p), $MachinePrecision] * p), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

↓

code[p_, x_] := If[LessEqual[N[(x / N[Sqrt[N[(N[(p * N[(4.0 * p), $MachinePrecision]), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1.0], N[Sqrt[N[(0.5 * N[(2.0 * N[(N[(p / x), $MachinePrecision] * N[(p / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(0.5 + N[(x * N[(0.5 / N[Sqrt[x ^ 2 + N[(p * 2.0), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Target

Original	13.0
Target	13.0
Herbie	5.5

\[\sqrt{0.5 + \frac{\mathsf{copysign}\left(0.5, x\right)}{\mathsf{hypot}\left(1, \frac{2 \cdot p}{x}\right)}} \]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 4 p) p) (*.f64 x x)))) < -1

   1. Initial program 53.9

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Taylor expanded in x around -inf 30.6

      \[\leadsto \sqrt{0.5 \cdot \color{blue}{\left(2 \cdot \frac{{p}^{2}}{{x}^{2}}\right)}} \]

   3. Simplified 22.7

      \[\leadsto \sqrt{0.5 \cdot \color{blue}{\left(2 \cdot \left(\frac{p}{x} \cdot \frac{p}{x}\right)\right)}} \]
      Proof

      [Start] 30.6	\[ \sqrt{0.5 \cdot \left(2 \cdot \frac{{p}^{2}}{{x}^{2}}\right)} \]
      unpow2 [=>] 30.6	\[ \sqrt{0.5 \cdot \left(2 \cdot \frac{\color{blue}{p \cdot p}}{{x}^{2}}\right)} \]
      unpow2 [=>] 30.6	\[ \sqrt{0.5 \cdot \left(2 \cdot \frac{p \cdot p}{\color{blue}{x \cdot x}}\right)} \]
      times-frac [=>] 22.7	\[ \sqrt{0.5 \cdot \left(2 \cdot \color{blue}{\left(\frac{p}{x} \cdot \frac{p}{x}\right)}\right)} \]

   if -1 < (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 4 p) p) (*.f64 x x))))

   1. Initial program 0.2

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]

   2. Applied egg-rr 0.9

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, 2 \cdot p\right)}}\right)} - 1} \]

   3. Simplified 0.2

      \[\leadsto \color{blue}{\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, 2 \cdot p\right)}}} \]
      Proof

      [Start] 0.9	\[ e^{\mathsf{log1p}\left(\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, 2 \cdot p\right)}}\right)} - 1 \]
      expm1-def [=>] 0.9	\[ \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, 2 \cdot p\right)}}\right)\right)} \]
      expm1-log1p [=>] 0.2	\[ \color{blue}{\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, 2 \cdot p\right)}}} \]

3. Recombined 2 regimes into one program.

4. Final simplification 5.5

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{\sqrt{p \cdot \left(4 \cdot p\right) + x \cdot x}} \leq -1:\\ \;\;\;\;\sqrt{0.5 \cdot \left(2 \cdot \left(\frac{p}{x} \cdot \frac{p}{x}\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, p \cdot 2\right)}}\\ \end{array} \]

Alternatives

Alternative 1
Error	20.1
Cost	7256

\[\begin{array}{l} \mathbf{if}\;p \leq -1.35 \cdot 10^{-15}:\\ \;\;\;\;\sqrt{0.5}\\ \mathbf{elif}\;p \leq -2.85 \cdot 10^{-161}:\\ \;\;\;\;1\\ \mathbf{elif}\;p \leq -3.8 \cdot 10^{-254}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{elif}\;p \leq 6 \cdot 10^{-229}:\\ \;\;\;\;1\\ \mathbf{elif}\;p \leq 4.4 \cdot 10^{-195}:\\ \;\;\;\;\frac{-p}{x}\\ \mathbf{elif}\;p \leq 1.06 \cdot 10^{-40}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5}\\ \end{array} \]

Alternative 2
Error	35.5
Cost	720

\[\begin{array}{l} t_0 := \frac{-p}{x}\\ \mathbf{if}\;x \leq -8.2 \cdot 10^{+92}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -5 \cdot 10^{+31}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{elif}\;x \leq -4.55 \cdot 10^{-23}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq -1.55 \cdot 10^{-93}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 3
Error	35.8
Cost	324

\[\begin{array}{l} \mathbf{if}\;x \leq -1.65 \cdot 10^{-96}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 4
Error	40.9
Cost	64

\[1 \]

Reproduce

herbie shell --seed 2023016 
(FPCore (p x)
  :name "Given's Rotation SVD example"
  :precision binary64
  :pre (and (< 1e-150 (fabs x)) (< (fabs x) 1e+150))

  :herbie-target
  (sqrt (+ 0.5 (/ (copysign 0.5 x) (hypot 1.0 (/ (* 2.0 p) x)))))

  (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))