
(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 14 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))))
(if (<= x_m 8.5e+21)
(* (/ (/ 1.0 (* x_m s_m)) c_m) (/ t_0 (* (* x_m s_m) c_m)))
(/ t_0 (* s_m (* (* x_m c_m) (* s_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 tmp;
if (x_m <= 8.5e+21) {
tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_m));
} else {
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 8.5d+21) then
tmp = ((1.0d0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_m))
else
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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 tmp;
if (x_m <= 8.5e+21) {
tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_m));
} else {
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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)) tmp = 0 if x_m <= 8.5e+21: tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_m)) else: tmp = t_0 / (s_m * ((x_m * c_m) * (s_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)) tmp = 0.0 if (x_m <= 8.5e+21) tmp = Float64(Float64(Float64(1.0 / Float64(x_m * s_m)) / c_m) * Float64(t_0 / Float64(Float64(x_m * s_m) * c_m))); else tmp = Float64(t_0 / Float64(s_m * Float64(Float64(x_m * c_m) * Float64(s_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));
tmp = 0.0;
if (x_m <= 8.5e+21)
tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_m));
else
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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]}, If[LessEqual[x$95$m, 8.5e+21], N[(N[(N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(t$95$0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$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)\\
\mathbf{if}\;x_m \leq 8.5 \cdot 10^{+21}:\\
\;\;\;\;\frac{\frac{1}{x_m \cdot s_m}}{c_m} \cdot \frac{t_0}{\left(x_m \cdot s_m\right) \cdot c_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{s_m \cdot \left(\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 8.5e21Initial program 69.9%
associate-/r*69.5%
unpow269.5%
sqr-neg69.5%
unpow269.5%
associate-/r*69.9%
cos-neg69.9%
*-commutative69.9%
distribute-rgt-neg-in69.9%
metadata-eval69.9%
associate-*r*71.5%
*-commutative71.5%
unpow271.5%
sqr-neg71.5%
associate-*l*76.4%
associate-*r*79.3%
associate-*r*75.7%
associate-*r*69.8%
unpow269.8%
Simplified64.0%
*-un-lft-identity64.0%
add-sqr-sqrt64.0%
times-frac64.0%
sqrt-prod64.0%
unpow264.0%
sqrt-prod33.3%
add-sqr-sqrt43.6%
pow-prod-down43.6%
sqrt-pow145.8%
metadata-eval45.8%
pow145.8%
*-commutative45.8%
Applied egg-rr96.7%
associate-/r*96.8%
div-inv96.8%
Applied egg-rr96.8%
associate-*l/96.8%
*-un-lft-identity96.8%
Applied egg-rr96.8%
if 8.5e21 < x Initial program 71.8%
associate-/r*71.9%
unpow271.9%
sqr-neg71.9%
unpow271.9%
associate-/r*71.8%
cos-neg71.8%
*-commutative71.8%
distribute-rgt-neg-in71.8%
metadata-eval71.8%
associate-*r*74.7%
*-commutative74.7%
unpow274.7%
sqr-neg74.7%
associate-*l*80.8%
associate-*r*85.2%
associate-*r*78.0%
associate-*r*70.6%
unpow270.6%
Simplified62.8%
add-sqr-sqrt56.6%
pow256.6%
Applied egg-rr40.8%
Taylor expanded in x around inf 62.8%
associate-/r*62.9%
*-commutative62.9%
*-commutative62.9%
unpow262.9%
unpow262.9%
swap-sqr80.8%
unpow280.8%
associate-/l/80.8%
*-commutative80.8%
unpow280.8%
unpow280.8%
swap-sqr98.2%
unpow298.1%
associate-*r*95.2%
Simplified95.2%
unpow295.2%
associate-*r*93.9%
associate-*r*89.7%
associate-*r*91.1%
*-commutative91.1%
Applied egg-rr91.1%
Final simplification95.3%
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))))
(if (<= x_m 2.7e+22)
(* (/ t_0 (* (* x_m s_m) c_m)) (/ (/ 1.0 c_m) (* x_m s_m)))
(/ t_0 (* s_m (* (* x_m c_m) (* s_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 tmp;
if (x_m <= 2.7e+22) {
tmp = (t_0 / ((x_m * s_m) * c_m)) * ((1.0 / c_m) / (x_m * s_m));
} else {
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 2.7d+22) then
tmp = (t_0 / ((x_m * s_m) * c_m)) * ((1.0d0 / c_m) / (x_m * s_m))
else
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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 tmp;
if (x_m <= 2.7e+22) {
tmp = (t_0 / ((x_m * s_m) * c_m)) * ((1.0 / c_m) / (x_m * s_m));
} else {
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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)) tmp = 0 if x_m <= 2.7e+22: tmp = (t_0 / ((x_m * s_m) * c_m)) * ((1.0 / c_m) / (x_m * s_m)) else: tmp = t_0 / (s_m * ((x_m * c_m) * (s_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)) tmp = 0.0 if (x_m <= 2.7e+22) tmp = Float64(Float64(t_0 / Float64(Float64(x_m * s_m) * c_m)) * Float64(Float64(1.0 / c_m) / Float64(x_m * s_m))); else tmp = Float64(t_0 / Float64(s_m * Float64(Float64(x_m * c_m) * Float64(s_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));
tmp = 0.0;
if (x_m <= 2.7e+22)
tmp = (t_0 / ((x_m * s_m) * c_m)) * ((1.0 / c_m) / (x_m * s_m));
else
tmp = t_0 / (s_m * ((x_m * c_m) * (s_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]}, If[LessEqual[x$95$m, 2.7e+22], N[(N[(t$95$0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$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)\\
\mathbf{if}\;x_m \leq 2.7 \cdot 10^{+22}:\\
\;\;\;\;\frac{t_0}{\left(x_m \cdot s_m\right) \cdot c_m} \cdot \frac{\frac{1}{c_m}}{x_m \cdot s_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{s_m \cdot \left(\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.7000000000000002e22Initial program 69.9%
associate-/r*69.5%
unpow269.5%
sqr-neg69.5%
unpow269.5%
associate-/r*69.9%
cos-neg69.9%
*-commutative69.9%
distribute-rgt-neg-in69.9%
metadata-eval69.9%
associate-*r*71.5%
*-commutative71.5%
unpow271.5%
sqr-neg71.5%
associate-*l*76.4%
associate-*r*79.3%
associate-*r*75.7%
associate-*r*69.8%
unpow269.8%
Simplified64.0%
*-un-lft-identity64.0%
add-sqr-sqrt64.0%
times-frac64.0%
sqrt-prod64.0%
unpow264.0%
sqrt-prod33.3%
add-sqr-sqrt43.6%
pow-prod-down43.6%
sqrt-pow145.8%
metadata-eval45.8%
pow145.8%
*-commutative45.8%
Applied egg-rr96.7%
associate-/r*96.8%
div-inv96.8%
Applied egg-rr96.8%
un-div-inv96.8%
Applied egg-rr96.8%
if 2.7000000000000002e22 < x Initial program 71.8%
associate-/r*71.9%
unpow271.9%
sqr-neg71.9%
unpow271.9%
associate-/r*71.8%
cos-neg71.8%
*-commutative71.8%
distribute-rgt-neg-in71.8%
metadata-eval71.8%
associate-*r*74.7%
*-commutative74.7%
unpow274.7%
sqr-neg74.7%
associate-*l*80.8%
associate-*r*85.2%
associate-*r*78.0%
associate-*r*70.6%
unpow270.6%
Simplified62.8%
add-sqr-sqrt56.6%
pow256.6%
Applied egg-rr40.8%
Taylor expanded in x around inf 62.8%
associate-/r*62.9%
*-commutative62.9%
*-commutative62.9%
unpow262.9%
unpow262.9%
swap-sqr80.8%
unpow280.8%
associate-/l/80.8%
*-commutative80.8%
unpow280.8%
unpow280.8%
swap-sqr98.2%
unpow298.1%
associate-*r*95.2%
Simplified95.2%
unpow295.2%
associate-*r*93.9%
associate-*r*89.7%
associate-*r*91.1%
*-commutative91.1%
Applied egg-rr91.1%
Final simplification95.3%
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 (<= s_m 1.62e+227) (/ (cos (* x_m 2.0)) (* (* x_m c_m) (* s_m (* s_m (* x_m c_m))))) (/ -1.0 (- (pow (* x_m (* s_m c_m)) 2.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 tmp;
if (s_m <= 1.62e+227) {
tmp = cos((x_m * 2.0)) / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))));
} else {
tmp = -1.0 / -pow((x_m * (s_m * c_m)), 2.0);
}
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 (s_m <= 1.62d+227) then
tmp = cos((x_m * 2.0d0)) / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))))
else
tmp = (-1.0d0) / -((x_m * (s_m * c_m)) ** 2.0d0)
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 (s_m <= 1.62e+227) {
tmp = Math.cos((x_m * 2.0)) / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))));
} else {
tmp = -1.0 / -Math.pow((x_m * (s_m * c_m)), 2.0);
}
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 s_m <= 1.62e+227: tmp = math.cos((x_m * 2.0)) / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m)))) else: tmp = -1.0 / -math.pow((x_m * (s_m * c_m)), 2.0) 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 (s_m <= 1.62e+227) tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(s_m * Float64(x_m * c_m))))); else tmp = Float64(-1.0 / Float64(-(Float64(x_m * Float64(s_m * c_m)) ^ 2.0))); 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 (s_m <= 1.62e+227)
tmp = cos((x_m * 2.0)) / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))));
else
tmp = -1.0 / -((x_m * (s_m * c_m)) ^ 2.0);
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[s$95$m, 1.62e+227], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / (-N[Power[N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $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}\;s_m \leq 1.62 \cdot 10^{+227}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot 2\right)}{\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{-{\left(x_m \cdot \left(s_m \cdot c_m\right)\right)}^{2}}\\
\end{array}
\end{array}
if s < 1.61999999999999994e227Initial program 70.8%
associate-/r*70.5%
unpow270.5%
sqr-neg70.5%
unpow270.5%
associate-/r*70.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
associate-*r*72.8%
*-commutative72.8%
unpow272.8%
sqr-neg72.8%
associate-*l*78.0%
associate-*r*80.6%
associate-*r*75.8%
associate-*r*70.7%
unpow270.7%
Simplified64.4%
add-sqr-sqrt61.1%
pow261.1%
Applied egg-rr70.6%
Taylor expanded in x around inf 64.4%
associate-/r*64.1%
*-commutative64.1%
*-commutative64.1%
unpow264.1%
unpow264.1%
swap-sqr78.2%
unpow278.2%
associate-/l/78.5%
*-commutative78.5%
unpow278.5%
unpow278.5%
swap-sqr96.9%
unpow296.9%
associate-*r*97.8%
Simplified97.8%
unpow297.8%
associate-*r*95.6%
associate-*l*93.6%
associate-*r*94.5%
*-commutative94.5%
Applied egg-rr94.5%
if 1.61999999999999994e227 < s Initial program 65.0%
associate-/r*65.0%
unpow265.0%
sqr-neg65.0%
unpow265.0%
associate-/r*65.0%
cos-neg65.0%
*-commutative65.0%
distribute-rgt-neg-in65.0%
metadata-eval65.0%
associate-*r*65.0%
*-commutative65.0%
unpow265.0%
sqr-neg65.0%
associate-*l*70.9%
associate-*r*82.9%
associate-*r*82.9%
associate-*r*60.0%
unpow260.0%
Simplified52.9%
Taylor expanded in x around 0 52.9%
associate-/r*52.9%
*-commutative52.9%
unpow252.9%
unpow252.9%
swap-sqr82.9%
unpow282.9%
associate-/r*82.9%
unpow282.9%
unpow282.9%
swap-sqr99.9%
unpow299.9%
*-commutative99.9%
Simplified99.9%
frac-2neg99.9%
metadata-eval99.9%
*-commutative99.9%
div-inv99.9%
Applied egg-rr99.9%
associate-*r/99.9%
metadata-eval99.9%
*-commutative99.9%
associate-*r*99.9%
Simplified99.9%
Final simplification94.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 (if (<= x_m 5e-37) (* (/ (/ 1.0 c_m) (* x_m s_m)) (/ 1.0 (* (* x_m s_m) c_m))) (/ (cos (* x_m 2.0)) (* x_m (* (* s_m (* x_m c_m)) (* s_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 tmp;
if (x_m <= 5e-37) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m));
} else {
tmp = cos((x_m * 2.0)) / (x_m * ((s_m * (x_m * c_m)) * (s_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) :: tmp
if (x_m <= 5d-37) then
tmp = ((1.0d0 / c_m) / (x_m * s_m)) * (1.0d0 / ((x_m * s_m) * c_m))
else
tmp = cos((x_m * 2.0d0)) / (x_m * ((s_m * (x_m * c_m)) * (s_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 tmp;
if (x_m <= 5e-37) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m));
} else {
tmp = Math.cos((x_m * 2.0)) / (x_m * ((s_m * (x_m * c_m)) * (s_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): tmp = 0 if x_m <= 5e-37: tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m)) else: tmp = math.cos((x_m * 2.0)) / (x_m * ((s_m * (x_m * c_m)) * (s_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) tmp = 0.0 if (x_m <= 5e-37) tmp = Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(1.0 / Float64(Float64(x_m * s_m) * c_m))); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * Float64(Float64(s_m * Float64(x_m * c_m)) * Float64(s_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)
tmp = 0.0;
if (x_m <= 5e-37)
tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m));
else
tmp = cos((x_m * 2.0)) / (x_m * ((s_m * (x_m * c_m)) * (s_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_] := If[LessEqual[x$95$m, 5e-37], N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * N[(N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * c$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])\\
\\
\begin{array}{l}
\mathbf{if}\;x_m \leq 5 \cdot 10^{-37}:\\
\;\;\;\;\frac{\frac{1}{c_m}}{x_m \cdot s_m} \cdot \frac{1}{\left(x_m \cdot s_m\right) \cdot c_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot 2\right)}{x_m \cdot \left(\left(s_m \cdot \left(x_m \cdot c_m\right)\right) \cdot \left(s_m \cdot c_m\right)\right)}\\
\end{array}
\end{array}
if x < 4.9999999999999997e-37Initial program 69.9%
associate-/r*70.0%
unpow270.0%
sqr-neg70.0%
unpow270.0%
associate-/r*69.9%
cos-neg69.9%
*-commutative69.9%
distribute-rgt-neg-in69.9%
metadata-eval69.9%
associate-*r*71.6%
*-commutative71.6%
unpow271.6%
sqr-neg71.6%
associate-*l*76.9%
associate-*r*79.4%
associate-*r*75.5%
associate-*r*69.3%
unpow269.3%
Simplified63.5%
*-un-lft-identity63.5%
add-sqr-sqrt63.5%
times-frac63.6%
sqrt-prod63.6%
unpow263.6%
sqrt-prod32.3%
add-sqr-sqrt43.3%
pow-prod-down43.3%
sqrt-pow146.2%
metadata-eval46.2%
pow146.2%
*-commutative46.2%
Applied egg-rr96.5%
associate-/r*96.6%
div-inv96.6%
Applied egg-rr96.6%
un-div-inv96.6%
Applied egg-rr96.6%
Taylor expanded in x around 0 88.2%
if 4.9999999999999997e-37 < x Initial program 71.5%
associate-/r*70.4%
unpow270.4%
sqr-neg70.4%
unpow270.4%
associate-/r*71.5%
cos-neg71.5%
*-commutative71.5%
distribute-rgt-neg-in71.5%
metadata-eval71.5%
associate-*r*73.9%
*-commutative73.9%
unpow273.9%
sqr-neg73.9%
associate-*l*79.0%
associate-*r*83.9%
associate-*r*78.0%
associate-*r*71.7%
unpow271.7%
Simplified64.0%
add-sqr-sqrt57.5%
pow257.5%
Applied egg-rr45.4%
Taylor expanded in x around inf 64.0%
associate-/r*62.9%
*-commutative62.9%
*-commutative62.9%
unpow262.9%
unpow262.9%
swap-sqr77.9%
unpow277.9%
associate-/l/79.1%
*-commutative79.1%
unpow279.1%
unpow279.1%
swap-sqr98.4%
unpow298.3%
associate-*r*95.9%
Simplified95.9%
associate-*r*98.3%
pow298.4%
*-commutative98.4%
associate-*r*97.3%
associate-*r*97.2%
associate-*r*94.7%
*-commutative94.7%
Applied egg-rr94.7%
Final simplification90.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 (if (<= x_m 2.6e-22) (* (/ (/ 1.0 c_m) (* x_m s_m)) (/ 1.0 (* (* x_m s_m) c_m))) (/ (cos (* x_m 2.0)) (* s_m (* (* x_m c_m) (* s_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 tmp;
if (x_m <= 2.6e-22) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m));
} else {
tmp = cos((x_m * 2.0)) / (s_m * ((x_m * c_m) * (s_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) :: tmp
if (x_m <= 2.6d-22) then
tmp = ((1.0d0 / c_m) / (x_m * s_m)) * (1.0d0 / ((x_m * s_m) * c_m))
else
tmp = cos((x_m * 2.0d0)) / (s_m * ((x_m * c_m) * (s_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 tmp;
if (x_m <= 2.6e-22) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m));
} else {
tmp = Math.cos((x_m * 2.0)) / (s_m * ((x_m * c_m) * (s_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): tmp = 0 if x_m <= 2.6e-22: tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m)) else: tmp = math.cos((x_m * 2.0)) / (s_m * ((x_m * c_m) * (s_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) tmp = 0.0 if (x_m <= 2.6e-22) tmp = Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(1.0 / Float64(Float64(x_m * s_m) * c_m))); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(s_m * Float64(Float64(x_m * c_m) * Float64(s_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)
tmp = 0.0;
if (x_m <= 2.6e-22)
tmp = ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_m));
else
tmp = cos((x_m * 2.0)) / (s_m * ((x_m * c_m) * (s_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_] := If[LessEqual[x$95$m, 2.6e-22], N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$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}
\mathbf{if}\;x_m \leq 2.6 \cdot 10^{-22}:\\
\;\;\;\;\frac{\frac{1}{c_m}}{x_m \cdot s_m} \cdot \frac{1}{\left(x_m \cdot s_m\right) \cdot c_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot 2\right)}{s_m \cdot \left(\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.6e-22Initial program 70.0%
associate-/r*69.5%
unpow269.5%
sqr-neg69.5%
unpow269.5%
associate-/r*70.0%
cos-neg70.0%
*-commutative70.0%
distribute-rgt-neg-in70.0%
metadata-eval70.0%
associate-*r*71.6%
*-commutative71.6%
unpow271.6%
sqr-neg71.6%
associate-*l*76.9%
associate-*r*79.3%
associate-*r*75.5%
associate-*r*69.4%
unpow269.4%
Simplified63.8%
*-un-lft-identity63.8%
add-sqr-sqrt63.8%
times-frac63.8%
sqrt-prod63.8%
unpow263.8%
sqrt-prod32.7%
add-sqr-sqrt43.5%
pow-prod-down43.5%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
Applied egg-rr96.6%
associate-/r*96.7%
div-inv96.7%
Applied egg-rr96.7%
un-div-inv96.7%
Applied egg-rr96.7%
Taylor expanded in x around 0 88.5%
if 2.6e-22 < x Initial program 71.4%
associate-/r*71.4%
unpow271.4%
sqr-neg71.4%
unpow271.4%
associate-/r*71.4%
cos-neg71.4%
*-commutative71.4%
distribute-rgt-neg-in71.4%
metadata-eval71.4%
associate-*r*73.9%
*-commutative73.9%
unpow273.9%
sqr-neg73.9%
associate-*l*79.3%
associate-*r*84.4%
associate-*r*78.1%
associate-*r*71.6%
unpow271.6%
Simplified63.4%
add-sqr-sqrt56.6%
pow256.6%
Applied egg-rr42.5%
Taylor expanded in x around inf 63.4%
associate-/r*63.5%
*-commutative63.5%
*-commutative63.5%
unpow263.5%
unpow263.5%
swap-sqr79.3%
unpow279.3%
associate-/l/79.3%
*-commutative79.3%
unpow279.3%
unpow279.3%
swap-sqr98.3%
unpow298.3%
associate-*r*95.7%
Simplified95.7%
unpow295.7%
associate-*r*94.6%
associate-*r*88.4%
associate-*r*89.6%
*-commutative89.6%
Applied egg-rr89.6%
Final simplification88.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 (/ 1.0 (* (* x_m s_m) c_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 / ((x_m * s_m) * c_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 / ((x_m * s_m) * c_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 / ((x_m * s_m) * c_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 / ((x_m * s_m) * c_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(Float64(x_m * s_m) * c_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 / ((x_m * s_m) * c_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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $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}{\left(x_m \cdot s_m\right) \cdot c_m}\\
t_0 \cdot t_0
\end{array}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
Taylor expanded in x around 0 58.8%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr69.0%
unpow269.0%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr80.4%
unpow280.4%
*-commutative80.4%
Simplified80.4%
unpow-prod-down69.3%
*-commutative69.3%
unpow-prod-down80.4%
unpow280.4%
associate-/r*80.4%
un-div-inv80.4%
Applied egg-rr80.4%
Final simplification80.4%
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)) (/ 1.0 (* (* x_m s_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) {
return ((1.0 / c_m) / (x_m * s_m)) * (1.0 / ((x_m * s_m) * c_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)) * (1.0d0 / ((x_m * s_m) * c_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)) * (1.0 / ((x_m * s_m) * c_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)) * (1.0 / ((x_m * s_m) * c_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(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(1.0 / Float64(Float64(x_m * s_m) * c_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)) * (1.0 / ((x_m * s_m) * c_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[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $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}}{x_m \cdot s_m} \cdot \frac{1}{\left(x_m \cdot s_m\right) \cdot c_m}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
*-un-lft-identity63.7%
add-sqr-sqrt63.7%
times-frac63.7%
sqrt-prod63.7%
unpow263.7%
sqrt-prod31.9%
add-sqr-sqrt45.5%
pow-prod-down45.5%
sqrt-pow148.6%
metadata-eval48.6%
pow148.6%
*-commutative48.6%
Applied egg-rr97.1%
associate-/r*97.2%
div-inv97.2%
Applied egg-rr97.2%
un-div-inv97.2%
Applied egg-rr97.2%
Taylor expanded in x around 0 80.4%
Final simplification80.4%
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 (* (* s_m c_m) (* x_m (* (* x_m s_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) {
return 1.0 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_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 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_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 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_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 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_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(1.0 / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(Float64(x_m * s_m) * c_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 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_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[(1.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$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{1}{\left(s_m \cdot c_m\right) \cdot \left(x_m \cdot \left(\left(x_m \cdot s_m\right) \cdot c_m\right)\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
Taylor expanded in x around 0 58.8%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr69.0%
unpow269.0%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr80.4%
unpow280.4%
*-commutative80.4%
Simplified80.4%
unpow280.4%
associate-*r*80.0%
*-commutative80.0%
associate-*l*78.7%
Applied egg-rr78.7%
Final simplification78.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 (/ 1.0 (* (* s_m c_m) (* x_m (* x_m (* s_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) {
return 1.0 / ((s_m * c_m) * (x_m * (x_m * (s_m * c_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 / ((s_m * c_m) * (x_m * (x_m * (s_m * c_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 / ((s_m * c_m) * (x_m * (x_m * (s_m * c_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 / ((s_m * c_m) * (x_m * (x_m * (s_m * c_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(1.0 / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(x_m * Float64(s_m * c_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 / ((s_m * c_m) * (x_m * (x_m * (s_m * c_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[(1.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[(s$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])\\
\\
\frac{1}{\left(s_m \cdot c_m\right) \cdot \left(x_m \cdot \left(x_m \cdot \left(s_m \cdot c_m\right)\right)\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
Taylor expanded in x around 0 58.8%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr69.0%
unpow269.0%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr80.4%
unpow280.4%
*-commutative80.4%
Simplified80.4%
unpow280.4%
associate-*r*80.0%
*-commutative80.0%
associate-*l*78.7%
Applied egg-rr78.7%
Taylor expanded in c around 0 78.7%
associate-*r*79.0%
Simplified79.0%
Final simplification79.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 (/ 1.0 (* (* x_m s_m) (* c_m (* (* x_m s_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) {
return 1.0 / ((x_m * s_m) * (c_m * ((x_m * s_m) * c_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 / ((x_m * s_m) * (c_m * ((x_m * s_m) * c_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 / ((x_m * s_m) * (c_m * ((x_m * s_m) * c_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 / ((x_m * s_m) * (c_m * ((x_m * s_m) * c_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(1.0 / Float64(Float64(x_m * s_m) * Float64(c_m * Float64(Float64(x_m * s_m) * c_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 / ((x_m * s_m) * (c_m * ((x_m * s_m) * c_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[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$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{1}{\left(x_m \cdot s_m\right) \cdot \left(c_m \cdot \left(\left(x_m \cdot s_m\right) \cdot c_m\right)\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
Taylor expanded in x around 0 58.8%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr69.0%
unpow269.0%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr80.4%
unpow280.4%
*-commutative80.4%
Simplified80.4%
*-commutative80.4%
unpow280.4%
associate-*r*79.5%
Applied egg-rr79.5%
Final simplification79.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 (/ 1.0 (* x_m (* (* (* x_m s_m) c_m) (* s_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) {
return 1.0 / (x_m * (((x_m * s_m) * c_m) * (s_m * c_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 / (x_m * (((x_m * s_m) * c_m) * (s_m * c_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 / (x_m * (((x_m * s_m) * c_m) * (s_m * c_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 / (x_m * (((x_m * s_m) * c_m) * (s_m * c_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(1.0 / Float64(x_m * Float64(Float64(Float64(x_m * s_m) * c_m) * Float64(s_m * c_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 / (x_m * (((x_m * s_m) * c_m) * (s_m * c_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[(1.0 / N[(x$95$m * N[(N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * c$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{1}{x_m \cdot \left(\left(\left(x_m \cdot s_m\right) \cdot c_m\right) \cdot \left(s_m \cdot c_m\right)\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
Taylor expanded in x around 0 58.8%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr69.0%
unpow269.0%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr80.4%
unpow280.4%
*-commutative80.4%
Simplified80.4%
unpow280.4%
*-commutative80.4%
associate-*r*80.0%
associate-*r*79.5%
Applied egg-rr79.5%
Final simplification79.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 (/ 1.0 (* c_m (* (* x_m s_m) (* (* x_m s_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) {
return 1.0 / (c_m * ((x_m * s_m) * ((x_m * s_m) * c_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 * s_m) * c_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 * s_m) * c_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 * s_m) * c_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(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(Float64(x_m * s_m) * c_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 * s_m) * c_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[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$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{1}{c_m \cdot \left(\left(x_m \cdot s_m\right) \cdot \left(\left(x_m \cdot s_m\right) \cdot c_m\right)\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
Taylor expanded in x around 0 58.8%
associate-/r*58.4%
*-commutative58.4%
unpow258.4%
unpow258.4%
swap-sqr69.0%
unpow269.0%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr80.4%
unpow280.4%
*-commutative80.4%
Simplified80.4%
*-commutative80.4%
unpow280.4%
*-commutative80.4%
associate-*r*80.1%
Applied egg-rr80.1%
Final simplification80.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 (/ -2.0 (* (* s_m c_m) (* s_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) {
return -2.0 / ((s_m * c_m) * (s_m * c_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) / ((s_m * c_m) * (s_m * c_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 / ((s_m * c_m) * (s_m * c_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 / ((s_m * c_m) * (s_m * c_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(-2.0 / Float64(Float64(s_m * c_m) * Float64(s_m * c_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 / ((s_m * c_m) * (s_m * c_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[(-2.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * c$95$m), $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{-2}{\left(s_m \cdot c_m\right) \cdot \left(s_m \cdot c_m\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
*-un-lft-identity63.7%
add-sqr-sqrt63.7%
times-frac63.7%
sqrt-prod63.7%
unpow263.7%
sqrt-prod31.9%
add-sqr-sqrt45.5%
pow-prod-down45.5%
sqrt-pow148.6%
metadata-eval48.6%
pow148.6%
*-commutative48.6%
Applied egg-rr97.1%
Taylor expanded in x around 0 67.5%
Taylor expanded in x around inf 32.3%
unpow232.3%
unpow232.3%
swap-sqr29.3%
unpow229.3%
Simplified29.3%
unpow229.3%
Applied egg-rr29.3%
Final simplification29.3%
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 (* s_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) {
return -2.0 / (c_m * (s_m * (s_m * c_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 * (s_m * c_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 * (s_m * c_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 * (s_m * c_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(-2.0 / Float64(c_m * Float64(s_m * Float64(s_m * c_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 * (s_m * c_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[(-2.0 / N[(c$95$m * N[(s$95$m * N[(s$95$m * c$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{-2}{c_m \cdot \left(s_m \cdot \left(s_m \cdot c_m\right)\right)}
\end{array}
Initial program 70.4%
associate-/r*70.1%
unpow270.1%
sqr-neg70.1%
unpow270.1%
associate-/r*70.4%
cos-neg70.4%
*-commutative70.4%
distribute-rgt-neg-in70.4%
metadata-eval70.4%
associate-*r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
associate-*l*77.6%
associate-*r*80.8%
associate-*r*76.3%
associate-*r*70.0%
unpow270.0%
Simplified63.7%
*-un-lft-identity63.7%
add-sqr-sqrt63.7%
times-frac63.7%
sqrt-prod63.7%
unpow263.7%
sqrt-prod31.9%
add-sqr-sqrt45.5%
pow-prod-down45.5%
sqrt-pow148.6%
metadata-eval48.6%
pow148.6%
*-commutative48.6%
Applied egg-rr97.1%
Taylor expanded in x around 0 67.5%
Taylor expanded in x around inf 32.3%
unpow232.3%
unpow232.3%
swap-sqr29.3%
unpow229.3%
Simplified29.3%
unpow229.3%
*-commutative29.3%
associate-*r*30.1%
Applied egg-rr30.1%
Final simplification30.1%
herbie shell --seed 2023331
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))