Given's Rotation SVD example

Average Error: 20.35% → 9%

Time: 7.7s

Precision: binary64

Cost: 20932

\[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} t_0 := \frac{x}{\sqrt{p \cdot \left(4 \cdot p\right) + x \cdot x}}\\ \mathbf{if}\;t_0 \leq -1:\\ \;\;\;\;\sqrt{0.5 \cdot \left(2 \cdot \left(\frac{p}{x} \cdot \frac{p}{x}\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 \cdot \left(t_0 + 1\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
 (let* ((t_0 (/ x (sqrt (+ (* p (* 4.0 p)) (* x x))))))
   (if (<= t_0 -1.0)
     (sqrt (* 0.5 (* 2.0 (* (/ p x) (/ p x)))))
     (sqrt (* 0.5 (+ t_0 1.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 t_0 = x / sqrt(((p * (4.0 * p)) + (x * x)));
	double tmp;
	if (t_0 <= -1.0) {
		tmp = sqrt((0.5 * (2.0 * ((p / x) * (p / x)))));
	} else {
		tmp = sqrt((0.5 * (t_0 + 1.0)));
	}
	return tmp;
}

Fortran

real(8) function code(p, x)
    real(8), intent (in) :: p
    real(8), intent (in) :: x
    code = sqrt((0.5d0 * (1.0d0 + (x / sqrt((((4.0d0 * p) * p) + (x * x)))))))
end function

↓

real(8) function code(p, x)
    real(8), intent (in) :: p
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x / sqrt(((p * (4.0d0 * p)) + (x * x)))
    if (t_0 <= (-1.0d0)) then
        tmp = sqrt((0.5d0 * (2.0d0 * ((p / x) * (p / x)))))
    else
        tmp = sqrt((0.5d0 * (t_0 + 1.0d0)))
    end if
    code = tmp
end function

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 t_0 = x / Math.sqrt(((p * (4.0 * p)) + (x * x)));
	double tmp;
	if (t_0 <= -1.0) {
		tmp = Math.sqrt((0.5 * (2.0 * ((p / x) * (p / x)))));
	} else {
		tmp = Math.sqrt((0.5 * (t_0 + 1.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):
	t_0 = x / math.sqrt(((p * (4.0 * p)) + (x * x)))
	tmp = 0
	if t_0 <= -1.0:
		tmp = math.sqrt((0.5 * (2.0 * ((p / x) * (p / x)))))
	else:
		tmp = math.sqrt((0.5 * (t_0 + 1.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)
	t_0 = Float64(x / sqrt(Float64(Float64(p * Float64(4.0 * p)) + Float64(x * x))))
	tmp = 0.0
	if (t_0 <= -1.0)
		tmp = sqrt(Float64(0.5 * Float64(2.0 * Float64(Float64(p / x) * Float64(p / x)))));
	else
		tmp = sqrt(Float64(0.5 * Float64(t_0 + 1.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)
	t_0 = x / sqrt(((p * (4.0 * p)) + (x * x)));
	tmp = 0.0;
	if (t_0 <= -1.0)
		tmp = sqrt((0.5 * (2.0 * ((p / x) * (p / x)))));
	else
		tmp = sqrt((0.5 * (t_0 + 1.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_] := Block[{t$95$0 = N[(x / N[Sqrt[N[(N[(p * N[(4.0 * p), $MachinePrecision]), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -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[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]

Target

Original	20.35%
Target	20.34%
Herbie	9%

\[\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 83.88

      \[\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 48.81

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

   3. Simplified 36.37

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

      [Start] 48.81	\[ \sqrt{0.5 \cdot \left(2 \cdot \frac{{p}^{2}}{{x}^{2}}\right)} \]
      unpow2 [=>] 48.81	\[ \sqrt{0.5 \cdot \left(2 \cdot \frac{\color{blue}{p \cdot p}}{{x}^{2}}\right)} \]
      unpow2 [=>] 48.81	\[ \sqrt{0.5 \cdot \left(2 \cdot \frac{p \cdot p}{\color{blue}{x \cdot x}}\right)} \]
      times-frac [=>] 36.37	\[ \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.42

      \[\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 9

   \[\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 \cdot \left(\frac{x}{\sqrt{p \cdot \left(4 \cdot p\right) + x \cdot x}} + 1\right)}\\ \end{array} \]

Alternatives

Alternative 1
Error	21.63%
Cost	13970

\[\begin{array}{l} \mathbf{if}\;p \leq -2.9 \cdot 10^{-42} \lor \neg \left(p \leq -1.6 \cdot 10^{-70}\right) \land \left(p \leq -3.6 \cdot 10^{-123} \lor \neg \left(p \leq -5.9 \cdot 10^{-210}\right)\right):\\ \;\;\;\;\sqrt{0.5 + x \cdot \frac{0.5}{\mathsf{hypot}\left(x, p \cdot 2\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{p}{x}\\ \end{array} \]

Alternative 2
Error	32.08%
Cost	7244

\[\begin{array}{l} \mathbf{if}\;p \leq -3.5 \cdot 10^{-42}:\\ \;\;\;\;\sqrt{0.5}\\ \mathbf{elif}\;p \leq -3.1 \cdot 10^{-211}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{elif}\;p \leq 2.5 \cdot 10^{+30}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5 + x \cdot \frac{0.25}{p}}\\ \end{array} \]

Alternative 3
Error	32.1%
Cost	6860

\[\begin{array}{l} \mathbf{if}\;p \leq -2.9 \cdot 10^{-42}:\\ \;\;\;\;\sqrt{0.5}\\ \mathbf{elif}\;p \leq -1.9 \cdot 10^{-211}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{elif}\;p \leq 2.5 \cdot 10^{+30}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5}\\ \end{array} \]

Alternative 4
Error	55.01%
Cost	588

\[\begin{array}{l} \mathbf{if}\;x \leq -2.7 \cdot 10^{+35}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{elif}\;x \leq -37000:\\ \;\;\;\;\frac{-p}{x}\\ \mathbf{elif}\;x \leq -3.1 \cdot 10^{-149}:\\ \;\;\;\;\frac{p}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 5
Error	54.95%
Cost	324

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

Alternative 6
Error	63.55%
Cost	64

\[1 \]

Reproduce

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