
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z) :precision binary64 (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))
double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
real(8) function code(x, y, z)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function
public static double code(double x, double y, double z) {
return (1.0 / x) / (y * (1.0 + (z * z)));
}
def code(x, y, z): return (1.0 / x) / (y * (1.0 + (z * z)))
function code(x, y, z) return Float64(Float64(1.0 / x) / Float64(y * Float64(1.0 + Float64(z * z)))) end
function tmp = code(x, y, z) tmp = (1.0 / x) / (y * (1.0 + (z * z))); end
code[x_, y_, z_] := N[(N[(1.0 / x), $MachinePrecision] / N[(y * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\frac{1}{x}}{y \cdot \left(1 + z \cdot z\right)}
\end{array}
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e+306)
(/ (/ 1.0 (* x_m (fma z z 1.0))) y_m)
(/ (/ 1.0 (* z y_m)) (* z x_m))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+306) {
tmp = (1.0 / (x_m * fma(z, z, 1.0))) / y_m;
} else {
tmp = (1.0 / (z * y_m)) / (z * x_m);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+306) tmp = Float64(Float64(1.0 / Float64(x_m * fma(z, z, 1.0))) / y_m); else tmp = Float64(Float64(1.0 / Float64(z * y_m)) / Float64(z * x_m)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+306], N[(N[(1.0 / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision], N[(N[(1.0 / N[(z * y$95$m), $MachinePrecision]), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+306}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}}{y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z \cdot y\_m}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000003e306Initial program 96.1%
lift-/.f64N/A
lift-*.f64N/A
lift-+.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
clear-numN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-*.f6496.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6496.7
Applied egg-rr96.7%
if 2.00000000000000003e306 < (*.f64 z z) Initial program 79.4%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.4
Simplified79.4%
metadata-evalN/A
remove-double-negN/A
associate-*r*N/A
lift-*.f64N/A
frac-timesN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
frac-2negN/A
frac-timesN/A
metadata-evalN/A
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied egg-rr99.9%
Final simplification97.6%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e-6)
(- (/ (fma z z -1.0) (* x_m y_m)))
(if (<= (* z z) 5e+302)
(/ 1.0 (* y_m (* (* z z) x_m)))
(/ 1.0 (* z (* x_m (* z y_m)))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-6) {
tmp = -(fma(z, z, -1.0) / (x_m * y_m));
} else if ((z * z) <= 5e+302) {
tmp = 1.0 / (y_m * ((z * z) * x_m));
} else {
tmp = 1.0 / (z * (x_m * (z * y_m)));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-6) tmp = Float64(-Float64(fma(z, z, -1.0) / Float64(x_m * y_m))); elseif (Float64(z * z) <= 5e+302) tmp = Float64(1.0 / Float64(y_m * Float64(Float64(z * z) * x_m))); else tmp = Float64(1.0 / Float64(z * Float64(x_m * Float64(z * y_m)))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-6], (-N[(N[(z * z + -1.0), $MachinePrecision] / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), If[LessEqual[N[(z * z), $MachinePrecision], 5e+302], N[(1.0 / N[(y$95$m * N[(N[(z * z), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-6}:\\
\;\;\;\;-\frac{\mathsf{fma}\left(z, z, -1\right)}{x\_m \cdot y\_m}\\
\mathbf{elif}\;z \cdot z \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(\left(z \cdot z\right) \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(x\_m \cdot \left(z \cdot y\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999991e-6Initial program 99.5%
Taylor expanded in z around 0
*-rgt-identityN/A
cancel-sign-subN/A
mul-1-negN/A
distribute-neg-frac2N/A
*-rgt-identityN/A
distribute-neg-frac2N/A
div-subN/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-*.f6499.0
Simplified99.0%
if 1.99999999999999991e-6 < (*.f64 z z) < 5e302Initial program 88.4%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6486.6
Simplified86.6%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6486.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.7
Applied egg-rr86.7%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6488.3
Applied egg-rr88.3%
if 5e302 < (*.f64 z z) Initial program 79.7%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.7
Simplified79.7%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6498.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6498.4
Applied egg-rr98.4%
Final simplification96.4%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* y_m (+ (* z z) 1.0)) 2e+305)
(/ 1.0 (* x_m (fma y_m (* z z) y_m)))
(/ 1.0 (* z (* y_m (* z x_m))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((y_m * ((z * z) + 1.0)) <= 2e+305) {
tmp = 1.0 / (x_m * fma(y_m, (z * z), y_m));
} else {
tmp = 1.0 / (z * (y_m * (z * x_m)));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(y_m * Float64(Float64(z * z) + 1.0)) <= 2e+305) tmp = Float64(1.0 / Float64(x_m * fma(y_m, Float64(z * z), y_m))); else tmp = Float64(1.0 / Float64(z * Float64(y_m * Float64(z * x_m)))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * N[(N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], 2e+305], N[(1.0 / N[(x$95$m * N[(y$95$m * N[(z * z), $MachinePrecision] + y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(y$95$m * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;y\_m \cdot \left(z \cdot z + 1\right) \leq 2 \cdot 10^{+305}:\\
\;\;\;\;\frac{1}{x\_m \cdot \mathsf{fma}\left(y\_m, z \cdot z, y\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(y\_m \cdot \left(z \cdot x\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 1.9999999999999999e305Initial program 95.9%
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6495.3
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f6495.3
Applied egg-rr95.3%
if 1.9999999999999999e305 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) Initial program 76.8%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6476.8
Simplified76.8%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6491.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.6
Applied egg-rr91.6%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6498.0
Applied egg-rr98.0%
Final simplification95.9%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 5e+302)
(/ (/ 1.0 y_m) (* x_m (fma z z 1.0)))
(/ (/ 1.0 (* z y_m)) (* z x_m))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 5e+302) {
tmp = (1.0 / y_m) / (x_m * fma(z, z, 1.0));
} else {
tmp = (1.0 / (z * y_m)) / (z * x_m);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 5e+302) tmp = Float64(Float64(1.0 / y_m) / Float64(x_m * fma(z, z, 1.0))); else tmp = Float64(Float64(1.0 / Float64(z * y_m)) / Float64(z * x_m)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+302], N[(N[(1.0 / y$95$m), $MachinePrecision] / N[(x$95$m * N[(z * z + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * y$95$m), $MachinePrecision]), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{\frac{1}{y\_m}}{x\_m \cdot \mathsf{fma}\left(z, z, 1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z \cdot y\_m}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5e302Initial program 96.1%
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-*.f6496.8
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6496.8
Applied egg-rr96.8%
if 5e302 < (*.f64 z z) Initial program 79.7%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.7
Simplified79.7%
metadata-evalN/A
remove-double-negN/A
associate-*r*N/A
lift-*.f64N/A
frac-timesN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
frac-2negN/A
frac-timesN/A
metadata-evalN/A
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied egg-rr99.9%
Final simplification97.6%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e+306)
(/ 1.0 (* y_m (fma x_m (* z z) x_m)))
(/ (/ 1.0 (* z y_m)) (* z x_m))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+306) {
tmp = 1.0 / (y_m * fma(x_m, (z * z), x_m));
} else {
tmp = (1.0 / (z * y_m)) / (z * x_m);
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+306) tmp = Float64(1.0 / Float64(y_m * fma(x_m, Float64(z * z), x_m))); else tmp = Float64(Float64(1.0 / Float64(z * y_m)) / Float64(z * x_m)); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+306], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision] + x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(z * y$95$m), $MachinePrecision]), $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+306}:\\
\;\;\;\;\frac{1}{y\_m \cdot \mathsf{fma}\left(x\_m, z \cdot z, x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{z \cdot y\_m}}{z \cdot x\_m}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000003e306Initial program 96.1%
lift-/.f64N/A
lift-*.f64N/A
lift-+.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
clear-numN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-*.f6496.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6496.7
Applied egg-rr96.7%
lift-fma.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft1-inN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-fma.f64N/A
lower-*.f6495.5
lift-fma.f64N/A
Applied egg-rr95.5%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-/.f6495.5
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
Applied egg-rr96.1%
if 2.00000000000000003e306 < (*.f64 z z) Initial program 79.4%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.4
Simplified79.4%
metadata-evalN/A
remove-double-negN/A
associate-*r*N/A
lift-*.f64N/A
frac-timesN/A
metadata-evalN/A
frac-2negN/A
metadata-evalN/A
frac-2negN/A
frac-timesN/A
metadata-evalN/A
*-commutativeN/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied egg-rr99.9%
Final simplification97.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e+306)
(/ 1.0 (* y_m (fma x_m (* z z) x_m)))
(/ (/ 1.0 (* x_m (* z y_m))) z)))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e+306) {
tmp = 1.0 / (y_m * fma(x_m, (z * z), x_m));
} else {
tmp = (1.0 / (x_m * (z * y_m))) / z;
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e+306) tmp = Float64(1.0 / Float64(y_m * fma(x_m, Float64(z * z), x_m))); else tmp = Float64(Float64(1.0 / Float64(x_m * Float64(z * y_m))) / z); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e+306], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision] + x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{+306}:\\
\;\;\;\;\frac{1}{y\_m \cdot \mathsf{fma}\left(x\_m, z \cdot z, x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot \left(z \cdot y\_m\right)}}{z}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 2.00000000000000003e306Initial program 96.1%
lift-/.f64N/A
lift-*.f64N/A
lift-+.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
clear-numN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-*.f6496.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6496.7
Applied egg-rr96.7%
lift-fma.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft1-inN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-fma.f64N/A
lower-*.f6495.5
lift-fma.f64N/A
Applied egg-rr95.5%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-/.f6495.5
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
Applied egg-rr96.1%
if 2.00000000000000003e306 < (*.f64 z z) Initial program 79.4%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.4
Simplified79.4%
metadata-evalN/A
remove-double-negN/A
associate-*r*N/A
lift-*.f64N/A
frac-timesN/A
remove-double-negN/A
lift-/.f64N/A
div-invN/A
associate-/r*N/A
lower-/.f64N/A
clear-numN/A
un-div-invN/A
lift-/.f64N/A
remove-double-divN/A
*-rgt-identityN/A
*-rgt-identityN/A
*-commutativeN/A
lower-/.f64N/A
lower-*.f6499.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.9
Applied egg-rr99.9%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 5e+302)
(/ 1.0 (* y_m (fma x_m (* z z) x_m)))
(/ 1.0 (* z (* x_m (* z y_m))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 5e+302) {
tmp = 1.0 / (y_m * fma(x_m, (z * z), x_m));
} else {
tmp = 1.0 / (z * (x_m * (z * y_m)));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 5e+302) tmp = Float64(1.0 / Float64(y_m * fma(x_m, Float64(z * z), x_m))); else tmp = Float64(1.0 / Float64(z * Float64(x_m * Float64(z * y_m)))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 5e+302], N[(1.0 / N[(y$95$m * N[(x$95$m * N[(z * z), $MachinePrecision] + x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+302}:\\
\;\;\;\;\frac{1}{y\_m \cdot \mathsf{fma}\left(x\_m, z \cdot z, x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(x\_m \cdot \left(z \cdot y\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 5e302Initial program 96.1%
lift-/.f64N/A
lift-*.f64N/A
lift-+.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
clear-numN/A
lower-/.f64N/A
lift-/.f64N/A
associate-/r/N/A
/-rgt-identityN/A
*-commutativeN/A
lower-*.f6496.7
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lower-fma.f6496.7
Applied egg-rr96.7%
lift-fma.f64N/A
associate-/r*N/A
lift-/.f64N/A
lift-/.f64N/A
associate-/r*N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft1-inN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-fma.f64N/A
lower-*.f6495.5
lift-fma.f64N/A
Applied egg-rr95.5%
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
lift-/.f6495.5
lift-*.f64N/A
lift-fma.f64N/A
lift-*.f64N/A
distribute-lft-inN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-outN/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
Applied egg-rr96.0%
if 5e302 < (*.f64 z z) Initial program 79.7%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.7
Simplified79.7%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6498.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6498.4
Applied egg-rr98.4%
Final simplification96.7%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e-6)
(- (/ (fma z z -1.0) (* x_m y_m)))
(/ 1.0 (* y_m (* z (* z x_m))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-6) {
tmp = -(fma(z, z, -1.0) / (x_m * y_m));
} else {
tmp = 1.0 / (y_m * (z * (z * x_m)));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-6) tmp = Float64(-Float64(fma(z, z, -1.0) / Float64(x_m * y_m))); else tmp = Float64(1.0 / Float64(y_m * Float64(z * Float64(z * x_m)))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-6], (-N[(N[(z * z + -1.0), $MachinePrecision] / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), N[(1.0 / N[(y$95$m * N[(z * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-6}:\\
\;\;\;\;-\frac{\mathsf{fma}\left(z, z, -1\right)}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{y\_m \cdot \left(z \cdot \left(z \cdot x\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999991e-6Initial program 99.5%
Taylor expanded in z around 0
*-rgt-identityN/A
cancel-sign-subN/A
mul-1-negN/A
distribute-neg-frac2N/A
*-rgt-identityN/A
distribute-neg-frac2N/A
div-subN/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-*.f6499.0
Simplified99.0%
if 1.99999999999999991e-6 < (*.f64 z z) Initial program 83.6%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6482.8
Simplified82.8%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6493.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.2
Applied egg-rr93.2%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6483.5
Applied egg-rr83.5%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6488.7
Applied egg-rr88.7%
Final simplification93.8%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e-6)
(- (/ (fma z z -1.0) (* x_m y_m)))
(/ 1.0 (* z (* y_m (* z x_m))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-6) {
tmp = -(fma(z, z, -1.0) / (x_m * y_m));
} else {
tmp = 1.0 / (z * (y_m * (z * x_m)));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-6) tmp = Float64(-Float64(fma(z, z, -1.0) / Float64(x_m * y_m))); else tmp = Float64(1.0 / Float64(z * Float64(y_m * Float64(z * x_m)))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-6], (-N[(N[(z * z + -1.0), $MachinePrecision] / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), N[(1.0 / N[(z * N[(y$95$m * N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-6}:\\
\;\;\;\;-\frac{\mathsf{fma}\left(z, z, -1\right)}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(y\_m \cdot \left(z \cdot x\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999991e-6Initial program 99.5%
Taylor expanded in z around 0
*-rgt-identityN/A
cancel-sign-subN/A
mul-1-negN/A
distribute-neg-frac2N/A
*-rgt-identityN/A
distribute-neg-frac2N/A
div-subN/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-*.f6499.0
Simplified99.0%
if 1.99999999999999991e-6 < (*.f64 z z) Initial program 83.6%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6482.8
Simplified82.8%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6493.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.2
Applied egg-rr93.2%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6493.2
Applied egg-rr93.2%
Final simplification96.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e-6)
(- (/ (fma z z -1.0) (* x_m y_m)))
(/ 1.0 (* z (* x_m (* z y_m))))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-6) {
tmp = -(fma(z, z, -1.0) / (x_m * y_m));
} else {
tmp = 1.0 / (z * (x_m * (z * y_m)));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-6) tmp = Float64(-Float64(fma(z, z, -1.0) / Float64(x_m * y_m))); else tmp = Float64(1.0 / Float64(z * Float64(x_m * Float64(z * y_m)))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-6], (-N[(N[(z * z + -1.0), $MachinePrecision] / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), N[(1.0 / N[(z * N[(x$95$m * N[(z * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-6}:\\
\;\;\;\;-\frac{\mathsf{fma}\left(z, z, -1\right)}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \left(x\_m \cdot \left(z \cdot y\_m\right)\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999991e-6Initial program 99.5%
Taylor expanded in z around 0
*-rgt-identityN/A
cancel-sign-subN/A
mul-1-negN/A
distribute-neg-frac2N/A
*-rgt-identityN/A
distribute-neg-frac2N/A
div-subN/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-*.f6499.0
Simplified99.0%
if 1.99999999999999991e-6 < (*.f64 z z) Initial program 83.6%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6482.8
Simplified82.8%
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6493.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.2
Applied egg-rr93.2%
Final simplification96.1%
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
:precision binary64
(*
x_s
(*
y_s
(if (<= (* z z) 2e-6)
(- (/ (fma z z -1.0) (* x_m y_m)))
(/ 1.0 (* x_m (* (* z z) y_m)))))))y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
double tmp;
if ((z * z) <= 2e-6) {
tmp = -(fma(z, z, -1.0) / (x_m * y_m));
} else {
tmp = 1.0 / (x_m * ((z * z) * y_m));
}
return x_s * (y_s * tmp);
}
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) tmp = 0.0 if (Float64(z * z) <= 2e-6) tmp = Float64(-Float64(fma(z, z, -1.0) / Float64(x_m * y_m))); else tmp = Float64(1.0 / Float64(x_m * Float64(Float64(z * z) * y_m))); end return Float64(x_s * Float64(y_s * tmp)) end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 2e-6], (-N[(N[(z * z + -1.0), $MachinePrecision] / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), N[(1.0 / N[(x$95$m * N[(N[(z * z), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \begin{array}{l}
\mathbf{if}\;z \cdot z \leq 2 \cdot 10^{-6}:\\
\;\;\;\;-\frac{\mathsf{fma}\left(z, z, -1\right)}{x\_m \cdot y\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(\left(z \cdot z\right) \cdot y\_m\right)}\\
\end{array}\right)
\end{array}
if (*.f64 z z) < 1.99999999999999991e-6Initial program 99.5%
Taylor expanded in z around 0
*-rgt-identityN/A
cancel-sign-subN/A
mul-1-negN/A
distribute-neg-frac2N/A
*-rgt-identityN/A
distribute-neg-frac2N/A
div-subN/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-*.f6499.0
Simplified99.0%
if 1.99999999999999991e-6 < (*.f64 z z) Initial program 83.6%
Taylor expanded in z around inf
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6482.8
Simplified82.8%
Final simplification90.9%
y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function. (FPCore (x_s y_s x_m y_m z) :precision binary64 (* x_s (* y_s (/ 1.0 (* x_m y_m)))))
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z);
double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * (1.0 / (x_m * y_m)));
}
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, x_m, y_m, z)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z
code = x_s * (y_s * (1.0d0 / (x_m * y_m)))
end function
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
return x_s * (y_s * (1.0 / (x_m * y_m)));
}
y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z] = sort([x_m, y_m, z]) def code(x_s, y_s, x_m, y_m, z): return x_s * (y_s * (1.0 / (x_m * y_m)))
y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z = sort([x_m, y_m, z]) function code(x_s, y_s, x_m, y_m, z) return Float64(x_s * Float64(y_s * Float64(1.0 / Float64(x_m * y_m)))) end
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
tmp = x_s * (y_s * (1.0 / (x_m * y_m)));
end
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[(1.0 / N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\
\\
x\_s \cdot \left(y\_s \cdot \frac{1}{x\_m \cdot y\_m}\right)
\end{array}
Initial program 91.6%
Taylor expanded in z around 0
lower-/.f64N/A
lower-*.f6460.3
Simplified60.3%
(FPCore (x y z)
:precision binary64
(let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
(if (< t_1 (- INFINITY))
t_2
(if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))
double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
public static double code(double x, double y, double z) {
double t_0 = 1.0 + (z * z);
double t_1 = y * t_0;
double t_2 = (1.0 / y) / (t_0 * x);
double tmp;
if (t_1 < -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 < 8.680743250567252e+305) {
tmp = (1.0 / x) / (t_0 * y);
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z): t_0 = 1.0 + (z * z) t_1 = y * t_0 t_2 = (1.0 / y) / (t_0 * x) tmp = 0 if t_1 < -math.inf: tmp = t_2 elif t_1 < 8.680743250567252e+305: tmp = (1.0 / x) / (t_0 * y) else: tmp = t_2 return tmp
function code(x, y, z) t_0 = Float64(1.0 + Float64(z * z)) t_1 = Float64(y * t_0) t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x)) tmp = 0.0 if (t_1 < Float64(-Inf)) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z) t_0 = 1.0 + (z * z); t_1 = y * t_0; t_2 = (1.0 / y) / (t_0 * x); tmp = 0.0; if (t_1 < -Inf) tmp = t_2; elseif (t_1 < 8.680743250567252e+305) tmp = (1.0 / x) / (t_0 * y); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 1 + z \cdot z\\
t_1 := y \cdot t\_0\\
t_2 := \frac{\frac{1}{y}}{t\_0 \cdot x}\\
\mathbf{if}\;t\_1 < -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 < 8.680743250567252 \cdot 10^{+305}:\\
\;\;\;\;\frac{\frac{1}{x}}{t\_0 \cdot y}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024212
(FPCore (x y z)
:name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< (* y (+ 1 (* z z))) -inf.0) (/ (/ 1 y) (* (+ 1 (* z z)) x)) (if (< (* y (+ 1 (* z z))) 868074325056725200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (/ 1 x) (* (+ 1 (* z z)) y)) (/ (/ 1 y) (* (+ 1 (* z z)) x)))))
(/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))