
(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 17 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 (* s_m x_m))))
(if (<= x_m 9e-86)
(/ (/ 1.0 t_1) t_1)
(if (<= x_m 1.3e+185)
(/ t_0 (* (* s_m c_m) (* s_m (* x_m (* x_m c_m)))))
(/ t_0 (* (* x_m (* c_m (* x_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) {
double t_0 = cos((x_m + x_m));
double t_1 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 9e-86) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.3e+185) {
tmp = t_0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))));
} else {
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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 * (s_m * x_m)
if (x_m <= 9d-86) then
tmp = (1.0d0 / t_1) / t_1
else if (x_m <= 1.3d+185) then
tmp = t_0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))))
else
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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 * (s_m * x_m);
double tmp;
if (x_m <= 9e-86) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.3e+185) {
tmp = t_0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))));
} else {
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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 * (s_m * x_m) tmp = 0 if x_m <= 9e-86: tmp = (1.0 / t_1) / t_1 elif x_m <= 1.3e+185: tmp = t_0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m)))) else: tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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(s_m * x_m)) tmp = 0.0 if (x_m <= 9e-86) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x_m <= 1.3e+185) tmp = Float64(t_0 / Float64(Float64(s_m * c_m) * Float64(s_m * Float64(x_m * Float64(x_m * c_m))))); else tmp = Float64(t_0 / Float64(Float64(x_m * Float64(c_m * Float64(x_m * c_m))) * Float64(s_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 * (s_m * x_m);
tmp = 0.0;
if (x_m <= 9e-86)
tmp = (1.0 / t_1) / t_1;
elseif (x_m <= 1.3e+185)
tmp = t_0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))));
else
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 9e-86], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 1.3e+185], N[(t$95$0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(x$95$m * N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 9 \cdot 10^{-86}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 1.3 \cdot 10^{+185}:\\
\;\;\;\;\frac{t\_0}{\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 8.9999999999999995e-86Initial program 64.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-*.f6467.6
Applied rewrites67.6%
Applied rewrites83.1%
if 8.9999999999999995e-86 < x < 1.3e185Initial program 70.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-*.f6498.1
Applied rewrites98.1%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6498.2
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6496.8
Applied rewrites96.8%
lift-*.f64N/A
count-2N/A
lift-+.f6496.8
Applied rewrites96.8%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6494.0
Applied rewrites94.0%
if 1.3e185 < x Initial program 56.7%
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-*.f6490.5
Applied rewrites90.5%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6480.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6480.1
Applied rewrites80.1%
lift-*.f64N/A
count-2N/A
lift-+.f6480.1
Applied rewrites80.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites78.4%
Final simplification85.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 (* c_m (* s_m x_m))))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* x_m (* (pow s_m 2.0) x_m))))
-2e-138)
(/ (fma x_m (* x_m -2.0) 1.0) (* x_m (* c_m (* s_m t_0))))
(/ 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 * (s_m * x_m);
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * (x_m * (pow(s_m, 2.0) * x_m)))) <= -2e-138) {
tmp = fma(x_m, (x_m * -2.0), 1.0) / (x_m * (c_m * (s_m * t_0)));
} 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(s_m * x_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64((s_m ^ 2.0) * x_m)))) <= -2e-138) tmp = Float64(fma(x_m, Float64(x_m * -2.0), 1.0) / Float64(x_m * Float64(c_m * Float64(s_m * t_0)))); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], N[(N[(x$95$m * N[(x$95$m * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(x$95$m * N[(c$95$m * N[(s$95$m * t$95$0), $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(s\_m \cdot x\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left({s\_m}^{2} \cdot x\_m\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m, x\_m \cdot -2, 1\right)}{x\_m \cdot \left(c\_m \cdot \left(s\_m \cdot t\_0\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))) < -2.00000000000000013e-138Initial program 77.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-*.f6492.6
Applied rewrites92.6%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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.9%
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-*.f6472.5
Applied rewrites72.5%
Applied rewrites84.7%
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 (* s_m x_m))))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* x_m (* (pow s_m 2.0) x_m))))
-2e-138)
(/ (* x_m (* x_m -2.0)) (* s_m (* (* s_m x_m) (* x_m (* c_m c_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 * (s_m * x_m);
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * (x_m * (pow(s_m, 2.0) * x_m)))) <= -2e-138) {
tmp = (x_m * (x_m * -2.0)) / (s_m * ((s_m * x_m) * (x_m * (c_m * c_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 * (s_m * x_m)
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * (x_m * ((s_m ** 2.0d0) * x_m)))) <= (-2d-138)) then
tmp = (x_m * (x_m * (-2.0d0))) / (s_m * ((s_m * x_m) * (x_m * (c_m * c_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 * (s_m * x_m);
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * (x_m * (Math.pow(s_m, 2.0) * x_m)))) <= -2e-138) {
tmp = (x_m * (x_m * -2.0)) / (s_m * ((s_m * x_m) * (x_m * (c_m * c_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 * (s_m * x_m) tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * (x_m * (math.pow(s_m, 2.0) * x_m)))) <= -2e-138: tmp = (x_m * (x_m * -2.0)) / (s_m * ((s_m * x_m) * (x_m * (c_m * c_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(s_m * x_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64((s_m ^ 2.0) * x_m)))) <= -2e-138) tmp = Float64(Float64(x_m * Float64(x_m * -2.0)) / Float64(s_m * Float64(Float64(s_m * x_m) * Float64(x_m * Float64(c_m * c_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 * (s_m * x_m);
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * (x_m * ((s_m ^ 2.0) * x_m)))) <= -2e-138)
tmp = (x_m * (x_m * -2.0)) / (s_m * ((s_m * x_m) * (x_m * (c_m * c_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[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], N[(N[(x$95$m * N[(x$95$m * -2.0), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * N[(N[(s$95$m * x$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * c$95$m), $MachinePrecision]), $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(s\_m \cdot x\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left({s\_m}^{2} \cdot x\_m\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{x\_m \cdot \left(x\_m \cdot -2\right)}{s\_m \cdot \left(\left(s\_m \cdot x\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot c\_m\right)\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))) < -2.00000000000000013e-138Initial program 77.0%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
Applied rewrites49.0%
if -2.00000000000000013e-138 < (/.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.9%
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-*.f6472.5
Applied rewrites72.5%
Applied rewrites84.7%
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 (* s_m x_m))))
(if (<=
(/ (cos (* 2.0 x_m)) (* (pow c_m 2.0) (* x_m (* (pow s_m 2.0) x_m))))
-2e-138)
(/ (* x_m (* x_m -2.0)) (* s_m (* c_m (* c_m (* x_m (* s_m x_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 * (s_m * x_m);
double tmp;
if ((cos((2.0 * x_m)) / (pow(c_m, 2.0) * (x_m * (pow(s_m, 2.0) * x_m)))) <= -2e-138) {
tmp = (x_m * (x_m * -2.0)) / (s_m * (c_m * (c_m * (x_m * (s_m * x_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 * (s_m * x_m)
if ((cos((2.0d0 * x_m)) / ((c_m ** 2.0d0) * (x_m * ((s_m ** 2.0d0) * x_m)))) <= (-2d-138)) then
tmp = (x_m * (x_m * (-2.0d0))) / (s_m * (c_m * (c_m * (x_m * (s_m * x_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 * (s_m * x_m);
double tmp;
if ((Math.cos((2.0 * x_m)) / (Math.pow(c_m, 2.0) * (x_m * (Math.pow(s_m, 2.0) * x_m)))) <= -2e-138) {
tmp = (x_m * (x_m * -2.0)) / (s_m * (c_m * (c_m * (x_m * (s_m * x_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 * (s_m * x_m) tmp = 0 if (math.cos((2.0 * x_m)) / (math.pow(c_m, 2.0) * (x_m * (math.pow(s_m, 2.0) * x_m)))) <= -2e-138: tmp = (x_m * (x_m * -2.0)) / (s_m * (c_m * (c_m * (x_m * (s_m * x_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(s_m * x_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64((s_m ^ 2.0) * x_m)))) <= -2e-138) tmp = Float64(Float64(x_m * Float64(x_m * -2.0)) / Float64(s_m * Float64(c_m * Float64(c_m * Float64(x_m * Float64(s_m * x_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 * (s_m * x_m);
tmp = 0.0;
if ((cos((2.0 * x_m)) / ((c_m ^ 2.0) * (x_m * ((s_m ^ 2.0) * x_m)))) <= -2e-138)
tmp = (x_m * (x_m * -2.0)) / (s_m * (c_m * (c_m * (x_m * (s_m * x_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[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], N[(N[(x$95$m * N[(x$95$m * -2.0), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * N[(c$95$m * N[(c$95$m * N[(x$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $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(s\_m \cdot x\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left({s\_m}^{2} \cdot x\_m\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{x\_m \cdot \left(x\_m \cdot -2\right)}{s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(s\_m \cdot x\_m\right)\right)\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))) < -2.00000000000000013e-138Initial program 77.0%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lower-*.f6449.1
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6444.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6444.7
Applied rewrites44.7%
Taylor expanded in x around inf
Applied rewrites44.7%
if -2.00000000000000013e-138 < (/.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.9%
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-*.f6472.5
Applied rewrites72.5%
Applied rewrites84.7%
Final simplification80.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 (<= (pow s_m 2.0) 400.0) (/ (* (/ (cos (+ x_m x_m)) c_m) (/ 1.0 x_m)) (* c_m (* s_m (* s_m x_m)))) (/ (cos (* 2.0 x_m)) (pow (* x_m (* s_m c_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 tmp;
if (pow(s_m, 2.0) <= 400.0) {
tmp = ((cos((x_m + x_m)) / c_m) * (1.0 / x_m)) / (c_m * (s_m * (s_m * x_m)));
} else {
tmp = cos((2.0 * x_m)) / pow((x_m * (s_m * c_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) :: tmp
if ((s_m ** 2.0d0) <= 400.0d0) then
tmp = ((cos((x_m + x_m)) / c_m) * (1.0d0 / x_m)) / (c_m * (s_m * (s_m * x_m)))
else
tmp = cos((2.0d0 * x_m)) / ((x_m * (s_m * c_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 tmp;
if (Math.pow(s_m, 2.0) <= 400.0) {
tmp = ((Math.cos((x_m + x_m)) / c_m) * (1.0 / x_m)) / (c_m * (s_m * (s_m * x_m)));
} else {
tmp = Math.cos((2.0 * x_m)) / Math.pow((x_m * (s_m * c_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): tmp = 0 if math.pow(s_m, 2.0) <= 400.0: tmp = ((math.cos((x_m + x_m)) / c_m) * (1.0 / x_m)) / (c_m * (s_m * (s_m * x_m))) else: tmp = math.cos((2.0 * x_m)) / math.pow((x_m * (s_m * c_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) tmp = 0.0 if ((s_m ^ 2.0) <= 400.0) tmp = Float64(Float64(Float64(cos(Float64(x_m + x_m)) / c_m) * Float64(1.0 / x_m)) / Float64(c_m * Float64(s_m * Float64(s_m * x_m)))); else tmp = Float64(cos(Float64(2.0 * x_m)) / (Float64(x_m * Float64(s_m * c_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)
tmp = 0.0;
if ((s_m ^ 2.0) <= 400.0)
tmp = ((cos((x_m + x_m)) / c_m) * (1.0 / x_m)) / (c_m * (s_m * (s_m * x_m)));
else
tmp = cos((2.0 * x_m)) / ((x_m * (s_m * c_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_] := If[LessEqual[N[Power[s$95$m, 2.0], $MachinePrecision], 400.0], N[(N[(N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] * N[(1.0 / x$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * N[(s$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[Power[N[(x$95$m * N[(s$95$m * c$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}
\mathbf{if}\;{s\_m}^{2} \leq 400:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m + x\_m\right)}{c\_m} \cdot \frac{1}{x\_m}}{c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot x\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{{\left(x\_m \cdot \left(s\_m \cdot c\_m\right)\right)}^{2}}\\
\end{array}
\end{array}
if (pow.f64 s #s(literal 2 binary64)) < 400Initial program 64.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.0
Applied rewrites96.0%
Applied rewrites85.9%
if 400 < (pow.f64 s #s(literal 2 binary64)) Initial program 66.0%
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-*.f6495.4
Applied rewrites95.4%
Final simplification90.5%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x_m x_m))) (t_1 (* c_m (* s_m x_m))))
(if (<= x_m 1e-122)
(/ (/ 1.0 t_1) t_1)
(if (<= x_m 1.3e+185)
(/ t_0 (* (* s_m c_m) (* x_m t_1)))
(/ t_0 (* (* x_m (* c_m (* x_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) {
double t_0 = cos((x_m + x_m));
double t_1 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 1e-122) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.3e+185) {
tmp = t_0 / ((s_m * c_m) * (x_m * t_1));
} else {
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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 * (s_m * x_m)
if (x_m <= 1d-122) then
tmp = (1.0d0 / t_1) / t_1
else if (x_m <= 1.3d+185) then
tmp = t_0 / ((s_m * c_m) * (x_m * t_1))
else
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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 * (s_m * x_m);
double tmp;
if (x_m <= 1e-122) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.3e+185) {
tmp = t_0 / ((s_m * c_m) * (x_m * t_1));
} else {
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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 * (s_m * x_m) tmp = 0 if x_m <= 1e-122: tmp = (1.0 / t_1) / t_1 elif x_m <= 1.3e+185: tmp = t_0 / ((s_m * c_m) * (x_m * t_1)) else: tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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(s_m * x_m)) tmp = 0.0 if (x_m <= 1e-122) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x_m <= 1.3e+185) tmp = Float64(t_0 / Float64(Float64(s_m * c_m) * Float64(x_m * t_1))); else tmp = Float64(t_0 / Float64(Float64(x_m * Float64(c_m * Float64(x_m * c_m))) * Float64(s_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 * (s_m * x_m);
tmp = 0.0;
if (x_m <= 1e-122)
tmp = (1.0 / t_1) / t_1;
elseif (x_m <= 1.3e+185)
tmp = t_0 / ((s_m * c_m) * (x_m * t_1));
else
tmp = t_0 / ((x_m * (c_m * (x_m * c_m))) * (s_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[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1e-122], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 1.3e+185], N[(t$95$0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(x$95$m * N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 10^{-122}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 1.3 \cdot 10^{+185}:\\
\;\;\;\;\frac{t\_0}{\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot t\_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 1.00000000000000006e-122Initial program 64.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-*.f6466.7
Applied rewrites66.7%
Applied rewrites82.1%
if 1.00000000000000006e-122 < x < 1.3e185Initial program 70.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-*.f6498.3
Applied rewrites98.3%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6498.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.1
Applied rewrites97.1%
lift-*.f64N/A
count-2N/A
lift-+.f6497.1
Applied rewrites97.1%
if 1.3e185 < x Initial program 56.7%
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-*.f6490.5
Applied rewrites90.5%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6480.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6480.1
Applied rewrites80.1%
lift-*.f64N/A
count-2N/A
lift-+.f6480.1
Applied rewrites80.1%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites78.4%
Final simplification86.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 (cos (+ x_m x_m))) (t_1 (* c_m (* s_m x_m))))
(if (<= s_m 2.1e+29)
(/ t_0 (* c_m (* (* s_m (* s_m x_m)) (* x_m c_m))))
(if (<= s_m 4.9e+204)
(/ t_0 (* x_m (* c_m (* s_m t_1))))
(/ (/ 1.0 t_1) 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 * (s_m * x_m);
double tmp;
if (s_m <= 2.1e+29) {
tmp = t_0 / (c_m * ((s_m * (s_m * x_m)) * (x_m * c_m)));
} else if (s_m <= 4.9e+204) {
tmp = t_0 / (x_m * (c_m * (s_m * t_1)));
} else {
tmp = (1.0 / t_1) / 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 * (s_m * x_m)
if (s_m <= 2.1d+29) then
tmp = t_0 / (c_m * ((s_m * (s_m * x_m)) * (x_m * c_m)))
else if (s_m <= 4.9d+204) then
tmp = t_0 / (x_m * (c_m * (s_m * t_1)))
else
tmp = (1.0d0 / t_1) / 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 * (s_m * x_m);
double tmp;
if (s_m <= 2.1e+29) {
tmp = t_0 / (c_m * ((s_m * (s_m * x_m)) * (x_m * c_m)));
} else if (s_m <= 4.9e+204) {
tmp = t_0 / (x_m * (c_m * (s_m * t_1)));
} else {
tmp = (1.0 / t_1) / 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 * (s_m * x_m) tmp = 0 if s_m <= 2.1e+29: tmp = t_0 / (c_m * ((s_m * (s_m * x_m)) * (x_m * c_m))) elif s_m <= 4.9e+204: tmp = t_0 / (x_m * (c_m * (s_m * t_1))) else: tmp = (1.0 / t_1) / 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(s_m * x_m)) tmp = 0.0 if (s_m <= 2.1e+29) tmp = Float64(t_0 / Float64(c_m * Float64(Float64(s_m * Float64(s_m * x_m)) * Float64(x_m * c_m)))); elseif (s_m <= 4.9e+204) tmp = Float64(t_0 / Float64(x_m * Float64(c_m * Float64(s_m * t_1)))); else tmp = Float64(Float64(1.0 / t_1) / 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 * (s_m * x_m);
tmp = 0.0;
if (s_m <= 2.1e+29)
tmp = t_0 / (c_m * ((s_m * (s_m * x_m)) * (x_m * c_m)));
elseif (s_m <= 4.9e+204)
tmp = t_0 / (x_m * (c_m * (s_m * t_1)));
else
tmp = (1.0 / t_1) / 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[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[s$95$m, 2.1e+29], N[(t$95$0 / N[(c$95$m * N[(N[(s$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[s$95$m, 4.9e+204], N[(t$95$0 / N[(x$95$m * N[(c$95$m * N[(s$95$m * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $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(s\_m \cdot x\_m\right)\\
\mathbf{if}\;s\_m \leq 2.1 \cdot 10^{+29}:\\
\;\;\;\;\frac{t\_0}{c\_m \cdot \left(\left(s\_m \cdot \left(s\_m \cdot x\_m\right)\right) \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\mathbf{elif}\;s\_m \leq 4.9 \cdot 10^{+204}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(c\_m \cdot \left(s\_m \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\end{array}
\end{array}
if s < 2.1000000000000002e29Initial program 67.3%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6479.7
Applied rewrites79.7%
lift-*.f64N/A
count-2N/A
lift-+.f6479.7
Applied rewrites79.7%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6478.0
Applied rewrites78.0%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6486.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6486.2
Applied rewrites86.2%
if 2.1000000000000002e29 < s < 4.8999999999999997e204Initial program 64.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-*.f6496.2
Applied rewrites96.2%
lift-*.f64N/A
count-2N/A
lift-+.f6496.2
Applied rewrites96.2%
if 4.8999999999999997e204 < s Initial program 47.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.6
Applied rewrites74.6%
Applied rewrites99.6%
Final simplification88.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 x_m))) (t_1 (* c_m (* s_m x_m))))
(if (<= x_m 8e-7)
(/ 1.0 (* t_1 t_1))
(if (<= x_m 1.2e+136)
(/ t_0 (* x_m (* x_m (* c_m (* s_m (* s_m c_m))))))
(/ t_0 (* c_m (* (* x_m c_m) (* x_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) {
double t_0 = cos((x_m + x_m));
double t_1 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 1.2e+136) {
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
} else {
tmp = t_0 / (c_m * ((x_m * c_m) * (x_m * (s_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 * (s_m * x_m)
if (x_m <= 8d-7) then
tmp = 1.0d0 / (t_1 * t_1)
else if (x_m <= 1.2d+136) then
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))))
else
tmp = t_0 / (c_m * ((x_m * c_m) * (x_m * (s_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 * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 1.2e+136) {
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
} else {
tmp = t_0 / (c_m * ((x_m * c_m) * (x_m * (s_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 * (s_m * x_m) tmp = 0 if x_m <= 8e-7: tmp = 1.0 / (t_1 * t_1) elif x_m <= 1.2e+136: tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m))))) else: tmp = t_0 / (c_m * ((x_m * c_m) * (x_m * (s_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(s_m * x_m)) tmp = 0.0 if (x_m <= 8e-7) tmp = Float64(1.0 / Float64(t_1 * t_1)); elseif (x_m <= 1.2e+136) tmp = Float64(t_0 / Float64(x_m * Float64(x_m * Float64(c_m * Float64(s_m * Float64(s_m * c_m)))))); else tmp = Float64(t_0 / Float64(c_m * Float64(Float64(x_m * c_m) * Float64(x_m * Float64(s_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 * (s_m * x_m);
tmp = 0.0;
if (x_m <= 8e-7)
tmp = 1.0 / (t_1 * t_1);
elseif (x_m <= 1.2e+136)
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
else
tmp = t_0 / (c_m * ((x_m * c_m) * (x_m * (s_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[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 8e-7], N[(1.0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$95$m, 1.2e+136], N[(t$95$0 / N[(x$95$m * N[(x$95$m * N[(c$95$m * N[(s$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(c$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(s$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 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 8 \cdot 10^{-7}:\\
\;\;\;\;\frac{1}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x\_m \leq 1.2 \cdot 10^{+136}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{c\_m \cdot \left(\left(x\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 7.9999999999999996e-7Initial program 65.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-*.f6470.1
Applied rewrites70.1%
Applied rewrites84.7%
if 7.9999999999999996e-7 < x < 1.2e136Initial program 71.8%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6478.4
Applied rewrites78.4%
lift-*.f64N/A
count-2N/A
lift-+.f6478.4
Applied rewrites78.4%
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
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6492.3
Applied rewrites92.3%
if 1.2e136 < x Initial program 59.7%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6475.9
Applied rewrites75.9%
lift-*.f64N/A
count-2N/A
lift-+.f6475.9
Applied rewrites75.9%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6476.4
Applied rewrites76.4%
Final simplification84.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 x_m))) (t_1 (* c_m (* s_m x_m))))
(if (<= x_m 8e-7)
(/ 1.0 (* t_1 t_1))
(if (<= x_m 3.2e+172)
(/ t_0 (* x_m (* x_m (* c_m (* s_m (* s_m c_m))))))
(/ t_0 (* c_m (* c_m (* x_m (* s_m (* s_m x_m))))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m + x_m));
double t_1 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 3.2e+172) {
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
} else {
tmp = t_0 / (c_m * (c_m * (x_m * (s_m * (s_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) :: t_1
real(8) :: tmp
t_0 = cos((x_m + x_m))
t_1 = c_m * (s_m * x_m)
if (x_m <= 8d-7) then
tmp = 1.0d0 / (t_1 * t_1)
else if (x_m <= 3.2d+172) then
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))))
else
tmp = t_0 / (c_m * (c_m * (x_m * (s_m * (s_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 = Math.cos((x_m + x_m));
double t_1 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_1 * t_1);
} else if (x_m <= 3.2e+172) {
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
} else {
tmp = t_0 / (c_m * (c_m * (x_m * (s_m * (s_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 = math.cos((x_m + x_m)) t_1 = c_m * (s_m * x_m) tmp = 0 if x_m <= 8e-7: tmp = 1.0 / (t_1 * t_1) elif x_m <= 3.2e+172: tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m))))) else: tmp = t_0 / (c_m * (c_m * (x_m * (s_m * (s_m * x_m))))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m + x_m)) t_1 = Float64(c_m * Float64(s_m * x_m)) tmp = 0.0 if (x_m <= 8e-7) tmp = Float64(1.0 / Float64(t_1 * t_1)); elseif (x_m <= 3.2e+172) tmp = Float64(t_0 / Float64(x_m * Float64(x_m * Float64(c_m * Float64(s_m * Float64(s_m * c_m)))))); else tmp = Float64(t_0 / Float64(c_m * Float64(c_m * Float64(x_m * Float64(s_m * Float64(s_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 = cos((x_m + x_m));
t_1 = c_m * (s_m * x_m);
tmp = 0.0;
if (x_m <= 8e-7)
tmp = 1.0 / (t_1 * t_1);
elseif (x_m <= 3.2e+172)
tmp = t_0 / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
else
tmp = t_0 / (c_m * (c_m * (x_m * (s_m * (s_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[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 8e-7], N[(1.0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x$95$m, 3.2e+172], N[(t$95$0 / N[(x$95$m * N[(x$95$m * N[(c$95$m * N[(s$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(c$95$m * N[(c$95$m * N[(x$95$m * N[(s$95$m * N[(s$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 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 8 \cdot 10^{-7}:\\
\;\;\;\;\frac{1}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x\_m \leq 3.2 \cdot 10^{+172}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(s\_m \cdot \left(s\_m \cdot x\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 7.9999999999999996e-7Initial program 65.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-*.f6470.1
Applied rewrites70.1%
Applied rewrites84.7%
if 7.9999999999999996e-7 < x < 3.19999999999999985e172Initial program 71.8%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6479.7
Applied rewrites79.7%
lift-*.f64N/A
count-2N/A
lift-+.f6479.7
Applied rewrites79.7%
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
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6491.3
Applied rewrites91.3%
if 3.19999999999999985e172 < x Initial program 57.1%
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-*.f6491.4
Applied rewrites91.4%
lift-*.f64N/A
count-2N/A
lift-+.f6491.4
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites88.5%
Final simplification86.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 (* c_m (* s_m x_m))))
(if (<= x_m 2.2e-16)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* s_m (* x_m (* c_m (* x_m (* s_m c_m)))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 2.2e-16) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (s_m * c_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (s_m * x_m)
if (x_m <= 2.2d-16) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (s_m * c_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 2.2e-16) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (s_m * c_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (s_m * x_m) tmp = 0 if x_m <= 2.2e-16: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (s_m * c_m))))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(s_m * x_m)) tmp = 0.0 if (x_m <= 2.2e-16) 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(s_m * c_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (s_m * x_m);
tmp = 0.0;
if (x_m <= 2.2e-16)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / (s_m * (x_m * (c_m * (x_m * (s_m * c_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.2e-16], 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[(s$95$m * c$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(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 2.2 \cdot 10^{-16}:\\
\;\;\;\;\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(s\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.2e-16Initial program 65.1%
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.9
Applied rewrites69.9%
Applied rewrites84.6%
if 2.2e-16 < x Initial program 65.6%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
count-2N/A
lift-+.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6490.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
Final simplification85.9%
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 (* s_m x_m))))
(if (<= x_m 8e-7)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* x_m c_m) (* x_m (* s_m (* s_m c_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / ((x_m * c_m) * (x_m * (s_m * (s_m * c_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
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 * (s_m * x_m)
if (x_m <= 8d-7) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / ((x_m * c_m) * (x_m * (s_m * (s_m * c_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / ((x_m * c_m) * (x_m * (s_m * (s_m * c_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (s_m * x_m) tmp = 0 if x_m <= 8e-7: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / ((x_m * c_m) * (x_m * (s_m * (s_m * c_m)))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(s_m * x_m)) tmp = 0.0 if (x_m <= 8e-7) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(x_m * c_m) * Float64(x_m * Float64(s_m * Float64(s_m * c_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (s_m * x_m);
tmp = 0.0;
if (x_m <= 8e-7)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / ((x_m * c_m) * (x_m * (s_m * (s_m * c_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 8e-7], 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[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(s$95$m * N[(s$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}
t_0 := c\_m \cdot \left(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 8 \cdot 10^{-7}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 7.9999999999999996e-7Initial program 65.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-*.f6470.1
Applied rewrites70.1%
Applied rewrites84.7%
if 7.9999999999999996e-7 < x Initial program 65.2%
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-*.f6495.1
Applied rewrites95.1%
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6491.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6490.2
Applied rewrites90.2%
lift-*.f64N/A
count-2N/A
lift-+.f6490.2
Applied rewrites90.2%
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites85.2%
Final simplification84.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 (* s_m x_m))))
(if (<= x_m 8e-7)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* x_m (* x_m (* c_m (* s_m (* s_m c_m)))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (s_m * x_m)
if (x_m <= 8d-7) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
double tmp;
if (x_m <= 8e-7) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (s_m * x_m) tmp = 0 if x_m <= 8e-7: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / (x_m * (x_m * (c_m * (s_m * (s_m * c_m))))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(s_m * x_m)) tmp = 0.0 if (x_m <= 8e-7) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(x_m * Float64(x_m * Float64(c_m * Float64(s_m * Float64(s_m * c_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (s_m * x_m);
tmp = 0.0;
if (x_m <= 8e-7)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / (x_m * (x_m * (c_m * (s_m * (s_m * c_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 8e-7], 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[(x$95$m * N[(x$95$m * N[(c$95$m * N[(s$95$m * N[(s$95$m * c$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(s\_m \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 8 \cdot 10^{-7}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 7.9999999999999996e-7Initial program 65.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-*.f6470.1
Applied rewrites70.1%
Applied rewrites84.7%
if 7.9999999999999996e-7 < x Initial program 65.2%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6477.1
Applied rewrites77.1%
lift-*.f64N/A
count-2N/A
lift-+.f6477.1
Applied rewrites77.1%
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
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6480.0
Applied rewrites80.0%
Final simplification83.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 (<= c_m 1.55e-130) (/ 1.0 (* x_m (* (* s_m c_m) (* c_m (* s_m x_m))))) (/ 1.0 (* s_m (* c_m (* c_m (* x_m (* s_m x_m))))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (c_m <= 1.55e-130) {
tmp = 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))));
} else {
tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (s_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 (c_m <= 1.55d-130) then
tmp = 1.0d0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))))
else
tmp = 1.0d0 / (s_m * (c_m * (c_m * (x_m * (s_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 (c_m <= 1.55e-130) {
tmp = 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))));
} else {
tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (s_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 c_m <= 1.55e-130: tmp = 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m)))) else: tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (s_m * x_m))))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (c_m <= 1.55e-130) tmp = Float64(1.0 / Float64(x_m * Float64(Float64(s_m * c_m) * Float64(c_m * Float64(s_m * x_m))))); else tmp = Float64(1.0 / Float64(s_m * Float64(c_m * Float64(c_m * Float64(x_m * Float64(s_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 (c_m <= 1.55e-130)
tmp = 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))));
else
tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (s_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[c$95$m, 1.55e-130], N[(1.0 / N[(x$95$m * N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s$95$m * N[(c$95$m * N[(c$95$m * N[(x$95$m * N[(s$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}\;c\_m \leq 1.55 \cdot 10^{-130}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(\left(s\_m \cdot c\_m\right) \cdot \left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(s\_m \cdot x\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if c < 1.55000000000000005e-130Initial program 68.1%
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-*.f6465.1
Applied rewrites65.1%
Applied rewrites69.7%
if 1.55000000000000005e-130 < c Initial program 60.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-*.f6465.3
Applied rewrites65.3%
Applied rewrites71.5%
Final simplification70.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 (* c_m (* s_m x_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 * (s_m * x_m);
return 1.0 / (t_0 * t_0);
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (s_m * x_m)
code = 1.0d0 / (t_0 * t_0)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (s_m * x_m);
return 1.0 / (t_0 * t_0);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (s_m * x_m) return 1.0 / (t_0 * t_0)
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(s_m * x_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = c_m * (s_m * x_m);
tmp = 1.0 / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(s$95$m * x$95$m), $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(s\_m \cdot x\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 65.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-*.f6465.2
Applied rewrites65.2%
Applied rewrites76.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 (/ 1.0 (* x_m (* (* s_m c_m) (* c_m (* s_m x_m))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(x_m * Float64(Float64(s_m * c_m) * Float64(c_m * Float64(s_m * x_m))))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (x_m * ((s_m * c_m) * (c_m * (s_m * x_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(x$95$m * N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{x\_m \cdot \left(\left(s\_m \cdot c\_m\right) \cdot \left(c\_m \cdot \left(s\_m \cdot x\_m\right)\right)\right)}
\end{array}
Initial program 65.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-*.f6465.2
Applied rewrites65.2%
Applied rewrites70.9%
Final simplification70.9%
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 (/ 1.0 (* x_m (* x_m (* (* s_m c_m) (* s_m c_m))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * (x_m * ((s_m * c_m) * (s_m * c_m))));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (x_m * (x_m * ((s_m * c_m) * (s_m * c_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * (x_m * ((s_m * c_m) * (s_m * c_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (x_m * (x_m * ((s_m * c_m) * (s_m * c_m))))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(x_m * Float64(x_m * Float64(Float64(s_m * c_m) * Float64(s_m * c_m))))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (x_m * (x_m * ((s_m * c_m) * (s_m * c_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(x$95$m * N[(x$95$m * N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$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])\\
\\
\frac{1}{x\_m \cdot \left(x\_m \cdot \left(\left(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot c\_m\right)\right)\right)}
\end{array}
Initial program 65.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-*.f6465.2
Applied rewrites65.2%
Applied rewrites67.6%
Final simplification67.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 (/ 1.0 (* x_m (* x_m (* s_m (* c_m (* s_m c_m)))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(x_m * Float64(x_m * Float64(s_m * Float64(c_m * Float64(s_m * c_m)))))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (x_m * (x_m * (s_m * (c_m * (s_m * c_m)))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(x$95$m * N[(x$95$m * N[(s$95$m * N[(c$95$m * N[(s$95$m * c$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])\\
\\
\frac{1}{x\_m \cdot \left(x\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot c\_m\right)\right)\right)\right)}
\end{array}
Initial program 65.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-*.f6465.2
Applied rewrites65.2%
Final simplification65.2%
herbie shell --seed 2024216
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))