
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 1.9e-105)
(/ (/ 1.0 t_1) t_1)
(if (<= x_m 1.95e+149)
(/ t_0 (* (* c_m s_m) (* x_m (* x_m (* c_m s_m)))))
(/ (/ t_0 s_m) (* s_m (* x_m (* c_m (* x_m c_m)))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.9e-105) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.95e+149) {
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
} else {
tmp = (t_0 / s_m) / (s_m * (x_m * (c_m * (x_m * c_m))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * 2.0d0))
t_1 = c_m * (x_m * s_m)
if (x_m <= 1.9d-105) then
tmp = (1.0d0 / t_1) / t_1
else if (x_m <= 1.95d+149) then
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))))
else
tmp = (t_0 / s_m) / (s_m * (x_m * (c_m * (x_m * c_m))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.9e-105) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.95e+149) {
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
} else {
tmp = (t_0 / s_m) / (s_m * (x_m * (c_m * (x_m * c_m))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.9e-105: tmp = (1.0 / t_1) / t_1 elif x_m <= 1.95e+149: tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m)))) else: tmp = (t_0 / s_m) / (s_m * (x_m * (c_m * (x_m * c_m)))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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 * 2.0)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.9e-105) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x_m <= 1.95e+149) tmp = Float64(t_0 / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(x_m * Float64(c_m * s_m))))); else tmp = Float64(Float64(t_0 / s_m) / Float64(s_m * Float64(x_m * Float64(c_m * Float64(x_m * c_m))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.9e-105)
tmp = (1.0 / t_1) / t_1;
elseif (x_m <= 1.95e+149)
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
else
tmp = (t_0 / s_m) / (s_m * (x_m * (c_m * (x_m * c_m))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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 * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.9e-105], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 1.95e+149], N[(t$95$0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(s$95$m * N[(x$95$m * N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.9 \cdot 10^{-105}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 1.95 \cdot 10^{+149}:\\
\;\;\;\;\frac{t\_0}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 1.8999999999999999e-105Initial program 66.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.4%
Simplified73.4%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.6%
Applied egg-rr80.6%
if 1.8999999999999999e-105 < x < 1.95e149Initial program 65.7%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6484.6%
Simplified84.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.4%
Applied egg-rr99.4%
if 1.95e149 < x Initial program 66.1%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.4%
Applied egg-rr97.4%
*-rgt-identityN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
swap-sqrN/A
unswap-sqrN/A
associate-*r*N/A
frac-timesN/A
associate-/r*N/A
frac-timesN/A
div-invN/A
*-commutativeN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
Applied egg-rr78.7%
Final simplification84.5%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 4.2e-105)
(/ (/ 1.0 t_1) t_1)
(if (<= x_m 3.3e+150)
(/ t_0 (* (* c_m s_m) (* x_m (* x_m (* c_m s_m)))))
(/ t_0 (* s_m (* s_m (* x_m (* c_m (* x_m c_m))))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 4.2e-105) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 3.3e+150) {
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
} else {
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * 2.0d0))
t_1 = c_m * (x_m * s_m)
if (x_m <= 4.2d-105) then
tmp = (1.0d0 / t_1) / t_1
else if (x_m <= 3.3d+150) then
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))))
else
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 4.2e-105) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 3.3e+150) {
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
} else {
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 4.2e-105: tmp = (1.0 / t_1) / t_1 elif x_m <= 3.3e+150: tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m)))) else: tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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 * 2.0)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 4.2e-105) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x_m <= 3.3e+150) tmp = Float64(t_0 / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(x_m * Float64(c_m * s_m))))); else tmp = Float64(t_0 / Float64(s_m * Float64(s_m * Float64(x_m * Float64(c_m * Float64(x_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 4.2e-105)
tmp = (1.0 / t_1) / t_1;
elseif (x_m <= 3.3e+150)
tmp = t_0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
else
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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 * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 4.2e-105], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 3.3e+150], N[(t$95$0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(s$95$m * N[(x$95$m * N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 4.2 \cdot 10^{-105}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 3.3 \cdot 10^{+150}:\\
\;\;\;\;\frac{t\_0}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 4.2e-105Initial program 66.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.4%
Simplified73.4%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.6%
Applied egg-rr80.6%
if 4.2e-105 < x < 3.29999999999999981e150Initial program 66.3%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6484.9%
Simplified84.9%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.4%
Applied egg-rr99.4%
if 3.29999999999999981e150 < x Initial program 64.4%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.4%
Applied egg-rr97.4%
unpow2N/A
associate-*l*N/A
associate-*l*N/A
swap-sqrN/A
unswap-sqrN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6477.6%
Applied egg-rr77.6%
Final simplification84.5%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 9.2e-5)
(/ (/ (+ 1.0 (* (* x_m x_m) -2.0)) t_1) t_1)
(if (<= x_m 2.8e+110)
(/ t_0 (* (* x_m c_m) (* (* x_m s_m) (* c_m s_m))))
(/ t_0 (* s_m (* s_m (* x_m (* c_m (* x_m c_m))))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 9.2e-5) {
tmp = ((1.0 + ((x_m * x_m) * -2.0)) / t_1) / t_1;
} else if (x_m <= 2.8e+110) {
tmp = t_0 / ((x_m * c_m) * ((x_m * s_m) * (c_m * s_m)));
} else {
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * 2.0d0))
t_1 = c_m * (x_m * s_m)
if (x_m <= 9.2d-5) then
tmp = ((1.0d0 + ((x_m * x_m) * (-2.0d0))) / t_1) / t_1
else if (x_m <= 2.8d+110) then
tmp = t_0 / ((x_m * c_m) * ((x_m * s_m) * (c_m * s_m)))
else
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 9.2e-5) {
tmp = ((1.0 + ((x_m * x_m) * -2.0)) / t_1) / t_1;
} else if (x_m <= 2.8e+110) {
tmp = t_0 / ((x_m * c_m) * ((x_m * s_m) * (c_m * s_m)));
} else {
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 9.2e-5: tmp = ((1.0 + ((x_m * x_m) * -2.0)) / t_1) / t_1 elif x_m <= 2.8e+110: tmp = t_0 / ((x_m * c_m) * ((x_m * s_m) * (c_m * s_m))) else: tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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 * 2.0)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 9.2e-5) tmp = Float64(Float64(Float64(1.0 + Float64(Float64(x_m * x_m) * -2.0)) / t_1) / t_1); elseif (x_m <= 2.8e+110) tmp = Float64(t_0 / Float64(Float64(x_m * c_m) * Float64(Float64(x_m * s_m) * Float64(c_m * s_m)))); else tmp = Float64(t_0 / Float64(s_m * Float64(s_m * Float64(x_m * Float64(c_m * Float64(x_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 9.2e-5)
tmp = ((1.0 + ((x_m * x_m) * -2.0)) / t_1) / t_1;
elseif (x_m <= 2.8e+110)
tmp = t_0 / ((x_m * c_m) * ((x_m * s_m) * (c_m * s_m)));
else
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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 * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 9.2e-5], N[(N[(N[(1.0 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 2.8e+110], N[(t$95$0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(s$95$m * N[(x$95$m * N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 9.2 \cdot 10^{-5}:\\
\;\;\;\;\frac{\frac{1 + \left(x\_m \cdot x\_m\right) \cdot -2}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 2.8 \cdot 10^{+110}:\\
\;\;\;\;\frac{t\_0}{\left(x\_m \cdot c\_m\right) \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 9.20000000000000001e-5Initial program 65.5%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.4%
Applied egg-rr96.4%
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.7%
Applied egg-rr98.7%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6469.8%
Simplified69.8%
if 9.20000000000000001e-5 < x < 2.79999999999999987e110Initial program 71.2%
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6495.8%
Applied egg-rr95.8%
if 2.79999999999999987e110 < x Initial program 65.0%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.1%
Applied egg-rr98.1%
unpow2N/A
associate-*l*N/A
associate-*l*N/A
swap-sqrN/A
unswap-sqrN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6475.9%
Applied egg-rr75.9%
Final simplification73.0%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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))) (t_1 (/ 1.0 (* c_m (* x_m s_m)))))
(if (<= x_m 3.45e-37)
(* t_1 t_1)
(if (<= x_m 7.6e+116)
(/ t_0 (* x_m (* x_m (* s_m (* c_m (* c_m s_m))))))
(/ t_0 (* s_m (* s_m (* x_m (* c_m (* x_m c_m))))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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));
double t_1 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (x_m <= 3.45e-37) {
tmp = t_1 * t_1;
} else if (x_m <= 7.6e+116) {
tmp = t_0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
} else {
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * 2.0d0))
t_1 = 1.0d0 / (c_m * (x_m * s_m))
if (x_m <= 3.45d-37) then
tmp = t_1 * t_1
else if (x_m <= 7.6d+116) then
tmp = t_0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))))
else
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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));
double t_1 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (x_m <= 3.45e-37) {
tmp = t_1 * t_1;
} else if (x_m <= 7.6e+116) {
tmp = t_0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
} else {
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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)) t_1 = 1.0 / (c_m * (x_m * s_m)) tmp = 0 if x_m <= 3.45e-37: tmp = t_1 * t_1 elif x_m <= 7.6e+116: tmp = t_0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m))))) else: tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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 * 2.0)) t_1 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (x_m <= 3.45e-37) tmp = Float64(t_1 * t_1); elseif (x_m <= 7.6e+116) tmp = Float64(t_0 / Float64(x_m * Float64(x_m * Float64(s_m * Float64(c_m * Float64(c_m * s_m)))))); else tmp = Float64(t_0 / Float64(s_m * Float64(s_m * Float64(x_m * Float64(c_m * Float64(x_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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));
t_1 = 1.0 / (c_m * (x_m * s_m));
tmp = 0.0;
if (x_m <= 3.45e-37)
tmp = t_1 * t_1;
elseif (x_m <= 7.6e+116)
tmp = t_0 / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
else
tmp = t_0 / (s_m * (s_m * (x_m * (c_m * (x_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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 * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 3.45e-37], N[(t$95$1 * t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 7.6e+116], N[(t$95$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], N[(t$95$0 / N[(s$95$m * N[(s$95$m * N[(x$95$m * N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
t_1 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;x\_m \leq 3.45 \cdot 10^{-37}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{elif}\;x\_m \leq 7.6 \cdot 10^{+116}:\\
\;\;\;\;\frac{t\_0}{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)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 3.4499999999999999e-37Initial program 65.9%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.4%
Simplified73.4%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.9%
Applied egg-rr81.9%
if 3.4499999999999999e-37 < x < 7.5999999999999998e116Initial program 67.2%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6493.7%
Simplified93.7%
if 7.5999999999999998e116 < x Initial program 64.8%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.1%
Applied egg-rr98.1%
unpow2N/A
associate-*l*N/A
associate-*l*N/A
swap-sqrN/A
unswap-sqrN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6479.6%
Applied egg-rr79.6%
Final simplification83.1%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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 (/ 1.0 (* c_m (* x_m s_m)))))
(if (<= x_m 4.7e-37)
(* t_0 t_0)
(/ (cos (* x_m 2.0)) (* x_m (* x_m (* s_m (* c_m (* c_m s_m)))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (x_m <= 4.7e-37) {
tmp = t_0 * t_0;
} else {
tmp = cos((x_m * 2.0)) / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 = 1.0d0 / (c_m * (x_m * s_m))
if (x_m <= 4.7d-37) then
tmp = t_0 * t_0
else
tmp = cos((x_m * 2.0d0)) / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (x_m <= 4.7e-37) {
tmp = t_0 * t_0;
} else {
tmp = Math.cos((x_m * 2.0)) / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) tmp = 0 if x_m <= 4.7e-37: tmp = t_0 * t_0 else: tmp = math.cos((x_m * 2.0)) / (x_m * (x_m * (s_m * (c_m * (c_m * s_m))))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (x_m <= 4.7e-37) tmp = Float64(t_0 * t_0); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * Float64(x_m * Float64(s_m * Float64(c_m * Float64(c_m * s_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 = 1.0 / (c_m * (x_m * s_m));
tmp = 0.0;
if (x_m <= 4.7e-37)
tmp = t_0 * t_0;
else
tmp = cos((x_m * 2.0)) / (x_m * (x_m * (s_m * (c_m * (c_m * s_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 4.7e-37], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;x\_m \leq 4.7 \cdot 10^{-37}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{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 x < 4.7000000000000003e-37Initial program 65.9%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.4%
Simplified73.4%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.9%
Applied egg-rr81.9%
if 4.7000000000000003e-37 < x Initial program 66.0%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6485.1%
Simplified85.1%
Final simplification82.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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)))) (/ (/ (cos (* x_m 2.0)) t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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);
return (cos((x_m * 2.0)) / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * (x_m * s_m)
code = (cos((x_m * 2.0d0)) / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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);
return (Math.cos((x_m * 2.0)) / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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) return (math.cos((x_m * 2.0)) / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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)) return Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 * (x_m * s_m);
tmp = (cos((x_m * 2.0)) / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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]}, N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\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)\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.0%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.9%
Applied egg-rr96.9%
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.5%
Applied egg-rr98.5%
Final simplification98.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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.12e+101) (/ (/ 1.0 c_m) (* c_m (* s_m (* s_m (* x_m x_m))))) (/ (/ -2.0 (* c_m s_m)) (* c_m s_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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.12e+101) {
tmp = (1.0 / c_m) / (c_m * (s_m * (s_m * (x_m * x_m))));
} else {
tmp = (-2.0 / (c_m * s_m)) / (c_m * s_m);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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.12d+101) then
tmp = (1.0d0 / c_m) / (c_m * (s_m * (s_m * (x_m * x_m))))
else
tmp = ((-2.0d0) / (c_m * s_m)) / (c_m * s_m)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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.12e+101) {
tmp = (1.0 / c_m) / (c_m * (s_m * (s_m * (x_m * x_m))));
} else {
tmp = (-2.0 / (c_m * s_m)) / (c_m * s_m);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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.12e+101: tmp = (1.0 / c_m) / (c_m * (s_m * (s_m * (x_m * x_m)))) else: tmp = (-2.0 / (c_m * s_m)) / (c_m * s_m) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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.12e+101) tmp = Float64(Float64(1.0 / c_m) / Float64(c_m * Float64(s_m * Float64(s_m * Float64(x_m * x_m))))); else tmp = Float64(Float64(-2.0 / Float64(c_m * s_m)) / Float64(c_m * s_m)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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.12e+101)
tmp = (1.0 / c_m) / (c_m * (s_m * (s_m * (x_m * x_m))));
else
tmp = (-2.0 / (c_m * s_m)) / (c_m * s_m);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $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.12e+101], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(c$95$m * N[(s$95$m * N[(s$95$m * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;c\_m \leq 1.12 \cdot 10^{+101}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot x\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-2}{c\_m \cdot s\_m}}{c\_m \cdot s\_m}\\
\end{array}
\end{array}
if c < 1.1199999999999999e101Initial program 65.9%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6467.5%
Simplified67.5%
associate-/l/N/A
associate-/r*N/A
associate-/l/N/A
*-rgt-identityN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
frac-timesN/A
associate-/r*N/A
associate-*l*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.4%
Applied egg-rr63.4%
if 1.1199999999999999e101 < c Initial program 66.3%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.0%
Applied egg-rr96.0%
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.9%
Applied egg-rr97.9%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified39.5%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6452.9%
Simplified52.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 = 1.0d0 / (c_m * (x_m * s_m))
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) return Float64(t_0 * t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 = 1.0 / (c_m * (x_m * s_m));
tmp = t_0 * t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 66.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6468.7%
Simplified68.7%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
div-invN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.8%
Applied egg-rr75.8%
Final simplification75.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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)))) (/ (/ 1.0 t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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);
return (1.0 / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * (x_m * s_m)
code = (1.0d0 / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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);
return (1.0 / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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) return (1.0 / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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)) return Float64(Float64(1.0 / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 * (x_m * s_m);
tmp = (1.0 / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\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)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6468.7%
Simplified68.7%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.8%
Applied egg-rr75.8%
Final simplification75.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 c_m) (* (* x_m s_m) (* x_m (* c_m s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (1.0 / c_m) / ((x_m * s_m) * (x_m * (c_m * s_m)));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 / c_m) / ((x_m * s_m) * (x_m * (c_m * s_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 / c_m) / ((x_m * s_m) * (x_m * (c_m * s_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (1.0 / c_m) / ((x_m * s_m) * (x_m * (c_m * s_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(1.0 / c_m) / Float64(Float64(x_m * s_m) * Float64(x_m * Float64(c_m * s_m)))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 / c_m) / ((x_m * s_m) * (x_m * (c_m * s_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 66.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6468.7%
Simplified68.7%
associate-/l/N/A
associate-/r*N/A
associate-/l/N/A
*-rgt-identityN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
frac-timesN/A
associate-/r*N/A
associate-*l*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.4%
Applied egg-rr63.4%
associate-*r*N/A
*-commutativeN/A
remove-double-divN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6470.2%
Applied egg-rr70.2%
associate-*r*N/A
associate-*r/N/A
*-commutativeN/A
div-invN/A
remove-double-divN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.8%
Applied egg-rr72.8%
Final simplification72.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 c_m) (* c_m (* s_m (* x_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (1.0 / c_m) / (c_m * (s_m * (x_m * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 / c_m) / (c_m * (s_m * (x_m * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 / c_m) / (c_m * (s_m * (x_m * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (1.0 / c_m) / (c_m * (s_m * (x_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(1.0 / c_m) / Float64(c_m * Float64(s_m * Float64(x_m * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 / c_m) / (c_m * (s_m * (x_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(c$95$m * N[(s$95$m * N[(x$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{1}{c\_m}}{c\_m \cdot \left(s\_m \cdot \left(x\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 66.0%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6468.7%
Simplified68.7%
associate-/l/N/A
associate-/r*N/A
associate-/l/N/A
*-rgt-identityN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
frac-timesN/A
associate-/r*N/A
associate-*l*N/A
*-commutativeN/A
div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6463.4%
Applied egg-rr63.4%
associate-*r*N/A
*-commutativeN/A
remove-double-divN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6470.2%
Applied egg-rr70.2%
associate-*r/N/A
*-commutativeN/A
associate-/r/N/A
/-rgt-identityN/A
swap-sqrN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.2%
Applied egg-rr70.2%
Final simplification70.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ -2.0 (* c_m s_m)) (* c_m s_m)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (-2.0 / (c_m * s_m)) / (c_m * s_m);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = ((-2.0d0) / (c_m * s_m)) / (c_m * s_m)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (-2.0 / (c_m * s_m)) / (c_m * s_m);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (-2.0 / (c_m * s_m)) / (c_m * s_m)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(-2.0 / Float64(c_m * s_m)) / Float64(c_m * s_m)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (-2.0 / (c_m * s_m)) / (c_m * s_m);
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(-2.0 / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{-2}{c\_m \cdot s\_m}}{c\_m \cdot s\_m}
\end{array}
Initial program 66.0%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.9%
Applied egg-rr96.9%
unpow2N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
count-2N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.5%
Applied egg-rr98.5%
Taylor expanded in x around 0
/-lowering-/.f64N/A
Simplified47.6%
Taylor expanded in x around inf
unpow2N/A
unpow2N/A
unswap-sqrN/A
associate-/r*N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6430.1%
Simplified30.1%
herbie shell --seed 2024191
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))