
(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 8 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 3.3e-15) (pow (* c_m (* x_m s_m)) -2.0) (/ (/ (/ (cos (* x_m 2.0)) (* s_m (* x_m c_m))) (* x_m c_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 <= 3.3e-15) {
tmp = pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = ((cos((x_m * 2.0)) / (s_m * (x_m * c_m))) / (x_m * c_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 <= 3.3d-15) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
else
tmp = ((cos((x_m * 2.0d0)) / (s_m * (x_m * c_m))) / (x_m * c_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 <= 3.3e-15) {
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))) / (x_m * c_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 <= 3.3e-15: 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))) / (x_m * c_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 <= 3.3e-15) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.0; else tmp = Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(s_m * Float64(x_m * c_m))) / Float64(x_m * c_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 <= 3.3e-15)
tmp = (c_m * (x_m * s_m)) ^ -2.0;
else
tmp = ((cos((x_m * 2.0)) / (s_m * (x_m * c_m))) / (x_m * c_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, 3.3e-15], N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $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 3.3 \cdot 10^{-15}:\\
\;\;\;\;{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m \cdot \left(x\_m \cdot c\_m\right)}}{x\_m \cdot c\_m}}{s\_m}\\
\end{array}
\end{array}
if x < 3.3e-15Initial program 66.2%
associate-/r*64.7%
*-commutative64.7%
unpow264.7%
sqr-neg64.7%
unpow264.7%
cos-neg64.7%
*-commutative64.7%
distribute-rgt-neg-in64.7%
metadata-eval64.7%
unpow264.7%
sqr-neg64.7%
unpow264.7%
associate-*r*59.1%
unpow259.1%
*-commutative59.1%
Simplified59.1%
Taylor expanded in x around 0 58.2%
associate-/r*56.7%
*-commutative56.7%
unpow256.7%
unpow256.7%
swap-sqr68.9%
unpow268.9%
associate-/r*70.4%
unpow270.4%
unpow270.4%
swap-sqr83.6%
unpow283.6%
Simplified83.6%
Taylor expanded in c around 0 58.2%
associate-/r*56.7%
*-commutative56.7%
unpow256.7%
unpow256.7%
swap-sqr68.9%
unpow268.9%
associate-/l/70.4%
*-commutative70.4%
unpow270.4%
unpow270.4%
swap-sqr83.6%
*-commutative83.6%
associate-*r*81.6%
*-commutative81.6%
*-commutative81.6%
associate-*r*83.6%
*-commutative83.6%
associate-/l/84.0%
*-lft-identity84.0%
associate-*l/84.0%
unpow-184.0%
Simplified84.0%
if 3.3e-15 < x Initial program 67.8%
associate-/r*66.3%
*-commutative66.3%
unpow266.3%
sqr-neg66.3%
unpow266.3%
cos-neg66.3%
*-commutative66.3%
distribute-rgt-neg-in66.3%
metadata-eval66.3%
unpow266.3%
sqr-neg66.3%
unpow266.3%
associate-*r*60.3%
unpow260.3%
*-commutative60.3%
Simplified60.3%
Applied egg-rr98.3%
Taylor expanded in c around 0 98.3%
associate-/r*98.2%
Simplified98.2%
*-commutative98.2%
associate-*r*98.2%
*-commutative98.2%
associate-/r*98.3%
associate-*r*99.5%
*-commutative99.5%
frac-times99.5%
*-un-lft-identity99.5%
*-commutative99.5%
associate-/l/99.5%
associate-*r*92.7%
associate-/r*89.9%
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 (if (<= x_m 2.1e-15) (pow (* c_m (* x_m s_m)) -2.0) (/ (/ (/ (cos (* x_m 2.0)) c_m) x_m) (* s_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 <= 2.1e-15) {
tmp = pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = ((cos((x_m * 2.0)) / c_m) / x_m) / (s_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 <= 2.1d-15) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
else
tmp = ((cos((x_m * 2.0d0)) / c_m) / x_m) / (s_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 <= 2.1e-15) {
tmp = Math.pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = ((Math.cos((x_m * 2.0)) / c_m) / x_m) / (s_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 <= 2.1e-15: tmp = math.pow((c_m * (x_m * s_m)), -2.0) else: tmp = ((math.cos((x_m * 2.0)) / c_m) / x_m) / (s_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 <= 2.1e-15) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.0; else tmp = Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / c_m) / x_m) / Float64(s_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 <= 2.1e-15)
tmp = (c_m * (x_m * s_m)) ^ -2.0;
else
tmp = ((cos((x_m * 2.0)) / c_m) / x_m) / (s_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, 2.1e-15], N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / N[(s$95$m * N[(s$95$m * 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}
\mathbf{if}\;x\_m \leq 2.1 \cdot 10^{-15}:\\
\;\;\;\;{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{c\_m}}{x\_m}}{s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 2.09999999999999981e-15Initial program 66.2%
associate-/r*64.7%
*-commutative64.7%
unpow264.7%
sqr-neg64.7%
unpow264.7%
cos-neg64.7%
*-commutative64.7%
distribute-rgt-neg-in64.7%
metadata-eval64.7%
unpow264.7%
sqr-neg64.7%
unpow264.7%
associate-*r*59.1%
unpow259.1%
*-commutative59.1%
Simplified59.1%
Taylor expanded in x around 0 58.2%
associate-/r*56.7%
*-commutative56.7%
unpow256.7%
unpow256.7%
swap-sqr68.9%
unpow268.9%
associate-/r*70.4%
unpow270.4%
unpow270.4%
swap-sqr83.6%
unpow283.6%
Simplified83.6%
Taylor expanded in c around 0 58.2%
associate-/r*56.7%
*-commutative56.7%
unpow256.7%
unpow256.7%
swap-sqr68.9%
unpow268.9%
associate-/l/70.4%
*-commutative70.4%
unpow270.4%
unpow270.4%
swap-sqr83.6%
*-commutative83.6%
associate-*r*81.6%
*-commutative81.6%
*-commutative81.6%
associate-*r*83.6%
*-commutative83.6%
associate-/l/84.0%
*-lft-identity84.0%
associate-*l/84.0%
unpow-184.0%
Simplified84.0%
if 2.09999999999999981e-15 < x Initial program 67.8%
associate-/r*66.3%
*-commutative66.3%
unpow266.3%
sqr-neg66.3%
unpow266.3%
cos-neg66.3%
*-commutative66.3%
distribute-rgt-neg-in66.3%
metadata-eval66.3%
unpow266.3%
sqr-neg66.3%
unpow266.3%
associate-*r*60.3%
unpow260.3%
*-commutative60.3%
Simplified60.3%
Applied egg-rr98.3%
Taylor expanded in c around 0 98.3%
associate-/r*98.2%
Simplified98.2%
frac-times95.5%
associate-*l/95.5%
*-un-lft-identity95.5%
*-commutative95.5%
*-commutative95.5%
associate-*r*95.6%
*-commutative95.6%
associate-*l*94.0%
associate-/r*93.2%
*-commutative93.2%
*-commutative93.2%
associate-*r*91.8%
*-commutative91.8%
associate-*l*91.3%
Applied egg-rr91.3%
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 (/ (/ (/ (cos (* x_m 2.0)) x_m) (* c_m s_m)) (* x_m (* c_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 ((cos((x_m * 2.0)) / x_m) / (c_m * s_m)) / (x_m * (c_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 = ((cos((x_m * 2.0d0)) / x_m) / (c_m * s_m)) / (x_m * (c_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 ((Math.cos((x_m * 2.0)) / x_m) / (c_m * s_m)) / (x_m * (c_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 ((math.cos((x_m * 2.0)) / x_m) / (c_m * s_m)) / (x_m * (c_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(Float64(cos(Float64(x_m * 2.0)) / x_m) / Float64(c_m * s_m)) / Float64(x_m * Float64(c_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 = ((cos((x_m * 2.0)) / x_m) / (c_m * s_m)) / (x_m * (c_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[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / x$95$m), $MachinePrecision] / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(c$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{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m}}{c\_m \cdot s\_m}}{x\_m \cdot \left(c\_m \cdot s\_m\right)}
\end{array}
Initial program 66.6%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
cos-neg65.1%
*-commutative65.1%
distribute-rgt-neg-in65.1%
metadata-eval65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
associate-*r*59.4%
unpow259.4%
*-commutative59.4%
Simplified59.4%
Applied egg-rr97.0%
associate-*l/97.0%
*-un-lft-identity97.0%
unpow297.0%
associate-/r*97.3%
*-commutative97.3%
*-commutative97.3%
associate-*l*95.2%
*-commutative95.2%
*-commutative95.2%
associate-*l*97.3%
*-commutative97.3%
Applied egg-rr97.3%
*-commutative97.3%
*-un-lft-identity97.3%
*-commutative97.3%
times-frac97.4%
*-commutative97.4%
associate-/l/97.4%
*-commutative97.4%
Applied egg-rr97.4%
*-commutative97.4%
associate-/l/97.4%
*-commutative97.4%
un-div-inv97.4%
Applied egg-rr97.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 (* x_m (* c_m s_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 * (c_m * s_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 * (c_m * s_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 * (c_m * s_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 * (c_m * s_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(c_m * s_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 = x_m * (c_m * s_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[(c$95$m * s$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 := x\_m \cdot \left(c\_m \cdot s\_m\right)\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.6%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
cos-neg65.1%
*-commutative65.1%
distribute-rgt-neg-in65.1%
metadata-eval65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
associate-*r*59.4%
unpow259.4%
*-commutative59.4%
Simplified59.4%
Applied egg-rr97.0%
associate-*l/97.0%
*-un-lft-identity97.0%
unpow297.0%
associate-/r*97.3%
*-commutative97.3%
*-commutative97.3%
associate-*l*95.2%
*-commutative95.2%
*-commutative95.2%
associate-*l*97.3%
*-commutative97.3%
Applied egg-rr97.3%
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)) (* x_m (* c_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 (cos((x_m * 2.0)) / (x_m * (c_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 = (cos((x_m * 2.0d0)) / (x_m * (c_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 (Math.cos((x_m * 2.0)) / (x_m * (c_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 (math.cos((x_m * 2.0)) / (x_m * (c_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(cos(Float64(x_m * 2.0)) / Float64(x_m * Float64(c_m * s_m))) / Float64(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 = (cos((x_m * 2.0)) / (x_m * (c_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[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * 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{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot \left(c\_m \cdot s\_m\right)}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 66.6%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
cos-neg65.1%
*-commutative65.1%
distribute-rgt-neg-in65.1%
metadata-eval65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
associate-*r*59.4%
unpow259.4%
*-commutative59.4%
Simplified59.4%
Applied egg-rr97.0%
associate-*l/97.0%
*-un-lft-identity97.0%
unpow297.0%
associate-/r*97.3%
*-commutative97.3%
*-commutative97.3%
associate-*l*95.2%
*-commutative95.2%
*-commutative95.2%
associate-*l*97.3%
*-commutative97.3%
Applied egg-rr97.3%
Taylor expanded in x around 0 95.2%
Final simplification95.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 (pow (* c_m (* x_m s_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((c_m * (x_m * s_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 = (c_m * (x_m * s_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((c_m * (x_m * s_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((c_m * (x_m * s_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(c_m * Float64(x_m * s_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 = (c_m * (x_m * s_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[(c$95$m * N[(x$95$m * s$95$m), $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(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}
\end{array}
Initial program 66.6%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
cos-neg65.1%
*-commutative65.1%
distribute-rgt-neg-in65.1%
metadata-eval65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
associate-*r*59.4%
unpow259.4%
*-commutative59.4%
Simplified59.4%
Taylor expanded in x around 0 56.0%
associate-/r*54.4%
*-commutative54.4%
unpow254.4%
unpow254.4%
swap-sqr64.5%
unpow264.5%
associate-/r*66.0%
unpow266.0%
unpow266.0%
swap-sqr77.3%
unpow277.3%
Simplified77.3%
Taylor expanded in c around 0 56.0%
associate-/r*54.4%
*-commutative54.4%
unpow254.4%
unpow254.4%
swap-sqr64.5%
unpow264.5%
associate-/l/66.0%
*-commutative66.0%
unpow266.0%
unpow266.0%
swap-sqr77.3%
*-commutative77.3%
associate-*r*75.8%
*-commutative75.8%
*-commutative75.8%
associate-*r*77.3%
*-commutative77.3%
associate-/l/77.6%
*-lft-identity77.6%
associate-*l/77.6%
unpow-177.6%
Simplified77.6%
Final simplification77.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 (/ 1.0 (* c_m (* x_m s_m))))) (* 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 = 1.0 / (c_m * (x_m * s_m));
return 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 = 1.0d0 / (c_m * (x_m * s_m))
code = 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 = 1.0 / (c_m * (x_m * s_m));
return 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 = 1.0 / (c_m * (x_m * s_m)) return 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(1.0 / Float64(c_m * Float64(x_m * s_m))) return 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 = 1.0 / (c_m * (x_m * s_m));
tmp = 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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * 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 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 66.6%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
cos-neg65.1%
*-commutative65.1%
distribute-rgt-neg-in65.1%
metadata-eval65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
associate-*r*59.4%
unpow259.4%
*-commutative59.4%
Simplified59.4%
Applied egg-rr97.3%
Taylor expanded in x around 0 77.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 (/ 1.0 (* c_m (* (* c_m (* x_m s_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 * ((c_m * (x_m * s_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 * ((c_m * (x_m * s_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 * ((c_m * (x_m * s_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 * ((c_m * (x_m * s_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(1.0 / Float64(c_m * Float64(Float64(c_m * Float64(x_m * s_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 * ((c_m * (x_m * s_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[(1.0 / N[(c$95$m * N[(N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * s$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])\\
\\
\frac{1}{c\_m \cdot \left(\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right) \cdot \left(x\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 66.6%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
cos-neg65.1%
*-commutative65.1%
distribute-rgt-neg-in65.1%
metadata-eval65.1%
unpow265.1%
sqr-neg65.1%
unpow265.1%
associate-*r*59.4%
unpow259.4%
*-commutative59.4%
Simplified59.4%
Taylor expanded in x around 0 56.0%
associate-/r*54.4%
*-commutative54.4%
unpow254.4%
unpow254.4%
swap-sqr64.5%
unpow264.5%
associate-/r*66.0%
unpow266.0%
unpow266.0%
swap-sqr77.3%
unpow277.3%
Simplified77.3%
unpow277.3%
associate-*l*76.0%
*-commutative76.0%
associate-*l*74.4%
*-commutative74.4%
Applied egg-rr74.4%
Taylor expanded in x around 0 76.0%
Final simplification76.0%
herbie shell --seed 2024170
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))