
(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 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x_m x_m))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 2.15e-11)
(/ 1.0 (* t_1 t_1))
(if (<= x_m 1.95e+197)
(/ t_0 (* s_m (* c_m (* s_m (* x_m (* x_m c_m))))))
(/ t_0 (* s_m (* x_m (* c_m (* x_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 t_0 = cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 1.95e+197) {
tmp = t_0 / (s_m * (c_m * (s_m * (x_m * (x_m * c_m)))));
} else {
tmp = t_0 / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m + x_m))
t_1 = c_m * (x_m * s_m)
if (x_m <= 2.15d-11) then
tmp = 1.0d0 / (t_1 * t_1)
else if (x_m <= 1.95d+197) then
tmp = t_0 / (s_m * (c_m * (s_m * (x_m * (x_m * c_m)))))
else
tmp = t_0 / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 1.95e+197) {
tmp = t_0 / (s_m * (c_m * (s_m * (x_m * (x_m * c_m)))));
} else {
tmp = t_0 / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m + x_m)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.15e-11: tmp = 1.0 / (t_1 * t_1) elif x_m <= 1.95e+197: tmp = t_0 / (s_m * (c_m * (s_m * (x_m * (x_m * c_m))))) else: tmp = t_0 / (s_m * (x_m * (c_m * (x_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) t_0 = cos(Float64(x_m + x_m)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.15e-11) tmp = Float64(1.0 / Float64(t_1 * t_1)); elseif (x_m <= 1.95e+197) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(s_m * Float64(x_m * Float64(x_m * c_m)))))); else tmp = Float64(t_0 / Float64(s_m * Float64(x_m * Float64(c_m * Float64(x_m * Float64(c_m * s_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m + x_m));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.15e-11)
tmp = 1.0 / (t_1 * t_1);
elseif (x_m <= 1.95e+197)
tmp = t_0 / (s_m * (c_m * (s_m * (x_m * (x_m * c_m)))));
else
tmp = t_0 / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.15e-11], N[(1.0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$95$m, 1.95e+197], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(s$95$m * N[(x$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(x$95$m * N[(c$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $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}
t_0 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.15 \cdot 10^{-11}:\\
\;\;\;\;\frac{1}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x\_m \leq 1.95 \cdot 10^{+197}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.15000000000000001e-11Initial program 71.3%
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.1
Applied rewrites69.1%
Applied rewrites79.4%
if 2.15000000000000001e-11 < x < 1.95e197Initial program 71.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6485.9
Applied rewrites85.9%
lift-*.f64N/A
count-2N/A
lift-+.f6485.9
Applied rewrites85.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites85.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6494.0
Applied rewrites94.0%
if 1.95e197 < x Initial program 73.5%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6493.5
Applied rewrites93.5%
lift-*.f64N/A
count-2N/A
lift-+.f6493.5
Applied rewrites93.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites94.9%
Final simplification82.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
(/
(cos (* x_m 2.0))
(* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))))
(if (<= t_0 -5e-187)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(if (<= t_0 2e+57)
(/ 1.0 (* s_m (* c_m (* (* x_m s_m) (* x_m c_m)))))
(/ 1.0 (* 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 t_0 = cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))));
double tmp;
if (t_0 <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= 2e+57) {
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
} else {
tmp = 1.0 / (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)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))
if (t_0 <= (-5d-187)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else if (t_0 <= 2d+57) then
tmp = 1.0d0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))))
else
tmp = 1.0d0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))));
double tmp;
if (t_0 <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= 2e+57) {
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
} else {
tmp = 1.0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0)))) tmp = 0 if t_0 <= -5e-187: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) elif t_0 <= 2e+57: tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m)))) else: tmp = 1.0 / (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) t_0 = Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) tmp = 0.0 if (t_0 <= -5e-187) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); elseif (t_0 <= 2e+57) tmp = Float64(1.0 / Float64(s_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * c_m))))); else tmp = Float64(1.0 / Float64(x_m * Float64(x_m * Float64(Float64(c_m * s_m) * Float64(c_m * s_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))));
tmp = 0.0;
if (t_0 <= -5e-187)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
elseif (t_0 <= 2e+57)
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
else
tmp = 1.0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-187], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+57], N[(1.0 / N[(s$95$m * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(x$95$m * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * s$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}
t_0 := \frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)}\\
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{-187}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+57}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(x\_m \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(c\_m \cdot s\_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))) < -4.9999999999999996e-187Initial program 72.5%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites28.8%
Taylor expanded in x around inf
Applied rewrites41.4%
if -4.9999999999999996e-187 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < 2.0000000000000001e57Initial program 82.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-*.f6474.2
Applied rewrites74.2%
Applied rewrites72.7%
Applied rewrites85.8%
if 2.0000000000000001e57 < (/.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 63.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-*.f6473.9
Applied rewrites73.9%
Applied rewrites78.3%
Final simplification77.4%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0
(/
(cos (* x_m 2.0))
(* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))))
(if (<= t_0 -5e-187)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(if (<= t_0 2e+67)
(/ 1.0 (* s_m (* c_m (* (* x_m s_m) (* x_m c_m)))))
(/ 1.0 (* x_m (* x_m (* s_m (* c_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 t_0 = cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))));
double tmp;
if (t_0 <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= 2e+67) {
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
} else {
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))
if (t_0 <= (-5d-187)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else if (t_0 <= 2d+67) then
tmp = 1.0d0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))))
else
tmp = 1.0d0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))));
double tmp;
if (t_0 <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= 2e+67) {
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
} else {
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0)))) tmp = 0 if t_0 <= -5e-187: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) elif t_0 <= 2e+67: tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m)))) else: tmp = 1.0 / (x_m * (x_m * (s_m * (c_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) t_0 = Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) tmp = 0.0 if (t_0 <= -5e-187) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); elseif (t_0 <= 2e+67) tmp = Float64(1.0 / Float64(s_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * c_m))))); else tmp = Float64(1.0 / Float64(x_m * Float64(x_m * Float64(s_m * Float64(c_m * Float64(c_m * s_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))));
tmp = 0.0;
if (t_0 <= -5e-187)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
elseif (t_0 <= 2e+67)
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
else
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-187], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+67], N[(1.0 / N[(s$95$m * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(x$95$m * N[(s$95$m * N[(c$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $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}
t_0 := \frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)}\\
\mathbf{if}\;t\_0 \leq -5 \cdot 10^{-187}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+67}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(x\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot s\_m\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))) < -4.9999999999999996e-187Initial program 72.5%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites28.8%
Taylor expanded in x around inf
Applied rewrites41.4%
if -4.9999999999999996e-187 < (/.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.99999999999999997e67Initial program 82.5%
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-*.f6473.6
Applied rewrites73.6%
Applied rewrites72.1%
Applied rewrites85.1%
if 1.99999999999999997e67 < (/.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.7%
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-*.f6474.3
Applied rewrites74.3%
Final simplification75.1%
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 (* c_m (* x_m s_m))))
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-5e-187)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-5d-187)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -5e-187: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -5e-187) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(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 = c_m * (x_m * s_m);
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -5e-187)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-187], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / 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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -5 \cdot 10^{-187}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\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))) < -4.9999999999999996e-187Initial program 72.5%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites28.8%
Taylor expanded in x around inf
Applied rewrites41.4%
if -4.9999999999999996e-187 < (/.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 71.3%
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-*.f6474.0
Applied rewrites74.0%
Applied rewrites83.5%
Final simplification79.3%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-5e-187)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* s_m (* c_m (* (* x_m s_m) (* x_m c_m)))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-5d-187)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -5e-187: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m)))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -5e-187) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(s_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * c_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -5e-187)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (s_m * (c_m * ((x_m * s_m) * (x_m * c_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-187], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s$95$m * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * c$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(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -5 \cdot 10^{-187}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot c\_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))) < -4.9999999999999996e-187Initial program 72.5%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites28.8%
Taylor expanded in x around inf
Applied rewrites41.4%
if -4.9999999999999996e-187 < (/.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 71.3%
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-*.f6474.0
Applied rewrites74.0%
Applied rewrites73.0%
Applied rewrites79.4%
Final simplification75.6%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-5e-187)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* s_m (* c_m (* s_m (* c_m (* x_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((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (s_m * (c_m * (s_m * (c_m * (x_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((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-5d-187)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (s_m * (c_m * (s_m * (c_m * (x_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((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -5e-187) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (s_m * (c_m * (s_m * (c_m * (x_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((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -5e-187: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (s_m * (c_m * (s_m * (c_m * (x_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(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -5e-187) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(s_m * Float64(c_m * Float64(s_m * Float64(c_m * Float64(x_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((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -5e-187)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (s_m * (c_m * (s_m * (c_m * (x_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[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-187], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s$95$m * N[(c$95$m * N[(s$95$m * N[(c$95$m * N[(x$95$m * x$95$m), $MachinePrecision]), $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(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -5 \cdot 10^{-187}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x\_m \cdot x\_m\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))) < -4.9999999999999996e-187Initial program 72.5%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites28.8%
Taylor expanded in x around inf
Applied rewrites41.4%
if -4.9999999999999996e-187 < (/.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 71.3%
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-*.f6474.0
Applied rewrites74.0%
Applied rewrites73.0%
Final simplification69.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 (* c_m (* x_m s_m))))
(if (<= x_m 1e-39)
(/ 1.0 (* t_0 t_0))
(/ (cos (* x_m 2.0)) (pow (* x_m (* c_m s_m)) 2.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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1e-39) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m * 2.0)) / pow((x_m * (c_m * s_m)), 2.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 = c_m * (x_m * s_m)
if (x_m <= 1d-39) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m * 2.0d0)) / ((x_m * (c_m * s_m)) ** 2.0d0)
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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1e-39) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m * 2.0)) / Math.pow((x_m * (c_m * s_m)), 2.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 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1e-39: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m * 2.0)) / math.pow((x_m * (c_m * s_m)), 2.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(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1e-39) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m * 2.0)) / (Float64(x_m * Float64(c_m * s_m)) ^ 2.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 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1e-39)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m * 2.0)) / ((x_m * (c_m * s_m)) ^ 2.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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1e-39], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[Power[N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 10^{-39}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{{\left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)}^{2}}\\
\end{array}
\end{array}
if x < 9.99999999999999929e-40Initial program 70.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-*.f6468.3
Applied rewrites68.3%
Applied rewrites78.9%
if 9.99999999999999929e-40 < x Initial program 74.5%
lift-*.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.4
Applied rewrites96.4%
Final simplification82.6%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x_m x_m))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 2.15e-11)
(/ 1.0 (* t_1 t_1))
(if (<= x_m 6.4e+153)
(/ t_0 (* s_m (* c_m (* s_m (* c_m (* x_m x_m))))))
(/ t_0 (* x_m (* c_m (* s_m t_1))))))))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 t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 6.4e+153) {
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x_m * x_m)))));
} else {
tmp = t_0 / (x_m * (c_m * (s_m * t_1)));
}
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) :: t_1
real(8) :: tmp
t_0 = cos((x_m + x_m))
t_1 = c_m * (x_m * s_m)
if (x_m <= 2.15d-11) then
tmp = 1.0d0 / (t_1 * t_1)
else if (x_m <= 6.4d+153) then
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x_m * x_m)))))
else
tmp = t_0 / (x_m * (c_m * (s_m * t_1)))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 6.4e+153) {
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x_m * x_m)))));
} else {
tmp = t_0 / (x_m * (c_m * (s_m * t_1)));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m + x_m)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.15e-11: tmp = 1.0 / (t_1 * t_1) elif x_m <= 6.4e+153: tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x_m * x_m))))) else: tmp = t_0 / (x_m * (c_m * (s_m * t_1))) 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)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.15e-11) tmp = Float64(1.0 / Float64(t_1 * t_1)); elseif (x_m <= 6.4e+153) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(s_m * Float64(c_m * Float64(x_m * x_m)))))); else tmp = Float64(t_0 / Float64(x_m * Float64(c_m * Float64(s_m * t_1)))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m + x_m));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.15e-11)
tmp = 1.0 / (t_1 * t_1);
elseif (x_m <= 6.4e+153)
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x_m * x_m)))));
else
tmp = t_0 / (x_m * (c_m * (s_m * t_1)));
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[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.15e-11], N[(1.0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$95$m, 6.4e+153], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(s$95$m * N[(c$95$m * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(x$95$m * N[(c$95$m * N[(s$95$m * t$95$1), $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)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.15 \cdot 10^{-11}:\\
\;\;\;\;\frac{1}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x\_m \leq 6.4 \cdot 10^{+153}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x\_m \cdot x\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(c\_m \cdot \left(s\_m \cdot t\_1\right)\right)}\\
\end{array}
\end{array}
if x < 2.15000000000000001e-11Initial program 71.3%
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.1
Applied rewrites69.1%
Applied rewrites79.4%
if 2.15000000000000001e-11 < x < 6.4000000000000003e153Initial program 79.4%
lift-*.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-*.f6499.3
Applied rewrites99.3%
lift-*.f64N/A
count-2N/A
lift-+.f6499.3
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lift-*.f64N/A
pow-prod-downN/A
pow2N/A
pow2N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
pow2N/A
associate-*r*N/A
Applied rewrites93.0%
if 6.4000000000000003e153 < x Initial program 61.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6481.0
Applied rewrites81.0%
lift-*.f64N/A
count-2N/A
lift-+.f6481.0
Applied rewrites81.0%
Final simplification81.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 (* c_m (* x_m s_m))))
(if (<= x_m 2.15e-11)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* s_m (* x_m (* c_m (* x_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 t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 2.15d-11) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.15e-11: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_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) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.15e-11) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(s_m * Float64(x_m * Float64(c_m * Float64(x_m * Float64(c_m * s_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.15e-11)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (c_m * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.15e-11], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(x$95$m * N[(c$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $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}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.15 \cdot 10^{-11}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.15000000000000001e-11Initial program 71.3%
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.1
Applied rewrites69.1%
Applied rewrites79.4%
if 2.15000000000000001e-11 < x Initial program 71.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6488.3
Applied rewrites88.3%
lift-*.f64N/A
count-2N/A
lift-+.f6488.3
Applied rewrites88.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites88.5%
Final simplification81.1%
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 (* c_m (* x_m s_m))))
(if (<= x_m 2.15e-11)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* s_m (* c_m (* s_m (* c_m (* x_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 t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (s_m * (c_m * (s_m * (c_m * (x_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) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 2.15d-11) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / (s_m * (c_m * (s_m * (c_m * (x_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 t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.15e-11) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / (s_m * (c_m * (s_m * (c_m * (x_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): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.15e-11: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / (s_m * (c_m * (s_m * (c_m * (x_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) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.15e-11) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(s_m * Float64(c_m * Float64(s_m * Float64(c_m * Float64(x_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)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.15e-11)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / (s_m * (c_m * (s_m * (c_m * (x_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_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.15e-11], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(c$95$m * N[(s$95$m * N[(c$95$m * N[(x$95$m * x$95$m), $MachinePrecision]), $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}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.15 \cdot 10^{-11}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x\_m \cdot x\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.15000000000000001e-11Initial program 71.3%
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.1
Applied rewrites69.1%
Applied rewrites79.4%
if 2.15000000000000001e-11 < x Initial program 71.9%
lift-*.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.1
Applied rewrites96.1%
lift-*.f64N/A
count-2N/A
lift-+.f6496.1
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
unpow-prod-downN/A
lift-*.f64N/A
pow-prod-downN/A
pow2N/A
pow2N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
pow2N/A
pow2N/A
associate-*r*N/A
Applied rewrites78.0%
Final simplification79.1%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ -2.0 (* c_m (* c_m (* s_m s_m)))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return -2.0 / (c_m * (c_m * (s_m * s_m)))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * 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])\\
\\
\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 71.4%
Taylor expanded in x around 0
lower-/.f64N/A
Applied rewrites48.3%
Taylor expanded in x around inf
Applied rewrites27.2%
herbie shell --seed 2024221
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))