
(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 (/ (/ 1.0 c_m) (* x_m s_m))))
(if (<= x_m 2e-10)
(* t_0 t_0)
(/ (/ (/ (cos (* x_m 2.0)) (* x_m c_m)) s_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 = (1.0 / c_m) / (x_m * s_m);
double tmp;
if (x_m <= 2e-10) {
tmp = t_0 * t_0;
} else {
tmp = ((cos((x_m * 2.0)) / (x_m * c_m)) / s_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 = (1.0d0 / c_m) / (x_m * s_m)
if (x_m <= 2d-10) then
tmp = t_0 * t_0
else
tmp = ((cos((x_m * 2.0d0)) / (x_m * c_m)) / s_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 = (1.0 / c_m) / (x_m * s_m);
double tmp;
if (x_m <= 2e-10) {
tmp = t_0 * t_0;
} else {
tmp = ((Math.cos((x_m * 2.0)) / (x_m * c_m)) / s_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 = (1.0 / c_m) / (x_m * s_m) tmp = 0 if x_m <= 2e-10: tmp = t_0 * t_0 else: tmp = ((math.cos((x_m * 2.0)) / (x_m * c_m)) / s_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 = Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2e-10) tmp = Float64(t_0 * t_0); else tmp = Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * c_m)) / s_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 = (1.0 / c_m) / (x_m * s_m);
tmp = 0.0;
if (x_m <= 2e-10)
tmp = t_0 * t_0;
else
tmp = ((cos((x_m * 2.0)) / (x_m * c_m)) / s_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[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2e-10], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision] / N[(s$95$m * 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 := \frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}\\
\mathbf{if}\;x\_m \leq 2 \cdot 10^{-10}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot c\_m}}{s\_m}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 2.00000000000000007e-10Initial program 74.0%
associate-/r*73.9%
*-commutative73.9%
unpow273.9%
sqr-neg73.9%
unpow273.9%
cos-neg73.9%
*-commutative73.9%
distribute-rgt-neg-in73.9%
metadata-eval73.9%
unpow273.9%
sqr-neg73.9%
unpow273.9%
associate-*r*69.4%
unpow269.4%
*-commutative69.4%
Simplified69.4%
Taylor expanded in x around 0 66.2%
associate-/r*66.2%
*-commutative66.2%
unpow266.2%
unpow266.2%
swap-sqr75.7%
unpow275.7%
associate-/r*75.6%
unpow275.6%
unpow275.6%
swap-sqr86.8%
unpow286.8%
Simplified86.8%
unpow286.8%
*-commutative86.8%
*-commutative86.8%
*-commutative86.8%
associate-*l*85.3%
*-commutative85.3%
associate-*l*86.9%
Applied egg-rr86.9%
Applied egg-rr87.0%
if 2.00000000000000007e-10 < x Initial program 67.0%
associate-/r*66.9%
*-commutative66.9%
unpow266.9%
sqr-neg66.9%
unpow266.9%
cos-neg66.9%
*-commutative66.9%
distribute-rgt-neg-in66.9%
metadata-eval66.9%
unpow266.9%
sqr-neg66.9%
unpow266.9%
associate-*r*58.9%
unpow258.9%
*-commutative58.9%
Simplified58.9%
Applied egg-rr95.1%
unpow-195.1%
clear-num95.2%
unpow295.2%
associate-/r*95.1%
div-inv95.1%
div-inv95.1%
*-commutative95.1%
*-commutative95.1%
*-commutative95.1%
associate-*l*95.3%
*-commutative95.3%
*-commutative95.3%
associate-*l*99.5%
Applied egg-rr99.5%
*-commutative99.5%
*-un-lft-identity99.5%
*-commutative99.5%
times-frac99.6%
*-commutative99.6%
Applied egg-rr99.6%
associate-*l/99.6%
*-lft-identity99.6%
*-commutative99.6%
*-commutative99.6%
Simplified99.6%
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 (let* ((t_0 (* s_m (* x_m c_m))) (t_1 (/ (/ 1.0 c_m) (* x_m s_m)))) (if (<= x_m 1.18e-12) (* t_1 t_1) (/ (/ (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 = s_m * (x_m * c_m);
double t_1 = (1.0 / c_m) / (x_m * s_m);
double tmp;
if (x_m <= 1.18e-12) {
tmp = t_1 * t_1;
} 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) :: t_1
real(8) :: tmp
t_0 = s_m * (x_m * c_m)
t_1 = (1.0d0 / c_m) / (x_m * s_m)
if (x_m <= 1.18d-12) then
tmp = t_1 * t_1
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 = s_m * (x_m * c_m);
double t_1 = (1.0 / c_m) / (x_m * s_m);
double tmp;
if (x_m <= 1.18e-12) {
tmp = t_1 * t_1;
} 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 = s_m * (x_m * c_m) t_1 = (1.0 / c_m) / (x_m * s_m) tmp = 0 if x_m <= 1.18e-12: tmp = t_1 * t_1 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(s_m * Float64(x_m * c_m)) t_1 = Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.18e-12) tmp = Float64(t_1 * t_1); 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 = s_m * (x_m * c_m);
t_1 = (1.0 / c_m) / (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.18e-12)
tmp = t_1 * t_1;
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[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.18e-12], N[(t$95$1 * t$95$1), $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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
t_1 := \frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}\\
\mathbf{if}\;x\_m \leq 1.18 \cdot 10^{-12}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 1.18000000000000002e-12Initial program 74.3%
associate-/r*74.3%
*-commutative74.3%
unpow274.3%
sqr-neg74.3%
unpow274.3%
cos-neg74.3%
*-commutative74.3%
distribute-rgt-neg-in74.3%
metadata-eval74.3%
unpow274.3%
sqr-neg74.3%
unpow274.3%
associate-*r*69.7%
unpow269.7%
*-commutative69.7%
Simplified69.7%
Taylor expanded in x around 0 66.5%
associate-/r*66.5%
*-commutative66.5%
unpow266.5%
unpow266.5%
swap-sqr76.0%
unpow276.0%
associate-/r*76.0%
unpow276.0%
unpow276.0%
swap-sqr86.7%
unpow286.7%
Simplified86.7%
unpow286.7%
*-commutative86.7%
*-commutative86.7%
*-commutative86.7%
associate-*l*85.2%
*-commutative85.2%
associate-*l*86.8%
Applied egg-rr86.8%
Applied egg-rr86.9%
if 1.18000000000000002e-12 < x Initial program 66.0%
associate-/r*66.0%
*-commutative66.0%
unpow266.0%
sqr-neg66.0%
unpow266.0%
cos-neg66.0%
*-commutative66.0%
distribute-rgt-neg-in66.0%
metadata-eval66.0%
unpow266.0%
sqr-neg66.0%
unpow266.0%
associate-*r*58.1%
unpow258.1%
*-commutative58.1%
Simplified58.1%
Applied egg-rr95.2%
unpow-195.2%
clear-num95.3%
unpow295.3%
associate-/r*95.2%
div-inv95.2%
div-inv95.2%
*-commutative95.2%
*-commutative95.2%
*-commutative95.2%
associate-*l*95.4%
*-commutative95.4%
*-commutative95.4%
associate-*l*99.5%
Applied egg-rr99.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 2.9e-51) (pow (* c_m (* x_m s_m)) -2.0) (/ (/ (cos (* x_m 2.0)) (* x_m (* c_m s_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.9e-51) {
tmp = pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = (cos((x_m * 2.0)) / (x_m * (c_m * s_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.9d-51) then
tmp = (c_m * (x_m * s_m)) ** (-2.0d0)
else
tmp = (cos((x_m * 2.0d0)) / (x_m * (c_m * s_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.9e-51) {
tmp = Math.pow((c_m * (x_m * s_m)), -2.0);
} else {
tmp = (Math.cos((x_m * 2.0)) / (x_m * (c_m * s_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.9e-51: tmp = math.pow((c_m * (x_m * s_m)), -2.0) else: tmp = (math.cos((x_m * 2.0)) / (x_m * (c_m * s_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.9e-51) tmp = Float64(c_m * Float64(x_m * s_m)) ^ -2.0; else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * Float64(c_m * s_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.9e-51)
tmp = (c_m * (x_m * s_m)) ^ -2.0;
else
tmp = (cos((x_m * 2.0)) / (x_m * (c_m * s_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.9e-51], 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] / N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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}
\mathbf{if}\;x\_m \leq 2.9 \cdot 10^{-51}:\\
\;\;\;\;{\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot \left(c\_m \cdot s\_m\right)}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 2.89999999999999973e-51Initial program 74.0%
associate-/r*74.0%
*-commutative74.0%
unpow274.0%
sqr-neg74.0%
unpow274.0%
cos-neg74.0%
*-commutative74.0%
distribute-rgt-neg-in74.0%
metadata-eval74.0%
unpow274.0%
sqr-neg74.0%
unpow274.0%
associate-*r*69.3%
unpow269.3%
*-commutative69.3%
Simplified69.3%
Taylor expanded in x around 0 65.9%
associate-/r*65.9%
*-commutative65.9%
unpow265.9%
unpow265.9%
swap-sqr75.8%
unpow275.8%
associate-/r*75.8%
unpow275.8%
unpow275.8%
swap-sqr86.3%
unpow286.3%
Simplified86.3%
Taylor expanded in c around 0 65.9%
*-commutative65.9%
associate-*r*65.1%
unpow265.1%
unpow265.1%
unpow265.1%
swap-sqr76.2%
swap-sqr86.4%
associate-/l/86.6%
*-lft-identity86.6%
associate-*l/86.5%
unpow-186.5%
unpow-186.5%
pow-sqr86.6%
metadata-eval86.6%
associate-*r*86.6%
*-commutative86.6%
Simplified86.6%
if 2.89999999999999973e-51 < x Initial program 67.5%
associate-/r*67.5%
*-commutative67.5%
unpow267.5%
sqr-neg67.5%
unpow267.5%
cos-neg67.5%
*-commutative67.5%
distribute-rgt-neg-in67.5%
metadata-eval67.5%
unpow267.5%
sqr-neg67.5%
unpow267.5%
associate-*r*60.2%
unpow260.2%
*-commutative60.2%
Simplified60.2%
Applied egg-rr95.5%
unpow-195.5%
clear-num95.6%
unpow295.6%
associate-/r*95.5%
div-inv95.5%
div-inv95.5%
*-commutative95.5%
*-commutative95.5%
*-commutative95.5%
associate-*l*95.8%
*-commutative95.8%
*-commutative95.8%
associate-*l*99.5%
Applied egg-rr99.5%
Taylor expanded in x around inf 95.7%
associate-*r*96.6%
*-commutative96.6%
Simplified96.6%
Final simplification89.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 (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(Float64(1.0 / 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[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$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{\frac{1}{c\_m}}{x\_m \cdot s\_m}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 72.2%
associate-/r*72.2%
*-commutative72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
cos-neg72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
associate-*r*66.7%
unpow266.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in x around 0 61.1%
associate-/r*61.1%
*-commutative61.1%
unpow261.1%
unpow261.1%
swap-sqr68.8%
unpow268.8%
associate-/r*68.8%
unpow268.8%
unpow268.8%
swap-sqr79.0%
unpow279.0%
Simplified79.0%
unpow279.0%
*-commutative79.0%
*-commutative79.0%
*-commutative79.0%
associate-*l*77.9%
*-commutative77.9%
associate-*l*79.3%
Applied egg-rr79.3%
Applied egg-rr79.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 (/ 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 72.2%
associate-/r*72.2%
*-commutative72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
cos-neg72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
associate-*r*66.7%
unpow266.7%
*-commutative66.7%
Simplified66.7%
Applied egg-rr96.9%
Taylor expanded in x around 0 79.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)) (* x_m (* c_m s_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return ((1.0 / c_m) / (x_m * s_m)) / (x_m * (c_m * s_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = ((1.0d0 / c_m) / (x_m * s_m)) / (x_m * (c_m * s_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return ((1.0 / c_m) / (x_m * s_m)) / (x_m * (c_m * s_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return ((1.0 / c_m) / (x_m * s_m)) / (x_m * (c_m * s_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) / Float64(x_m * Float64(c_m * s_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = ((1.0 / c_m) / (x_m * s_m)) / (x_m * (c_m * s_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(c$95$m * 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{\frac{1}{c\_m}}{x\_m \cdot s\_m}}{x\_m \cdot \left(c\_m \cdot s\_m\right)}
\end{array}
Initial program 72.2%
associate-/r*72.2%
*-commutative72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
cos-neg72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
associate-*r*66.7%
unpow266.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in x around 0 61.1%
associate-/r*61.1%
*-commutative61.1%
unpow261.1%
unpow261.1%
swap-sqr68.8%
unpow268.8%
associate-/r*68.8%
unpow268.8%
unpow268.8%
swap-sqr79.0%
unpow279.0%
Simplified79.0%
unpow-prod-down68.8%
*-commutative68.8%
pow-prod-down61.1%
associate-/r*61.1%
clear-num61.1%
add-sqr-sqrt61.1%
Applied egg-rr79.4%
Applied egg-rr78.3%
Final simplification78.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 (* s_m (* x_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 = s_m * (x_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 = s_m * (x_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 = s_m * (x_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 = s_m * (x_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(s_m * Float64(x_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 = s_m * (x_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[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 72.2%
associate-/r*72.2%
*-commutative72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
cos-neg72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
associate-*r*66.7%
unpow266.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in x around 0 61.1%
associate-/r*61.1%
*-commutative61.1%
unpow261.1%
unpow261.1%
swap-sqr68.8%
unpow268.8%
associate-/r*68.8%
unpow268.8%
unpow268.8%
swap-sqr79.0%
unpow279.0%
Simplified79.0%
unpow279.0%
*-commutative79.0%
*-commutative79.0%
*-commutative79.0%
associate-*l*77.9%
*-commutative77.9%
associate-*l*79.3%
Applied egg-rr79.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 (* (* x_m c_m) (* s_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) {
return 1.0 / ((x_m * c_m) * (s_m * (s_m * (x_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 * (s_m * (x_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 * (s_m * (x_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 * (s_m * (x_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(s_m * Float64(x_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 * (s_m * (x_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[(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])\\
\\
\frac{1}{\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)}
\end{array}
Initial program 72.2%
associate-/r*72.2%
*-commutative72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
cos-neg72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
unpow272.2%
sqr-neg72.2%
unpow272.2%
associate-*r*66.7%
unpow266.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in x around 0 61.1%
associate-/r*61.1%
*-commutative61.1%
unpow261.1%
unpow261.1%
swap-sqr68.8%
unpow268.8%
associate-/r*68.8%
unpow268.8%
unpow268.8%
swap-sqr79.0%
unpow279.0%
Simplified79.0%
unpow279.0%
associate-*r*77.9%
associate-*l*76.8%
*-commutative76.8%
*-commutative76.8%
associate-*l*77.5%
Applied egg-rr77.5%
Final simplification77.5%
herbie shell --seed 2024177
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))