
(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 8 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 (* x_m (* s_m c_m))))
(if (<= x_m 1e-13)
(/ (/ (/ (/ 1.0 s_m) x_m) c_m) (* (* x_m s_m) c_m))
(/ (/ (cos (* x_m 2.0)) t_0) t_0))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 1e-13) {
tmp = (((1.0 / s_m) / x_m) / c_m) / ((x_m * s_m) * c_m);
} else {
tmp = (cos((x_m * 2.0)) / t_0) / t_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) :: t_0
real(8) :: tmp
t_0 = x_m * (s_m * c_m)
if (x_m <= 1d-13) then
tmp = (((1.0d0 / s_m) / x_m) / c_m) / ((x_m * s_m) * c_m)
else
tmp = (cos((x_m * 2.0d0)) / t_0) / t_0
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 = x_m * (s_m * c_m);
double tmp;
if (x_m <= 1e-13) {
tmp = (((1.0 / s_m) / x_m) / c_m) / ((x_m * s_m) * c_m);
} else {
tmp = (Math.cos((x_m * 2.0)) / t_0) / t_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): t_0 = x_m * (s_m * c_m) tmp = 0 if x_m <= 1e-13: tmp = (((1.0 / s_m) / x_m) / c_m) / ((x_m * s_m) * c_m) else: tmp = (math.cos((x_m * 2.0)) / t_0) / t_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) t_0 = Float64(x_m * Float64(s_m * c_m)) tmp = 0.0 if (x_m <= 1e-13) tmp = Float64(Float64(Float64(Float64(1.0 / s_m) / x_m) / c_m) / Float64(Float64(x_m * s_m) * c_m)); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / t_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)
t_0 = x_m * (s_m * c_m);
tmp = 0.0;
if (x_m <= 1e-13)
tmp = (((1.0 / s_m) / x_m) / c_m) / ((x_m * s_m) * c_m);
else
tmp = (cos((x_m * 2.0)) / t_0) / t_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_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1e-13], N[(N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 10^{-13}:\\
\;\;\;\;\frac{\frac{\frac{\frac{1}{s\_m}}{x\_m}}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 1e-13Initial program 66.0%
associate-/r*66.1%
*-commutative66.1%
unpow266.1%
sqr-neg66.1%
unpow266.1%
cos-neg66.1%
*-commutative66.1%
distribute-rgt-neg-in66.1%
metadata-eval66.1%
unpow266.1%
sqr-neg66.1%
unpow266.1%
associate-*r*61.4%
unpow261.4%
*-commutative61.4%
Simplified61.4%
associate-/l/61.3%
associate-/r*61.4%
associate-/l/61.5%
add-cube-cbrt61.4%
associate-/l*61.4%
Applied egg-rr80.6%
associate-*r/80.6%
unpow280.6%
rem-3cbrt-lft80.8%
*-commutative80.8%
associate-/l*80.5%
*-commutative80.5%
Simplified80.5%
*-commutative80.5%
div-inv80.5%
*-commutative80.5%
associate-*l*80.5%
pow-flip80.8%
metadata-eval80.8%
unpow-prod-down98.6%
metadata-eval98.6%
pow-flip97.8%
div-inv97.8%
unpow297.8%
associate-/r*98.6%
*-commutative98.6%
associate-/r*98.7%
*-commutative98.7%
Applied egg-rr98.7%
Taylor expanded in x around 0 86.7%
associate-/r*86.8%
Simplified86.8%
if 1e-13 < x Initial program 78.4%
associate-/r*78.3%
*-commutative78.3%
unpow278.3%
sqr-neg78.3%
unpow278.3%
cos-neg78.3%
*-commutative78.3%
distribute-rgt-neg-in78.3%
metadata-eval78.3%
unpow278.3%
sqr-neg78.3%
unpow278.3%
associate-*r*70.3%
unpow270.3%
*-commutative70.3%
Simplified70.3%
Applied egg-rr99.5%
*-un-lft-identity99.5%
associate-*r*98.2%
times-frac98.2%
*-commutative98.2%
Applied egg-rr98.2%
associate-*l/98.2%
*-un-lft-identity98.2%
frac-times98.3%
associate-*r*99.6%
*-commutative99.6%
*-un-lft-identity99.6%
associate-*l*96.8%
*-commutative96.8%
associate-*l*96.7%
Applied egg-rr96.7%
Final simplification89.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
(let* ((t_0 (cos (* x_m 2.0))))
(if (<= x_m 4.4e+61)
(/ (/ t_0 c_m) (* (* x_m s_m) (* (* x_m s_m) c_m)))
(/ (/ t_0 s_m) (* (* x_m (* s_m c_m)) (* x_m c_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0));
double tmp;
if (x_m <= 4.4e+61) {
tmp = (t_0 / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m));
} else {
tmp = (t_0 / s_m) / ((x_m * (s_m * c_m)) * (x_m * c_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 4.4d+61) then
tmp = (t_0 / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m))
else
tmp = (t_0 / s_m) / ((x_m * (s_m * c_m)) * (x_m * c_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 4.4e+61) {
tmp = (t_0 / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m));
} else {
tmp = (t_0 / s_m) / ((x_m * (s_m * c_m)) * (x_m * c_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 4.4e+61: tmp = (t_0 / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m)) else: tmp = (t_0 / s_m) / ((x_m * (s_m * c_m)) * (x_m * c_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 4.4e+61) tmp = Float64(Float64(t_0 / c_m) / Float64(Float64(x_m * s_m) * Float64(Float64(x_m * s_m) * c_m))); else tmp = Float64(Float64(t_0 / s_m) / Float64(Float64(x_m * Float64(s_m * c_m)) * Float64(x_m * c_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 4.4e+61)
tmp = (t_0 / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m));
else
tmp = (t_0 / s_m) / ((x_m * (s_m * c_m)) * (x_m * c_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 4.4e+61], N[(N[(t$95$0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$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])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 4.4 \cdot 10^{+61}:\\
\;\;\;\;\frac{\frac{t\_0}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{\left(x\_m \cdot \left(s\_m \cdot c\_m\right)\right) \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 4.4000000000000001e61Initial program 66.6%
associate-/r*66.6%
*-commutative66.6%
unpow266.6%
sqr-neg66.6%
unpow266.6%
cos-neg66.6%
*-commutative66.6%
distribute-rgt-neg-in66.6%
metadata-eval66.6%
unpow266.6%
sqr-neg66.6%
unpow266.6%
associate-*r*62.3%
unpow262.3%
*-commutative62.3%
Simplified62.3%
associate-/l/62.3%
associate-/r*62.3%
associate-/l/62.4%
add-cube-cbrt62.3%
associate-/l*62.3%
Applied egg-rr80.1%
associate-*r/80.1%
unpow280.1%
rem-3cbrt-lft80.3%
*-commutative80.3%
associate-/l*80.1%
*-commutative80.1%
Simplified80.1%
*-commutative80.1%
div-inv80.0%
*-commutative80.0%
associate-*l*80.1%
pow-flip80.3%
metadata-eval80.3%
unpow-prod-down98.7%
metadata-eval98.7%
pow-flip97.9%
div-inv97.9%
unpow297.9%
associate-/r*98.6%
associate-/r*98.7%
associate-/l/95.4%
*-commutative95.4%
Applied egg-rr95.4%
if 4.4000000000000001e61 < x Initial program 79.7%
associate-/r*79.7%
*-commutative79.7%
unpow279.7%
sqr-neg79.7%
unpow279.7%
cos-neg79.7%
*-commutative79.7%
distribute-rgt-neg-in79.7%
metadata-eval79.7%
unpow279.7%
sqr-neg79.7%
unpow279.7%
associate-*r*69.1%
unpow269.1%
*-commutative69.1%
Simplified69.1%
Applied egg-rr99.7%
*-un-lft-identity99.7%
associate-*r*97.9%
times-frac97.8%
*-commutative97.8%
Applied egg-rr97.8%
associate-*l/97.8%
*-un-lft-identity97.8%
frac-times95.9%
*-un-lft-identity95.9%
*-commutative95.9%
associate-*l*92.2%
*-commutative92.2%
Applied egg-rr92.2%
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 (/ (/ (/ (cos (* x_m 2.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 ((cos((x_m * 2.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 = ((cos((x_m * 2.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 ((Math.cos((x_m * 2.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 ((math.cos((x_m * 2.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(Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * s_m)) / 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 = ((cos((x_m * 2.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[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot s\_m}}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot c\_m}
\end{array}
Initial program 69.0%
associate-/r*69.1%
*-commutative69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
cos-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
metadata-eval69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
associate-/l/63.6%
associate-/r*63.6%
associate-/l/63.6%
add-cube-cbrt63.6%
associate-/l*63.6%
Applied egg-rr81.6%
associate-*r/81.6%
unpow281.6%
rem-3cbrt-lft81.8%
*-commutative81.8%
associate-/l*81.5%
*-commutative81.5%
Simplified81.5%
*-commutative81.5%
div-inv81.5%
*-commutative81.5%
associate-*l*81.5%
pow-flip81.7%
metadata-eval81.7%
unpow-prod-down98.9%
metadata-eval98.9%
pow-flip98.2%
div-inv98.2%
unpow298.2%
associate-/r*98.8%
*-commutative98.8%
associate-/r*98.9%
*-commutative98.9%
Applied egg-rr98.9%
Final simplification98.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (cos (* x_m 2.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 (cos((x_m * 2.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 = (cos((x_m * 2.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 (Math.cos((x_m * 2.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 (math.cos((x_m * 2.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(Float64(cos(Float64(x_m * 2.0)) / 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 = (cos((x_m * 2.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[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * 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{\cos \left(x\_m \cdot 2\right)}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)}
\end{array}
Initial program 69.0%
associate-/r*69.1%
*-commutative69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
cos-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
metadata-eval69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
associate-/l/63.6%
associate-/r*63.6%
associate-/l/63.6%
add-cube-cbrt63.6%
associate-/l*63.6%
Applied egg-rr81.6%
associate-*r/81.6%
unpow281.6%
rem-3cbrt-lft81.8%
*-commutative81.8%
associate-/l*81.5%
*-commutative81.5%
Simplified81.5%
*-commutative81.5%
div-inv81.5%
*-commutative81.5%
associate-*l*81.5%
pow-flip81.7%
metadata-eval81.7%
unpow-prod-down98.9%
metadata-eval98.9%
pow-flip98.2%
div-inv98.2%
unpow298.2%
associate-/r*98.8%
associate-/r*98.9%
associate-/l/95.9%
*-commutative95.9%
Applied egg-rr95.9%
Final simplification95.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (/ (/ 1.0 s_m) x_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 / s_m) / x_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 / s_m) / x_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 / s_m) / x_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 / s_m) / x_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(Float64(Float64(Float64(1.0 / s_m) / x_m) / 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 / s_m) / x_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[(N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\frac{\frac{1}{s\_m}}{x\_m}}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot c\_m}
\end{array}
Initial program 69.0%
associate-/r*69.1%
*-commutative69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
cos-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
metadata-eval69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
associate-/l/63.6%
associate-/r*63.6%
associate-/l/63.6%
add-cube-cbrt63.6%
associate-/l*63.6%
Applied egg-rr81.6%
associate-*r/81.6%
unpow281.6%
rem-3cbrt-lft81.8%
*-commutative81.8%
associate-/l*81.5%
*-commutative81.5%
Simplified81.5%
*-commutative81.5%
div-inv81.5%
*-commutative81.5%
associate-*l*81.5%
pow-flip81.7%
metadata-eval81.7%
unpow-prod-down98.9%
metadata-eval98.9%
pow-flip98.2%
div-inv98.2%
unpow298.2%
associate-/r*98.8%
*-commutative98.8%
associate-/r*98.9%
*-commutative98.9%
Applied egg-rr98.9%
Taylor expanded in x around 0 81.2%
associate-/r*81.3%
Simplified81.3%
Final simplification81.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 (/ (/ 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(Float64(1.0 / 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[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * 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}}{\left(x\_m \cdot s\_m\right) \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)}
\end{array}
Initial program 69.0%
associate-/r*69.1%
*-commutative69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
cos-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
metadata-eval69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
associate-/l/63.6%
associate-/r*63.6%
associate-/l/63.6%
add-cube-cbrt63.6%
associate-/l*63.6%
Applied egg-rr81.6%
associate-*r/81.6%
unpow281.6%
rem-3cbrt-lft81.8%
*-commutative81.8%
associate-/l*81.5%
*-commutative81.5%
Simplified81.5%
*-commutative81.5%
div-inv81.5%
*-commutative81.5%
associate-*l*81.5%
pow-flip81.7%
metadata-eval81.7%
unpow-prod-down98.9%
metadata-eval98.9%
pow-flip98.2%
div-inv98.2%
unpow298.2%
associate-/r*98.8%
associate-/r*98.9%
associate-/l/95.9%
*-commutative95.9%
Applied egg-rr95.9%
Taylor expanded in x around 0 80.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 (let* ((t_0 (* (* x_m s_m) c_m))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (x_m * s_m) * c_m
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (x_m * s_m) * c_m return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(x_m * s_m) * c_m) return Float64(1.0 / 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 = (x_m * s_m) * c_m;
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$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}
t_0 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 69.0%
associate-/r*69.1%
*-commutative69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
cos-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
metadata-eval69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
Taylor expanded in x around 0 57.6%
associate-/r*57.7%
*-commutative57.7%
unpow257.7%
unpow257.7%
swap-sqr70.3%
unpow270.3%
associate-/r*70.5%
unpow270.5%
unpow270.5%
swap-sqr80.9%
unpow280.9%
Simplified80.9%
unpow280.9%
Applied egg-rr80.9%
Final simplification80.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* x_m c_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 / ((x_m * c_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 / ((x_m * c_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 / ((x_m * c_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 / ((x_m * c_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(Float64(x_m * c_m) * Float64(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 / ((x_m * c_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[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$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 c\_m\right) \cdot \left(s\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)\right)}
\end{array}
Initial program 69.0%
associate-/r*69.1%
*-commutative69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
cos-neg69.1%
*-commutative69.1%
distribute-rgt-neg-in69.1%
metadata-eval69.1%
unpow269.1%
sqr-neg69.1%
unpow269.1%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
Taylor expanded in x around 0 57.6%
associate-/r*57.7%
*-commutative57.7%
unpow257.7%
unpow257.7%
swap-sqr70.3%
unpow270.3%
associate-/r*70.5%
unpow270.5%
unpow270.5%
swap-sqr80.9%
unpow280.9%
Simplified80.9%
unpow280.9%
associate-*r*79.6%
associate-*l*77.5%
Applied egg-rr77.5%
Final simplification77.5%
herbie shell --seed 2024165
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))