
(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 9 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 (cos (* x_m 2.0))))
(if (<= x_m 3e+20)
(* (/ 1.0 (pow (* c_m (* x_m s_m)) 2.0)) t_0)
(/ t_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 t_0 = cos((x_m * 2.0));
double tmp;
if (x_m <= 3e+20) {
tmp = (1.0 / pow((c_m * (x_m * s_m)), 2.0)) * t_0;
} else {
tmp = t_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) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 3d+20) then
tmp = (1.0d0 / ((c_m * (x_m * s_m)) ** 2.0d0)) * t_0
else
tmp = t_0 / (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 t_0 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 3e+20) {
tmp = (1.0 / Math.pow((c_m * (x_m * s_m)), 2.0)) * t_0;
} else {
tmp = t_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): t_0 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 3e+20: tmp = (1.0 / math.pow((c_m * (x_m * s_m)), 2.0)) * t_0 else: tmp = t_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) t_0 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 3e+20) tmp = Float64(Float64(1.0 / (Float64(c_m * Float64(x_m * s_m)) ^ 2.0)) * t_0); else tmp = Float64(t_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)
t_0 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 3e+20)
tmp = (1.0 / ((c_m * (x_m * s_m)) ^ 2.0)) * t_0;
else
tmp = t_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_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 3e+20], N[(N[(1.0 / N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision], N[(t$95$0 / 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}
t_0 := \cos \left(x_m \cdot 2\right)\\
\mathbf{if}\;x_m \leq 3 \cdot 10^{+20}:\\
\;\;\;\;\frac{1}{{\left(c_m \cdot \left(x_m \cdot s_m\right)\right)}^{2}} \cdot t_0\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{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 < 3e20Initial program 63.4%
clear-num63.4%
associate-/r/63.4%
*-commutative63.4%
associate-*r*56.9%
unpow256.9%
*-commutative56.9%
associate-*r*56.0%
associate-*r*56.9%
pow-prod-down76.5%
pow-prod-down96.9%
*-commutative96.9%
Applied egg-rr96.9%
if 3e20 < x Initial program 58.2%
add-cbrt-cube56.4%
pow356.4%
*-commutative56.4%
associate-*r*46.6%
unpow246.6%
*-commutative46.6%
pow-prod-down67.7%
pow-prod-down79.6%
*-commutative79.6%
Applied egg-rr79.6%
rem-cbrt-cube96.3%
unpow296.3%
associate-*r*92.7%
associate-*r*91.0%
*-commutative91.0%
associate-*r*94.3%
*-commutative94.3%
associate-*l*94.3%
Applied egg-rr94.3%
Final simplification96.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 (if (<= x_m 9.5e-6) (/ (cos (* x_m -2.0)) (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 <= 9.5e-6) {
tmp = cos((x_m * -2.0)) / 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 <= 9.5d-6) then
tmp = cos((x_m * (-2.0d0))) / ((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 <= 9.5e-6) {
tmp = Math.cos((x_m * -2.0)) / 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 <= 9.5e-6: tmp = math.cos((x_m * -2.0)) / 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 <= 9.5e-6) tmp = Float64(cos(Float64(x_m * -2.0)) / (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 <= 9.5e-6)
tmp = cos((x_m * -2.0)) / ((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, 9.5e-6], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $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 9.5 \cdot 10^{-6}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot -2\right)}{{\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 < 9.5000000000000005e-6Initial program 62.3%
associate-/r*61.9%
unpow261.9%
sqr-neg61.9%
unpow261.9%
associate-/r*62.3%
cos-neg62.3%
*-commutative62.3%
distribute-rgt-neg-in62.3%
metadata-eval62.3%
associate-*r*62.5%
*-commutative62.5%
unpow262.5%
sqr-neg62.5%
associate-*l*72.2%
associate-*r*73.3%
associate-*r*71.6%
associate-*r*65.2%
unpow265.2%
Simplified55.6%
Taylor expanded in x around inf 55.6%
associate-/r*55.6%
*-commutative55.6%
unpow255.6%
unpow255.6%
swap-sqr75.1%
unpow275.1%
associate-/r*75.8%
*-commutative75.8%
unpow275.8%
unpow275.8%
swap-sqr96.8%
unpow296.8%
*-commutative96.8%
Simplified96.8%
if 9.5000000000000005e-6 < x Initial program 62.5%
add-cbrt-cube60.9%
pow360.9%
*-commutative60.9%
associate-*r*52.1%
unpow252.1%
*-commutative52.1%
pow-prod-down71.0%
pow-prod-down81.7%
*-commutative81.7%
Applied egg-rr81.7%
rem-cbrt-cube96.6%
unpow296.6%
associate-*r*93.5%
associate-*r*91.9%
*-commutative91.9%
associate-*r*94.8%
*-commutative94.8%
associate-*l*94.8%
Applied egg-rr94.8%
Final simplification96.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 (if (<= x_m 1.35e-28) (/ (/ -1.0 c_m) (* (* c_m (* x_m s_m)) (* x_m (- s_m)))) (/ (cos (* x_m 2.0)) (* (* x_m (* s_m (* x_m c_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 <= 1.35e-28) {
tmp = (-1.0 / c_m) / ((c_m * (x_m * s_m)) * (x_m * -s_m));
} else {
tmp = cos((x_m * 2.0)) / ((x_m * (s_m * (x_m * c_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 <= 1.35d-28) then
tmp = ((-1.0d0) / c_m) / ((c_m * (x_m * s_m)) * (x_m * -s_m))
else
tmp = cos((x_m * 2.0d0)) / ((x_m * (s_m * (x_m * c_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 <= 1.35e-28) {
tmp = (-1.0 / c_m) / ((c_m * (x_m * s_m)) * (x_m * -s_m));
} else {
tmp = Math.cos((x_m * 2.0)) / ((x_m * (s_m * (x_m * c_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 <= 1.35e-28: tmp = (-1.0 / c_m) / ((c_m * (x_m * s_m)) * (x_m * -s_m)) else: tmp = math.cos((x_m * 2.0)) / ((x_m * (s_m * (x_m * c_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 <= 1.35e-28) tmp = Float64(Float64(-1.0 / c_m) / Float64(Float64(c_m * Float64(x_m * s_m)) * Float64(x_m * Float64(-s_m)))); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(Float64(x_m * Float64(s_m * Float64(x_m * c_m))) * Float64(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 <= 1.35e-28)
tmp = (-1.0 / c_m) / ((c_m * (x_m * s_m)) * (x_m * -s_m));
else
tmp = cos((x_m * 2.0)) / ((x_m * (s_m * (x_m * c_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, 1.35e-28], N[(N[(-1.0 / c$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(x$95$m * s$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[(x$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;x_m \leq 1.35 \cdot 10^{-28}:\\
\;\;\;\;\frac{\frac{-1}{c_m}}{\left(c_m \cdot \left(x_m \cdot s_m\right)\right) \cdot \left(x_m \cdot \left(-s_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot 2\right)}{\left(x_m \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right) \cdot \left(c_m \cdot s_m\right)}\\
\end{array}
\end{array}
if x < 1.3499999999999999e-28Initial program 62.1%
add-sqr-sqrt59.3%
pow259.3%
Applied egg-rr83.5%
Taylor expanded in x around 0 85.7%
unpow285.7%
frac-2neg85.7%
metadata-eval85.7%
associate-/r*85.7%
frac-times83.3%
neg-mul-183.3%
distribute-neg-frac83.3%
metadata-eval83.3%
distribute-rgt-neg-in83.3%
*-commutative83.3%
distribute-rgt-neg-in83.3%
Applied egg-rr83.3%
if 1.3499999999999999e-28 < x Initial program 63.2%
add-cbrt-cube59.0%
pow359.0%
*-commutative59.0%
associate-*r*51.4%
unpow251.4%
*-commutative51.4%
pow-prod-down67.8%
pow-prod-down77.1%
*-commutative77.1%
Applied egg-rr77.1%
rem-cbrt-cube97.0%
unpow297.0%
*-commutative97.0%
associate-*r*97.1%
associate-*l*91.5%
*-commutative91.5%
associate-*r*95.7%
*-commutative95.7%
associate-*r*98.3%
*-commutative98.3%
associate-*l*96.9%
Applied egg-rr96.9%
Final simplification86.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
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 3.3e-9)
(/ 1.0 (* t_0 t_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 t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 3.3e-9) {
tmp = 1.0 / (t_0 * t_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) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 3.3d-9) then
tmp = 1.0d0 / (t_0 * t_0)
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 t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 3.3e-9) {
tmp = 1.0 / (t_0 * t_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): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 3.3e-9: tmp = 1.0 / (t_0 * t_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) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 3.3e-9) tmp = Float64(1.0 / Float64(t_0 * t_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)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 3.3e-9)
tmp = 1.0 / (t_0 * t_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_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 3.3e-9], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $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}
t_0 := c_m \cdot \left(x_m \cdot s_m\right)\\
\mathbf{if}\;x_m \leq 3.3 \cdot 10^{-9}:\\
\;\;\;\;\frac{1}{t_0 \cdot t_0}\\
\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 < 3.30000000000000018e-9Initial program 62.5%
add-sqr-sqrt59.8%
pow259.8%
Applied egg-rr84.0%
Taylor expanded in x around 0 86.2%
unpow286.2%
frac-2neg86.2%
metadata-eval86.2%
frac-2neg86.2%
metadata-eval86.2%
frac-times86.2%
metadata-eval86.2%
distribute-rgt-neg-in86.2%
*-commutative86.2%
distribute-rgt-neg-in86.2%
distribute-rgt-neg-in86.2%
*-commutative86.2%
distribute-rgt-neg-in86.2%
Applied egg-rr86.2%
if 3.30000000000000018e-9 < x Initial program 62.0%
add-cbrt-cube58.9%
pow358.9%
*-commutative58.9%
associate-*r*50.4%
unpow250.4%
*-commutative50.4%
pow-prod-down68.7%
pow-prod-down79.1%
*-commutative79.1%
Applied egg-rr79.1%
rem-cbrt-cube96.7%
unpow296.7%
associate-*r*93.6%
associate-*r*92.1%
*-commutative92.1%
associate-*r*95.0%
*-commutative95.0%
associate-*l*94.9%
Applied egg-rr94.9%
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 (/ (/ -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(Float64(-1.0 / c_m) / Float64(Float64(c_m * Float64(x_m * s_m)) * Float64(x_m * Float64(-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[(N[(-1.0 / c$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(x$95$m * s$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(c_m \cdot \left(x_m \cdot s_m\right)\right) \cdot \left(x_m \cdot \left(-s_m\right)\right)}
\end{array}
Initial program 62.4%
add-sqr-sqrt59.5%
pow259.5%
Applied egg-rr77.6%
Taylor expanded in x around 0 82.0%
unpow282.0%
frac-2neg82.0%
metadata-eval82.0%
associate-/r*82.0%
frac-times80.1%
neg-mul-180.1%
distribute-neg-frac80.1%
metadata-eval80.1%
distribute-rgt-neg-in80.1%
*-commutative80.1%
distribute-rgt-neg-in80.1%
Applied egg-rr80.1%
Final simplification80.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 (* 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) {
return (1.0 / (c_m * (x_m * s_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 / (c_m * (x_m * s_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 / (c_m * (x_m * s_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 / (c_m * (x_m * s_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(c_m * Float64(x_m * s_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 / (c_m * (x_m * s_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[(c$95$m * N[(x$95$m * s$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}{c_m \cdot \left(x_m \cdot s_m\right)}}{s_m \cdot \left(x_m \cdot c_m\right)}
\end{array}
Initial program 62.4%
add-sqr-sqrt59.5%
pow259.5%
Applied egg-rr77.6%
Taylor expanded in x around 0 82.0%
unpow282.0%
un-div-inv82.0%
*-commutative82.0%
associate-*r*79.8%
*-commutative79.8%
associate-*l*81.4%
*-commutative81.4%
associate-*r*80.2%
*-commutative80.2%
associate-*l*82.4%
Applied egg-rr82.4%
Taylor expanded in s around 0 81.4%
Final simplification81.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 (* x_m c_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 / (s_m * (x_m * c_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 / (s_m * (x_m * c_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 / (s_m * (x_m * c_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 / (s_m * (x_m * c_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 / Float64(s_m * Float64(x_m * c_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 = (1.0 / (s_m * (x_m * c_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 / N[(s$95$m * N[(x$95$m * c$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{1}{s_m \cdot \left(x_m \cdot c_m\right)}}{c_m \cdot \left(x_m \cdot s_m\right)}
\end{array}
Initial program 62.4%
add-sqr-sqrt59.5%
pow259.5%
Applied egg-rr77.6%
Taylor expanded in x around 0 82.0%
unpow282.0%
un-div-inv82.0%
*-commutative82.0%
associate-*r*79.8%
*-commutative79.8%
associate-*l*81.4%
*-commutative81.4%
associate-*r*80.2%
*-commutative80.2%
associate-*l*82.4%
Applied egg-rr82.4%
Taylor expanded in s around 0 81.4%
Final simplification81.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 (* s_m (* x_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 = s_m * (x_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 = s_m * (x_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 = s_m * (x_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 = s_m * (x_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(s_m * Float64(x_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 = s_m * (x_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[(s$95$m * N[(x$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 := s_m \cdot \left(x_m \cdot c_m\right)\\
\frac{\frac{1}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 62.4%
add-sqr-sqrt59.5%
pow259.5%
Applied egg-rr77.6%
Taylor expanded in x around 0 82.0%
unpow282.0%
un-div-inv82.0%
*-commutative82.0%
associate-*r*79.8%
*-commutative79.8%
associate-*l*81.4%
*-commutative81.4%
associate-*r*80.2%
*-commutative80.2%
associate-*l*82.4%
Applied egg-rr82.4%
Final simplification82.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(1.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 = 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[(1.0 / 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 := c_m \cdot \left(x_m \cdot s_m\right)\\
\frac{1}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 62.4%
add-sqr-sqrt59.5%
pow259.5%
Applied egg-rr77.6%
Taylor expanded in x around 0 82.0%
unpow282.0%
frac-2neg82.0%
metadata-eval82.0%
frac-2neg82.0%
metadata-eval82.0%
frac-times82.0%
metadata-eval82.0%
distribute-rgt-neg-in82.0%
*-commutative82.0%
distribute-rgt-neg-in82.0%
distribute-rgt-neg-in82.0%
*-commutative82.0%
distribute-rgt-neg-in82.0%
Applied egg-rr82.0%
Final simplification82.0%
herbie shell --seed 2023318
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))