
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 1.7e-50)
(/ (/ 1.0 t_0) t_0)
(/ (cos (* x_m -2.0)) (* s_m (* (* s_m (* x_m c_m)) (* x_m c_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.7e-50) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x_m * -2.0)) / (s_m * ((s_m * (x_m * c_m)) * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 1.7d-50) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x_m * (-2.0d0))) / (s_m * ((s_m * (x_m * c_m)) * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.7e-50) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x_m * -2.0)) / (s_m * ((s_m * (x_m * c_m)) * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.7e-50: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x_m * -2.0)) / (s_m * ((s_m * (x_m * c_m)) * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.7e-50) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(s_m * Float64(Float64(s_m * Float64(x_m * c_m)) * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.7e-50)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x_m * -2.0)) / (s_m * ((s_m * (x_m * c_m)) * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.7e-50], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.7 \cdot 10^{-50}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot -2\right)}{s\_m \cdot \left(\left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right) \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.70000000000000007e-50Initial program 66.5%
Taylor expanded in x around 0 55.8%
associate-/r*55.8%
*-commutative55.8%
unpow255.8%
unpow255.8%
swap-sqr66.9%
unpow266.9%
associate-/r*66.6%
unpow266.6%
unpow266.6%
swap-sqr83.6%
unpow283.6%
*-commutative83.6%
Simplified83.6%
*-commutative83.6%
add-sqr-sqrt83.5%
sqrt-div83.5%
metadata-eval83.5%
sqrt-pow158.7%
associate-*r*57.7%
metadata-eval57.7%
pow157.7%
*-commutative57.7%
sqrt-div57.7%
metadata-eval57.7%
sqrt-pow181.7%
associate-*r*81.8%
metadata-eval81.8%
pow181.8%
*-commutative81.8%
Applied egg-rr81.8%
un-div-inv81.8%
*-commutative81.8%
associate-*l*81.7%
*-commutative81.7%
associate-*l*83.9%
Applied egg-rr83.9%
if 1.70000000000000007e-50 < x Initial program 66.9%
associate-/r*65.2%
associate-/l/66.8%
unpow266.8%
sqr-neg66.8%
unpow266.8%
associate-/r*65.2%
*-commutative65.2%
associate-/r*66.9%
cos-neg66.9%
*-commutative66.9%
distribute-rgt-neg-in66.9%
metadata-eval66.9%
*-commutative66.9%
associate-*r*66.8%
unpow266.8%
sqr-neg66.8%
unpow266.8%
Simplified58.8%
Taylor expanded in x around inf 58.8%
associate-/r*57.0%
*-commutative57.0%
unpow257.0%
unpow257.0%
swap-sqr70.8%
unpow270.8%
associate-/r*72.6%
*-commutative72.6%
unpow272.6%
unpow272.6%
swap-sqr98.3%
unpow298.3%
associate-*r*95.9%
*-commutative95.9%
Simplified95.9%
unpow295.9%
*-commutative95.9%
associate-*r*94.7%
*-commutative94.7%
associate-*r*92.1%
associate-*r*93.4%
*-commutative93.4%
Applied egg-rr93.4%
Final simplification86.6%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 2.2e-56) (pow (* c_m (* x_m s_m)) -2.0) (/ (cos (* x_m -2.0)) (* s_m (* c_m (* x_m (* x_m (* s_m c_m))))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 2.2e-56) {
tmp = pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = cos((x_m * -2.0)) / (s_m * (c_m * (x_m * (x_m * (s_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 2.2d-56) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
else
tmp = cos((x_m * (-2.0d0))) / (s_m * (c_m * (x_m * (x_m * (s_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 2.2e-56) {
tmp = Math.pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = Math.cos((x_m * -2.0)) / (s_m * (c_m * (x_m * (x_m * (s_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 2.2e-56: tmp = math.pow((c_m * (x_m * s_m)), -2.0) else: tmp = math.cos((x_m * -2.0)) / (s_m * (c_m * (x_m * (x_m * (s_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 2.2e-56) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.0; else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(s_m * Float64(c_m * Float64(x_m * Float64(x_m * Float64(s_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 2.2e-56)
tmp = (c_m * (x_m * s_m)) ^ -2.0;
else
tmp = cos((x_m * -2.0)) / (s_m * (c_m * (x_m * (x_m * (s_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 2.2e-56], N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(c$95$m * N[(x$95$m * N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 2.2 \cdot 10^{-56}:\\
\;\;\;\;{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot -2\right)}{s\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(x\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.20000000000000004e-56Initial program 66.9%
associate-/r*66.8%
associate-/l/68.1%
unpow268.1%
sqr-neg68.1%
unpow268.1%
associate-/r*66.8%
*-commutative66.8%
associate-/r*66.9%
cos-neg66.9%
*-commutative66.9%
distribute-rgt-neg-in66.9%
metadata-eval66.9%
*-commutative66.9%
associate-*r*67.7%
unpow267.7%
sqr-neg67.7%
unpow267.7%
Simplified60.4%
Taylor expanded in x around inf 60.4%
associate-/r*60.4%
*-commutative60.4%
unpow260.4%
unpow260.4%
swap-sqr74.8%
unpow274.8%
associate-/r*74.5%
*-commutative74.5%
unpow274.5%
unpow274.5%
swap-sqr98.1%
unpow298.1%
associate-*r*95.5%
*-commutative95.5%
Simplified95.5%
Taylor expanded in x around 0 56.2%
associate-*r*56.0%
*-commutative56.0%
associate-*l*56.4%
unpow256.4%
unpow256.4%
swap-sqr72.8%
unpow272.8%
swap-sqr81.3%
associate-/r*81.7%
*-rgt-identity81.7%
associate-*r/81.7%
unpow-181.7%
unpow-181.7%
pow-sqr81.7%
metadata-eval81.7%
associate-*r*82.4%
*-commutative82.4%
associate-*r*83.9%
Simplified83.9%
if 2.20000000000000004e-56 < x Initial program 66.0%
associate-/r*64.3%
associate-/l/65.9%
unpow265.9%
sqr-neg65.9%
unpow265.9%
associate-/r*64.3%
*-commutative64.3%
associate-/r*66.0%
cos-neg66.0%
*-commutative66.0%
distribute-rgt-neg-in66.0%
metadata-eval66.0%
*-commutative66.0%
associate-*r*65.9%
unpow265.9%
sqr-neg65.9%
unpow265.9%
Simplified58.0%
Taylor expanded in x around inf 58.0%
associate-/r*56.3%
*-commutative56.3%
unpow256.3%
unpow256.3%
swap-sqr69.8%
unpow269.8%
associate-/r*71.6%
*-commutative71.6%
unpow271.6%
unpow271.6%
swap-sqr98.3%
unpow298.3%
associate-*r*95.9%
*-commutative95.9%
Simplified95.9%
add095.9%
associate-*r*97.2%
fma-define97.2%
Applied egg-rr97.2%
fma-undefine97.2%
add097.2%
Applied egg-rr97.2%
unpow297.2%
associate-*r*93.6%
*-commutative93.6%
associate-*r*95.9%
associate-*r*91.0%
associate-*l*91.1%
associate-*r*92.3%
*-commutative92.3%
associate-*r*89.9%
*-commutative89.9%
Applied egg-rr89.9%
Final simplification85.6%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 4e-56)
(/ (/ 1.0 t_0) t_0)
(/ (cos (* x_m -2.0)) (* (* s_m c_m) (* x_m (* s_m (* x_m c_m))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 4e-56) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 4d-56) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x_m * (-2.0d0))) / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 4e-56) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 4e-56: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m)))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 4e-56) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(s_m * Float64(x_m * c_m))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 4e-56)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 4e-56], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 4 \cdot 10^{-56}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot -2\right)}{\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 4.0000000000000002e-56Initial program 66.5%
Taylor expanded in x around 0 55.8%
associate-/r*55.8%
*-commutative55.8%
unpow255.8%
unpow255.8%
swap-sqr66.9%
unpow266.9%
associate-/r*66.6%
unpow266.6%
unpow266.6%
swap-sqr83.6%
unpow283.6%
*-commutative83.6%
Simplified83.6%
*-commutative83.6%
add-sqr-sqrt83.5%
sqrt-div83.5%
metadata-eval83.5%
sqrt-pow158.7%
associate-*r*57.7%
metadata-eval57.7%
pow157.7%
*-commutative57.7%
sqrt-div57.7%
metadata-eval57.7%
sqrt-pow181.7%
associate-*r*81.8%
metadata-eval81.8%
pow181.8%
*-commutative81.8%
Applied egg-rr81.8%
un-div-inv81.8%
*-commutative81.8%
associate-*l*81.7%
*-commutative81.7%
associate-*l*83.9%
Applied egg-rr83.9%
if 4.0000000000000002e-56 < x Initial program 66.9%
associate-/r*65.2%
associate-/l/66.8%
unpow266.8%
sqr-neg66.8%
unpow266.8%
associate-/r*65.2%
*-commutative65.2%
associate-/r*66.9%
cos-neg66.9%
*-commutative66.9%
distribute-rgt-neg-in66.9%
metadata-eval66.9%
*-commutative66.9%
associate-*r*66.8%
unpow266.8%
sqr-neg66.8%
unpow266.8%
Simplified58.8%
Taylor expanded in x around inf 58.8%
associate-/r*57.0%
*-commutative57.0%
unpow257.0%
unpow257.0%
swap-sqr70.8%
unpow270.8%
associate-/r*72.6%
*-commutative72.6%
unpow272.6%
unpow272.6%
swap-sqr98.3%
unpow298.3%
associate-*r*95.9%
*-commutative95.9%
Simplified95.9%
unpow295.9%
associate-*r*93.5%
*-commutative93.5%
associate-*r*95.9%
associate-*l*90.9%
associate-*r*90.9%
*-commutative90.9%
Applied egg-rr90.9%
Final simplification85.9%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 2.9e+22)
(/ (/ 1.0 t_0) t_0)
(/ -1.0 (* s_m (* s_m (pow (* x_m c_m) 2.0)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.9e+22) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = -1.0 / (s_m * (s_m * pow((x_m * c_m), 2.0)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 2.9d+22) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = (-1.0d0) / (s_m * (s_m * ((x_m * c_m) ** 2.0d0)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.9e+22) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = -1.0 / (s_m * (s_m * Math.pow((x_m * c_m), 2.0)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.9e+22: tmp = (1.0 / t_0) / t_0 else: tmp = -1.0 / (s_m * (s_m * math.pow((x_m * c_m), 2.0))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.9e+22) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(-1.0 / Float64(s_m * Float64(s_m * (Float64(x_m * c_m) ^ 2.0)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.9e+22)
tmp = (1.0 / t_0) / t_0;
else
tmp = -1.0 / (s_m * (s_m * ((x_m * c_m) ^ 2.0)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.9e+22], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(-1.0 / N[(s$95$m * N[(s$95$m * N[Power[N[(x$95$m * c$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.9 \cdot 10^{+22}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{s\_m \cdot \left(s\_m \cdot {\left(x\_m \cdot c\_m\right)}^{2}\right)}\\
\end{array}
\end{array}
if x < 2.9e22Initial program 66.6%
Taylor expanded in x around 0 56.2%
associate-/r*55.5%
*-commutative55.5%
unpow255.5%
unpow255.5%
swap-sqr65.9%
unpow265.9%
associate-/r*66.3%
unpow266.3%
unpow266.3%
swap-sqr83.4%
unpow283.4%
*-commutative83.4%
Simplified83.4%
*-commutative83.4%
add-sqr-sqrt83.4%
sqrt-div83.4%
metadata-eval83.4%
sqrt-pow159.7%
associate-*r*58.8%
metadata-eval58.8%
pow158.8%
*-commutative58.8%
sqrt-div58.8%
metadata-eval58.8%
sqrt-pow181.7%
associate-*r*81.8%
metadata-eval81.8%
pow181.8%
*-commutative81.8%
Applied egg-rr81.8%
un-div-inv81.8%
*-commutative81.8%
associate-*l*81.7%
*-commutative81.7%
associate-*l*83.8%
Applied egg-rr83.8%
if 2.9e22 < x Initial program 66.7%
Taylor expanded in x around 0 45.8%
associate-/r*45.8%
*-commutative45.8%
unpow245.8%
unpow245.8%
swap-sqr50.3%
unpow250.3%
associate-/r*50.3%
unpow250.3%
unpow250.3%
swap-sqr59.1%
unpow259.1%
*-commutative59.1%
Simplified59.1%
*-commutative59.1%
add-sqr-sqrt59.1%
sqrt-div59.1%
metadata-eval59.1%
sqrt-pow159.7%
associate-*r*59.3%
metadata-eval59.3%
pow159.3%
*-commutative59.3%
sqrt-div59.3%
metadata-eval59.3%
sqrt-pow159.0%
associate-*r*59.0%
metadata-eval59.0%
pow159.0%
*-commutative59.0%
Applied egg-rr59.0%
associate-/r*59.0%
frac-times58.8%
*-un-lft-identity58.8%
*-commutative58.8%
associate-*l*58.8%
*-commutative58.8%
Applied egg-rr58.8%
Applied egg-rr63.4%
associate-*r/63.4%
metadata-eval63.4%
*-commutative63.4%
*-commutative63.4%
Simplified63.4%
Final simplification79.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* x_m (* s_m c_m)))) (/ (cos (* x_m -2.0)) (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
return cos((x_m * -2.0)) / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = x_m * (s_m * c_m)
code = cos((x_m * (-2.0d0))) / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
return Math.cos((x_m * -2.0)) / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) return math.cos((x_m * -2.0)) / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) return Float64(cos(Float64(x_m * -2.0)) / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = cos((x_m * -2.0)) / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\frac{\cos \left(x\_m \cdot -2\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.6%
associate-/r*66.1%
associate-/l/67.4%
unpow267.4%
sqr-neg67.4%
unpow267.4%
associate-/r*66.1%
*-commutative66.1%
associate-/r*66.6%
cos-neg66.6%
*-commutative66.6%
distribute-rgt-neg-in66.6%
metadata-eval66.6%
*-commutative66.6%
associate-*r*67.2%
unpow267.2%
sqr-neg67.2%
unpow267.2%
Simplified59.7%
Taylor expanded in x around inf 59.7%
associate-/r*59.2%
*-commutative59.2%
unpow259.2%
unpow259.2%
swap-sqr73.4%
unpow273.4%
associate-/r*73.6%
*-commutative73.6%
unpow273.6%
unpow273.6%
swap-sqr98.2%
unpow298.2%
associate-*r*95.7%
*-commutative95.7%
Simplified95.7%
add095.7%
associate-*r*97.1%
fma-define97.1%
Applied egg-rr97.1%
fma-undefine97.1%
add097.1%
Applied egg-rr97.1%
unpow297.1%
*-commutative97.1%
*-commutative97.1%
Applied egg-rr97.1%
Final simplification97.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* s_m (* x_m c_m)))) (/ (/ (cos (* x_m -2.0)) t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
return (cos((x_m * -2.0)) / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = s_m * (x_m * c_m)
code = (cos((x_m * (-2.0d0))) / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
return (Math.cos((x_m * -2.0)) / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) return (math.cos((x_m * -2.0)) / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) return Float64(Float64(cos(Float64(x_m * -2.0)) / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = s_m * (x_m * c_m);
tmp = (cos((x_m * -2.0)) / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\frac{\frac{\cos \left(x\_m \cdot -2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.6%
div-inv66.6%
*-commutative66.6%
*-commutative66.6%
associate-*r*59.7%
unpow259.7%
*-commutative59.7%
pow-prod-down73.6%
pow-prod-down98.1%
*-commutative98.1%
Applied egg-rr98.1%
associate-*l/98.2%
*-un-lft-identity98.2%
unpow298.2%
associate-/r*98.4%
add-sqr-sqrt48.2%
sqrt-unprod71.9%
*-commutative71.9%
*-commutative71.9%
swap-sqr71.9%
metadata-eval71.9%
metadata-eval71.9%
swap-sqr71.9%
sqrt-unprod41.6%
add-sqr-sqrt98.4%
associate-*r*94.9%
*-commutative94.9%
associate-*r*95.9%
*-commutative95.9%
Applied egg-rr95.9%
Final simplification95.9%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 2.9e+22)
(/ (/ 1.0 t_0) t_0)
(/ (/ 1.0 s_m) (* (* x_m (* s_m c_m)) (* c_m (- x_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.9e+22) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = (1.0 / s_m) / ((x_m * (s_m * c_m)) * (c_m * -x_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 2.9d+22) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = (1.0d0 / s_m) / ((x_m * (s_m * c_m)) * (c_m * -x_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.9e+22) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = (1.0 / s_m) / ((x_m * (s_m * c_m)) * (c_m * -x_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.9e+22: tmp = (1.0 / t_0) / t_0 else: tmp = (1.0 / s_m) / ((x_m * (s_m * c_m)) * (c_m * -x_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.9e+22) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(Float64(1.0 / s_m) / Float64(Float64(x_m * Float64(s_m * c_m)) * Float64(c_m * Float64(-x_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.9e+22)
tmp = (1.0 / t_0) / t_0;
else
tmp = (1.0 / s_m) / ((x_m * (s_m * c_m)) * (c_m * -x_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.9e+22], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / s$95$m), $MachinePrecision] / N[(N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * (-x$95$m)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.9 \cdot 10^{+22}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{s\_m}}{\left(x\_m \cdot \left(s\_m \cdot c\_m\right)\right) \cdot \left(c\_m \cdot \left(-x\_m\right)\right)}\\
\end{array}
\end{array}
if x < 2.9e22Initial program 66.6%
Taylor expanded in x around 0 56.2%
associate-/r*55.5%
*-commutative55.5%
unpow255.5%
unpow255.5%
swap-sqr65.9%
unpow265.9%
associate-/r*66.3%
unpow266.3%
unpow266.3%
swap-sqr83.4%
unpow283.4%
*-commutative83.4%
Simplified83.4%
*-commutative83.4%
add-sqr-sqrt83.4%
sqrt-div83.4%
metadata-eval83.4%
sqrt-pow159.7%
associate-*r*58.8%
metadata-eval58.8%
pow158.8%
*-commutative58.8%
sqrt-div58.8%
metadata-eval58.8%
sqrt-pow181.7%
associate-*r*81.8%
metadata-eval81.8%
pow181.8%
*-commutative81.8%
Applied egg-rr81.8%
un-div-inv81.8%
*-commutative81.8%
associate-*l*81.7%
*-commutative81.7%
associate-*l*83.8%
Applied egg-rr83.8%
if 2.9e22 < x Initial program 66.7%
Taylor expanded in x around 0 45.8%
associate-/r*45.8%
*-commutative45.8%
unpow245.8%
unpow245.8%
swap-sqr50.3%
unpow250.3%
associate-/r*50.3%
unpow250.3%
unpow250.3%
swap-sqr59.1%
unpow259.1%
*-commutative59.1%
Simplified59.1%
*-commutative59.1%
add-sqr-sqrt59.1%
sqrt-div59.1%
metadata-eval59.1%
sqrt-pow159.7%
associate-*r*59.3%
metadata-eval59.3%
pow159.3%
*-commutative59.3%
sqrt-div59.3%
metadata-eval59.3%
sqrt-pow159.0%
associate-*r*59.0%
metadata-eval59.0%
pow159.0%
*-commutative59.0%
Applied egg-rr59.0%
associate-/r*59.0%
frac-times58.8%
*-un-lft-identity58.8%
*-commutative58.8%
associate-*l*58.8%
*-commutative58.8%
Applied egg-rr58.8%
associate-*r*58.8%
*-commutative58.8%
add-sqr-sqrt24.2%
sqrt-unprod64.7%
sqr-neg64.7%
sqrt-unprod40.8%
add-sqr-sqrt63.7%
distribute-rgt-neg-in63.7%
neg-sub063.7%
associate-*r*58.6%
*-commutative58.6%
Applied egg-rr58.6%
neg-sub063.7%
distribute-rgt-neg-in63.7%
distribute-lft-neg-in63.7%
Simplified63.7%
Final simplification79.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ 1.0 s_m) (* (* c_m (* x_m s_m)) (* x_m c_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (1.0 / s_m) / ((c_m * (x_m * s_m)) * (x_m * c_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (1.0d0 / s_m) / ((c_m * (x_m * s_m)) * (x_m * c_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (1.0 / s_m) / ((c_m * (x_m * s_m)) * (x_m * c_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (1.0 / s_m) / ((c_m * (x_m * s_m)) * (x_m * c_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(1.0 / s_m) / Float64(Float64(c_m * Float64(x_m * s_m)) * Float64(x_m * c_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (1.0 / s_m) / ((c_m * (x_m * s_m)) * (x_m * c_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(1.0 / s$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{1}{s\_m}}{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right) \cdot \left(x\_m \cdot c\_m\right)}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0 53.8%
associate-/r*53.3%
*-commutative53.3%
unpow253.3%
unpow253.3%
swap-sqr62.3%
unpow262.3%
associate-/r*62.6%
unpow262.6%
unpow262.6%
swap-sqr77.8%
unpow277.8%
*-commutative77.8%
Simplified77.8%
*-commutative77.8%
add-sqr-sqrt77.8%
sqrt-div77.8%
metadata-eval77.8%
sqrt-pow159.7%
associate-*r*58.9%
metadata-eval58.9%
pow158.9%
*-commutative58.9%
sqrt-div58.9%
metadata-eval58.9%
sqrt-pow176.5%
associate-*r*76.5%
metadata-eval76.5%
pow176.5%
*-commutative76.5%
Applied egg-rr76.5%
associate-/r*76.6%
frac-times75.5%
*-un-lft-identity75.5%
*-commutative75.5%
associate-*l*75.4%
*-commutative75.4%
Applied egg-rr75.4%
Final simplification75.4%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ 1.0 s_m) (* (* s_m (* x_m c_m)) (* x_m c_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (1.0 / s_m) / ((s_m * (x_m * c_m)) * (x_m * c_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (1.0d0 / s_m) / ((s_m * (x_m * c_m)) * (x_m * c_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (1.0 / s_m) / ((s_m * (x_m * c_m)) * (x_m * c_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (1.0 / s_m) / ((s_m * (x_m * c_m)) * (x_m * c_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(1.0 / s_m) / Float64(Float64(s_m * Float64(x_m * c_m)) * Float64(x_m * c_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (1.0 / s_m) / ((s_m * (x_m * c_m)) * (x_m * c_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(1.0 / s$95$m), $MachinePrecision] / N[(N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{1}{s\_m}}{\left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right) \cdot \left(x\_m \cdot c\_m\right)}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0 53.8%
associate-/r*53.3%
*-commutative53.3%
unpow253.3%
unpow253.3%
swap-sqr62.3%
unpow262.3%
associate-/r*62.6%
unpow262.6%
unpow262.6%
swap-sqr77.8%
unpow277.8%
*-commutative77.8%
Simplified77.8%
*-commutative77.8%
add-sqr-sqrt77.8%
sqrt-div77.8%
metadata-eval77.8%
sqrt-pow159.7%
associate-*r*58.9%
metadata-eval58.9%
pow158.9%
*-commutative58.9%
sqrt-div58.9%
metadata-eval58.9%
sqrt-pow176.5%
associate-*r*76.5%
metadata-eval76.5%
pow176.5%
*-commutative76.5%
Applied egg-rr76.5%
associate-/r*76.6%
frac-times75.5%
*-un-lft-identity75.5%
*-commutative75.5%
associate-*l*75.4%
*-commutative75.4%
Applied egg-rr75.4%
associate-*r*75.5%
*-commutative75.5%
add066.5%
fma-define70.8%
Applied egg-rr70.8%
fma-undefine66.5%
add075.5%
*-commutative75.5%
Simplified75.5%
Final simplification75.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* c_m (* x_m s_m)))) (/ (/ 1.0 t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return (1.0 / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x_m * s_m)
code = (1.0d0 / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return (1.0 / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) return (1.0 / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) return Float64(Float64(1.0 / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = (1.0 / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0 53.8%
associate-/r*53.3%
*-commutative53.3%
unpow253.3%
unpow253.3%
swap-sqr62.3%
unpow262.3%
associate-/r*62.6%
unpow262.6%
unpow262.6%
swap-sqr77.8%
unpow277.8%
*-commutative77.8%
Simplified77.8%
*-commutative77.8%
add-sqr-sqrt77.8%
sqrt-div77.8%
metadata-eval77.8%
sqrt-pow159.7%
associate-*r*58.9%
metadata-eval58.9%
pow158.9%
*-commutative58.9%
sqrt-div58.9%
metadata-eval58.9%
sqrt-pow176.5%
associate-*r*76.5%
metadata-eval76.5%
pow176.5%
*-commutative76.5%
Applied egg-rr76.5%
un-div-inv76.6%
*-commutative76.6%
associate-*l*76.5%
*-commutative76.5%
associate-*l*78.1%
Applied egg-rr78.1%
Final simplification78.1%
herbie shell --seed 2024034
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))