
(FPCore (x y z t a) :precision binary64 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))
double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) * z) / sqrt(((z * z) - (t * a)))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}
def code(x, y, z, t, a): return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a)))) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) * z) / sqrt(((z * z) - (t * a))); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))
double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) * z) / sqrt(((z * z) - (t * a)))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}
def code(x, y, z, t, a): return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a)))) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) * z) / sqrt(((z * z) - (t * a))); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}}
\end{array}
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 6.8e-127)
(* (* z_m y_m) (/ x_m (* (sqrt (- 0.0 t)) (sqrt a))))
(if (<= z_m 1e+113)
(/ (* y_m x_m) (/ (sqrt (- (* z_m z_m) (* t a))) z_m))
(* y_m (/ x_m (+ 1.0 (/ (* a -0.5) (/ z_m (/ t z_m))))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 6.8e-127) {
tmp = (z_m * y_m) * (x_m / (sqrt((0.0 - t)) * sqrt(a)));
} else if (z_m <= 1e+113) {
tmp = (y_m * x_m) / (sqrt(((z_m * z_m) - (t * a))) / z_m);
} else {
tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 6.8d-127) then
tmp = (z_m * y_m) * (x_m / (sqrt((0.0d0 - t)) * sqrt(a)))
else if (z_m <= 1d+113) then
tmp = (y_m * x_m) / (sqrt(((z_m * z_m) - (t * a))) / z_m)
else
tmp = y_m * (x_m / (1.0d0 + ((a * (-0.5d0)) / (z_m / (t / z_m)))))
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 6.8e-127) {
tmp = (z_m * y_m) * (x_m / (Math.sqrt((0.0 - t)) * Math.sqrt(a)));
} else if (z_m <= 1e+113) {
tmp = (y_m * x_m) / (Math.sqrt(((z_m * z_m) - (t * a))) / z_m);
} else {
tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 6.8e-127: tmp = (z_m * y_m) * (x_m / (math.sqrt((0.0 - t)) * math.sqrt(a))) elif z_m <= 1e+113: tmp = (y_m * x_m) / (math.sqrt(((z_m * z_m) - (t * a))) / z_m) else: tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m))))) return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 6.8e-127) tmp = Float64(Float64(z_m * y_m) * Float64(x_m / Float64(sqrt(Float64(0.0 - t)) * sqrt(a)))); elseif (z_m <= 1e+113) tmp = Float64(Float64(y_m * x_m) / Float64(sqrt(Float64(Float64(z_m * z_m) - Float64(t * a))) / z_m)); else tmp = Float64(y_m * Float64(x_m / Float64(1.0 + Float64(Float64(a * -0.5) / Float64(z_m / Float64(t / z_m)))))); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 6.8e-127)
tmp = (z_m * y_m) * (x_m / (sqrt((0.0 - t)) * sqrt(a)));
elseif (z_m <= 1e+113)
tmp = (y_m * x_m) / (sqrt(((z_m * z_m) - (t * a))) / z_m);
else
tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m)))));
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 6.8e-127], N[(N[(z$95$m * y$95$m), $MachinePrecision] * N[(x$95$m / N[(N[Sqrt[N[(0.0 - t), $MachinePrecision]], $MachinePrecision] * N[Sqrt[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z$95$m, 1e+113], N[(N[(y$95$m * x$95$m), $MachinePrecision] / N[(N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m * N[(x$95$m / N[(1.0 + N[(N[(a * -0.5), $MachinePrecision] / N[(z$95$m / N[(t / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 6.8 \cdot 10^{-127}:\\
\;\;\;\;\left(z\_m \cdot y\_m\right) \cdot \frac{x\_m}{\sqrt{0 - t} \cdot \sqrt{a}}\\
\mathbf{elif}\;z\_m \leq 10^{+113}:\\
\;\;\;\;\frac{y\_m \cdot x\_m}{\frac{\sqrt{z\_m \cdot z\_m - t \cdot a}}{z\_m}}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot \frac{x\_m}{1 + \frac{a \cdot -0.5}{\frac{z\_m}{\frac{t}{z\_m}}}}\\
\end{array}\right)\right)
\end{array}
if z < 6.7999999999999997e-127Initial program 62.4%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6462.8%
Applied egg-rr62.8%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6438.2%
Simplified38.2%
sub0-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
sqrt-prodN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f6419.3%
Applied egg-rr19.3%
if 6.7999999999999997e-127 < z < 1e113Initial program 94.5%
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.7%
Applied egg-rr94.7%
if 1e113 < z Initial program 32.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6473.8%
Simplified73.8%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6497.8%
Applied egg-rr97.8%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr97.8%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-/r/N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6497.8%
Applied egg-rr97.8%
Final simplification49.0%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 1e+113)
(/ x_m (/ (/ (sqrt (- (* z_m z_m) (* t a))) z_m) y_m))
(* y_m (/ x_m (+ 1.0 (/ (* a -0.5) (/ z_m (/ t z_m)))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1e+113) {
tmp = x_m / ((sqrt(((z_m * z_m) - (t * a))) / z_m) / y_m);
} else {
tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1d+113) then
tmp = x_m / ((sqrt(((z_m * z_m) - (t * a))) / z_m) / y_m)
else
tmp = y_m * (x_m / (1.0d0 + ((a * (-0.5d0)) / (z_m / (t / z_m)))))
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1e+113) {
tmp = x_m / ((Math.sqrt(((z_m * z_m) - (t * a))) / z_m) / y_m);
} else {
tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1e+113: tmp = x_m / ((math.sqrt(((z_m * z_m) - (t * a))) / z_m) / y_m) else: tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m))))) return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1e+113) tmp = Float64(x_m / Float64(Float64(sqrt(Float64(Float64(z_m * z_m) - Float64(t * a))) / z_m) / y_m)); else tmp = Float64(y_m * Float64(x_m / Float64(1.0 + Float64(Float64(a * -0.5) / Float64(z_m / Float64(t / z_m)))))); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1e+113)
tmp = x_m / ((sqrt(((z_m * z_m) - (t * a))) / z_m) / y_m);
else
tmp = y_m * (x_m / (1.0 + ((a * -0.5) / (z_m / (t / z_m)))));
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1e+113], N[(x$95$m / N[(N[(N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / z$95$m), $MachinePrecision] / y$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m * N[(x$95$m / N[(1.0 + N[(N[(a * -0.5), $MachinePrecision] / N[(z$95$m / N[(t / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 10^{+113}:\\
\;\;\;\;\frac{x\_m}{\frac{\frac{\sqrt{z\_m \cdot z\_m - t \cdot a}}{z\_m}}{y\_m}}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot \frac{x\_m}{1 + \frac{a \cdot -0.5}{\frac{z\_m}{\frac{t}{z\_m}}}}\\
\end{array}\right)\right)
\end{array}
if z < 1e113Initial program 70.9%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.5%
Applied egg-rr69.5%
*-commutativeN/A
associate-*l/N/A
associate-*l*N/A
associate-*l/N/A
associate-/r/N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.5%
Applied egg-rr73.5%
if 1e113 < z Initial program 32.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6473.8%
Simplified73.8%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6497.8%
Applied egg-rr97.8%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr97.8%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-/r/N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6497.8%
Applied egg-rr97.8%
Final simplification77.6%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 1.95e+71)
(* (* z_m y_m) (/ x_m (sqrt (- (* z_m z_m) (* t a)))))
(* x_m (/ y_m (+ 1.0 (* (/ t z_m) (* a (/ -0.5 z_m)))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.95e+71) {
tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (t * a))));
} else {
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.95d+71) then
tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (t * a))))
else
tmp = x_m * (y_m / (1.0d0 + ((t / z_m) * (a * ((-0.5d0) / z_m)))))
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.95e+71) {
tmp = (z_m * y_m) * (x_m / Math.sqrt(((z_m * z_m) - (t * a))));
} else {
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.95e+71: tmp = (z_m * y_m) * (x_m / math.sqrt(((z_m * z_m) - (t * a)))) else: tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))) return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.95e+71) tmp = Float64(Float64(z_m * y_m) * Float64(x_m / sqrt(Float64(Float64(z_m * z_m) - Float64(t * a))))); else tmp = Float64(x_m * Float64(y_m / Float64(1.0 + Float64(Float64(t / z_m) * Float64(a * Float64(-0.5 / z_m)))))); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.95e+71)
tmp = (z_m * y_m) * (x_m / sqrt(((z_m * z_m) - (t * a))));
else
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.95e+71], N[(N[(z$95$m * y$95$m), $MachinePrecision] * N[(x$95$m / N[Sqrt[N[(N[(z$95$m * z$95$m), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(y$95$m / N[(1.0 + N[(N[(t / z$95$m), $MachinePrecision] * N[(a * N[(-0.5 / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.95 \cdot 10^{+71}:\\
\;\;\;\;\left(z\_m \cdot y\_m\right) \cdot \frac{x\_m}{\sqrt{z\_m \cdot z\_m - t \cdot a}}\\
\mathbf{else}:\\
\;\;\;\;x\_m \cdot \frac{y\_m}{1 + \frac{t}{z\_m} \cdot \left(a \cdot \frac{-0.5}{z\_m}\right)}\\
\end{array}\right)\right)
\end{array}
if z < 1.9500000000000001e71Initial program 69.9%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.4%
Applied egg-rr69.4%
if 1.9500000000000001e71 < z Initial program 43.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.9%
Simplified76.9%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6496.5%
Applied egg-rr96.5%
*-commutativeN/A
associate-*r/N/A
times-fracN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6496.5%
Applied egg-rr96.5%
Final simplification75.0%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 1.85e-65)
(/ (* z_m y_m) (/ (sqrt (- 0.0 (* t a))) x_m))
(* x_m (/ y_m (+ 1.0 (* (/ t z_m) (* a (/ -0.5 z_m)))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.85e-65) {
tmp = (z_m * y_m) / (sqrt((0.0 - (t * a))) / x_m);
} else {
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.85d-65) then
tmp = (z_m * y_m) / (sqrt((0.0d0 - (t * a))) / x_m)
else
tmp = x_m * (y_m / (1.0d0 + ((t / z_m) * (a * ((-0.5d0) / z_m)))))
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.85e-65) {
tmp = (z_m * y_m) / (Math.sqrt((0.0 - (t * a))) / x_m);
} else {
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.85e-65: tmp = (z_m * y_m) / (math.sqrt((0.0 - (t * a))) / x_m) else: tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))) return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.85e-65) tmp = Float64(Float64(z_m * y_m) / Float64(sqrt(Float64(0.0 - Float64(t * a))) / x_m)); else tmp = Float64(x_m * Float64(y_m / Float64(1.0 + Float64(Float64(t / z_m) * Float64(a * Float64(-0.5 / z_m)))))); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.85e-65)
tmp = (z_m * y_m) / (sqrt((0.0 - (t * a))) / x_m);
else
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.85e-65], N[(N[(z$95$m * y$95$m), $MachinePrecision] / N[(N[Sqrt[N[(0.0 - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(y$95$m / N[(1.0 + N[(N[(t / z$95$m), $MachinePrecision] * N[(a * N[(-0.5 / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.85 \cdot 10^{-65}:\\
\;\;\;\;\frac{z\_m \cdot y\_m}{\frac{\sqrt{0 - t \cdot a}}{x\_m}}\\
\mathbf{else}:\\
\;\;\;\;x\_m \cdot \frac{y\_m}{1 + \frac{t}{z\_m} \cdot \left(a \cdot \frac{-0.5}{z\_m}\right)}\\
\end{array}\right)\right)
\end{array}
if z < 1.85e-65Initial program 64.7%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.5%
Applied egg-rr64.5%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6440.1%
Simplified40.1%
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-commutativeN/A
*-lowering-*.f6440.1%
Applied egg-rr40.1%
if 1.85e-65 < z Initial program 63.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.6%
Simplified76.6%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6488.4%
Applied egg-rr88.4%
*-commutativeN/A
associate-*r/N/A
times-fracN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6488.4%
Applied egg-rr88.4%
Final simplification56.9%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= z_m 1.1e-70)
(* (* z_m y_m) (/ x_m (sqrt (- 0.0 (* t a)))))
(* x_m (/ y_m (+ 1.0 (* (/ t z_m) (* a (/ -0.5 z_m)))))))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.1e-70) {
tmp = (z_m * y_m) * (x_m / sqrt((0.0 - (t * a))));
} else {
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.1d-70) then
tmp = (z_m * y_m) * (x_m / sqrt((0.0d0 - (t * a))))
else
tmp = x_m * (y_m / (1.0d0 + ((t / z_m) * (a * ((-0.5d0) / z_m)))))
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.1e-70) {
tmp = (z_m * y_m) * (x_m / Math.sqrt((0.0 - (t * a))));
} else {
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.1e-70: tmp = (z_m * y_m) * (x_m / math.sqrt((0.0 - (t * a)))) else: tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))) return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.1e-70) tmp = Float64(Float64(z_m * y_m) * Float64(x_m / sqrt(Float64(0.0 - Float64(t * a))))); else tmp = Float64(x_m * Float64(y_m / Float64(1.0 + Float64(Float64(t / z_m) * Float64(a * Float64(-0.5 / z_m)))))); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.1e-70)
tmp = (z_m * y_m) * (x_m / sqrt((0.0 - (t * a))));
else
tmp = x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m)))));
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 1.1e-70], N[(N[(z$95$m * y$95$m), $MachinePrecision] * N[(x$95$m / N[Sqrt[N[(0.0 - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(y$95$m / N[(1.0 + N[(N[(t / z$95$m), $MachinePrecision] * N[(a * N[(-0.5 / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.1 \cdot 10^{-70}:\\
\;\;\;\;\left(z\_m \cdot y\_m\right) \cdot \frac{x\_m}{\sqrt{0 - t \cdot a}}\\
\mathbf{else}:\\
\;\;\;\;x\_m \cdot \frac{y\_m}{1 + \frac{t}{z\_m} \cdot \left(a \cdot \frac{-0.5}{z\_m}\right)}\\
\end{array}\right)\right)
\end{array}
if z < 1.0999999999999999e-70Initial program 64.7%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.5%
Applied egg-rr64.5%
Taylor expanded in z around 0
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
*-lowering-*.f6440.1%
Simplified40.1%
if 1.0999999999999999e-70 < z Initial program 63.9%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6476.6%
Simplified76.6%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6488.4%
Applied egg-rr88.4%
*-commutativeN/A
associate-*r/N/A
times-fracN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6488.4%
Applied egg-rr88.4%
Final simplification56.9%
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (z_s y_s x_s x_m y_m z_m t a)
:precision binary64
(*
z_s
(*
y_s
(*
x_s
(if (<= x_m 1.05e-52)
(* x_m (/ y_m (+ 1.0 (* a (* -0.5 (/ t (* z_m z_m)))))))
(* y_m x_m))))))x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (x_m <= 1.05e-52) {
tmp = x_m * (y_m / (1.0 + (a * (-0.5 * (t / (z_m * z_m))))));
} else {
tmp = y_m * x_m;
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (x_m <= 1.05d-52) then
tmp = x_m * (y_m / (1.0d0 + (a * ((-0.5d0) * (t / (z_m * z_m))))))
else
tmp = y_m * x_m
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (x_m <= 1.05e-52) {
tmp = x_m * (y_m / (1.0 + (a * (-0.5 * (t / (z_m * z_m))))));
} else {
tmp = y_m * x_m;
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if x_m <= 1.05e-52: tmp = x_m * (y_m / (1.0 + (a * (-0.5 * (t / (z_m * z_m)))))) else: tmp = y_m * x_m return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (x_m <= 1.05e-52) tmp = Float64(x_m * Float64(y_m / Float64(1.0 + Float64(a * Float64(-0.5 * Float64(t / Float64(z_m * z_m))))))); else tmp = Float64(y_m * x_m); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (x_m <= 1.05e-52)
tmp = x_m * (y_m / (1.0 + (a * (-0.5 * (t / (z_m * z_m))))));
else
tmp = y_m * x_m;
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.05e-52], N[(x$95$m * N[(y$95$m / N[(1.0 + N[(a * N[(-0.5 * N[(t / N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;x\_m \leq 1.05 \cdot 10^{-52}:\\
\;\;\;\;x\_m \cdot \frac{y\_m}{1 + a \cdot \left(-0.5 \cdot \frac{t}{z\_m \cdot z\_m}\right)}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if x < 1.0499999999999999e-52Initial program 68.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.3%
Simplified46.3%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6449.4%
Applied egg-rr49.4%
if 1.0499999999999999e-52 < x Initial program 53.7%
Taylor expanded in z around inf
*-lowering-*.f6442.0%
Simplified42.0%
Final simplification47.6%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (* x_m (/ y_m (+ 1.0 (/ -0.5 (/ (/ z_m (/ t z_m)) a)))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)))))));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * (x_m * (y_m / (1.0d0 + ((-0.5d0) / ((z_m / (t / z_m)) / a)))))))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)))))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)))))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * Float64(x_m * Float64(y_m / Float64(1.0 + Float64(-0.5 / Float64(Float64(z_m / Float64(t / z_m)) / a)))))))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + (-0.5 / ((z_m / (t / z_m)) / a)))))));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(x$95$m * N[(y$95$m / N[(1.0 + N[(-0.5 / N[(N[(z$95$m / N[(t / z$95$m), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(x\_m \cdot \frac{y\_m}{1 + \frac{-0.5}{\frac{\frac{z\_m}{\frac{t}{z\_m}}}{a}}}\right)\right)\right)
\end{array}
Initial program 64.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6444.3%
Simplified44.3%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.1%
Applied egg-rr48.1%
*-commutativeN/A
*-lowering-*.f64N/A
Applied egg-rr48.8%
Final simplification48.8%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (* x_m (/ y_m (+ 1.0 (* (/ t z_m) (* a (/ -0.5 z_m))))))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))))));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * (x_m * (y_m / (1.0d0 + ((t / z_m) * (a * ((-0.5d0) / z_m))))))))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))))));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))))))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * Float64(x_m * Float64(y_m / Float64(1.0 + Float64(Float64(t / z_m) * Float64(a * Float64(-0.5 / z_m))))))))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * (x_m * (y_m / (1.0 + ((t / z_m) * (a * (-0.5 / z_m))))))));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(x$95$m * N[(y$95$m / N[(1.0 + N[(N[(t / z$95$m), $MachinePrecision] * N[(a * N[(-0.5 / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(x\_m \cdot \frac{y\_m}{1 + \frac{t}{z\_m} \cdot \left(a \cdot \frac{-0.5}{z\_m}\right)}\right)\right)\right)
\end{array}
Initial program 64.4%
Taylor expanded in z around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6444.3%
Simplified44.3%
associate-/l*N/A
associate-*l*N/A
associate-/r*N/A
*-inversesN/A
un-div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.1%
Applied egg-rr48.1%
*-commutativeN/A
associate-*r/N/A
times-fracN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6448.8%
Applied egg-rr48.8%
Final simplification48.8%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (if (<= (* t a) -1e-206) (* y_m (/ (* z_m x_m) z_m)) (* y_m x_m))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if ((t * a) <= -1e-206) {
tmp = y_m * ((z_m * x_m) / z_m);
} else {
tmp = y_m * x_m;
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((t * a) <= (-1d-206)) then
tmp = y_m * ((z_m * x_m) / z_m)
else
tmp = y_m * x_m
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if ((t * a) <= -1e-206) {
tmp = y_m * ((z_m * x_m) / z_m);
} else {
tmp = y_m * x_m;
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if (t * a) <= -1e-206: tmp = y_m * ((z_m * x_m) / z_m) else: tmp = y_m * x_m return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (Float64(t * a) <= -1e-206) tmp = Float64(y_m * Float64(Float64(z_m * x_m) / z_m)); else tmp = Float64(y_m * x_m); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if ((t * a) <= -1e-206)
tmp = y_m * ((z_m * x_m) / z_m);
else
tmp = y_m * x_m;
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[N[(t * a), $MachinePrecision], -1e-206], N[(y$95$m * N[(N[(z$95$m * x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;t \cdot a \leq -1 \cdot 10^{-206}:\\
\;\;\;\;y\_m \cdot \frac{z\_m \cdot x\_m}{z\_m}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if (*.f64 t a) < -1.00000000000000003e-206Initial program 68.3%
Taylor expanded in z around inf
*-lowering-*.f6433.3%
Simplified33.3%
*-rgt-identityN/A
*-inversesN/A
associate-/l*N/A
*-commutativeN/A
associate-*r*N/A
*-rgt-identityN/A
times-fracN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6431.8%
Applied egg-rr31.8%
if -1.00000000000000003e-206 < (*.f64 t a) Initial program 60.3%
Taylor expanded in z around inf
*-lowering-*.f6454.6%
Simplified54.6%
Final simplification42.8%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (if (<= z_m 3.8e-188) (* (* z_m x_m) (/ y_m z_m)) (* y_m x_m))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 3.8e-188) {
tmp = (z_m * x_m) * (y_m / z_m);
} else {
tmp = y_m * x_m;
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 3.8d-188) then
tmp = (z_m * x_m) * (y_m / z_m)
else
tmp = y_m * x_m
end if
code = z_s * (y_s * (x_s * tmp))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 3.8e-188) {
tmp = (z_m * x_m) * (y_m / z_m);
} else {
tmp = y_m * x_m;
}
return z_s * (y_s * (x_s * tmp));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 3.8e-188: tmp = (z_m * x_m) * (y_m / z_m) else: tmp = y_m * x_m return z_s * (y_s * (x_s * tmp))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 3.8e-188) tmp = Float64(Float64(z_m * x_m) * Float64(y_m / z_m)); else tmp = Float64(y_m * x_m); end return Float64(z_s * Float64(y_s * Float64(x_s * tmp))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 3.8e-188)
tmp = (z_m * x_m) * (y_m / z_m);
else
tmp = y_m * x_m;
end
tmp_2 = z_s * (y_s * (x_s * tmp));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 3.8e-188], N[(N[(z$95$m * x$95$m), $MachinePrecision] * N[(y$95$m / z$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 3.8 \cdot 10^{-188}:\\
\;\;\;\;\left(z\_m \cdot x\_m\right) \cdot \frac{y\_m}{z\_m}\\
\mathbf{else}:\\
\;\;\;\;y\_m \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 3.8e-188Initial program 62.3%
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.3%
Applied egg-rr63.3%
Taylor expanded in z around inf
/-lowering-/.f6418.5%
Simplified18.5%
*-commutativeN/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6415.3%
Applied egg-rr15.3%
if 3.8e-188 < z Initial program 67.4%
Taylor expanded in z around inf
*-lowering-*.f6484.1%
Simplified84.1%
Final simplification44.1%
x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (z_s y_s x_s x_m y_m z_m t a) :precision binary64 (* z_s (* y_s (* x_s (* y_m x_m)))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (y_m * x_m)));
}
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: z_s
real(8), intent (in) :: y_s
real(8), intent (in) :: x_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = z_s * (y_s * (x_s * (y_m * x_m)))
end function
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m, double t, double a) {
return z_s * (y_s * (x_s * (y_m * x_m)));
}
x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(z_s, y_s, x_s, x_m, y_m, z_m, t, a): return z_s * (y_s * (x_s * (y_m * x_m)))
x\_m = abs(x) x\_s = copysign(1.0, x) y\_m = abs(y) y\_s = copysign(1.0, y) z\_m = abs(z) z\_s = copysign(1.0, z) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(z_s, y_s, x_s, x_m, y_m, z_m, t, a) return Float64(z_s * Float64(y_s * Float64(x_s * Float64(y_m * x_m)))) end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m, t, a)
tmp = z_s * (y_s * (x_s * (y_m * x_m)));
end
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(y\_m \cdot x\_m\right)\right)\right)
\end{array}
Initial program 64.4%
Taylor expanded in z around inf
*-lowering-*.f6443.6%
Simplified43.6%
Final simplification43.6%
(FPCore (x y z t a)
:precision binary64
(if (< z -3.1921305903852764e+46)
(- (* y x))
(if (< z 5.976268120920894e+90)
(/ (* x z) (/ (sqrt (- (* z z) (* a t))) y))
(* y x))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z < -3.1921305903852764e+46) {
tmp = -(y * x);
} else if (z < 5.976268120920894e+90) {
tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y);
} else {
tmp = y * x;
}
return tmp;
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z < (-3.1921305903852764d+46)) then
tmp = -(y * x)
else if (z < 5.976268120920894d+90) then
tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y)
else
tmp = y * x
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z < -3.1921305903852764e+46) {
tmp = -(y * x);
} else if (z < 5.976268120920894e+90) {
tmp = (x * z) / (Math.sqrt(((z * z) - (a * t))) / y);
} else {
tmp = y * x;
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if z < -3.1921305903852764e+46: tmp = -(y * x) elif z < 5.976268120920894e+90: tmp = (x * z) / (math.sqrt(((z * z) - (a * t))) / y) else: tmp = y * x return tmp
function code(x, y, z, t, a) tmp = 0.0 if (z < -3.1921305903852764e+46) tmp = Float64(-Float64(y * x)); elseif (z < 5.976268120920894e+90) tmp = Float64(Float64(x * z) / Float64(sqrt(Float64(Float64(z * z) - Float64(a * t))) / y)); else tmp = Float64(y * x); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (z < -3.1921305903852764e+46) tmp = -(y * x); elseif (z < 5.976268120920894e+90) tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y); else tmp = y * x; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[z, -3.1921305903852764e+46], (-N[(y * x), $MachinePrecision]), If[Less[z, 5.976268120920894e+90], N[(N[(x * z), $MachinePrecision] / N[(N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(y * x), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z < -3.1921305903852764 \cdot 10^{+46}:\\
\;\;\;\;-y \cdot x\\
\mathbf{elif}\;z < 5.976268120920894 \cdot 10^{+90}:\\
\;\;\;\;\frac{x \cdot z}{\frac{\sqrt{z \cdot z - a \cdot t}}{y}}\\
\mathbf{else}:\\
\;\;\;\;y \cdot x\\
\end{array}
\end{array}
herbie shell --seed 2024152
(FPCore (x y z t a)
:name "Statistics.Math.RootFinding:ridders from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< z -31921305903852764000000000000000000000000000000) (- (* y x)) (if (< z 5976268120920894000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (* x z) (/ (sqrt (- (* z z) (* a t))) y)) (* y x))))
(/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))