
(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 12 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 (if (<= x_m 0.24) (pow (* c_m (* x_m s_m)) -2.0) (/ (cos (* x_m -2.0)) (* s_m (* (* x_m c_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 tmp;
if (x_m <= 0.24) {
tmp = pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = cos((x_m * -2.0)) / (s_m * ((x_m * c_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) :: tmp
if (x_m <= 0.24d0) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
else
tmp = cos((x_m * (-2.0d0))) / (s_m * ((x_m * c_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 tmp;
if (x_m <= 0.24) {
tmp = Math.pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = Math.cos((x_m * -2.0)) / (s_m * ((x_m * c_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): tmp = 0 if x_m <= 0.24: tmp = math.pow((c_m * (x_m * s_m)), -2.0) else: tmp = math.cos((x_m * -2.0)) / (s_m * ((x_m * c_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) tmp = 0.0 if (x_m <= 0.24) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.0; else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(s_m * Float64(Float64(x_m * c_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)
tmp = 0.0;
if (x_m <= 0.24)
tmp = (c_m * (x_m * s_m)) ^ -2.0;
else
tmp = cos((x_m * -2.0)) / (s_m * ((x_m * c_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_] := If[LessEqual[x$95$m, 0.24], 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[(N[(x$95$m * c$95$m), $MachinePrecision] * 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}
\mathbf{if}\;x_m \leq 0.24:\\
\;\;\;\;{\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(\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 0.23999999999999999Initial program 73.6%
associate-/r*73.6%
associate-*l*73.6%
unpow273.6%
sqr-neg73.6%
unpow273.6%
*-commutative73.6%
*-commutative73.6%
associate-/r*73.6%
cos-neg73.6%
*-commutative73.6%
distribute-rgt-neg-in73.6%
metadata-eval73.6%
associate-*r*75.1%
*-commutative75.1%
unpow275.1%
sqr-neg75.1%
associate-*l*81.2%
associate-*r*81.9%
Simplified69.7%
Taylor expanded in x around inf 69.7%
associate-/r*69.7%
*-commutative69.7%
unpow269.7%
unpow269.7%
swap-sqr82.6%
unpow282.6%
associate-/r*82.6%
*-commutative82.6%
unpow282.6%
unpow282.6%
swap-sqr97.6%
unpow297.6%
associate-*r*97.6%
*-commutative97.6%
Simplified97.6%
Taylor expanded in x around 0 64.5%
associate-*r*65.1%
*-commutative65.1%
unpow265.1%
unpow265.1%
swap-sqr76.5%
unpow276.5%
swap-sqr88.7%
associate-*r*87.2%
associate-*r*87.2%
unpow287.2%
/-rgt-identity87.2%
unpow287.2%
associate-/l*87.2%
associate-/l*87.1%
associate-*l/87.1%
unpow-187.1%
unpow-187.1%
pow-sqr87.2%
metadata-eval87.2%
Simplified88.0%
if 0.23999999999999999 < x Initial program 66.7%
associate-/r*64.6%
associate-*l*64.6%
unpow264.6%
sqr-neg64.6%
unpow264.6%
*-commutative64.6%
*-commutative64.6%
associate-/r*66.7%
cos-neg66.7%
*-commutative66.7%
distribute-rgt-neg-in66.7%
metadata-eval66.7%
associate-*r*66.8%
*-commutative66.8%
unpow266.8%
sqr-neg66.8%
associate-*l*72.8%
associate-*r*75.2%
Simplified58.6%
Taylor expanded in x around inf 58.6%
associate-/r*56.5%
*-commutative56.5%
unpow256.5%
unpow256.5%
swap-sqr76.6%
unpow276.6%
associate-/r*78.6%
*-commutative78.6%
unpow278.6%
unpow278.6%
swap-sqr95.8%
unpow295.8%
associate-*r*97.3%
*-commutative97.3%
Simplified97.3%
unpow297.3%
associate-*r*93.2%
*-commutative93.2%
associate-*r*94.5%
*-commutative94.5%
associate-*r*91.7%
associate-*r*90.3%
*-commutative90.3%
associate-*r*94.6%
Applied egg-rr94.6%
Final simplification89.7%
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 1.25e-204) (/ (/ 1.0 c_m) (* (* x_m (* s_m c_m)) (* x_m s_m))) (/ (cos (* x_m -2.0)) (* (* s_m c_m) (* x_m (* c_m (* x_m s_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 <= 1.25e-204) {
tmp = (1.0 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_m));
} else {
tmp = cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (c_m * (x_m * s_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 <= 1.25d-204) then
tmp = (1.0d0 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_m))
else
tmp = cos((x_m * (-2.0d0))) / ((s_m * c_m) * (x_m * (c_m * (x_m * s_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 <= 1.25e-204) {
tmp = (1.0 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_m));
} else {
tmp = Math.cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (c_m * (x_m * s_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 <= 1.25e-204: tmp = (1.0 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_m)) else: tmp = math.cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (c_m * (x_m * s_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 <= 1.25e-204) tmp = Float64(Float64(1.0 / c_m) / Float64(Float64(x_m * Float64(s_m * c_m)) * Float64(x_m * s_m))); else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(c_m * Float64(x_m * s_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 <= 1.25e-204)
tmp = (1.0 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_m));
else
tmp = cos((x_m * -2.0)) / ((s_m * c_m) * (x_m * (c_m * (x_m * s_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, 1.25e-204], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $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[(c$95$m * N[(x$95$m * s$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}
\mathbf{if}\;x_m \leq 1.25 \cdot 10^{-204}:\\
\;\;\;\;\frac{\frac{1}{c_m}}{\left(x_m \cdot \left(s_m \cdot c_m\right)\right) \cdot \left(x_m \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot -2\right)}{\left(s_m \cdot c_m\right) \cdot \left(x_m \cdot \left(c_m \cdot \left(x_m \cdot s_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 1.25e-204Initial program 75.1%
associate-/r*75.1%
associate-*l*75.1%
unpow275.1%
sqr-neg75.1%
unpow275.1%
*-commutative75.1%
*-commutative75.1%
associate-/r*75.1%
cos-neg75.1%
*-commutative75.1%
distribute-rgt-neg-in75.1%
metadata-eval75.1%
associate-*r*77.0%
*-commutative77.0%
unpow277.0%
sqr-neg77.0%
associate-*l*82.8%
associate-*r*84.2%
Simplified71.6%
Taylor expanded in x around inf 71.6%
associate-/r*71.6%
*-commutative71.6%
unpow271.6%
unpow271.6%
swap-sqr84.1%
unpow284.1%
associate-/r*84.1%
*-commutative84.1%
unpow284.1%
unpow284.1%
swap-sqr97.7%
unpow297.7%
associate-*r*97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in x around 0 65.0%
associate-*r*65.8%
*-commutative65.8%
unpow265.8%
unpow265.8%
swap-sqr75.0%
unpow275.0%
swap-sqr85.8%
associate-*r*83.9%
associate-*r*83.9%
unpow283.9%
/-rgt-identity83.9%
unpow283.9%
associate-/l*83.9%
associate-/l*83.8%
associate-*l/83.8%
unpow-183.8%
unpow-183.8%
pow-sqr83.9%
metadata-eval83.9%
Simplified85.6%
metadata-eval85.6%
pow-sqr85.5%
inv-pow85.5%
inv-pow85.5%
associate-/r*85.5%
frac-times84.2%
*-un-lft-identity84.2%
*-commutative84.2%
associate-*r*82.2%
*-commutative82.2%
associate-*l*84.2%
*-commutative84.2%
Applied egg-rr84.2%
if 1.25e-204 < x Initial program 67.1%
associate-/r*65.8%
associate-*l*65.8%
unpow265.8%
sqr-neg65.8%
unpow265.8%
*-commutative65.8%
*-commutative65.8%
associate-/r*67.1%
cos-neg67.1%
*-commutative67.1%
distribute-rgt-neg-in67.1%
metadata-eval67.1%
associate-*r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
associate-*l*73.7%
associate-*r*74.4%
Simplified60.1%
Taylor expanded in x around inf 60.1%
associate-/r*58.8%
*-commutative58.8%
unpow258.8%
unpow258.8%
swap-sqr76.8%
unpow276.8%
associate-/r*78.1%
*-commutative78.1%
unpow278.1%
unpow278.1%
swap-sqr96.4%
unpow296.4%
associate-*r*98.2%
*-commutative98.2%
Simplified98.2%
associate-*r*96.4%
*-commutative96.4%
associate-*r*96.4%
unpow296.4%
associate-*r*93.8%
associate-*l*93.8%
*-commutative93.8%
associate-*r*94.7%
*-commutative94.7%
associate-*r*93.9%
Applied egg-rr93.9%
Taylor expanded in s around 0 93.8%
Final simplification88.2%
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 8.5e-9) (pow (* c_m (* x_m s_m)) -2.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 tmp;
if (x_m <= 8.5e-9) {
tmp = pow((c_m * (x_m * s_m)), -2.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) :: tmp
if (x_m <= 8.5d-9) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
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 tmp;
if (x_m <= 8.5e-9) {
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 * (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): tmp = 0 if x_m <= 8.5e-9: 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 * (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) tmp = 0.0 if (x_m <= 8.5e-9) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.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)
tmp = 0.0;
if (x_m <= 8.5e-9)
tmp = (c_m * (x_m * s_m)) ^ -2.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_] := If[LessEqual[x$95$m, 8.5e-9], 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[(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}
\mathbf{if}\;x_m \leq 8.5 \cdot 10^{-9}:\\
\;\;\;\;{\left(c_m \cdot \left(x_m \cdot s_m\right)\right)}^{-2}\\
\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 < 8.5e-9Initial program 73.4%
associate-/r*73.4%
associate-*l*73.4%
unpow273.4%
sqr-neg73.4%
unpow273.4%
*-commutative73.4%
*-commutative73.4%
associate-/r*73.4%
cos-neg73.4%
*-commutative73.4%
distribute-rgt-neg-in73.4%
metadata-eval73.4%
associate-*r*75.0%
*-commutative75.0%
unpow275.0%
sqr-neg75.0%
associate-*l*81.1%
associate-*r*81.8%
Simplified69.5%
Taylor expanded in x around inf 69.5%
associate-/r*69.5%
*-commutative69.5%
unpow269.5%
unpow269.5%
swap-sqr82.5%
unpow282.5%
associate-/r*82.5%
*-commutative82.5%
unpow282.5%
unpow282.5%
swap-sqr97.6%
unpow297.6%
associate-*r*97.6%
*-commutative97.6%
Simplified97.6%
Taylor expanded in x around 0 64.3%
associate-*r*64.9%
*-commutative64.9%
unpow264.9%
unpow264.9%
swap-sqr76.4%
unpow276.4%
swap-sqr88.6%
associate-*r*87.1%
associate-*r*87.1%
unpow287.1%
/-rgt-identity87.1%
unpow287.1%
associate-/l*87.1%
associate-/l*87.0%
associate-*l/87.0%
unpow-187.0%
unpow-187.0%
pow-sqr87.1%
metadata-eval87.1%
Simplified88.0%
if 8.5e-9 < x Initial program 67.2%
associate-/r*65.1%
associate-*l*65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
*-commutative65.1%
*-commutative65.1%
associate-/r*67.2%
cos-neg67.2%
*-commutative67.2%
distribute-rgt-neg-in67.2%
metadata-eval67.2%
associate-*r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
associate-*l*73.2%
associate-*r*75.6%
Simplified59.3%
Taylor expanded in x around inf 59.3%
associate-/r*57.2%
*-commutative57.2%
unpow257.2%
unpow257.2%
swap-sqr76.9%
unpow276.9%
associate-/r*79.0%
*-commutative79.0%
unpow279.0%
unpow279.0%
swap-sqr95.9%
unpow295.9%
associate-*r*97.3%
*-commutative97.3%
Simplified97.3%
associate-*r*94.6%
*-commutative94.6%
associate-*r*95.9%
unpow295.9%
associate-*r*91.8%
associate-*l*91.8%
*-commutative91.8%
associate-*r*91.7%
*-commutative91.7%
associate-*r*90.5%
Applied egg-rr90.5%
Final simplification88.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 (/ (* (/ (cos (* x_m -2.0)) s_m) (/ 1.0 (* x_m c_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 ((cos((x_m * -2.0)) / s_m) * (1.0 / (x_m * c_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 = ((cos((x_m * (-2.0d0))) / s_m) * (1.0d0 / (x_m * c_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 ((Math.cos((x_m * -2.0)) / s_m) * (1.0 / (x_m * c_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 ((math.cos((x_m * -2.0)) / s_m) * (1.0 / (x_m * c_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(Float64(cos(Float64(x_m * -2.0)) / s_m) * Float64(1.0 / Float64(x_m * c_m))) / Float64(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 = ((cos((x_m * -2.0)) / s_m) * (1.0 / (x_m * c_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[(N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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{\cos \left(x_m \cdot -2\right)}{s_m} \cdot \frac{1}{x_m \cdot c_m}}{s_m \cdot \left(x_m \cdot c_m\right)}
\end{array}
Initial program 71.8%
associate-/r*71.3%
*-commutative71.3%
associate-*r*66.4%
unpow266.4%
associate-/r*66.9%
add-sqr-sqrt28.7%
sqrt-unprod50.5%
swap-sqr50.5%
metadata-eval50.5%
metadata-eval50.5%
swap-sqr50.5%
*-commutative50.5%
*-commutative50.5%
sqrt-unprod35.6%
add-sqr-sqrt66.9%
*-un-lft-identity66.9%
associate-*r*67.5%
Applied egg-rr82.1%
frac-times82.3%
*-un-lft-identity82.3%
pow-prod-down98.3%
associate-*r*97.1%
unpow297.1%
associate-/r*97.4%
Applied egg-rr97.8%
associate-/r*97.8%
div-inv97.9%
*-commutative97.9%
Applied egg-rr97.9%
Final simplification97.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 (* 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 71.8%
associate-/r*71.3%
*-commutative71.3%
associate-*r*66.4%
unpow266.4%
associate-/r*66.9%
add-sqr-sqrt28.7%
sqrt-unprod50.5%
swap-sqr50.5%
metadata-eval50.5%
metadata-eval50.5%
swap-sqr50.5%
*-commutative50.5%
*-commutative50.5%
sqrt-unprod35.6%
add-sqr-sqrt66.9%
*-un-lft-identity66.9%
associate-*r*67.5%
Applied egg-rr82.1%
frac-times82.3%
*-un-lft-identity82.3%
pow-prod-down98.3%
associate-*r*97.1%
unpow297.1%
associate-/r*97.4%
Applied egg-rr97.8%
Final simplification97.8%
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 (/ (/ (/ (cos (* x_m -2.0)) s_m) (* x_m c_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 ((cos((x_m * -2.0)) / s_m) / (x_m * c_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 = ((cos((x_m * (-2.0d0))) / s_m) / (x_m * c_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 ((Math.cos((x_m * -2.0)) / s_m) / (x_m * c_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 ((math.cos((x_m * -2.0)) / s_m) / (x_m * c_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(Float64(cos(Float64(x_m * -2.0)) / s_m) / Float64(x_m * c_m)) / Float64(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 = ((cos((x_m * -2.0)) / s_m) / (x_m * c_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[(N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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{\frac{\cos \left(x_m \cdot -2\right)}{s_m}}{x_m \cdot c_m}}{s_m \cdot \left(x_m \cdot c_m\right)}
\end{array}
Initial program 71.8%
associate-/r*71.3%
*-commutative71.3%
associate-*r*66.4%
unpow266.4%
associate-/r*66.9%
add-sqr-sqrt28.7%
sqrt-unprod50.5%
swap-sqr50.5%
metadata-eval50.5%
metadata-eval50.5%
swap-sqr50.5%
*-commutative50.5%
*-commutative50.5%
sqrt-unprod35.6%
add-sqr-sqrt66.9%
*-un-lft-identity66.9%
associate-*r*67.5%
Applied egg-rr82.1%
frac-times82.3%
*-un-lft-identity82.3%
pow-prod-down98.3%
associate-*r*97.1%
unpow297.1%
associate-/r*97.4%
Applied egg-rr97.8%
associate-/r*97.8%
div-inv97.9%
*-commutative97.9%
Applied egg-rr97.9%
un-div-inv97.8%
Applied egg-rr97.8%
Final simplification97.8%
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 (/ 1.0 (pow (* x_m (* s_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) {
return 1.0 / (1.0 / pow((x_m * (s_m * c_m)), -2.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
code = 1.0d0 / (1.0d0 / ((x_m * (s_m * c_m)) ** (-2.0d0)))
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 / (1.0 / Math.pow((x_m * (s_m * c_m)), -2.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): return 1.0 / (1.0 / math.pow((x_m * (s_m * c_m)), -2.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) return Float64(1.0 / Float64(1.0 / (Float64(x_m * Float64(s_m * c_m)) ^ -2.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)
tmp = 1.0 / (1.0 / ((x_m * (s_m * c_m)) ^ -2.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_] := N[(1.0 / N[(1.0 / N[Power[N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $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{1}{\frac{1}{{\left(x_m \cdot \left(s_m \cdot c_m\right)\right)}^{-2}}}
\end{array}
Initial program 71.8%
Taylor expanded in x around 0 61.2%
associate-/r*60.8%
*-commutative60.8%
unpow260.8%
unpow260.8%
swap-sqr70.7%
unpow270.7%
associate-/r*71.1%
unpow271.1%
unpow271.1%
swap-sqr81.6%
unpow281.6%
*-commutative81.6%
Simplified81.6%
add-sqr-sqrt81.6%
sqrt-div81.6%
metadata-eval81.6%
sqrt-pow157.9%
metadata-eval57.9%
associate-*r*57.8%
*-commutative57.8%
associate-*r*57.1%
pow157.1%
sqrt-div57.1%
metadata-eval57.1%
sqrt-pow180.4%
metadata-eval80.4%
associate-*r*80.9%
*-commutative80.9%
associate-*r*80.9%
pow180.9%
Applied egg-rr80.9%
frac-2neg80.9%
metadata-eval80.9%
frac-2neg80.9%
metadata-eval80.9%
frac-times81.0%
metadata-eval81.0%
*-commutative81.0%
distribute-rgt-neg-in81.0%
*-commutative81.0%
*-commutative81.0%
distribute-rgt-neg-in81.0%
*-commutative81.0%
Applied egg-rr81.0%
/-rgt-identity81.0%
clear-num81.0%
swap-sqr70.9%
sqr-neg70.9%
swap-sqr81.0%
*-commutative81.0%
*-commutative81.0%
*-commutative81.0%
associate-*r*80.4%
*-commutative80.4%
associate-/l/80.4%
*-commutative80.4%
associate-*r*81.6%
*-commutative81.6%
un-div-inv81.6%
inv-pow81.6%
inv-pow81.6%
pow-sqr81.6%
Applied egg-rr82.1%
Final simplification82.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 (pow (/ x_m (/ -1.0 (* s_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) {
return pow((x_m / (-1.0 / (s_m * c_m))), -2.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
code = (x_m / ((-1.0d0) / (s_m * c_m))) ** (-2.0d0)
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 Math.pow((x_m / (-1.0 / (s_m * c_m))), -2.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): return math.pow((x_m / (-1.0 / (s_m * c_m))), -2.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) return Float64(x_m / Float64(-1.0 / Float64(s_m * c_m))) ^ -2.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)
tmp = (x_m / (-1.0 / (s_m * c_m))) ^ -2.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_] := N[Power[N[(x$95$m / N[(-1.0 / N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2.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])\\
\\
{\left(\frac{x_m}{\frac{-1}{s_m \cdot c_m}}\right)}^{-2}
\end{array}
Initial program 71.8%
associate-/r*71.3%
associate-*l*71.3%
unpow271.3%
sqr-neg71.3%
unpow271.3%
*-commutative71.3%
*-commutative71.3%
associate-/r*71.8%
cos-neg71.8%
*-commutative71.8%
distribute-rgt-neg-in71.8%
metadata-eval71.8%
associate-*r*73.0%
*-commutative73.0%
unpow273.0%
sqr-neg73.0%
associate-*l*79.1%
associate-*r*80.2%
Simplified66.9%
Taylor expanded in x around inf 66.9%
associate-/r*66.4%
*-commutative66.4%
unpow266.4%
unpow266.4%
swap-sqr81.1%
unpow281.1%
associate-/r*81.6%
*-commutative81.6%
unpow281.6%
unpow281.6%
swap-sqr97.1%
unpow297.1%
associate-*r*97.5%
*-commutative97.5%
Simplified97.5%
Taylor expanded in x around 0 61.2%
associate-*r*61.6%
*-commutative61.6%
unpow261.6%
unpow261.6%
swap-sqr72.4%
unpow272.4%
swap-sqr82.1%
associate-*r*80.9%
associate-*r*81.0%
unpow281.0%
/-rgt-identity81.0%
unpow281.0%
associate-/l*81.0%
associate-/l*80.9%
associate-*l/80.9%
unpow-180.9%
unpow-180.9%
pow-sqr81.0%
metadata-eval81.0%
Simplified81.6%
/-rgt-identity81.6%
frac-2neg81.6%
*-commutative81.6%
associate-*r*81.0%
distribute-lft-neg-in81.0%
add-sqr-sqrt35.5%
sqrt-unprod72.9%
sqr-neg72.9%
sqrt-unprod45.4%
add-sqr-sqrt81.0%
*-commutative81.0%
associate-*l*82.1%
metadata-eval82.1%
Applied egg-rr82.1%
associate-/l*82.1%
Simplified82.1%
Final simplification82.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 (* x_m (* s_m c_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 / (x_m * (s_m * c_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) / (x_m * (s_m * c_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 / (x_m * (s_m * c_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 / (x_m * (s_m * c_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 / Float64(x_m * Float64(s_m * c_m))) / Float64(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 / (x_m * (s_m * c_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 / N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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}{x_m \cdot \left(s_m \cdot c_m\right)}}{s_m \cdot \left(x_m \cdot c_m\right)}
\end{array}
Initial program 71.8%
associate-/r*71.3%
*-commutative71.3%
associate-*r*66.4%
unpow266.4%
associate-/r*66.9%
add-sqr-sqrt28.7%
sqrt-unprod50.5%
swap-sqr50.5%
metadata-eval50.5%
metadata-eval50.5%
swap-sqr50.5%
*-commutative50.5%
*-commutative50.5%
sqrt-unprod35.6%
add-sqr-sqrt66.9%
*-un-lft-identity66.9%
associate-*r*67.5%
Applied egg-rr82.1%
frac-times82.3%
*-un-lft-identity82.3%
pow-prod-down98.3%
associate-*r*97.1%
unpow297.1%
associate-/r*97.4%
Applied egg-rr97.8%
Taylor expanded in x around 0 80.4%
Applied egg-rr39.9%
neg-sub039.9%
associate-/r*39.9%
*-commutative39.9%
associate-*r*39.9%
*-commutative39.9%
distribute-neg-frac39.9%
metadata-eval39.9%
Simplified39.9%
Final simplification39.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 (/ (/ 1.0 c_m) (* (* x_m (* s_m c_m)) (* x_m s_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 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_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 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_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 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_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 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_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 / c_m) / Float64(Float64(x_m * Float64(s_m * c_m)) * Float64(x_m * s_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 / c_m) / ((x_m * (s_m * c_m)) * (x_m * s_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 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * s$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}{c_m}}{\left(x_m \cdot \left(s_m \cdot c_m\right)\right) \cdot \left(x_m \cdot s_m\right)}
\end{array}
Initial program 71.8%
associate-/r*71.3%
associate-*l*71.3%
unpow271.3%
sqr-neg71.3%
unpow271.3%
*-commutative71.3%
*-commutative71.3%
associate-/r*71.8%
cos-neg71.8%
*-commutative71.8%
distribute-rgt-neg-in71.8%
metadata-eval71.8%
associate-*r*73.0%
*-commutative73.0%
unpow273.0%
sqr-neg73.0%
associate-*l*79.1%
associate-*r*80.2%
Simplified66.9%
Taylor expanded in x around inf 66.9%
associate-/r*66.4%
*-commutative66.4%
unpow266.4%
unpow266.4%
swap-sqr81.1%
unpow281.1%
associate-/r*81.6%
*-commutative81.6%
unpow281.6%
unpow281.6%
swap-sqr97.1%
unpow297.1%
associate-*r*97.5%
*-commutative97.5%
Simplified97.5%
Taylor expanded in x around 0 61.2%
associate-*r*61.6%
*-commutative61.6%
unpow261.6%
unpow261.6%
swap-sqr72.4%
unpow272.4%
swap-sqr82.1%
associate-*r*80.9%
associate-*r*81.0%
unpow281.0%
/-rgt-identity81.0%
unpow281.0%
associate-/l*81.0%
associate-/l*80.9%
associate-*l/80.9%
unpow-180.9%
unpow-180.9%
pow-sqr81.0%
metadata-eval81.0%
Simplified81.6%
metadata-eval81.6%
pow-sqr81.6%
inv-pow81.6%
inv-pow81.6%
associate-/r*81.6%
frac-times80.4%
*-un-lft-identity80.4%
*-commutative80.4%
associate-*r*79.2%
*-commutative79.2%
associate-*l*80.4%
*-commutative80.4%
Applied egg-rr80.4%
Final simplification80.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 (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 71.8%
associate-/r*71.3%
*-commutative71.3%
associate-*r*66.4%
unpow266.4%
associate-/r*66.9%
add-sqr-sqrt28.7%
sqrt-unprod50.5%
swap-sqr50.5%
metadata-eval50.5%
metadata-eval50.5%
swap-sqr50.5%
*-commutative50.5%
*-commutative50.5%
sqrt-unprod35.6%
add-sqr-sqrt66.9%
*-un-lft-identity66.9%
associate-*r*67.5%
Applied egg-rr82.1%
frac-times82.3%
*-un-lft-identity82.3%
pow-prod-down98.3%
associate-*r*97.1%
unpow297.1%
associate-/r*97.4%
Applied egg-rr97.8%
Taylor expanded in x around 0 80.4%
Taylor expanded in s around 0 81.6%
Final simplification81.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 (* x_m (* s_m c_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 = x_m * (s_m * c_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 = x_m * (s_m * c_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 = x_m * (s_m * c_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 = x_m * (s_m * c_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(x_m * Float64(s_m * c_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 = x_m * (s_m * c_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[(x$95$m * N[(s$95$m * c$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 := x_m \cdot \left(s_m \cdot c_m\right)\\
\frac{\frac{1}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 71.8%
Taylor expanded in x around 0 61.2%
associate-/r*60.8%
*-commutative60.8%
unpow260.8%
unpow260.8%
swap-sqr70.7%
unpow270.7%
associate-/r*71.1%
unpow271.1%
unpow271.1%
swap-sqr81.6%
unpow281.6%
*-commutative81.6%
Simplified81.6%
add-sqr-sqrt81.6%
sqrt-div81.6%
metadata-eval81.6%
sqrt-pow157.9%
metadata-eval57.9%
associate-*r*57.8%
*-commutative57.8%
associate-*r*57.1%
pow157.1%
sqrt-div57.1%
metadata-eval57.1%
sqrt-pow180.4%
metadata-eval80.4%
associate-*r*80.9%
*-commutative80.9%
associate-*r*80.9%
pow180.9%
Applied egg-rr80.9%
un-div-inv80.9%
*-commutative80.9%
*-commutative80.9%
*-commutative80.9%
associate-*l*80.9%
*-commutative80.9%
*-commutative80.9%
associate-*l*82.0%
*-commutative82.0%
Applied egg-rr82.0%
Final simplification82.0%
herbie shell --seed 2024013
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))