
(FPCore (p x) :precision binary64 (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))
double code(double p, double x) {
return sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
}
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
public static double code(double p, double x) {
return Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p) * p) + (x * x)))))));
}
def code(p, x): return math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p) * p) + (x * x)))))))
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 tmp = code(p, x) tmp = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x))))))); end
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]
\begin{array}{l}
\\
\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (p x) :precision binary64 (sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))
double code(double p, double x) {
return sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x)))))));
}
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
public static double code(double p, double x) {
return Math.sqrt((0.5 * (1.0 + (x / Math.sqrt((((4.0 * p) * p) + (x * x)))))));
}
def code(p, x): return math.sqrt((0.5 * (1.0 + (x / math.sqrt((((4.0 * p) * p) + (x * x)))))))
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 tmp = code(p, x) tmp = sqrt((0.5 * (1.0 + (x / sqrt((((4.0 * p) * p) + (x * x))))))); end
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]
\begin{array}{l}
\\
\sqrt{0.5 \cdot \left(1 + \frac{x}{\sqrt{\left(4 \cdot p\right) \cdot p + x \cdot x}}\right)}
\end{array}
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= (/ x (sqrt (+ (* p_m (* 4.0 p_m)) (* x x)))) -1.0) (/ p_m (- x)) (sqrt (* 0.5 (+ 1.0 (/ x (hypot (* p_m 2.0) x)))))))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if ((x / sqrt(((p_m * (4.0 * p_m)) + (x * x)))) <= -1.0) {
tmp = p_m / -x;
} else {
tmp = sqrt((0.5 * (1.0 + (x / hypot((p_m * 2.0), x)))));
}
return tmp;
}
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if ((x / Math.sqrt(((p_m * (4.0 * p_m)) + (x * x)))) <= -1.0) {
tmp = p_m / -x;
} else {
tmp = Math.sqrt((0.5 * (1.0 + (x / Math.hypot((p_m * 2.0), x)))));
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if (x / math.sqrt(((p_m * (4.0 * p_m)) + (x * x)))) <= -1.0: tmp = p_m / -x else: tmp = math.sqrt((0.5 * (1.0 + (x / math.hypot((p_m * 2.0), x))))) return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (Float64(x / sqrt(Float64(Float64(p_m * Float64(4.0 * p_m)) + Float64(x * x)))) <= -1.0) tmp = Float64(p_m / Float64(-x)); else tmp = sqrt(Float64(0.5 * Float64(1.0 + Float64(x / hypot(Float64(p_m * 2.0), x))))); end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if ((x / sqrt(((p_m * (4.0 * p_m)) + (x * x)))) <= -1.0) tmp = p_m / -x; else tmp = sqrt((0.5 * (1.0 + (x / hypot((p_m * 2.0), x))))); end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[N[(x / N[Sqrt[N[(N[(p$95$m * N[(4.0 * p$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1.0], N[(p$95$m / (-x)), $MachinePrecision], N[Sqrt[N[(0.5 * N[(1.0 + N[(x / N[Sqrt[N[(p$95$m * 2.0), $MachinePrecision] ^ 2 + x ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;\frac{x}{\sqrt{p\_m \cdot \left(4 \cdot p\_m\right) + x \cdot x}} \leq -1:\\
\;\;\;\;\frac{p\_m}{-x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 \cdot \left(1 + \frac{x}{\mathsf{hypot}\left(p\_m \cdot 2, x\right)}\right)}\\
\end{array}
\end{array}
if (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))) < -1Initial program 21.1%
add-sqr-sqrt21.1%
hypot-define21.1%
associate-*l*21.1%
sqrt-prod21.1%
metadata-eval21.1%
sqrt-unprod12.4%
add-sqr-sqrt21.1%
Applied egg-rr21.1%
Taylor expanded in x around -inf 60.9%
mul-1-neg60.9%
associate-/l*60.8%
distribute-rgt-neg-in60.8%
*-commutative60.8%
associate-/l*61.2%
distribute-rgt-neg-in61.2%
Simplified61.2%
add-sqr-sqrt61.1%
sqrt-unprod61.2%
swap-sqr61.0%
rem-square-sqrt61.4%
sqr-neg61.4%
frac-times61.2%
rem-square-sqrt61.5%
pow261.5%
Applied egg-rr61.5%
associate-*r/61.5%
metadata-eval61.5%
Simplified61.5%
Taylor expanded in x around -inf 61.7%
associate-*r/61.7%
neg-mul-161.7%
Simplified61.7%
if -1 < (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))) Initial program 100.0%
add-sqr-sqrt100.0%
hypot-define100.0%
associate-*l*100.0%
sqrt-prod100.0%
metadata-eval100.0%
sqrt-unprod51.9%
add-sqr-sqrt100.0%
Applied egg-rr100.0%
Final simplification89.7%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= p_m 1.8e-269) (/ p_m (- x)) (if (<= p_m 3.2e-21) 1.0 (sqrt 0.5))))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (p_m <= 1.8e-269) {
tmp = p_m / -x;
} else if (p_m <= 3.2e-21) {
tmp = 1.0;
} else {
tmp = sqrt(0.5);
}
return tmp;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
real(8) :: tmp
if (p_m <= 1.8d-269) then
tmp = p_m / -x
else if (p_m <= 3.2d-21) then
tmp = 1.0d0
else
tmp = sqrt(0.5d0)
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (p_m <= 1.8e-269) {
tmp = p_m / -x;
} else if (p_m <= 3.2e-21) {
tmp = 1.0;
} else {
tmp = Math.sqrt(0.5);
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if p_m <= 1.8e-269: tmp = p_m / -x elif p_m <= 3.2e-21: tmp = 1.0 else: tmp = math.sqrt(0.5) return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (p_m <= 1.8e-269) tmp = Float64(p_m / Float64(-x)); elseif (p_m <= 3.2e-21) tmp = 1.0; else tmp = sqrt(0.5); end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (p_m <= 1.8e-269) tmp = p_m / -x; elseif (p_m <= 3.2e-21) tmp = 1.0; else tmp = sqrt(0.5); end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[p$95$m, 1.8e-269], N[(p$95$m / (-x)), $MachinePrecision], If[LessEqual[p$95$m, 3.2e-21], 1.0, N[Sqrt[0.5], $MachinePrecision]]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;p\_m \leq 1.8 \cdot 10^{-269}:\\
\;\;\;\;\frac{p\_m}{-x}\\
\mathbf{elif}\;p\_m \leq 3.2 \cdot 10^{-21}:\\
\;\;\;\;1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if p < 1.79999999999999999e-269Initial program 77.3%
add-sqr-sqrt77.3%
hypot-define77.3%
associate-*l*77.3%
sqrt-prod77.3%
metadata-eval77.3%
sqrt-unprod6.1%
add-sqr-sqrt77.3%
Applied egg-rr77.3%
Taylor expanded in x around -inf 12.6%
mul-1-neg12.6%
associate-/l*12.6%
distribute-rgt-neg-in12.6%
*-commutative12.6%
associate-/l*12.6%
distribute-rgt-neg-in12.6%
Simplified12.6%
add-sqr-sqrt10.2%
sqrt-unprod11.1%
swap-sqr11.2%
rem-square-sqrt11.2%
sqr-neg11.2%
frac-times11.2%
rem-square-sqrt11.2%
pow211.2%
Applied egg-rr11.2%
associate-*r/11.2%
metadata-eval11.2%
Simplified11.2%
Taylor expanded in x around -inf 12.7%
associate-*r/12.7%
neg-mul-112.7%
Simplified12.7%
if 1.79999999999999999e-269 < p < 3.2000000000000002e-21Initial program 61.8%
Taylor expanded in x around inf 49.6%
if 3.2000000000000002e-21 < p Initial program 94.4%
Taylor expanded in x around 0 87.0%
Final simplification40.2%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= p_m 2e-73) (/ p_m (- x)) (sqrt 0.5)))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (p_m <= 2e-73) {
tmp = p_m / -x;
} else {
tmp = sqrt(0.5);
}
return tmp;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
real(8) :: tmp
if (p_m <= 2d-73) then
tmp = p_m / -x
else
tmp = sqrt(0.5d0)
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (p_m <= 2e-73) {
tmp = p_m / -x;
} else {
tmp = Math.sqrt(0.5);
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if p_m <= 2e-73: tmp = p_m / -x else: tmp = math.sqrt(0.5) return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (p_m <= 2e-73) tmp = Float64(p_m / Float64(-x)); else tmp = sqrt(0.5); end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (p_m <= 2e-73) tmp = p_m / -x; else tmp = sqrt(0.5); end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[p$95$m, 2e-73], N[(p$95$m / (-x)), $MachinePrecision], N[Sqrt[0.5], $MachinePrecision]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;p\_m \leq 2 \cdot 10^{-73}:\\
\;\;\;\;\frac{p\_m}{-x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if p < 1.99999999999999999e-73Initial program 72.6%
add-sqr-sqrt72.6%
hypot-define72.6%
associate-*l*72.6%
sqrt-prod72.6%
metadata-eval72.6%
sqrt-unprod19.5%
add-sqr-sqrt72.6%
Applied egg-rr72.6%
Taylor expanded in x around -inf 22.7%
mul-1-neg22.7%
associate-/l*22.7%
distribute-rgt-neg-in22.7%
*-commutative22.7%
associate-/l*22.8%
distribute-rgt-neg-in22.8%
Simplified22.8%
add-sqr-sqrt20.8%
sqrt-unprod22.0%
swap-sqr22.0%
rem-square-sqrt22.1%
sqr-neg22.1%
frac-times22.0%
rem-square-sqrt22.1%
pow222.1%
Applied egg-rr22.1%
associate-*r/22.1%
metadata-eval22.1%
Simplified22.1%
Taylor expanded in x around -inf 23.0%
associate-*r/23.0%
neg-mul-123.0%
Simplified23.0%
if 1.99999999999999999e-73 < p Initial program 93.6%
Taylor expanded in x around 0 83.9%
Final simplification40.9%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= x -3.9e-150) (/ p_m (- x)) 1.5))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (x <= -3.9e-150) {
tmp = p_m / -x;
} else {
tmp = 1.5;
}
return tmp;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
real(8) :: tmp
if (x <= (-3.9d-150)) then
tmp = p_m / -x
else
tmp = 1.5d0
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (x <= -3.9e-150) {
tmp = p_m / -x;
} else {
tmp = 1.5;
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if x <= -3.9e-150: tmp = p_m / -x else: tmp = 1.5 return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (x <= -3.9e-150) tmp = Float64(p_m / Float64(-x)); else tmp = 1.5; end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (x <= -3.9e-150) tmp = p_m / -x; else tmp = 1.5; end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[x, -3.9e-150], N[(p$95$m / (-x)), $MachinePrecision], 1.5]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;x \leq -3.9 \cdot 10^{-150}:\\
\;\;\;\;\frac{p\_m}{-x}\\
\mathbf{else}:\\
\;\;\;\;1.5\\
\end{array}
\end{array}
if x < -3.9000000000000002e-150Initial program 58.8%
add-sqr-sqrt58.8%
hypot-define58.8%
associate-*l*58.8%
sqrt-prod58.8%
metadata-eval58.8%
sqrt-unprod30.7%
add-sqr-sqrt58.8%
Applied egg-rr58.8%
Taylor expanded in x around -inf 33.4%
mul-1-neg33.4%
associate-/l*33.3%
distribute-rgt-neg-in33.3%
*-commutative33.3%
associate-/l*33.5%
distribute-rgt-neg-in33.5%
Simplified33.5%
add-sqr-sqrt33.5%
sqrt-unprod33.5%
swap-sqr33.4%
rem-square-sqrt33.6%
sqr-neg33.6%
frac-times33.5%
rem-square-sqrt33.7%
pow233.7%
Applied egg-rr33.7%
associate-*r/33.7%
metadata-eval33.7%
Simplified33.7%
Taylor expanded in x around -inf 33.8%
associate-*r/33.8%
neg-mul-133.8%
Simplified33.8%
if -3.9000000000000002e-150 < x Initial program 100.0%
Taylor expanded in x around 0 54.8%
Applied egg-rr19.5%
Final simplification26.9%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= x -2.4e+15) 0.0 1.5))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (x <= -2.4e+15) {
tmp = 0.0;
} else {
tmp = 1.5;
}
return tmp;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
real(8) :: tmp
if (x <= (-2.4d+15)) then
tmp = 0.0d0
else
tmp = 1.5d0
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (x <= -2.4e+15) {
tmp = 0.0;
} else {
tmp = 1.5;
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if x <= -2.4e+15: tmp = 0.0 else: tmp = 1.5 return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (x <= -2.4e+15) tmp = 0.0; else tmp = 1.5; end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (x <= -2.4e+15) tmp = 0.0; else tmp = 1.5; end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[x, -2.4e+15], 0.0, 1.5]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2.4 \cdot 10^{+15}:\\
\;\;\;\;0\\
\mathbf{else}:\\
\;\;\;\;1.5\\
\end{array}
\end{array}
if x < -2.4e15Initial program 53.8%
Taylor expanded in x around -inf 22.5%
neg-mul-122.5%
Simplified22.5%
Taylor expanded in x around 0 22.5%
if -2.4e15 < x Initial program 86.7%
Taylor expanded in x around 0 57.8%
Applied egg-rr17.3%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= x -1.7e+15) 0.0 0.125))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (x <= -1.7e+15) {
tmp = 0.0;
} else {
tmp = 0.125;
}
return tmp;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
real(8) :: tmp
if (x <= (-1.7d+15)) then
tmp = 0.0d0
else
tmp = 0.125d0
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (x <= -1.7e+15) {
tmp = 0.0;
} else {
tmp = 0.125;
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if x <= -1.7e+15: tmp = 0.0 else: tmp = 0.125 return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (x <= -1.7e+15) tmp = 0.0; else tmp = 0.125; end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (x <= -1.7e+15) tmp = 0.0; else tmp = 0.125; end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[x, -1.7e+15], 0.0, 0.125]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.7 \cdot 10^{+15}:\\
\;\;\;\;0\\
\mathbf{else}:\\
\;\;\;\;0.125\\
\end{array}
\end{array}
if x < -1.7e15Initial program 53.8%
Taylor expanded in x around -inf 22.5%
neg-mul-122.5%
Simplified22.5%
Taylor expanded in x around 0 22.5%
if -1.7e15 < x Initial program 86.7%
Taylor expanded in x around 0 57.8%
Applied egg-rr15.0%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 0.0)
p_m = fabs(p);
double code(double p_m, double x) {
return 0.0;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
code = 0.0d0
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
return 0.0;
}
p_m = math.fabs(p) def code(p_m, x): return 0.0
p_m = abs(p) function code(p_m, x) return 0.0 end
p_m = abs(p); function tmp = code(p_m, x) tmp = 0.0; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := 0.0
\begin{array}{l}
p_m = \left|p\right|
\\
0
\end{array}
Initial program 78.7%
Taylor expanded in x around -inf 8.0%
neg-mul-18.0%
Simplified8.0%
Taylor expanded in x around 0 8.0%
(FPCore (p x) :precision binary64 (sqrt (+ 0.5 (/ (copysign 0.5 x) (hypot 1.0 (/ (* 2.0 p) x))))))
double code(double p, double x) {
return sqrt((0.5 + (copysign(0.5, x) / hypot(1.0, ((2.0 * p) / x)))));
}
public static double code(double p, double x) {
return Math.sqrt((0.5 + (Math.copySign(0.5, x) / Math.hypot(1.0, ((2.0 * p) / x)))));
}
def code(p, x): return math.sqrt((0.5 + (math.copysign(0.5, x) / math.hypot(1.0, ((2.0 * p) / x)))))
function code(p, x) return sqrt(Float64(0.5 + Float64(copysign(0.5, x) / hypot(1.0, Float64(Float64(2.0 * p) / x))))) end
function tmp = code(p, x) tmp = sqrt((0.5 + ((sign(x) * abs(0.5)) / hypot(1.0, ((2.0 * p) / x))))); end
code[p_, x_] := N[Sqrt[N[(0.5 + N[(N[With[{TMP1 = Abs[0.5], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] / N[Sqrt[1.0 ^ 2 + N[(N[(2.0 * p), $MachinePrecision] / x), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{0.5 + \frac{\mathsf{copysign}\left(0.5, x\right)}{\mathsf{hypot}\left(1, \frac{2 \cdot p}{x}\right)}}
\end{array}
herbie shell --seed 2024145
(FPCore (p x)
:name "Given's Rotation SVD example"
:precision binary64
:pre (and (< 1e-150 (fabs x)) (< (fabs x) 1e+150))
:alt
(! :herbie-platform default (sqrt (+ 1/2 (/ (copysign 1/2 x) (hypot 1 (/ (* 2 p) x))))))
(sqrt (* 0.5 (+ 1.0 (/ x (sqrt (+ (* (* 4.0 p) p) (* x x))))))))