
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
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 (<= x_m 4.9e-89) (/ (/ (fma -2.0 (* x_m x_m) 1.0) c_m) (* (* c_m (* s_m x_m)) (* s_m x_m))) (/ (cos (+ x_m x_m)) (* (* x_m c_m) (* s_m (* (* c_m s_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) {
double tmp;
if (x_m <= 4.9e-89) {
tmp = (fma(-2.0, (x_m * x_m), 1.0) / c_m) / ((c_m * (s_m * x_m)) * (s_m * x_m));
} else {
tmp = cos((x_m + x_m)) / ((x_m * c_m) * (s_m * ((c_m * s_m) * x_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 (x_m <= 4.9e-89) tmp = Float64(Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / c_m) / Float64(Float64(c_m * Float64(s_m * x_m)) * Float64(s_m * x_m))); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(Float64(c_m * s_m) * x_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_] := If[LessEqual[x$95$m, 4.9e-89], N[(N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $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 * N[(N[(c$95$m * s$95$m), $MachinePrecision] * x$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}\;x\_m \leq 4.9 \cdot 10^{-89}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{c\_m}}{\left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(\left(c\_m \cdot s\_m\right) \cdot x\_m\right)\right)}\\
\end{array}
\end{array}
if x < 4.9e-89Initial program 59.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.9%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/r*N/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
div-addN/A
lower-/.f64N/A
Applied rewrites69.3%
if 4.9e-89 < x Initial program 69.3%
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.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.3
lift-pow.f64N/A
unpow2N/A
lower-*.f6478.3
Applied rewrites78.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6496.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.2
Applied rewrites96.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6496.2
Applied rewrites96.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6496.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.2
Applied rewrites96.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-175)
(/ -2.0 (* (* (* c_m s_m) c_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-175) {
tmp = -2.0 / (((c_m * s_m) * c_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-175)) then
tmp = (-2.0d0) / (((c_m * s_m) * c_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-175) {
tmp = -2.0 / (((c_m * s_m) * c_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-175: tmp = -2.0 / (((c_m * s_m) * c_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(s_m * Float64(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-175) tmp = Float64(-2.0 / Float64(Float64(Float64(c_m * s_m) * c_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-175)
tmp = -2.0 / (((c_m * s_m) * c_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[(s$95$m * N[(c$95$m * x$95$m), $MachinePrecision]), $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-175], N[(-2.0 / N[(N[(N[(c$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $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 := s\_m \cdot \left(c\_m \cdot x\_m\right)\\
\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^{-175}:\\
\;\;\;\;\frac{-2}{\left(\left(c\_m \cdot s\_m\right) \cdot c\_m\right) \cdot s\_m}\\
\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))) < -2e-175Initial program 64.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 rewrites27.5%
Taylor expanded in x around inf
Applied rewrites39.3%
Applied rewrites39.3%
Applied rewrites39.3%
if -2e-175 < (/.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 62.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-*.f6476.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.0
lift-pow.f64N/A
unpow2N/A
lower-*.f6476.0
Applied rewrites76.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6493.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.6
Applied rewrites93.6%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.1
lift-cos.f64N/A
cos-neg-revN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-cos.f64N/A
lower-*.f6498.1
Applied rewrites98.1%
Taylor expanded in x around 0
Applied rewrites85.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
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* (* x_m (pow s_m 2.0)) x_m)))
-2e-175)
(/ -2.0 (* (* (* c_m s_m) c_m) s_m))
(/ 1.0 (* (* x_m c_m) (* s_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) {
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * ((x_m * pow(s_m, 2.0)) * x_m))) <= -2e-175) {
tmp = -2.0 / (((c_m * s_m) * c_m) * s_m);
} else {
tmp = 1.0 / ((x_m * c_m) * (s_m * (s_m * (c_m * x_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-175)) then
tmp = (-2.0d0) / (((c_m * s_m) * c_m) * s_m)
else
tmp = 1.0d0 / ((x_m * c_m) * (s_m * (s_m * (c_m * x_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-175) {
tmp = -2.0 / (((c_m * s_m) * c_m) * s_m);
} else {
tmp = 1.0 / ((x_m * c_m) * (s_m * (s_m * (c_m * x_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-175: tmp = -2.0 / (((c_m * s_m) * c_m) * s_m) else: tmp = 1.0 / ((x_m * c_m) * (s_m * (s_m * (c_m * x_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-175) tmp = Float64(-2.0 / Float64(Float64(Float64(c_m * s_m) * c_m) * s_m)); else tmp = Float64(1.0 / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(s_m * Float64(c_m * x_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-175)
tmp = -2.0 / (((c_m * s_m) * c_m) * s_m);
else
tmp = 1.0 / ((x_m * c_m) * (s_m * (s_m * (c_m * x_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-175], N[(-2.0 / N[(N[(N[(c$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(s$95$m * N[(c$95$m * x$95$m), $MachinePrecision]), $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^{-175}:\\
\;\;\;\;\frac{-2}{\left(\left(c\_m \cdot s\_m\right) \cdot c\_m\right) \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(s\_m \cdot \left(c\_m \cdot x\_m\right)\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))) < -2e-175Initial program 64.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 rewrites27.5%
Taylor expanded in x around inf
Applied rewrites39.3%
Applied rewrites39.3%
Applied rewrites39.3%
if -2e-175 < (/.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 62.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-*.f6476.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.0
lift-pow.f64N/A
unpow2N/A
lower-*.f6476.0
Applied rewrites76.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6493.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.6
Applied rewrites93.6%
Taylor expanded in x around 0
Applied rewrites83.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 (cos (+ x_m x_m))))
(if (<= x_m 6e-17)
(/ (/ (fma -2.0 (* x_m x_m) 1.0) c_m) (* (* c_m (* s_m x_m)) (* s_m x_m)))
(if (<= x_m 4.8e+120)
(/ t_0 (* x_m (* x_m (* (* (* c_m s_m) c_m) s_m))))
(/ t_0 (* 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 = cos((x_m + x_m));
double tmp;
if (x_m <= 6e-17) {
tmp = (fma(-2.0, (x_m * x_m), 1.0) / c_m) / ((c_m * (s_m * x_m)) * (s_m * x_m));
} else if (x_m <= 4.8e+120) {
tmp = t_0 / (x_m * (x_m * (((c_m * s_m) * c_m) * s_m)));
} else {
tmp = t_0 / (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 = cos(Float64(x_m + x_m)) tmp = 0.0 if (x_m <= 6e-17) tmp = Float64(Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / c_m) / Float64(Float64(c_m * Float64(s_m * x_m)) * Float64(s_m * x_m))); elseif (x_m <= 4.8e+120) tmp = Float64(t_0 / Float64(x_m * Float64(x_m * Float64(Float64(Float64(c_m * s_m) * c_m) * s_m)))); else tmp = Float64(t_0 / Float64(x_m * Float64(Float64(c_m * x_m) * Float64(Float64(s_m * 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[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 6e-17], N[(N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$95$m, 4.8e+120], N[(t$95$0 / N[(x$95$m * N[(x$95$m * N[(N[(N[(c$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(x$95$m * N[(N[(c$95$m * x$95$m), $MachinePrecision] * N[(N[(s$95$m * s$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 := \cos \left(x\_m + x\_m\right)\\
\mathbf{if}\;x\_m \leq 6 \cdot 10^{-17}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{c\_m}}{\left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{elif}\;x\_m \leq 4.8 \cdot 10^{+120}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(x\_m \cdot \left(\left(\left(c\_m \cdot s\_m\right) \cdot c\_m\right) \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(\left(c\_m \cdot x\_m\right) \cdot \left(\left(s\_m \cdot s\_m\right) \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 6.00000000000000012e-17Initial program 59.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.2%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/r*N/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
div-addN/A
lower-/.f64N/A
Applied rewrites71.3%
if 6.00000000000000012e-17 < x < 4.80000000000000002e120Initial program 80.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-*.f6485.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6485.9
lift-pow.f64N/A
unpow2N/A
lower-*.f6485.9
Applied rewrites85.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6499.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
count-2-revN/A
lower-+.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
Applied rewrites90.5%
if 4.80000000000000002e120 < x Initial program 63.5%
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.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.0
lift-pow.f64N/A
unpow2N/A
lower-*.f6477.0
Applied rewrites77.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6493.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.4
Applied rewrites93.4%
lift-*.f64N/A
count-2-revN/A
lower-+.f6493.4
Applied rewrites93.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
Applied rewrites74.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 (if (<= x_m 4.9e-89) (/ (/ (fma -2.0 (* x_m x_m) 1.0) c_m) (* (* c_m (* s_m x_m)) (* s_m x_m))) (/ (cos (+ x_m x_m)) (* (* x_m c_m) (* s_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) {
double tmp;
if (x_m <= 4.9e-89) {
tmp = (fma(-2.0, (x_m * x_m), 1.0) / c_m) / ((c_m * (s_m * x_m)) * (s_m * x_m));
} else {
tmp = cos((x_m + x_m)) / ((x_m * c_m) * (s_m * (s_m * (c_m * x_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 (x_m <= 4.9e-89) tmp = Float64(Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / c_m) / Float64(Float64(c_m * Float64(s_m * x_m)) * Float64(s_m * x_m))); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(s_m * Float64(c_m * x_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_] := If[LessEqual[x$95$m, 4.9e-89], N[(N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $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 * N[(s$95$m * N[(c$95$m * x$95$m), $MachinePrecision]), $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}\;x\_m \leq 4.9 \cdot 10^{-89}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{c\_m}}{\left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(s\_m \cdot \left(c\_m \cdot x\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 4.9e-89Initial program 59.1%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.9%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/r*N/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
div-addN/A
lower-/.f64N/A
Applied rewrites69.3%
if 4.9e-89 < x Initial program 69.3%
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.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6478.3
lift-pow.f64N/A
unpow2N/A
lower-*.f6478.3
Applied rewrites78.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6496.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.2
Applied rewrites96.2%
lift-*.f64N/A
count-2-revN/A
lower-+.f6496.2
Applied rewrites96.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 (if (<= x_m 6e-17) (/ (/ (fma -2.0 (* x_m x_m) 1.0) c_m) (* (* c_m (* s_m x_m)) (* s_m x_m))) (/ (cos (+ x_m x_m)) (* x_m (* x_m (* (* (* c_m s_m) c_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 tmp;
if (x_m <= 6e-17) {
tmp = (fma(-2.0, (x_m * x_m), 1.0) / c_m) / ((c_m * (s_m * x_m)) * (s_m * x_m));
} else {
tmp = cos((x_m + x_m)) / (x_m * (x_m * (((c_m * s_m) * c_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) tmp = 0.0 if (x_m <= 6e-17) tmp = Float64(Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / c_m) / Float64(Float64(c_m * Float64(s_m * x_m)) * Float64(s_m * x_m))); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(x_m * Float64(x_m * Float64(Float64(Float64(c_m * s_m) * c_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_] := If[LessEqual[x$95$m, 6e-17], N[(N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * N[(x$95$m * N[(N[(N[(c$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$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}\;x\_m \leq 6 \cdot 10^{-17}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{c\_m}}{\left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{x\_m \cdot \left(x\_m \cdot \left(\left(\left(c\_m \cdot s\_m\right) \cdot c\_m\right) \cdot s\_m\right)\right)}\\
\end{array}
\end{array}
if x < 6.00000000000000012e-17Initial program 59.8%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.2%
Taylor expanded in x around 0
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
associate-/r*N/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
div-addN/A
lower-/.f64N/A
Applied rewrites71.3%
if 6.00000000000000012e-17 < x Initial program 69.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-*.f6479.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.9
lift-pow.f64N/A
unpow2N/A
lower-*.f6479.9
Applied rewrites79.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6495.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.4
Applied rewrites95.4%
lift-*.f64N/A
count-2-revN/A
lower-+.f6495.4
Applied rewrites95.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
Applied rewrites84.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 (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(s_m * Float64(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[(s$95$m * N[(c$95$m * x$95$m), $MachinePrecision]), $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 := s\_m \cdot \left(c\_m \cdot x\_m\right)\\
\frac{\frac{\cos \left(x\_m + x\_m\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 62.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-*.f6475.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6475.8
lift-pow.f64N/A
unpow2N/A
lower-*.f6475.8
Applied rewrites75.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6493.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.7
Applied rewrites93.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.8
lift-cos.f64N/A
cos-neg-revN/A
lift-*.f64N/A
distribute-lft-neg-inN/A
metadata-evalN/A
lower-cos.f64N/A
lower-*.f6497.8
Applied rewrites97.8%
lift-*.f64N/A
metadata-evalN/A
distribute-lft-neg-inN/A
count-2-revN/A
flip-+N/A
distribute-neg-fracN/A
lift-*.f64N/A
lift-*.f64N/A
+-inversesN/A
metadata-evalN/A
+-inversesN/A
lift-*.f64N/A
lift-*.f64N/A
flip-+N/A
lift-+.f6497.8
Applied rewrites97.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 (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(s_m * Float64(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[(s$95$m * N[(c$95$m * x$95$m), $MachinePrecision]), $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 := s\_m \cdot \left(c\_m \cdot x\_m\right)\\
\frac{\cos \left(2 \cdot x\_m\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 62.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-*.f6475.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6475.8
lift-pow.f64N/A
unpow2N/A
lower-*.f6475.8
Applied rewrites75.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6493.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6493.7
Applied rewrites93.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6497.5
Applied rewrites97.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 (/ (/ -2.0 (* s_m c_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) {
return (-2.0 / (s_m * c_m)) / (s_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 * c_m)) / (s_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 * c_m)) / (s_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 * c_m)) / (s_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(Float64(-2.0 / Float64(s_m * c_m)) / Float64(s_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 * c_m)) / (s_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[(N[(-2.0 / N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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{\frac{-2}{s\_m \cdot c\_m}}{s\_m \cdot c\_m}
\end{array}
Initial program 62.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 rewrites48.7%
Taylor expanded in x around inf
Applied rewrites23.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 s_m) c_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 * s_m) * c_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 * s_m) * c_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 * s_m) * c_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 * s_m) * c_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(-2.0 / Float64(Float64(Float64(c_m * s_m) * c_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 * s_m) * c_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[(N[(c$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$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(c\_m \cdot s\_m\right) \cdot c\_m\right) \cdot s\_m}
\end{array}
Initial program 62.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 rewrites48.7%
Taylor expanded in x around inf
Applied rewrites23.8%
Applied rewrites24.9%
Applied rewrites24.9%
herbie shell --seed 2024326
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))