
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x_m x_m))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 1.75e+39)
(/ t_0 (* t_1 t_1))
(/ (/ t_0 (* (* x_m c_m) (* s_m (* x_m c_m)))) s_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.75e+39) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = (t_0 / ((x_m * c_m) * (s_m * (x_m * c_m)))) / s_m;
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m + x_m))
t_1 = c_m * (x_m * s_m)
if (x_m <= 1.75d+39) then
tmp = t_0 / (t_1 * t_1)
else
tmp = (t_0 / ((x_m * c_m) * (s_m * (x_m * c_m)))) / s_m
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.75e+39) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = (t_0 / ((x_m * c_m) * (s_m * (x_m * c_m)))) / s_m;
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m + x_m)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.75e+39: tmp = t_0 / (t_1 * t_1) else: tmp = (t_0 / ((x_m * c_m) * (s_m * (x_m * c_m)))) / s_m return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m + x_m)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.75e+39) tmp = Float64(t_0 / Float64(t_1 * t_1)); else tmp = Float64(Float64(t_0 / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * c_m)))) / s_m); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m + x_m));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.75e+39)
tmp = t_0 / (t_1 * t_1);
else
tmp = (t_0 / ((x_m * c_m) * (s_m * (x_m * c_m)))) / s_m;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.75e+39], N[(t$95$0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.75 \cdot 10^{+39}:\\
\;\;\;\;\frac{t\_0}{t\_1 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}}{s\_m}\\
\end{array}
\end{array}
if x < 1.7500000000000001e39Initial program 59.9%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
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-*.f6486.4
Applied egg-rr86.4%
count-2N/A
lift-+.f6486.4
Applied egg-rr86.4%
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6470.9
Applied egg-rr70.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
pow2N/A
unpow-prod-downN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6494.2
Applied egg-rr97.7%
if 1.7500000000000001e39 < x Initial program 59.7%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6494.7
Applied egg-rr94.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/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
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
Applied egg-rr89.5%
Final simplification95.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 (* s_m (* x_m c_m))) (t_1 (/ 1.0 (* c_m (* x_m s_m)))))
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-2e-178)
(/ (fma x_m (* x_m -2.0) 1.0) (* t_0 t_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 = s_m * (x_m * c_m);
double t_1 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -2e-178) {
tmp = fma(x_m, (x_m * -2.0), 1.0) / (t_0 * t_0);
} else {
tmp = 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 = Float64(s_m * Float64(x_m * c_m)) t_1 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -2e-178) tmp = Float64(fma(x_m, Float64(x_m * -2.0), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(t_1 * t_1); 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[(s$95$m * N[(x$95$m * c$95$m), $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[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-178], N[(N[(x$95$m * N[(x$95$m * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * 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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
t_1 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-178}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m, x\_m \cdot -2, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\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))) < -1.9999999999999999e-178Initial program 61.5%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6490.0
Applied egg-rr90.0%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6490.0
lift-*.f64N/A
count-2N/A
lift-+.f6490.0
lift-pow.f64N/A
unpow2N/A
lower-*.f6490.0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6490.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6490.2
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6499.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.5
Applied egg-rr99.5%
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
Simplified49.0%
if -1.9999999999999999e-178 < (/.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 59.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6471.4
Simplified71.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr69.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6476.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.5
Applied egg-rr77.5%
Applied egg-rr80.6%
Final simplification77.8%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* s_m (* x_m c_m))))
(if (<= x_m 5.5e-57)
(/ 1.0 (* c_m (* (* x_m s_m) (* c_m (* x_m s_m)))))
(/ (cos (+ x_m x_m)) (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 5.5e-57) {
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
} else {
tmp = cos((x_m + x_m)) / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = s_m * (x_m * c_m)
if (x_m <= 5.5d-57) then
tmp = 1.0d0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
else
tmp = cos((x_m + x_m)) / (t_0 * t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 5.5e-57) {
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
} else {
tmp = Math.cos((x_m + x_m)) / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) tmp = 0 if x_m <= 5.5e-57: tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m)))) else: tmp = math.cos((x_m + x_m)) / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) tmp = 0.0 if (x_m <= 5.5e-57) tmp = Float64(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m))))); else tmp = Float64(cos(Float64(x_m + x_m)) / 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 = s_m * (x_m * c_m);
tmp = 0.0;
if (x_m <= 5.5e-57)
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
else
tmp = cos((x_m + x_m)) / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 5.5e-57], N[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 5.5 \cdot 10^{-57}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 5.50000000000000011e-57Initial program 58.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6469.8
Simplified69.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr68.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6477.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.8
Applied egg-rr77.8%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6479.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.5
Applied egg-rr79.5%
if 5.50000000000000011e-57 < x Initial program 62.1%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.6
Applied egg-rr95.6%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6495.6
lift-*.f64N/A
count-2N/A
lift-+.f6495.6
lift-pow.f64N/A
unpow2N/A
lower-*.f6495.6
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6491.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.5
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6494.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6494.7
Applied egg-rr94.7%
Final simplification84.7%
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 (/ 1.0 (* c_m (* x_m s_m)))))
(if (<= s_m 7.6e+132)
(/ (cos (+ x_m x_m)) (* c_m (* (* x_m c_m) (* s_m (* x_m s_m)))))
(* t_0 t_0))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (s_m <= 7.6e+132) {
tmp = cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
} else {
tmp = 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 = 1.0d0 / (c_m * (x_m * s_m))
if (s_m <= 7.6d+132) then
tmp = cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))))
else
tmp = 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 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (s_m <= 7.6e+132) {
tmp = Math.cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
} else {
tmp = 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 = 1.0 / (c_m * (x_m * s_m)) tmp = 0 if s_m <= 7.6e+132: tmp = math.cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m)))) else: tmp = 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(1.0 / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (s_m <= 7.6e+132) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(c_m * Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * s_m))))); else tmp = 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 = 1.0 / (c_m * (x_m * s_m));
tmp = 0.0;
if (s_m <= 7.6e+132)
tmp = cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
else
tmp = 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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[s$95$m, 7.6e+132], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * t$95$0), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;s\_m \leq 7.6 \cdot 10^{+132}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{c\_m \cdot \left(\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\end{array}
\end{array}
if s < 7.60000000000000012e132Initial program 58.5%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
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-*.f6486.0
Applied egg-rr86.0%
count-2N/A
lift-+.f6486.0
Applied egg-rr86.0%
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6471.6
Applied egg-rr71.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6477.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.0
lift-*.f64N/A
*-commutativeN/A
lift-*.f6477.0
Applied egg-rr77.0%
if 7.60000000000000012e132 < s Initial program 67.4%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.9
Simplified76.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr78.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6483.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6486.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.3
Applied egg-rr86.3%
Applied egg-rr91.3%
Final simplification79.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 (/ 1.0 (* c_m (* x_m s_m)))))
(if (<= s_m 7.5e+132)
(/ (cos (+ x_m x_m)) (* c_m (* c_m (* (* x_m s_m) (* x_m s_m)))))
(* t_0 t_0))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (s_m <= 7.5e+132) {
tmp = cos((x_m + x_m)) / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
} else {
tmp = 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 = 1.0d0 / (c_m * (x_m * s_m))
if (s_m <= 7.5d+132) then
tmp = cos((x_m + x_m)) / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))))
else
tmp = 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 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (s_m <= 7.5e+132) {
tmp = Math.cos((x_m + x_m)) / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
} else {
tmp = 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 = 1.0 / (c_m * (x_m * s_m)) tmp = 0 if s_m <= 7.5e+132: tmp = math.cos((x_m + x_m)) / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m)))) else: tmp = 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(1.0 / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (s_m <= 7.5e+132) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(c_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * s_m))))); else tmp = 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 = 1.0 / (c_m * (x_m * s_m));
tmp = 0.0;
if (s_m <= 7.5e+132)
tmp = cos((x_m + x_m)) / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
else
tmp = 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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[s$95$m, 7.5e+132], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * t$95$0), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;s\_m \leq 7.5 \cdot 10^{+132}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{c\_m \cdot \left(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\end{array}
\end{array}
if s < 7.50000000000000017e132Initial program 58.5%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.5
Applied egg-rr95.5%
Applied egg-rr83.0%
if 7.50000000000000017e132 < s Initial program 67.4%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.9
Simplified76.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr78.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6483.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6486.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6486.3
Applied egg-rr86.3%
Applied egg-rr91.3%
Final simplification84.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 (let* ((t_0 (* c_m (* x_m s_m)))) (/ (cos (+ x_m x_m)) (* t_0 t_0))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return cos((x_m + x_m)) / (t_0 * t_0);
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x_m * s_m)
code = cos((x_m + x_m)) / (t_0 * t_0)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return Math.cos((x_m + x_m)) / (t_0 * t_0);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) return math.cos((x_m + x_m)) / (t_0 * t_0)
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) return Float64(cos(Float64(x_m + x_m)) / Float64(t_0 * t_0)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = cos((x_m + x_m)) / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{\cos \left(x\_m + x\_m\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 59.8%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
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-*.f6486.3
Applied egg-rr86.3%
count-2N/A
lift-+.f6486.3
Applied egg-rr86.3%
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6470.6
Applied egg-rr70.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
pow2N/A
unpow-prod-downN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
pow2N/A
lift-*.f6494.0
Applied egg-rr97.3%
Final simplification97.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 (let* ((t_0 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return 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 = 1.0d0 / (c_m * (x_m * s_m))
code = 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 = 1.0 / (c_m * (x_m * s_m));
return 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 = 1.0 / (c_m * (x_m * s_m)) return 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(1.0 / Float64(c_m * Float64(x_m * s_m))) return 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 = 1.0 / (c_m * (x_m * s_m));
tmp = 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[(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}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 59.8%
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
Simplified65.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr63.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6470.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6470.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6470.9
Applied egg-rr70.9%
Applied egg-rr73.7%
Final simplification73.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* s_m (* x_m c_m))))
(if (<= x_m 5.5e-57)
(/ 1.0 (* c_m (* (* x_m s_m) (* c_m (* x_m s_m)))))
(/ 1.0 (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 5.5e-57) {
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = s_m * (x_m * c_m)
if (x_m <= 5.5d-57) then
tmp = 1.0d0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 5.5e-57) {
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) tmp = 0 if x_m <= 5.5e-57: tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m)))) else: tmp = 1.0 / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) tmp = 0.0 if (x_m <= 5.5e-57) tmp = Float64(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m))))); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = s_m * (x_m * c_m);
tmp = 0.0;
if (x_m <= 5.5e-57)
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 5.5e-57], N[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$95$m * s$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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 5.5 \cdot 10^{-57}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 5.50000000000000011e-57Initial program 58.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6469.8
Simplified69.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr68.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6477.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6477.8
Applied egg-rr77.8%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6479.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6479.5
Applied egg-rr79.5%
if 5.50000000000000011e-57 < x Initial program 62.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-*.f6456.6
Simplified56.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-/.f6456.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6458.7
Applied egg-rr58.0%
Final simplification72.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 (/ 1.0 (* c_m (* (* x_m s_m) (* c_m (* x_m s_m))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m))))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$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])\\
\\
\frac{1}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 59.8%
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
Simplified65.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr63.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6470.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6470.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6470.9
Applied egg-rr70.9%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6472.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6472.0
Applied egg-rr72.0%
Final simplification72.0%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* c_m (* (* x_m s_m) (* x_m (* c_m s_m))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (x_m * (c_m * s_m))));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x_m * s_m) * (x_m * (c_m * s_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (x_m * (c_m * s_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (c_m * ((x_m * s_m) * (x_m * (c_m * s_m))))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * Float64(c_m * s_m))))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (c_m * ((x_m * s_m) * (x_m * (c_m * s_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 59.8%
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
Simplified65.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr63.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6470.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6470.9
lift-*.f64N/A
*-commutativeN/A
lower-*.f6470.9
Applied egg-rr70.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 (* c_m (* (* x_m c_m) (* s_m (* x_m s_m))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * s_m))))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$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])\\
\\
\frac{1}{c\_m \cdot \left(\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 59.8%
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
Simplified65.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
Applied egg-rr63.4%
Final simplification63.4%
herbie shell --seed 2024207
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))