
(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 7 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}
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (* x 2.0))))
(if (<= c_m 1.7e-267)
(/ t_0 (* x (* (* c_m s_m) (* x (* c_m s_m)))))
(* (/ (/ 1.0 (* x s_m)) c_m) (/ t_0 (* c_m (* x s_m)))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((x * 2.0));
double tmp;
if (c_m <= 1.7e-267) {
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
} else {
tmp = ((1.0 / (x * s_m)) / c_m) * (t_0 / (c_m * (x * s_m)));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x * 2.0d0))
if (c_m <= 1.7d-267) then
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * s_m))))
else
tmp = ((1.0d0 / (x * s_m)) / c_m) * (t_0 / (c_m * (x * s_m)))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((x * 2.0));
double tmp;
if (c_m <= 1.7e-267) {
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
} else {
tmp = ((1.0 / (x * s_m)) / c_m) * (t_0 / (c_m * (x * s_m)));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((x * 2.0)) tmp = 0 if c_m <= 1.7e-267: tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * s_m)))) else: tmp = ((1.0 / (x * s_m)) / c_m) * (t_0 / (c_m * (x * s_m))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(x * 2.0)) tmp = 0.0 if (c_m <= 1.7e-267) tmp = Float64(t_0 / Float64(x * Float64(Float64(c_m * s_m) * Float64(x * Float64(c_m * s_m))))); else tmp = Float64(Float64(Float64(1.0 / Float64(x * s_m)) / c_m) * Float64(t_0 / Float64(c_m * Float64(x * s_m)))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((x * 2.0));
tmp = 0.0;
if (c_m <= 1.7e-267)
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
else
tmp = ((1.0 / (x * s_m)) / c_m) * (t_0 / (c_m * (x * s_m)));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 1.7e-267], N[(t$95$0 / N[(x * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(t$95$0 / N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;c_m \leq 1.7 \cdot 10^{-267}:\\
\;\;\;\;\frac{t_0}{x \cdot \left(\left(c_m \cdot s_m\right) \cdot \left(x \cdot \left(c_m \cdot s_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{x \cdot s_m}}{c_m} \cdot \frac{t_0}{c_m \cdot \left(x \cdot s_m\right)}\\
\end{array}
\end{array}
if c < 1.7000000000000001e-267Initial program 68.6%
*-un-lft-identity68.6%
add-sqr-sqrt68.5%
times-frac68.5%
Applied egg-rr97.0%
*-commutative97.0%
frac-2neg97.0%
frac-2neg97.0%
metadata-eval97.0%
frac-times96.7%
*-commutative96.7%
*-commutative96.7%
associate-*r*96.1%
distribute-rgt-neg-in96.1%
*-commutative96.1%
associate-*r*98.8%
distribute-rgt-neg-in98.8%
Applied egg-rr98.8%
Taylor expanded in x around inf 63.4%
*-commutative63.4%
unpow263.4%
unpow263.4%
unpow263.4%
swap-sqr80.2%
swap-sqr96.7%
unpow296.7%
*-commutative96.7%
associate-*l*96.7%
*-commutative96.7%
Simplified96.7%
unpow296.7%
*-commutative96.7%
associate-*r*94.1%
associate-*r*96.1%
*-commutative96.1%
associate-*r*93.5%
associate-*r*93.5%
*-commutative93.5%
associate-*r*96.2%
*-commutative96.2%
Applied egg-rr96.2%
if 1.7000000000000001e-267 < c Initial program 66.4%
*-un-lft-identity66.4%
add-sqr-sqrt66.3%
times-frac66.3%
Applied egg-rr97.1%
Taylor expanded in c around 0 97.1%
associate-/r*97.1%
*-commutative97.1%
*-rgt-identity97.1%
associate-*r/97.2%
associate-*l/97.2%
*-lft-identity97.2%
*-commutative97.2%
Simplified97.2%
Final simplification96.6%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x s_m))) (t_1 (cos (* x 2.0))))
(if (<= c_m 1.5e-267)
(/ t_1 (* x (* (* c_m s_m) (* x (* c_m s_m)))))
(* (/ t_1 t_0) (/ 1.0 t_0)))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double t_1 = cos((x * 2.0));
double tmp;
if (c_m <= 1.5e-267) {
tmp = t_1 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
} else {
tmp = (t_1 / t_0) * (1.0 / t_0);
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
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 * s_m)
t_1 = cos((x * 2.0d0))
if (c_m <= 1.5d-267) then
tmp = t_1 / (x * ((c_m * s_m) * (x * (c_m * s_m))))
else
tmp = (t_1 / t_0) * (1.0d0 / t_0)
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double t_1 = Math.cos((x * 2.0));
double tmp;
if (c_m <= 1.5e-267) {
tmp = t_1 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
} else {
tmp = (t_1 / t_0) * (1.0 / t_0);
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = c_m * (x * s_m) t_1 = math.cos((x * 2.0)) tmp = 0 if c_m <= 1.5e-267: tmp = t_1 / (x * ((c_m * s_m) * (x * (c_m * s_m)))) else: tmp = (t_1 / t_0) * (1.0 / t_0) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) t_1 = cos(Float64(x * 2.0)) tmp = 0.0 if (c_m <= 1.5e-267) tmp = Float64(t_1 / Float64(x * Float64(Float64(c_m * s_m) * Float64(x * Float64(c_m * s_m))))); else tmp = Float64(Float64(t_1 / t_0) * Float64(1.0 / t_0)); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = c_m * (x * s_m);
t_1 = cos((x * 2.0));
tmp = 0.0;
if (c_m <= 1.5e-267)
tmp = t_1 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
else
tmp = (t_1 / t_0) * (1.0 / t_0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 1.5e-267], N[(t$95$1 / N[(x * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / t$95$0), $MachinePrecision] * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x \cdot s_m\right)\\
t_1 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;c_m \leq 1.5 \cdot 10^{-267}:\\
\;\;\;\;\frac{t_1}{x \cdot \left(\left(c_m \cdot s_m\right) \cdot \left(x \cdot \left(c_m \cdot s_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{t_0} \cdot \frac{1}{t_0}\\
\end{array}
\end{array}
if c < 1.5e-267Initial program 68.6%
*-un-lft-identity68.6%
add-sqr-sqrt68.5%
times-frac68.5%
Applied egg-rr97.0%
*-commutative97.0%
frac-2neg97.0%
frac-2neg97.0%
metadata-eval97.0%
frac-times96.7%
*-commutative96.7%
*-commutative96.7%
associate-*r*96.1%
distribute-rgt-neg-in96.1%
*-commutative96.1%
associate-*r*98.8%
distribute-rgt-neg-in98.8%
Applied egg-rr98.8%
Taylor expanded in x around inf 63.4%
*-commutative63.4%
unpow263.4%
unpow263.4%
unpow263.4%
swap-sqr80.2%
swap-sqr96.7%
unpow296.7%
*-commutative96.7%
associate-*l*96.7%
*-commutative96.7%
Simplified96.7%
unpow296.7%
*-commutative96.7%
associate-*r*94.1%
associate-*r*96.1%
*-commutative96.1%
associate-*r*93.5%
associate-*r*93.5%
*-commutative93.5%
associate-*r*96.2%
*-commutative96.2%
Applied egg-rr96.2%
if 1.5e-267 < c Initial program 66.4%
*-un-lft-identity66.4%
add-sqr-sqrt66.3%
times-frac66.3%
Applied egg-rr97.1%
Final simplification96.6%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (if (<= x 1.25e-103) (* (/ (/ 1.0 (* x s_m)) c_m) (/ 1.0 (* c_m (* x s_m)))) (/ (cos (* x 2.0)) (* s_m (* (* x (* c_m s_m)) (* x c_m))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if (x <= 1.25e-103) {
tmp = ((1.0 / (x * s_m)) / c_m) * (1.0 / (c_m * (x * s_m)));
} else {
tmp = cos((x * 2.0)) / (s_m * ((x * (c_m * s_m)) * (x * c_m)));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x <= 1.25d-103) then
tmp = ((1.0d0 / (x * s_m)) / c_m) * (1.0d0 / (c_m * (x * s_m)))
else
tmp = cos((x * 2.0d0)) / (s_m * ((x * (c_m * s_m)) * (x * c_m)))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if (x <= 1.25e-103) {
tmp = ((1.0 / (x * s_m)) / c_m) * (1.0 / (c_m * (x * s_m)));
} else {
tmp = Math.cos((x * 2.0)) / (s_m * ((x * (c_m * s_m)) * (x * c_m)));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if x <= 1.25e-103: tmp = ((1.0 / (x * s_m)) / c_m) * (1.0 / (c_m * (x * s_m))) else: tmp = math.cos((x * 2.0)) / (s_m * ((x * (c_m * s_m)) * (x * c_m))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (x <= 1.25e-103) tmp = Float64(Float64(Float64(1.0 / Float64(x * s_m)) / c_m) * Float64(1.0 / Float64(c_m * Float64(x * s_m)))); else tmp = Float64(cos(Float64(x * 2.0)) / Float64(s_m * Float64(Float64(x * Float64(c_m * s_m)) * Float64(x * c_m)))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if (x <= 1.25e-103)
tmp = ((1.0 / (x * s_m)) / c_m) * (1.0 / (c_m * (x * s_m)));
else
tmp = cos((x * 2.0)) / (s_m * ((x * (c_m * s_m)) * (x * c_m)));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[x, 1.25e-103], N[(N[(N[(1.0 / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(1.0 / N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 1.25 \cdot 10^{-103}:\\
\;\;\;\;\frac{\frac{1}{x \cdot s_m}}{c_m} \cdot \frac{1}{c_m \cdot \left(x \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{s_m \cdot \left(\left(x \cdot \left(c_m \cdot s_m\right)\right) \cdot \left(x \cdot c_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.24999999999999992e-103Initial program 68.5%
Taylor expanded in x around 0 53.8%
associate-/r*53.9%
*-commutative53.9%
unpow253.9%
unpow253.9%
swap-sqr69.4%
unpow269.4%
associate-/r*69.4%
unpow269.4%
unpow269.4%
swap-sqr81.5%
unpow281.5%
*-commutative81.5%
Simplified81.5%
pow-flip81.6%
*-commutative81.6%
pow-flip81.5%
unpow281.5%
associate-/r*81.6%
un-div-inv81.6%
Applied egg-rr81.6%
Taylor expanded in c around 0 81.6%
associate-/r*96.6%
*-commutative96.6%
*-rgt-identity96.6%
associate-*r/96.6%
associate-*l/96.6%
*-lft-identity96.6%
*-commutative96.6%
Simplified81.7%
if 1.24999999999999992e-103 < x Initial program 66.3%
*-un-lft-identity66.3%
add-sqr-sqrt66.3%
times-frac66.3%
Applied egg-rr97.8%
*-commutative97.8%
frac-2neg97.8%
frac-2neg97.8%
metadata-eval97.8%
frac-times97.8%
*-commutative97.8%
*-commutative97.8%
associate-*r*96.4%
distribute-rgt-neg-in96.4%
*-commutative96.4%
associate-*r*98.1%
distribute-rgt-neg-in98.1%
Applied egg-rr98.1%
Taylor expanded in x around inf 62.2%
*-commutative62.2%
unpow262.2%
unpow262.2%
unpow262.2%
swap-sqr76.7%
swap-sqr97.8%
unpow297.8%
*-commutative97.8%
associate-*l*96.0%
*-commutative96.0%
Simplified96.0%
unpow296.0%
*-commutative96.0%
associate-*r*94.3%
*-commutative94.3%
associate-*r*89.7%
associate-*r*91.6%
*-commutative91.6%
associate-*r*90.1%
Applied egg-rr90.1%
Final simplification85.1%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* x (* c_m s_m)))) (/ (cos (* x 2.0)) (* t_0 t_0))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return cos((x * 2.0)) / (t_0 * t_0);
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = x * (c_m * s_m)
code = cos((x * 2.0d0)) / (t_0 * t_0)
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return Math.cos((x * 2.0)) / (t_0 * t_0);
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) return math.cos((x * 2.0)) / (t_0 * t_0)
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) return Float64(cos(Float64(x * 2.0)) / Float64(t_0 * t_0)) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = cos((x * 2.0)) / (t_0 * t_0);
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c_m \cdot s_m\right)\\
\frac{\cos \left(x \cdot 2\right)}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 67.6%
*-un-lft-identity67.6%
add-sqr-sqrt67.5%
times-frac67.5%
Applied egg-rr97.0%
*-commutative97.0%
frac-2neg97.0%
frac-2neg97.0%
metadata-eval97.0%
frac-times96.7%
*-commutative96.7%
*-commutative96.7%
associate-*r*96.2%
distribute-rgt-neg-in96.2%
*-commutative96.2%
associate-*r*98.7%
distribute-rgt-neg-in98.7%
Applied egg-rr98.7%
Final simplification98.7%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* (* c_m s_m) (* x (* c_m (* x s_m))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * (x * (c_m * (x * s_m))))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x * Float64(c_m * Float64(x * s_m))))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{\left(c_m \cdot s_m\right) \cdot \left(x \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\right)}
\end{array}
Initial program 67.6%
Taylor expanded in x around 0 53.4%
associate-/r*53.4%
*-commutative53.4%
unpow253.4%
unpow253.4%
swap-sqr65.0%
unpow265.0%
associate-/r*64.9%
unpow264.9%
unpow264.9%
swap-sqr76.5%
unpow276.5%
*-commutative76.5%
Simplified76.5%
unpow276.5%
associate-*r*76.5%
*-commutative76.5%
associate-*l*75.3%
Applied egg-rr75.3%
Final simplification75.3%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* c_m (* x s_m)))) (/ 1.0 (* t_0 t_0))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
return 1.0 / (t_0 * t_0);
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x * s_m)
code = 1.0d0 / (t_0 * t_0)
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
return 1.0 / (t_0 * t_0);
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = c_m * (x * s_m) return 1.0 / (t_0 * t_0)
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = c_m * (x * s_m);
tmp = 1.0 / (t_0 * t_0);
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x \cdot s_m\right)\\
\frac{1}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 67.6%
Taylor expanded in x around 0 53.4%
associate-/r*53.4%
*-commutative53.4%
unpow253.4%
unpow253.4%
swap-sqr65.0%
unpow265.0%
associate-/r*64.9%
unpow264.9%
unpow264.9%
swap-sqr76.5%
unpow276.5%
*-commutative76.5%
Simplified76.5%
*-commutative76.5%
unpow276.5%
Applied egg-rr76.5%
Final simplification76.5%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* x (* c_m s_m)))) (/ (/ 1.0 t_0) t_0)))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return (1.0 / t_0) / t_0;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = x * (c_m * s_m)
code = (1.0d0 / t_0) / t_0
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return (1.0 / t_0) / t_0;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) return (1.0 / t_0) / t_0
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) return Float64(Float64(1.0 / t_0) / t_0) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = (1.0 / t_0) / t_0;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c_m \cdot s_m\right)\\
\frac{\frac{1}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 67.6%
Taylor expanded in x around 0 53.4%
associate-/r*53.4%
*-commutative53.4%
unpow253.4%
unpow253.4%
swap-sqr65.0%
unpow265.0%
associate-/r*64.9%
unpow264.9%
unpow264.9%
swap-sqr76.5%
unpow276.5%
*-commutative76.5%
Simplified76.5%
unpow276.5%
associate-*r*76.5%
*-commutative76.5%
associate-*l*75.3%
Applied egg-rr75.3%
Applied egg-rr38.7%
Applied egg-rr77.8%
Final simplification77.8%
herbie shell --seed 2023337
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))