
(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}
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (cos (* 2.0 x))) (t_1 (* c_m (* x s))))
(if (<= (/ t_0 (* (pow c_m 2.0) (* x (* x (pow s 2.0))))) INFINITY)
(* (/ 1.0 (* t_1 t_1)) (cos (+ x x)))
(/ t_0 (pow (* x (* c_m s)) 2.0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = cos((2.0 * x));
double t_1 = c_m * (x * s);
double tmp;
if ((t_0 / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))))) <= ((double) INFINITY)) {
tmp = (1.0 / (t_1 * t_1)) * cos((x + x));
} else {
tmp = t_0 / pow((x * (c_m * s)), 2.0);
}
return tmp;
}
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = Math.cos((2.0 * x));
double t_1 = c_m * (x * s);
double tmp;
if ((t_0 / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))))) <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / (t_1 * t_1)) * Math.cos((x + x));
} else {
tmp = t_0 / Math.pow((x * (c_m * s)), 2.0);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = math.cos((2.0 * x)) t_1 = c_m * (x * s) tmp = 0 if (t_0 / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0))))) <= math.inf: tmp = (1.0 / (t_1 * t_1)) * math.cos((x + x)) else: tmp = t_0 / math.pow((x * (c_m * s)), 2.0) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(c_m * Float64(x * s)) tmp = 0.0 if (Float64(t_0 / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) <= Inf) tmp = Float64(Float64(1.0 / Float64(t_1 * t_1)) * cos(Float64(x + x))); else tmp = Float64(t_0 / (Float64(x * Float64(c_m * s)) ^ 2.0)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = cos((2.0 * x));
t_1 = c_m * (x * s);
tmp = 0.0;
if ((t_0 / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))))) <= Inf)
tmp = (1.0 / (t_1 * t_1)) * cos((x + x));
else
tmp = t_0 / ((x * (c_m * s)) ^ 2.0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(1.0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision] * N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[Power[N[(x * N[(c$95$m * s), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := c\_m \cdot \left(x \cdot s\right)\\
\mathbf{if}\;\frac{t\_0}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)} \leq \infty:\\
\;\;\;\;\frac{1}{t\_1 \cdot t\_1} \cdot \cos \left(x + x\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{{\left(x \cdot \left(c\_m \cdot s\right)\right)}^{2}}\\
\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))) < +inf.0Initial program 79.9%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6479.9
lift-*.f64N/A
count-2N/A
lower-+.f6479.9
lift-pow.f64N/A
unpow2N/A
lower-*.f6479.9
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6476.5
Applied rewrites76.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites92.3%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6499.5
Applied rewrites99.5%
lift-+.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6499.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.5
Applied rewrites99.5%
if +inf.0 < (/.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 0.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.7
Applied rewrites95.7%
Final simplification98.8%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s 2.0)))))))
(if (<= t_0 -5e-230)
(/ -2.0 (* c_m (* c_m (* s s))))
(if (<= t_0 1e+97)
(/ 1.0 (* s (* c_m (* c_m (* x (* x s))))))
(/ 1.0 (* x (* x (* (* c_m s) (* c_m s)))))))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))));
double tmp;
if (t_0 <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else if (t_0 <= 1e+97) {
tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s)))));
} else {
tmp = 1.0 / (x * (x * ((c_m * s) * (c_m * s))));
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s ** 2.0d0))))
if (t_0 <= (-5d-230)) then
tmp = (-2.0d0) / (c_m * (c_m * (s * s)))
else if (t_0 <= 1d+97) then
tmp = 1.0d0 / (s * (c_m * (c_m * (x * (x * s)))))
else
tmp = 1.0d0 / (x * (x * ((c_m * s) * (c_m * s))))
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))));
double tmp;
if (t_0 <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else if (t_0 <= 1e+97) {
tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s)))));
} else {
tmp = 1.0 / (x * (x * ((c_m * s) * (c_m * s))));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0)))) tmp = 0 if t_0 <= -5e-230: tmp = -2.0 / (c_m * (c_m * (s * s))) elif t_0 <= 1e+97: tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s))))) else: tmp = 1.0 / (x * (x * ((c_m * s) * (c_m * s)))) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) tmp = 0.0 if (t_0 <= -5e-230) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))); elseif (t_0 <= 1e+97) tmp = Float64(1.0 / Float64(s * Float64(c_m * Float64(c_m * Float64(x * Float64(x * s)))))); else tmp = Float64(1.0 / Float64(x * Float64(x * Float64(Float64(c_m * s) * Float64(c_m * s))))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))));
tmp = 0.0;
if (t_0 <= -5e-230)
tmp = -2.0 / (c_m * (c_m * (s * s)));
elseif (t_0 <= 1e+97)
tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s)))));
else
tmp = 1.0 / (x * (x * ((c_m * s) * (c_m * s))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-230], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1e+97], N[(1.0 / N[(s * N[(c$95$m * N[(c$95$m * N[(x * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x * N[(x * N[(N[(c$95$m * s), $MachinePrecision] * N[(c$95$m * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)}\\
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{-230}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}\\
\mathbf{elif}\;t\_0 \leq 10^{+97}:\\
\;\;\;\;\frac{1}{s \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot s\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot \left(x \cdot \left(\left(c\_m \cdot s\right) \cdot \left(c\_m \cdot s\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))) < -5.00000000000000035e-230Initial program 67.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6445.2
Applied rewrites45.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
if -5.00000000000000035e-230 < (/.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))) < 1.0000000000000001e97Initial program 79.6%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6482.1
Applied rewrites82.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
Applied rewrites84.4%
if 1.0000000000000001e97 < (/.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 50.0%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6469.4
Applied rewrites69.4%
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6474.6
Applied rewrites74.6%
Final simplification76.5%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s 2.0))))) -5e-230) (/ -2.0 (* c_m (* c_m (* s s)))) (/ 1.0 (* (* c_m (* x s)) (/ c_m (/ 1.0 (* x s)))))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / ((c_m * (x * s)) * (c_m / (1.0 / (x * s))));
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s ** 2.0d0))))) <= (-5d-230)) then
tmp = (-2.0d0) / (c_m * (c_m * (s * s)))
else
tmp = 1.0d0 / ((c_m * (x * s)) * (c_m / (1.0d0 / (x * s))))
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / ((c_m * (x * s)) * (c_m / (1.0 / (x * s))));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0))))) <= -5e-230: tmp = -2.0 / (c_m * (c_m * (s * s))) else: tmp = 1.0 / ((c_m * (x * s)) * (c_m / (1.0 / (x * s)))) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) <= -5e-230) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))); else tmp = Float64(1.0 / Float64(Float64(c_m * Float64(x * s)) * Float64(c_m / Float64(1.0 / Float64(x * s))))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))))) <= -5e-230)
tmp = -2.0 / (c_m * (c_m * (s * s)));
else
tmp = 1.0 / ((c_m * (x * s)) * (c_m / (1.0 / (x * s))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-230], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision] * N[(c$95$m / N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)} \leq -5 \cdot 10^{-230}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot \left(x \cdot s\right)\right) \cdot \frac{c\_m}{\frac{1}{x \cdot s}}}\\
\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))) < -5.00000000000000035e-230Initial program 67.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6445.2
Applied rewrites45.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
if -5.00000000000000035e-230 < (/.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 64.4%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.3
Applied rewrites96.3%
Taylor expanded in x around 0
Applied rewrites86.4%
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
/-rgt-identityN/A
clear-numN/A
lift-/.f64N/A
div-invN/A
clear-numN/A
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
Applied rewrites85.7%
Final simplification82.4%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x s))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s 2.0)))))
-5e-230)
(/ -2.0 (* c_m (* c_m (* s s))))
(/ (/ 1.0 t_0) t_0))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x * s)
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s ** 2.0d0))))) <= (-5d-230)) then
tmp = (-2.0d0) / (c_m * (c_m * (s * s)))
else
tmp = (1.0d0 / t_0) / t_0
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = c_m * (x * s) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0))))) <= -5e-230: tmp = -2.0 / (c_m * (c_m * (s * s))) else: tmp = (1.0 / t_0) / t_0 return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(c_m * Float64(x * s)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) <= -5e-230) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = c_m * (x * s);
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))))) <= -5e-230)
tmp = -2.0 / (c_m * (c_m * (s * s)));
else
tmp = (1.0 / t_0) / t_0;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-230], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)} \leq -5 \cdot 10^{-230}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\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))) < -5.00000000000000035e-230Initial program 67.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6445.2
Applied rewrites45.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
if -5.00000000000000035e-230 < (/.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 64.4%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.6
Applied rewrites75.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Final simplification82.7%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x s))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s 2.0)))))
-5e-230)
(/ -2.0 (* c_m (* c_m (* s s))))
(/ 1.0 (* t_0 t_0)))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x * s)
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s ** 2.0d0))))) <= (-5d-230)) then
tmp = (-2.0d0) / (c_m * (c_m * (s * s)))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = c_m * (x * s) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0))))) <= -5e-230: tmp = -2.0 / (c_m * (c_m * (s * s))) else: tmp = 1.0 / (t_0 * t_0) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(c_m * Float64(x * s)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) <= -5e-230) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = c_m * (x * s);
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))))) <= -5e-230)
tmp = -2.0 / (c_m * (c_m * (s * s)));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-230], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)} \leq -5 \cdot 10^{-230}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot 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))) < -5.00000000000000035e-230Initial program 67.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6445.2
Applied rewrites45.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
if -5.00000000000000035e-230 < (/.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 64.4%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.6
Applied rewrites75.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6486.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6483.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
Applied rewrites86.0%
Final simplification82.7%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s 2.0))))) -5e-230) (/ -2.0 (* c_m (* c_m (* s s)))) (/ 1.0 (* x (* (* c_m s) (* c_m (* x s)))))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / (x * ((c_m * s) * (c_m * (x * s))));
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s ** 2.0d0))))) <= (-5d-230)) then
tmp = (-2.0d0) / (c_m * (c_m * (s * s)))
else
tmp = 1.0d0 / (x * ((c_m * s) * (c_m * (x * s))))
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / (x * ((c_m * s) * (c_m * (x * s))));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0))))) <= -5e-230: tmp = -2.0 / (c_m * (c_m * (s * s))) else: tmp = 1.0 / (x * ((c_m * s) * (c_m * (x * s)))) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) <= -5e-230) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))); else tmp = Float64(1.0 / Float64(x * Float64(Float64(c_m * s) * Float64(c_m * Float64(x * s))))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))))) <= -5e-230)
tmp = -2.0 / (c_m * (c_m * (s * s)));
else
tmp = 1.0 / (x * ((c_m * s) * (c_m * (x * s))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-230], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x * N[(N[(c$95$m * s), $MachinePrecision] * N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)} \leq -5 \cdot 10^{-230}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x \cdot \left(\left(c\_m \cdot s\right) \cdot \left(c\_m \cdot \left(x \cdot s\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))) < -5.00000000000000035e-230Initial program 67.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6445.2
Applied rewrites45.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
if -5.00000000000000035e-230 < (/.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 64.4%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.6
Applied rewrites75.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6484.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6481.9
Applied rewrites81.9%
Final simplification78.9%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s 2.0))))) -5e-230) (/ -2.0 (* c_m (* c_m (* s s)))) (/ 1.0 (* s (* c_m (* c_m (* x (* x s))))))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s)))));
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s ** 2.0d0))))) <= (-5d-230)) then
tmp = (-2.0d0) / (c_m * (c_m * (s * s)))
else
tmp = 1.0d0 / (s * (c_m * (c_m * (x * (x * s)))))
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s, 2.0))))) <= -5e-230) {
tmp = -2.0 / (c_m * (c_m * (s * s)));
} else {
tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s)))));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s, 2.0))))) <= -5e-230: tmp = -2.0 / (c_m * (c_m * (s * s))) else: tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s))))) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s ^ 2.0))))) <= -5e-230) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))); else tmp = Float64(1.0 / Float64(s * Float64(c_m * Float64(c_m * Float64(x * Float64(x * s)))))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s ^ 2.0))))) <= -5e-230)
tmp = -2.0 / (c_m * (c_m * (s * s)));
else
tmp = 1.0 / (s * (c_m * (c_m * (x * (x * s)))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-230], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s * N[(c$95$m * N[(c$95$m * N[(x * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s}^{2}\right)\right)} \leq -5 \cdot 10^{-230}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot s\right)\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))) < -5.00000000000000035e-230Initial program 67.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6445.2
Applied rewrites45.2%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6445.3
Applied rewrites45.3%
if -5.00000000000000035e-230 < (/.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 64.4%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.6
Applied rewrites75.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
Applied rewrites76.9%
Final simplification74.3%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x s))))
(if (<= x 1.85e-7)
(/ (/ 1.0 t_0) t_0)
(/ (cos (+ x x)) (* (* x c_m) (* (* c_m s) (* x s)))))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if (x <= 1.85e-7) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x + x)) / ((x * c_m) * ((c_m * s) * (x * s)));
}
return tmp;
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x * s)
if (x <= 1.85d-7) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x + x)) / ((x * c_m) * ((c_m * s) * (x * s)))
end if
code = tmp
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if (x <= 1.85e-7) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x + x)) / ((x * c_m) * ((c_m * s) * (x * s)));
}
return tmp;
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = c_m * (x * s) tmp = 0 if x <= 1.85e-7: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x + x)) / ((x * c_m) * ((c_m * s) * (x * s))) return tmp
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(c_m * Float64(x * s)) tmp = 0.0 if (x <= 1.85e-7) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x + x)) / Float64(Float64(x * c_m) * Float64(Float64(c_m * s) * Float64(x * s)))); end return tmp end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp_2 = code(x, c_m, s)
t_0 = c_m * (x * s);
tmp = 0.0;
if (x <= 1.85e-7)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x + x)) / ((x * c_m) * ((c_m * s) * (x * s)));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.85e-7], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(N[(x * c$95$m), $MachinePrecision] * N[(N[(c$95$m * s), $MachinePrecision] * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\right)\\
\mathbf{if}\;x \leq 1.85 \cdot 10^{-7}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{\left(x \cdot c\_m\right) \cdot \left(\left(c\_m \cdot s\right) \cdot \left(x \cdot s\right)\right)}\\
\end{array}
\end{array}
if x < 1.85000000000000002e-7Initial program 62.2%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6469.3
Applied rewrites69.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.3%
if 1.85000000000000002e-7 < x Initial program 71.1%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6471.1
lift-*.f64N/A
count-2N/A
lower-+.f6471.1
lift-pow.f64N/A
unpow2N/A
lower-*.f6471.1
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6469.8
Applied rewrites69.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites90.5%
Final simplification84.6%
c_m = (fabs.f64 c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x s))))
(if (<= x 0.35)
(/
(fma
(* x x)
(fma (* x x) (fma x (* x -0.08888888888888889) 0.6666666666666666) -2.0)
1.0)
(* t_0 t_0))
(/ (cos (+ x x)) (* x (* x (* c_m (* c_m (* s s)))))))))c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
double tmp;
if (x <= 0.35) {
tmp = fma((x * x), fma((x * x), fma(x, (x * -0.08888888888888889), 0.6666666666666666), -2.0), 1.0) / (t_0 * t_0);
} else {
tmp = cos((x + x)) / (x * (x * (c_m * (c_m * (s * s)))));
}
return tmp;
}
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(c_m * Float64(x * s)) tmp = 0.0 if (x <= 0.35) tmp = Float64(fma(Float64(x * x), fma(Float64(x * x), fma(x, Float64(x * -0.08888888888888889), 0.6666666666666666), -2.0), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x + x)) / Float64(x * Float64(x * Float64(c_m * Float64(c_m * Float64(s * s)))))); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 0.35], N[(N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * N[(x * N[(x * -0.08888888888888889), $MachinePrecision] + 0.6666666666666666), $MachinePrecision] + -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(x * N[(x * N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\right)\\
\mathbf{if}\;x \leq 0.35:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x, x \cdot -0.08888888888888889, 0.6666666666666666\right), -2\right), 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{x \cdot \left(x \cdot \left(c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 0.34999999999999998Initial program 62.1%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6462.1
lift-*.f64N/A
count-2N/A
lower-+.f6462.1
lift-pow.f64N/A
unpow2N/A
lower-*.f6462.1
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6461.5
Applied rewrites61.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites83.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6495.4
Applied rewrites95.4%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6467.8
Applied rewrites67.8%
if 0.34999999999999998 < x Initial program 71.6%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6471.6
lift-*.f64N/A
count-2N/A
lower-+.f6471.6
lift-pow.f64N/A
unpow2N/A
lower-*.f6471.6
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6470.3
Applied rewrites70.3%
Taylor expanded in c around 0
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6481.8
Applied rewrites81.8%
Final simplification71.6%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (let* ((t_0 (* c_m (* x s)))) (* (/ 1.0 (* t_0 t_0)) (cos (+ x x)))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
return (1.0 / (t_0 * t_0)) * cos((x + x));
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
t_0 = c_m * (x * s)
code = (1.0d0 / (t_0 * t_0)) * cos((x + x))
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
return (1.0 / (t_0 * t_0)) * Math.cos((x + x));
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = c_m * (x * s) return (1.0 / (t_0 * t_0)) * math.cos((x + x))
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(c_m * Float64(x * s)) return Float64(Float64(1.0 / Float64(t_0 * t_0)) * cos(Float64(x + x))) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
t_0 = c_m * (x * s);
tmp = (1.0 / (t_0 * t_0)) * cos((x + x));
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\right)\\
\frac{1}{t\_0 \cdot t\_0} \cdot \cos \left(x + x\right)
\end{array}
\end{array}
Initial program 64.6%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6464.6
lift-*.f64N/A
count-2N/A
lower-+.f6464.6
lift-pow.f64N/A
unpow2N/A
lower-*.f6464.6
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6463.9
Applied rewrites63.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites84.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6496.2
Applied rewrites96.2%
lift-+.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6496.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6496.2
Applied rewrites96.2%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (let* ((t_0 (* c_m (* x s)))) (/ (cos (+ x x)) (* t_0 t_0))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
return cos((x + x)) / (t_0 * t_0);
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
t_0 = c_m * (x * s)
code = cos((x + x)) / (t_0 * t_0)
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
double t_0 = c_m * (x * s);
return Math.cos((x + x)) / (t_0 * t_0);
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): t_0 = c_m * (x * s) return math.cos((x + x)) / (t_0 * t_0)
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) t_0 = Float64(c_m * Float64(x * s)) return Float64(cos(Float64(x + x)) / Float64(t_0 * t_0)) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
t_0 = c_m * (x * s);
tmp = cos((x + x)) / (t_0 * t_0);
end
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x * s), $MachinePrecision]), $MachinePrecision]}, N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\right)\\
\frac{\cos \left(x + x\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 64.6%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6464.6
lift-*.f64N/A
count-2N/A
lower-+.f6464.6
lift-pow.f64N/A
unpow2N/A
lower-*.f6464.6
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6463.9
Applied rewrites63.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
Applied rewrites84.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6496.2
Applied rewrites96.2%
Final simplification96.2%
c_m = (fabs.f64 c) NOTE: x, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x c_m s) :precision binary64 (/ -2.0 (* c_m (* c_m (* s s)))))
c_m = fabs(c);
assert(x < c_m && c_m < s);
double code(double x, double c_m, double s) {
return -2.0 / (c_m * (c_m * (s * s)));
}
c_m = abs(c)
NOTE: x, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = (-2.0d0) / (c_m * (c_m * (s * s)))
end function
c_m = Math.abs(c);
assert x < c_m && c_m < s;
public static double code(double x, double c_m, double s) {
return -2.0 / (c_m * (c_m * (s * s)));
}
c_m = math.fabs(c) [x, c_m, s] = sort([x, c_m, s]) def code(x, c_m, s): return -2.0 / (c_m * (c_m * (s * s)))
c_m = abs(c) x, c_m, s = sort([x, c_m, s]) function code(x, c_m, s) return Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))) end
c_m = abs(c);
x, c_m, s = num2cell(sort([x, c_m, s])){:}
function tmp = code(x, c_m, s)
tmp = -2.0 / (c_m * (c_m * (s * s)));
end
c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s should be sorted in increasing order before calling this function. code[x_, c$95$m_, s_] := N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
[x, c_m, s] = \mathsf{sort}([x, c_m, s])\\
\\
\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}
\end{array}
Initial program 64.6%
lift-*.f64N/A
lift-cos.f64N/A
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites89.5%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6452.9
Applied rewrites52.9%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6432.6
Applied rewrites32.6%
herbie shell --seed 2024219
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))