
(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 6 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 (let* ((t_0 (/ x (sqrt (+ (* p_m (* 4.0 p_m)) (* x x)))))) (if (<= t_0 -1.0) (/ (- 0.0 p_m) x) (sqrt (* 0.5 (+ t_0 1.0))))))
p_m = fabs(p);
double code(double p_m, double x) {
double t_0 = x / sqrt(((p_m * (4.0 * p_m)) + (x * x)));
double tmp;
if (t_0 <= -1.0) {
tmp = (0.0 - p_m) / x;
} else {
tmp = sqrt((0.5 * (t_0 + 1.0)));
}
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) :: t_0
real(8) :: tmp
t_0 = x / sqrt(((p_m * (4.0d0 * p_m)) + (x * x)))
if (t_0 <= (-1.0d0)) then
tmp = (0.0d0 - p_m) / x
else
tmp = sqrt((0.5d0 * (t_0 + 1.0d0)))
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double t_0 = x / Math.sqrt(((p_m * (4.0 * p_m)) + (x * x)));
double tmp;
if (t_0 <= -1.0) {
tmp = (0.0 - p_m) / x;
} else {
tmp = Math.sqrt((0.5 * (t_0 + 1.0)));
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): t_0 = x / math.sqrt(((p_m * (4.0 * p_m)) + (x * x))) tmp = 0 if t_0 <= -1.0: tmp = (0.0 - p_m) / x else: tmp = math.sqrt((0.5 * (t_0 + 1.0))) return tmp
p_m = abs(p) function code(p_m, x) t_0 = Float64(x / sqrt(Float64(Float64(p_m * Float64(4.0 * p_m)) + Float64(x * x)))) tmp = 0.0 if (t_0 <= -1.0) tmp = Float64(Float64(0.0 - p_m) / x); else tmp = sqrt(Float64(0.5 * Float64(t_0 + 1.0))); end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) t_0 = x / sqrt(((p_m * (4.0 * p_m)) + (x * x))); tmp = 0.0; if (t_0 <= -1.0) tmp = (0.0 - p_m) / x; else tmp = sqrt((0.5 * (t_0 + 1.0))); end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision]
code[p$95$m_, x_] := Block[{t$95$0 = N[(x / N[Sqrt[N[(N[(p$95$m * N[(4.0 * p$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1.0], N[(N[(0.0 - p$95$m), $MachinePrecision] / x), $MachinePrecision], N[Sqrt[N[(0.5 * N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
t_0 := \frac{x}{\sqrt{p\_m \cdot \left(4 \cdot p\_m\right) + x \cdot x}}\\
\mathbf{if}\;t\_0 \leq -1:\\
\;\;\;\;\frac{0 - p\_m}{x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 \cdot \left(t\_0 + 1\right)}\\
\end{array}
\end{array}
if (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))) < -1Initial program 14.7%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6414.7%
Simplified14.7%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f6457.7%
Simplified57.7%
sub0-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f6457.7%
Applied egg-rr57.7%
if -1 < (/.f64 x (sqrt.f64 (+.f64 (*.f64 (*.f64 #s(literal 4 binary64) p) p) (*.f64 x x)))) Initial program 100.0%
Final simplification89.2%
p_m = (fabs.f64 p)
(FPCore (p_m x)
:precision binary64
(if (<= x -155000000.0)
(/ (- 0.0 p_m) x)
(sqrt
(+
0.5
(*
x
(/
0.5
(+
x
(*
p_m
(* p_m (+ (/ (* (* p_m p_m) -2.0) (* x (* x x))) (/ 2.0 x)))))))))))p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (x <= -155000000.0) {
tmp = (0.0 - p_m) / x;
} else {
tmp = sqrt((0.5 + (x * (0.5 / (x + (p_m * (p_m * ((((p_m * p_m) * -2.0) / (x * (x * x))) + (2.0 / x)))))))));
}
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 <= (-155000000.0d0)) then
tmp = (0.0d0 - p_m) / x
else
tmp = sqrt((0.5d0 + (x * (0.5d0 / (x + (p_m * (p_m * ((((p_m * p_m) * (-2.0d0)) / (x * (x * x))) + (2.0d0 / x)))))))))
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (x <= -155000000.0) {
tmp = (0.0 - p_m) / x;
} else {
tmp = Math.sqrt((0.5 + (x * (0.5 / (x + (p_m * (p_m * ((((p_m * p_m) * -2.0) / (x * (x * x))) + (2.0 / x)))))))));
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if x <= -155000000.0: tmp = (0.0 - p_m) / x else: tmp = math.sqrt((0.5 + (x * (0.5 / (x + (p_m * (p_m * ((((p_m * p_m) * -2.0) / (x * (x * x))) + (2.0 / x))))))))) return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (x <= -155000000.0) tmp = Float64(Float64(0.0 - p_m) / x); else tmp = sqrt(Float64(0.5 + Float64(x * Float64(0.5 / Float64(x + Float64(p_m * Float64(p_m * Float64(Float64(Float64(Float64(p_m * p_m) * -2.0) / Float64(x * Float64(x * x))) + Float64(2.0 / x))))))))); end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (x <= -155000000.0) tmp = (0.0 - p_m) / x; else tmp = sqrt((0.5 + (x * (0.5 / (x + (p_m * (p_m * ((((p_m * p_m) * -2.0) / (x * (x * x))) + (2.0 / x))))))))); end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[x, -155000000.0], N[(N[(0.0 - p$95$m), $MachinePrecision] / x), $MachinePrecision], N[Sqrt[N[(0.5 + N[(x * N[(0.5 / N[(x + N[(p$95$m * N[(p$95$m * N[(N[(N[(N[(p$95$m * p$95$m), $MachinePrecision] * -2.0), $MachinePrecision] / N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(2.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;x \leq -155000000:\\
\;\;\;\;\frac{0 - p\_m}{x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 + x \cdot \frac{0.5}{x + p\_m \cdot \left(p\_m \cdot \left(\frac{\left(p\_m \cdot p\_m\right) \cdot -2}{x \cdot \left(x \cdot x\right)} + \frac{2}{x}\right)\right)}}\\
\end{array}
\end{array}
if x < -1.55e8Initial program 45.2%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6445.2%
Simplified45.2%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f6439.6%
Simplified39.6%
sub0-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f6439.6%
Applied egg-rr39.6%
if -1.55e8 < x Initial program 90.4%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.4%
Simplified90.4%
Taylor expanded in p around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6483.4%
Simplified83.4%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
Applied egg-rr83.4%
Final simplification71.7%
p_m = (fabs.f64 p)
(FPCore (p_m x)
:precision binary64
(if (<= p_m 9.5e-262)
1.0
(if (<= p_m 4.8e-27)
(/ (- 0.0 p_m) x)
(sqrt (+ 0.5 (/ (* x 0.5) (+ (* p_m 2.0) (* x (* x (/ 0.25 p_m))))))))))p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (p_m <= 9.5e-262) {
tmp = 1.0;
} else if (p_m <= 4.8e-27) {
tmp = (0.0 - p_m) / x;
} else {
tmp = sqrt((0.5 + ((x * 0.5) / ((p_m * 2.0) + (x * (x * (0.25 / p_m)))))));
}
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 <= 9.5d-262) then
tmp = 1.0d0
else if (p_m <= 4.8d-27) then
tmp = (0.0d0 - p_m) / x
else
tmp = sqrt((0.5d0 + ((x * 0.5d0) / ((p_m * 2.0d0) + (x * (x * (0.25d0 / p_m)))))))
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 <= 9.5e-262) {
tmp = 1.0;
} else if (p_m <= 4.8e-27) {
tmp = (0.0 - p_m) / x;
} else {
tmp = Math.sqrt((0.5 + ((x * 0.5) / ((p_m * 2.0) + (x * (x * (0.25 / p_m)))))));
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if p_m <= 9.5e-262: tmp = 1.0 elif p_m <= 4.8e-27: tmp = (0.0 - p_m) / x else: tmp = math.sqrt((0.5 + ((x * 0.5) / ((p_m * 2.0) + (x * (x * (0.25 / p_m))))))) return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (p_m <= 9.5e-262) tmp = 1.0; elseif (p_m <= 4.8e-27) tmp = Float64(Float64(0.0 - p_m) / x); else tmp = sqrt(Float64(0.5 + Float64(Float64(x * 0.5) / Float64(Float64(p_m * 2.0) + Float64(x * Float64(x * Float64(0.25 / p_m))))))); end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (p_m <= 9.5e-262) tmp = 1.0; elseif (p_m <= 4.8e-27) tmp = (0.0 - p_m) / x; else tmp = sqrt((0.5 + ((x * 0.5) / ((p_m * 2.0) + (x * (x * (0.25 / p_m))))))); end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[p$95$m, 9.5e-262], 1.0, If[LessEqual[p$95$m, 4.8e-27], N[(N[(0.0 - p$95$m), $MachinePrecision] / x), $MachinePrecision], N[Sqrt[N[(0.5 + N[(N[(x * 0.5), $MachinePrecision] / N[(N[(p$95$m * 2.0), $MachinePrecision] + N[(x * N[(x * N[(0.25 / p$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;p\_m \leq 9.5 \cdot 10^{-262}:\\
\;\;\;\;1\\
\mathbf{elif}\;p\_m \leq 4.8 \cdot 10^{-27}:\\
\;\;\;\;\frac{0 - p\_m}{x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5 + \frac{x \cdot 0.5}{p\_m \cdot 2 + x \cdot \left(x \cdot \frac{0.25}{p\_m}\right)}}\\
\end{array}
\end{array}
if p < 9.4999999999999999e-262Initial program 78.5%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.5%
Simplified78.5%
Taylor expanded in x around inf
Simplified34.3%
if 9.4999999999999999e-262 < p < 4.80000000000000004e-27Initial program 60.9%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.9%
Simplified60.9%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f6450.2%
Simplified50.2%
sub0-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f6450.2%
Applied egg-rr50.2%
if 4.80000000000000004e-27 < p Initial program 92.5%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.5%
Simplified92.5%
Taylor expanded in x around 0
+-commutativeN/A
associate-*r/N/A
associate-*l/N/A
metadata-evalN/A
associate-*r/N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r/N/A
metadata-evalN/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
*-lowering-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
metadata-evalN/A
associate-*r/N/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
/-lowering-/.f6490.3%
Simplified90.3%
Final simplification51.6%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= p_m 1.3e-259) 1.0 (if (<= p_m 5.5e-28) (/ (- 0.0 p_m) x) (sqrt 0.5))))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (p_m <= 1.3e-259) {
tmp = 1.0;
} else if (p_m <= 5.5e-28) {
tmp = (0.0 - 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 <= 1.3d-259) then
tmp = 1.0d0
else if (p_m <= 5.5d-28) then
tmp = (0.0d0 - 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 <= 1.3e-259) {
tmp = 1.0;
} else if (p_m <= 5.5e-28) {
tmp = (0.0 - 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 <= 1.3e-259: tmp = 1.0 elif p_m <= 5.5e-28: tmp = (0.0 - 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 <= 1.3e-259) tmp = 1.0; elseif (p_m <= 5.5e-28) tmp = Float64(Float64(0.0 - p_m) / 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 <= 1.3e-259) tmp = 1.0; elseif (p_m <= 5.5e-28) tmp = (0.0 - 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, 1.3e-259], 1.0, If[LessEqual[p$95$m, 5.5e-28], N[(N[(0.0 - p$95$m), $MachinePrecision] / x), $MachinePrecision], N[Sqrt[0.5], $MachinePrecision]]]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;p\_m \leq 1.3 \cdot 10^{-259}:\\
\;\;\;\;1\\
\mathbf{elif}\;p\_m \leq 5.5 \cdot 10^{-28}:\\
\;\;\;\;\frac{0 - p\_m}{x}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{0.5}\\
\end{array}
\end{array}
if p < 1.3e-259Initial program 78.5%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.5%
Simplified78.5%
Taylor expanded in x around inf
Simplified34.3%
if 1.3e-259 < p < 5.49999999999999967e-28Initial program 60.9%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.9%
Simplified60.9%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f6450.2%
Simplified50.2%
sub0-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f6450.2%
Applied egg-rr50.2%
if 5.49999999999999967e-28 < p Initial program 92.5%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.5%
Simplified92.5%
Taylor expanded in x around 0
sqrt-lowering-sqrt.f6489.7%
Simplified89.7%
Final simplification51.4%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 (if (<= x -2e-146) (/ (- 0.0 p_m) x) 1.0))
p_m = fabs(p);
double code(double p_m, double x) {
double tmp;
if (x <= -2e-146) {
tmp = (0.0 - p_m) / x;
} else {
tmp = 1.0;
}
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 <= (-2d-146)) then
tmp = (0.0d0 - p_m) / x
else
tmp = 1.0d0
end if
code = tmp
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
double tmp;
if (x <= -2e-146) {
tmp = (0.0 - p_m) / x;
} else {
tmp = 1.0;
}
return tmp;
}
p_m = math.fabs(p) def code(p_m, x): tmp = 0 if x <= -2e-146: tmp = (0.0 - p_m) / x else: tmp = 1.0 return tmp
p_m = abs(p) function code(p_m, x) tmp = 0.0 if (x <= -2e-146) tmp = Float64(Float64(0.0 - p_m) / x); else tmp = 1.0; end return tmp end
p_m = abs(p); function tmp_2 = code(p_m, x) tmp = 0.0; if (x <= -2e-146) tmp = (0.0 - p_m) / x; else tmp = 1.0; end tmp_2 = tmp; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := If[LessEqual[x, -2e-146], N[(N[(0.0 - p$95$m), $MachinePrecision] / x), $MachinePrecision], 1.0]
\begin{array}{l}
p_m = \left|p\right|
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2 \cdot 10^{-146}:\\
\;\;\;\;\frac{0 - p\_m}{x}\\
\mathbf{else}:\\
\;\;\;\;1\\
\end{array}
\end{array}
if x < -2.00000000000000005e-146Initial program 58.6%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.6%
Simplified58.6%
Taylor expanded in x around -inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
/-lowering-/.f6429.4%
Simplified29.4%
sub0-negN/A
neg-lowering-neg.f64N/A
/-lowering-/.f6429.4%
Applied egg-rr29.4%
if -2.00000000000000005e-146 < x Initial program 100.0%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Taylor expanded in x around inf
Simplified58.1%
Final simplification43.1%
p_m = (fabs.f64 p) (FPCore (p_m x) :precision binary64 1.0)
p_m = fabs(p);
double code(double p_m, double x) {
return 1.0;
}
p_m = abs(p)
real(8) function code(p_m, x)
real(8), intent (in) :: p_m
real(8), intent (in) :: x
code = 1.0d0
end function
p_m = Math.abs(p);
public static double code(double p_m, double x) {
return 1.0;
}
p_m = math.fabs(p) def code(p_m, x): return 1.0
p_m = abs(p) function code(p_m, x) return 1.0 end
p_m = abs(p); function tmp = code(p_m, x) tmp = 1.0; end
p_m = N[Abs[p], $MachinePrecision] code[p$95$m_, x_] := 1.0
\begin{array}{l}
p_m = \left|p\right|
\\
1
\end{array}
Initial program 78.4%
sqrt-lowering-sqrt.f64N/A
distribute-rgt-inN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6478.4%
Simplified78.4%
Taylor expanded in x around inf
Simplified34.4%
(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 2024161
(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))))))))