
(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}
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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)))
(if (<= x_m 9.8e-18)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (/ (/ (cos (* -2.0 x_m)) (* c_m x_m)) (* (* s_m c_m) x_m)) s_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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;
double tmp;
if (x_m <= 9.8e-18) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = ((cos((-2.0 * x_m)) / (c_m * x_m)) / ((s_m * c_m) * x_m)) / s_m;
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 9.8e-18) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(Float64(Float64(cos(Float64(-2.0 * x_m)) / Float64(c_m * x_m)) / Float64(Float64(s_m * c_m) * x_m)) / s_m); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 9.8e-18], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Cos[N[(-2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 9.8 \cdot 10^{-18}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\cos \left(-2 \cdot x\_m\right)}{c\_m \cdot x\_m}}{\left(s\_m \cdot c\_m\right) \cdot x\_m}}{s\_m}\\
\end{array}
\end{array}
if x < 9.8000000000000002e-18Initial program 63.2%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites52.7%
Applied rewrites70.7%
if 9.8000000000000002e-18 < x Initial program 65.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-pow.f64N/A
unpow2N/A
lower-*.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6490.3
Applied rewrites90.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
*-commutativeN/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites95.6%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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 (* 2.0 x_m))
(* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))))
(if (<= t_0 -2e-123)
(/ (- 2.0) (* (* c_m c_m) (* s_m s_m)))
(if (<= t_0 0.1)
(/ 1.0 (* (* (* (* c_m c_m) x_m) (* s_m x_m)) s_m))
(/ 1.0 (* (* x_m c_m) (* s_m (* (* s_m x_m) c_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m));
double tmp;
if (t_0 <= -2e-123) {
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
} else if (t_0 <= 0.1) {
tmp = 1.0 / ((((c_m * c_m) * x_m) * (s_m * x_m)) * s_m);
} else {
tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))
if (t_0 <= (-2d-123)) then
tmp = -2.0d0 / ((c_m * c_m) * (s_m * s_m))
else if (t_0 <= 0.1d0) then
tmp = 1.0d0 / ((((c_m * c_m) * x_m) * (s_m * x_m)) * s_m)
else
tmp = 1.0d0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
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((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m));
double tmp;
if (t_0 <= -2e-123) {
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
} else if (t_0 <= 0.1) {
tmp = 1.0 / ((((c_m * c_m) * x_m) * (s_m * x_m)) * s_m);
} else {
tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [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((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m)) tmp = 0 if t_0 <= -2e-123: tmp = -2.0 / ((c_m * c_m) * (s_m * s_m)) elif t_0 <= 0.1: tmp = 1.0 / ((((c_m * c_m) * x_m) * (s_m * x_m)) * s_m) else: tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) tmp = 0.0 if (t_0 <= -2e-123) tmp = Float64(Float64(-2.0) / Float64(Float64(c_m * c_m) * Float64(s_m * s_m))); elseif (t_0 <= 0.1) tmp = Float64(1.0 / Float64(Float64(Float64(Float64(c_m * c_m) * x_m) * Float64(s_m * x_m)) * s_m)); else tmp = Float64(1.0 / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(Float64(s_m * x_m) * c_m)))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
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((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m));
tmp = 0.0;
if (t_0 <= -2e-123)
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
elseif (t_0 <= 0.1)
tmp = 1.0 / ((((c_m * c_m) * x_m) * (s_m * x_m)) * s_m);
else
tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-123], N[((-2.0) / N[(N[(c$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.1], N[(1.0 / N[(N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)}\\
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{-123}:\\
\;\;\;\;\frac{-2}{\left(c\_m \cdot c\_m\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\mathbf{elif}\;t\_0 \leq 0.1:\\
\;\;\;\;\frac{1}{\left(\left(\left(c\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(s\_m \cdot x\_m\right)\right) \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -2.0000000000000001e-123Initial program 49.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites23.0%
Taylor expanded in x around inf
Applied rewrites29.4%
Applied rewrites29.4%
if -2.0000000000000001e-123 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < 0.10000000000000001Initial program 74.9%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6487.1
Applied rewrites87.1%
Taylor expanded in x around 0
Applied rewrites78.7%
if 0.10000000000000001 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 56.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6472.1
lift-pow.f64N/A
unpow2N/A
lower-*.f6472.1
Applied rewrites72.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6492.3
Applied rewrites92.3%
Taylor expanded in x around 0
Applied rewrites81.0%
Final simplification76.2%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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 c_m) x_m)))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-2e-123)
(/ (- 2.0) (* (* c_m c_m) (* s_m s_m)))
(/ (/ 1.0 t_0) t_0))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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 * c_m) * x_m;
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -2e-123) {
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 = (s_m * c_m) * x_m
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))) <= (-2d-123)) then
tmp = -2.0d0 / ((c_m * c_m) * (s_m * s_m))
else
tmp = (1.0d0 / t_0) / t_0
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
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 * c_m) * x_m;
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m))) <= -2e-123) {
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [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 * c_m) * x_m tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m))) <= -2e-123: tmp = -2.0 / ((c_m * c_m) * (s_m * s_m)) else: tmp = (1.0 / t_0) / t_0 return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * c_m) * x_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -2e-123) tmp = Float64(Float64(-2.0) / Float64(Float64(c_m * c_m) * Float64(s_m * s_m))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
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 = (s_m * c_m) * x_m;
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m))) <= -2e-123)
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
else
tmp = (1.0 / t_0) / t_0;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-123], N[((-2.0) / N[(N[(c$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot c\_m\right) \cdot x\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -2 \cdot 10^{-123}:\\
\;\;\;\;\frac{-2}{\left(c\_m \cdot c\_m\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -2.0000000000000001e-123Initial program 49.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites23.0%
Taylor expanded in x around inf
Applied rewrites29.4%
Applied rewrites29.4%
if -2.0000000000000001e-123 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 65.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6478.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.8
lift-pow.f64N/A
unpow2N/A
lower-*.f6478.8
Applied rewrites78.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6492.4
Applied rewrites92.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites97.6%
Taylor expanded in x around 0
Applied rewrites84.8%
Final simplification80.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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 (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-2e-123)
(/ (- 2.0) (* (* c_m c_m) (* s_m s_m)))
(/ 1.0 (* (* x_m c_m) (* s_m (* (* s_m x_m) c_m))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -2e-123) {
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
} else {
tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * ((x_m * (s_m ** 2.0d0)) * x_m))) <= (-2d-123)) then
tmp = -2.0d0 / ((c_m * c_m) * (s_m * s_m))
else
tmp = 1.0d0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
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 ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * ((x_m * Math.pow(s_m, 2.0)) * x_m))) <= -2e-123) {
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
} else {
tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * ((x_m * math.pow(s_m, 2.0)) * x_m))) <= -2e-123: tmp = -2.0 / ((c_m * c_m) * (s_m * s_m)) else: tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) 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 (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(Float64(x_m * (s_m ^ 2.0)) * x_m))) <= -2e-123) tmp = Float64(Float64(-2.0) / Float64(Float64(c_m * c_m) * Float64(s_m * s_m))); else tmp = Float64(1.0 / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(Float64(s_m * x_m) * c_m)))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
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 ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * ((x_m * (s_m ^ 2.0)) * x_m))) <= -2e-123)
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
else
tmp = 1.0 / ((x_m * c_m) * (s_m * ((s_m * x_m) * c_m)));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $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[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-123], N[((-2.0) / N[(N[(c$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(\left(x\_m \cdot {s\_m}^{2}\right) \cdot x\_m\right)} \leq -2 \cdot 10^{-123}:\\
\;\;\;\;\frac{-2}{\left(c\_m \cdot c\_m\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -2.0000000000000001e-123Initial program 49.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites23.0%
Taylor expanded in x around inf
Applied rewrites29.4%
Applied rewrites29.4%
if -2.0000000000000001e-123 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 65.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6478.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.8
lift-pow.f64N/A
unpow2N/A
lower-*.f6478.8
Applied rewrites78.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6492.4
Applied rewrites92.4%
Taylor expanded in x around 0
Applied rewrites81.3%
Final simplification77.5%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) 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 (* 2.0 x_m)) (* c_m s_m)) x_m) (* (* s_m c_m) x_m)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return ((cos((2.0 * x_m)) / (c_m * s_m)) / x_m) / ((s_m * c_m) * x_m);
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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((2.0d0 * x_m)) / (c_m * s_m)) / x_m) / ((s_m * c_m) * x_m)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
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((2.0 * x_m)) / (c_m * s_m)) / x_m) / ((s_m * c_m) * x_m);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return ((math.cos((2.0 * x_m)) / (c_m * s_m)) / x_m) / ((s_m * c_m) * x_m)
s_m = abs(s) c_m = abs(c) x_m = abs(x) 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(2.0 * x_m)) / Float64(c_m * s_m)) / x_m) / Float64(Float64(s_m * c_m) * x_m)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
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((2.0 * x_m)) / (c_m * s_m)) / x_m) / ((s_m * c_m) * x_m);
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $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[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] / N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\frac{\cos \left(2 \cdot x\_m\right)}{c\_m \cdot s\_m}}{x\_m}}{\left(s\_m \cdot c\_m\right) \cdot x\_m}
\end{array}
Initial program 63.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-pow.f64N/A
unpow2N/A
lower-*.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6491.7
Applied rewrites91.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites97.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-cos.f64N/A
cos-neg-revN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lift-*.f64N/A
lift-cos.f64N/A
lower-/.f6497.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6497.7
Applied rewrites97.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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)))
(if (<= x_m 1.4e-18)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (cos (* 2.0 x_m)) (* x_m (* (* (* c_m x_m) s_m) (* s_m c_m)))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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;
double tmp;
if (x_m <= 1.4e-18) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = cos((2.0 * x_m)) / (x_m * (((c_m * x_m) * s_m) * (s_m * c_m)));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 1.4e-18) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(2.0 * x_m)) / Float64(x_m * Float64(Float64(Float64(c_m * x_m) * s_m) * Float64(s_m * c_m)))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 1.4e-18], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 1.4 \cdot 10^{-18}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{x\_m \cdot \left(\left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right) \cdot \left(s\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.40000000000000006e-18Initial program 63.1%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites52.5%
Applied rewrites70.5%
if 1.40000000000000006e-18 < x Initial program 66.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6477.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.7
lift-pow.f64N/A
unpow2N/A
lower-*.f6477.7
Applied rewrites77.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6490.5
Applied rewrites90.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6491.9
Applied rewrites91.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6492.0
Applied rewrites92.0%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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)))
(if (<= x_m 2.2e-56)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* x_m c_m) (* s_m t_0))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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;
double tmp;
if (x_m <= 2.2e-56) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / ((x_m * c_m) * (s_m * t_0));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 2.2e-56) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(x_m * c_m) * Float64(s_m * t_0))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 2.2e-56], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 2.2 \cdot 10^{-56}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot t\_0\right)}\\
\end{array}
\end{array}
if x < 2.20000000000000004e-56Initial program 62.9%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites50.7%
Applied rewrites69.1%
if 2.20000000000000004e-56 < x Initial program 66.4%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.5
lift-pow.f64N/A
unpow2N/A
lower-*.f6476.5
Applied rewrites76.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6491.4
Applied rewrites91.4%
lift-*.f64N/A
count-2-revN/A
lower-+.f6491.4
Applied rewrites91.4%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) 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 c_m) x_m))) (/ (/ (cos (+ x_m x_m)) t_0) t_0)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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 * c_m) * x_m;
return (cos((x_m + x_m)) / t_0) / t_0;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 * c_m) * x_m
code = (cos((x_m + x_m)) / t_0) / t_0
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
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 * c_m) * x_m;
return (Math.cos((x_m + x_m)) / t_0) / t_0;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [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 * c_m) * x_m return (math.cos((x_m + x_m)) / t_0) / t_0
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * c_m) * x_m) return Float64(Float64(cos(Float64(x_m + x_m)) / t_0) / t_0) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
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 * c_m) * x_m;
tmp = (cos((x_m + x_m)) / t_0) / t_0;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot c\_m\right) \cdot x\_m\\
\frac{\frac{\cos \left(x\_m + x\_m\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 63.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-pow.f64N/A
unpow2N/A
lower-*.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6491.7
Applied rewrites91.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites97.7%
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
count-2-revN/A
flip-+N/A
distribute-neg-frac2N/A
+-inversesN/A
metadata-evalN/A
+-inversesN/A
flip-+N/A
lower-+.f6497.7
Applied rewrites97.7%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) 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 c_m) x_m))) (/ (cos (* 2.0 x_m)) (* t_0 t_0))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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 * c_m) * x_m;
return cos((2.0 * x_m)) / (t_0 * t_0);
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 * c_m) * x_m
code = cos((2.0d0 * x_m)) / (t_0 * t_0)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
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 * c_m) * x_m;
return Math.cos((2.0 * x_m)) / (t_0 * t_0);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [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 * c_m) * x_m return math.cos((2.0 * x_m)) / (t_0 * t_0)
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * c_m) * x_m) return Float64(cos(Float64(2.0 * x_m)) / Float64(t_0 * t_0)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
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 * c_m) * x_m;
tmp = cos((2.0 * x_m)) / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot c\_m\right) \cdot x\_m\\
\frac{\cos \left(2 \cdot x\_m\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 63.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.4
lift-pow.f64N/A
unpow2N/A
lower-*.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6491.7
Applied rewrites91.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.7
Applied rewrites97.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
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 c_m) x_m)) (t_1 (* (* s_m x_m) c_m)))
(if (<= x_m 7.5e+57)
(/ (fma -2.0 (* x_m x_m) 1.0) (* t_1 t_1))
(/ (/ 1.0 t_0) t_0))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
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 * c_m) * x_m;
double t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 7.5e+57) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (t_1 * t_1);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * c_m) * x_m) t_1 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 7.5e+57) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_1 * t_1)); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $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[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 7.5e+57], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot c\_m\right) \cdot x\_m\\
t_1 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 7.5 \cdot 10^{+57}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_1 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 7.5000000000000006e57Initial program 64.5%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites54.5%
Applied rewrites71.5%
if 7.5000000000000006e57 < x Initial program 60.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6474.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6474.8
lift-pow.f64N/A
unpow2N/A
lower-*.f6474.8
Applied rewrites74.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6490.4
Applied rewrites90.4%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites97.5%
Taylor expanded in x around 0
Applied rewrites66.3%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) 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 (/ 2.0 (* (* (* (- s_m) s_m) c_m) c_m)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 2.0 / (((-s_m * s_m) * c_m) * c_m);
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 = 2.0d0 / (((-s_m * s_m) * c_m) * c_m)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 2.0 / (((-s_m * s_m) * c_m) * c_m);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 2.0 / (((-s_m * s_m) * c_m) * c_m)
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(2.0 / Float64(Float64(Float64(Float64(-s_m) * s_m) * c_m) * c_m)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 2.0 / (((-s_m * s_m) * c_m) * c_m);
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $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[(2.0 / N[(N[(N[((-s$95$m) * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{2}{\left(\left(\left(-s\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot c\_m}
\end{array}
Initial program 63.8%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites47.5%
Taylor expanded in x around inf
Applied rewrites25.6%
Applied rewrites26.6%
Applied rewrites26.8%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) 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 (/ (- 2.0) (* (* c_m c_m) (* s_m s_m))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return -2.0 / ((c_m * c_m) * (s_m * s_m));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 = -2.0d0 / ((c_m * c_m) * (s_m * s_m))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return -2.0 / ((c_m * c_m) * (s_m * s_m));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return -2.0 / ((c_m * c_m) * (s_m * s_m))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(-2.0) / Float64(Float64(c_m * c_m) * Float64(s_m * s_m))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = -2.0 / ((c_m * c_m) * (s_m * s_m));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $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[((-2.0) / N[(N[(c$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{-2}{\left(c\_m \cdot c\_m\right) \cdot \left(s\_m \cdot s\_m\right)}
\end{array}
Initial program 63.8%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/l/N/A
associate-*r*N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites47.5%
Taylor expanded in x around inf
Applied rewrites25.6%
Applied rewrites26.6%
Final simplification26.6%
herbie shell --seed 2024337
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))