
(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 (* c_m (* x_m s_m))) (t_1 (cos (* x_m 2.0))))
(if (<= x_m 7e+27)
(* (/ 1.0 t_0) (/ t_1 t_0))
(/ (/ t_1 s_m) (* (* c_m x_m) (* (* c_m x_m) s_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (x_m <= 7e+27) {
tmp = (1.0 / t_0) * (t_1 / t_0);
} else {
tmp = (t_1 / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
t_1 = cos((x_m * 2.0d0))
if (x_m <= 7d+27) then
tmp = (1.0d0 / t_0) * (t_1 / t_0)
else
tmp = (t_1 / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 7e+27) {
tmp = (1.0 / t_0) * (t_1 / t_0);
} else {
tmp = (t_1 / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 7e+27: tmp = (1.0 / t_0) * (t_1 / t_0) else: tmp = (t_1 / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 7e+27) tmp = Float64(Float64(1.0 / t_0) * Float64(t_1 / t_0)); else tmp = Float64(Float64(t_1 / s_m) / Float64(Float64(c_m * x_m) * Float64(Float64(c_m * x_m) * s_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 7e+27)
tmp = (1.0 / t_0) * (t_1 / t_0);
else
tmp = (t_1 / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 7e+27], N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(t$95$1 / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / s$95$m), $MachinePrecision] / N[(N[(c$95$m * x$95$m), $MachinePrecision] * N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 7 \cdot 10^{+27}:\\
\;\;\;\;\frac{1}{t\_0} \cdot \frac{t\_1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{s\_m}}{\left(c\_m \cdot x\_m\right) \cdot \left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 7.0000000000000004e27Initial program 71.2%
associate-/r*71.1%
*-commutative71.1%
unpow271.1%
sqr-neg71.1%
unpow271.1%
cos-neg71.1%
*-commutative71.1%
distribute-rgt-neg-in71.1%
metadata-eval71.1%
unpow271.1%
sqr-neg71.1%
unpow271.1%
associate-*r*64.4%
unpow264.4%
*-commutative64.4%
Simplified64.4%
Applied egg-rr99.1%
if 7.0000000000000004e27 < x Initial program 69.5%
associate-/r*69.5%
*-commutative69.5%
unpow269.5%
sqr-neg69.5%
unpow269.5%
cos-neg69.5%
*-commutative69.5%
distribute-rgt-neg-in69.5%
metadata-eval69.5%
unpow269.5%
sqr-neg69.5%
unpow269.5%
associate-*r*52.8%
unpow252.8%
*-commutative52.8%
Simplified52.8%
Applied egg-rr94.9%
*-un-lft-identity94.9%
associate-*r*91.9%
times-frac91.8%
*-commutative91.8%
Applied egg-rr91.8%
associate-*l/91.9%
*-lft-identity91.9%
Simplified91.9%
clear-num91.9%
frac-times90.3%
*-un-lft-identity90.3%
*-commutative90.3%
/-rgt-identity90.3%
*-commutative90.3%
associate-*r*95.0%
*-commutative95.0%
Applied egg-rr95.0%
Final simplification98.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 1.5e-8) (pow (* c_m (* x_m s_m)) -2.0) (/ (/ (cos (* x_m 2.0)) s_m) (* (* c_m x_m) (* (* c_m x_m) s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 1.5e-8) {
tmp = pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = (cos((x_m * 2.0)) / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 1.5d-8) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
else
tmp = (cos((x_m * 2.0d0)) / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 1.5e-8) {
tmp = Math.pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = (Math.cos((x_m * 2.0)) / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 1.5e-8: tmp = math.pow((c_m * (x_m * s_m)), -2.0) else: tmp = (math.cos((x_m * 2.0)) / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 1.5e-8) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.0; else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / s_m) / Float64(Float64(c_m * x_m) * Float64(Float64(c_m * x_m) * s_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 1.5e-8)
tmp = (c_m * (x_m * s_m)) ^ -2.0;
else
tmp = (cos((x_m * 2.0)) / s_m) / ((c_m * x_m) * ((c_m * x_m) * s_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 1.5e-8], N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(N[(c$95$m * x$95$m), $MachinePrecision] * N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$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}
\mathbf{if}\;x\_m \leq 1.5 \cdot 10^{-8}:\\
\;\;\;\;{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m}}{\left(c\_m \cdot x\_m\right) \cdot \left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 1.49999999999999987e-8Initial program 70.3%
associate-/r*70.2%
*-commutative70.2%
unpow270.2%
sqr-neg70.2%
unpow270.2%
cos-neg70.2%
*-commutative70.2%
distribute-rgt-neg-in70.2%
metadata-eval70.2%
unpow270.2%
sqr-neg70.2%
unpow270.2%
associate-*r*63.3%
unpow263.3%
*-commutative63.3%
Simplified63.3%
Taylor expanded in x around 0 58.3%
associate-/r*58.3%
*-commutative58.3%
unpow258.3%
unpow258.3%
swap-sqr70.3%
unpow270.3%
associate-/r*70.1%
unpow270.1%
unpow270.1%
swap-sqr86.8%
unpow286.8%
Simplified86.8%
Taylor expanded in c around 0 58.3%
associate-*r*57.8%
unpow257.8%
unpow257.8%
swap-sqr68.1%
unpow268.1%
swap-sqr84.3%
associate-/l/84.3%
*-rgt-identity84.3%
associate-*r/84.2%
unpow-184.2%
unpow-184.2%
pow-sqr84.3%
associate-*r*87.1%
metadata-eval87.1%
Simplified87.1%
if 1.49999999999999987e-8 < x Initial program 72.3%
associate-/r*72.3%
*-commutative72.3%
unpow272.3%
sqr-neg72.3%
unpow272.3%
cos-neg72.3%
*-commutative72.3%
distribute-rgt-neg-in72.3%
metadata-eval72.3%
unpow272.3%
sqr-neg72.3%
unpow272.3%
associate-*r*57.1%
unpow257.1%
*-commutative57.1%
Simplified57.1%
Applied egg-rr95.3%
*-un-lft-identity95.3%
associate-*r*92.6%
times-frac92.6%
*-commutative92.6%
Applied egg-rr92.6%
associate-*l/92.6%
*-lft-identity92.6%
Simplified92.6%
clear-num92.6%
frac-times91.2%
*-un-lft-identity91.2%
*-commutative91.2%
/-rgt-identity91.2%
*-commutative91.2%
associate-*r*95.4%
*-commutative95.4%
Applied egg-rr95.4%
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 (* (/ (/ 1.0 (* c_m x_m)) s_m) (/ (/ (cos (* x_m 2.0)) s_m) (* c_m x_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) * ((cos((x_m * 2.0)) / s_m) / (c_m * x_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) * ((cos((x_m * 2.0d0)) / s_m) / (c_m * x_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) * ((Math.cos((x_m * 2.0)) / s_m) / (c_m * x_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) * ((math.cos((x_m * 2.0)) / s_m) / (c_m * x_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 / Float64(c_m * x_m)) / s_m) * Float64(Float64(cos(Float64(x_m * 2.0)) / s_m) / Float64(c_m * x_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) * ((cos((x_m * 2.0)) / s_m) / (c_m * x_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 / N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision] * N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(c$95$m * x$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 \cdot x\_m}}{s\_m} \cdot \frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m}}{c\_m \cdot x\_m}
\end{array}
Initial program 70.8%
associate-/r*70.8%
*-commutative70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
associate-*r*61.7%
unpow261.7%
*-commutative61.7%
Simplified61.7%
Applied egg-rr98.1%
*-un-lft-identity98.1%
associate-*r*96.4%
times-frac96.4%
*-commutative96.4%
Applied egg-rr96.4%
associate-*l/96.4%
*-lft-identity96.4%
Simplified96.4%
inv-pow96.4%
associate-*r*97.8%
unpow-prod-down97.8%
Applied egg-rr97.8%
unpow-197.8%
*-commutative97.8%
associate-/r*97.8%
unpow-197.8%
associate-*l/97.9%
associate-/r*97.8%
*-lft-identity97.8%
Simplified97.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)) c_m) (* (* x_m s_m) (* (* c_m x_m) s_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((c_m * x_m) * s_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (cos((x_m * 2.0d0)) / c_m) / ((x_m * s_m) * ((c_m * x_m) * s_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (Math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((c_m * x_m) * s_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((c_m * x_m) * s_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(cos(Float64(x_m * 2.0)) / c_m) / Float64(Float64(x_m * s_m) * Float64(Float64(c_m * x_m) * s_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((c_m * x_m) * s_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(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[(c$95$m * x$95$m), $MachinePrecision] * s$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(c\_m \cdot x\_m\right) \cdot s\_m\right)}
\end{array}
Initial program 70.8%
associate-/r*70.8%
*-commutative70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
associate-*r*61.7%
unpow261.7%
*-commutative61.7%
Simplified61.7%
Applied egg-rr98.1%
*-un-lft-identity98.1%
associate-*r*96.4%
times-frac96.4%
*-commutative96.4%
Applied egg-rr96.4%
associate-*l/96.4%
*-lft-identity96.4%
Simplified96.4%
*-commutative96.4%
associate-/r*96.4%
associate-/l/96.5%
associate-*r*98.1%
*-commutative98.1%
frac-times94.3%
div-inv94.3%
*-commutative94.3%
*-commutative94.3%
associate-*r*92.5%
*-commutative92.5%
Applied egg-rr92.5%
Final simplification92.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 (pow (* c_m (* x_m s_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) {
return pow((c_m * (x_m * s_m)), -2.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
code = (c_m * (x_m * s_m)) ** (-2.0d0)
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.pow((c_m * (x_m * s_m)), -2.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): return math.pow((c_m * (x_m * s_m)), -2.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) return Float64(c_m * Float64(x_m * s_m)) ^ -2.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)
tmp = (c_m * (x_m * s_m)) ^ -2.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_] := N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], -2.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])\\
\\
{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}
\end{array}
Initial program 70.8%
associate-/r*70.8%
*-commutative70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
associate-*r*61.7%
unpow261.7%
*-commutative61.7%
Simplified61.7%
Taylor expanded in x around 0 55.6%
associate-/r*55.5%
*-commutative55.5%
unpow255.5%
unpow255.5%
swap-sqr66.5%
unpow266.5%
associate-/r*66.4%
unpow266.4%
unpow266.4%
swap-sqr79.9%
unpow279.9%
Simplified79.9%
Taylor expanded in c around 0 55.6%
associate-*r*55.1%
unpow255.1%
unpow255.1%
swap-sqr64.6%
unpow264.6%
swap-sqr77.9%
associate-/l/77.9%
*-rgt-identity77.9%
associate-*r/77.9%
unpow-177.9%
unpow-177.9%
pow-sqr77.9%
associate-*r*80.1%
metadata-eval80.1%
Simplified80.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 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = 1.0d0 / (c_m * (x_m * s_m))
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) return Float64(t_0 * t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = 1.0 / (c_m * (x_m * s_m));
tmp = t_0 * t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 70.8%
associate-/r*70.8%
*-commutative70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
associate-*r*61.7%
unpow261.7%
*-commutative61.7%
Simplified61.7%
Applied egg-rr98.1%
Taylor expanded in x around 0 80.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 (* (* c_m x_m) s_m))) (/ (/ 1.0 t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
return (1.0 / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (c_m * x_m) * s_m
code = (1.0d0 / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (c_m * x_m) * s_m;
return (1.0 / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (c_m * x_m) * s_m return (1.0 / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(c_m * x_m) * s_m) return Float64(Float64(1.0 / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = (c_m * x_m) * s_m;
tmp = (1.0 / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 70.8%
associate-/r*70.8%
*-commutative70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
associate-*r*61.7%
unpow261.7%
*-commutative61.7%
Simplified61.7%
Taylor expanded in x around 0 55.6%
associate-/r*55.5%
*-commutative55.5%
unpow255.5%
unpow255.5%
swap-sqr66.5%
unpow266.5%
associate-/r*66.4%
unpow266.4%
unpow266.4%
swap-sqr79.9%
unpow279.9%
Simplified79.9%
Taylor expanded in c around 0 55.6%
associate-*r*55.1%
unpow255.1%
unpow255.1%
swap-sqr64.6%
unpow264.6%
swap-sqr77.9%
associate-/l/77.9%
*-rgt-identity77.9%
associate-*r/77.9%
unpow-177.9%
unpow-177.9%
pow-sqr77.9%
associate-*r*80.1%
metadata-eval80.1%
Simplified80.1%
metadata-eval80.1%
pow-prod-up80.1%
*-commutative80.1%
associate-*r*79.4%
unpow-prod-down79.4%
inv-pow79.4%
inv-pow79.4%
associate-/l/79.4%
div-inv79.4%
inv-pow79.4%
div-inv79.4%
*-commutative79.4%
associate-*r*79.5%
*-commutative79.5%
div-inv79.5%
associate-/l/79.4%
frac-times79.4%
metadata-eval79.4%
*-commutative79.4%
Applied egg-rr79.4%
Final simplification79.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) (* c_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(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}
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(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 70.8%
associate-/r*70.8%
*-commutative70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
cos-neg70.8%
*-commutative70.8%
distribute-rgt-neg-in70.8%
metadata-eval70.8%
unpow270.8%
sqr-neg70.8%
unpow270.8%
associate-*r*61.7%
unpow261.7%
*-commutative61.7%
Simplified61.7%
Taylor expanded in x around 0 55.6%
associate-/r*55.5%
*-commutative55.5%
unpow255.5%
unpow255.5%
swap-sqr66.5%
unpow266.5%
associate-/r*66.4%
unpow266.4%
unpow266.4%
swap-sqr79.9%
unpow279.9%
Simplified79.9%
/-rgt-identity79.9%
clear-num79.9%
pow-flip79.9%
*-commutative79.9%
metadata-eval79.9%
unpow-prod-down67.6%
metadata-eval67.6%
pow-flip66.3%
div-inv66.3%
clear-num66.3%
unpow266.3%
associate-/l*73.5%
Applied egg-rr73.5%
*-un-lft-identity73.5%
metadata-eval73.5%
pow-sqr73.5%
inv-pow73.5%
inv-pow73.5%
times-frac77.2%
remove-double-div77.2%
associate-/r/77.2%
/-rgt-identity77.2%
*-commutative77.2%
associate-*l*75.2%
*-commutative75.2%
associate-*r*76.6%
*-commutative76.6%
Applied egg-rr76.6%
Taylor expanded in s around 0 77.2%
*-commutative77.2%
Simplified77.2%
herbie shell --seed 2024172
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))