
(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 9 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 (if (<= x_m 22000.0) (* (/ (/ 1.0 c_m) (* x_m s_m)) (* (/ 1.0 c_m) (/ 1.0 (* x_m s_m)))) (/ (cos (* 2.0 x_m)) (* s_m (* (* x_m (* c_m s_m)) (* x_m c_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 22000.0) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
} else {
tmp = cos((2.0 * x_m)) / (s_m * ((x_m * (c_m * s_m)) * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 22000.0d0) then
tmp = ((1.0d0 / c_m) / (x_m * s_m)) * ((1.0d0 / c_m) * (1.0d0 / (x_m * s_m)))
else
tmp = cos((2.0d0 * x_m)) / (s_m * ((x_m * (c_m * s_m)) * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 22000.0) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
} else {
tmp = Math.cos((2.0 * x_m)) / (s_m * ((x_m * (c_m * s_m)) * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 22000.0: tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m))) else: tmp = math.cos((2.0 * x_m)) / (s_m * ((x_m * (c_m * s_m)) * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 22000.0) tmp = Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(Float64(1.0 / c_m) * Float64(1.0 / Float64(x_m * s_m)))); else tmp = Float64(cos(Float64(2.0 * x_m)) / Float64(s_m * Float64(Float64(x_m * Float64(c_m * 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 <= 22000.0)
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
else
tmp = cos((2.0 * x_m)) / (s_m * ((x_m * (c_m * s_m)) * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 22000.0], N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 22000:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m} \cdot \left(\frac{1}{c\_m} \cdot \frac{1}{x\_m \cdot s\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{s\_m \cdot \left(\left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right) \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 22000Initial program 65.8%
associate-/r*65.8%
cos-neg65.8%
distribute-rgt-neg-out65.8%
distribute-rgt-neg-out65.8%
*-commutative65.8%
distribute-rgt-neg-in65.8%
metadata-eval65.8%
*-commutative65.8%
associate-*l*60.6%
unpow260.6%
Simplified60.6%
Taylor expanded in x around 0 55.4%
associate-/r*55.4%
*-commutative55.4%
unpow255.4%
unpow255.4%
swap-sqr69.3%
unpow269.3%
associate-/r*69.3%
unpow269.3%
unpow269.3%
swap-sqr84.3%
unpow284.3%
*-commutative84.3%
associate-*l*84.9%
Simplified84.9%
associate-*r*84.3%
*-commutative84.3%
add-sqr-sqrt84.2%
sqrt-div84.2%
metadata-eval84.2%
*-commutative84.2%
associate-*r*82.1%
unpow282.1%
sqrt-prod48.1%
add-sqr-sqrt56.6%
*-commutative56.6%
sqrt-div56.6%
metadata-eval56.6%
*-commutative56.6%
associate-*r*58.5%
unpow258.5%
sqrt-prod43.7%
add-sqr-sqrt85.0%
*-commutative85.0%
Applied egg-rr85.0%
*-commutative85.0%
associate-*r*82.2%
associate-/r*82.2%
div-inv82.2%
*-commutative82.2%
*-commutative82.2%
Applied egg-rr82.2%
Taylor expanded in x around 0 84.4%
associate-/r*84.4%
Simplified84.4%
if 22000 < x Initial program 72.4%
add-sqr-sqrt72.4%
pow272.4%
sqrt-prod72.4%
sqrt-pow181.7%
metadata-eval81.7%
pow181.7%
sqrt-prod85.3%
*-commutative85.3%
sqrt-prod88.8%
sqrt-pow199.6%
metadata-eval99.6%
pow199.6%
associate-*r*99.6%
add-sqr-sqrt99.7%
*-commutative99.7%
Applied egg-rr99.7%
unpow299.7%
*-commutative99.7%
associate-*r*99.7%
associate-*r*98.1%
associate-*r*96.4%
*-commutative96.4%
*-commutative96.4%
Applied egg-rr96.4%
Final simplification86.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 (* 2.0 x_m)) (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 cos((2.0 * x_m)) * 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 = cos((2.0d0 * x_m)) * ((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.cos((2.0 * x_m)) * 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.cos((2.0 * x_m)) * 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(cos(Float64(2.0 * x_m)) * (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 = cos((2.0 * x_m)) * ((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[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] * N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\cos \left(2 \cdot x\_m\right) \cdot {\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}
\end{array}
Initial program 67.2%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
sqrt-prod39.1%
*-commutative39.1%
sqrt-prod40.0%
sqrt-pow146.6%
metadata-eval46.6%
pow146.6%
associate-*r*46.6%
add-sqr-sqrt96.6%
*-commutative96.6%
Applied egg-rr96.6%
div-inv96.6%
*-commutative96.6%
associate-*r*97.4%
pow-flip97.5%
*-commutative97.5%
metadata-eval97.5%
Applied egg-rr97.5%
*-commutative97.5%
associate-*r*96.7%
Simplified96.7%
Final simplification96.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 8e-80) (* (/ (/ 1.0 c_m) (* x_m s_m)) (* (/ 1.0 c_m) (/ 1.0 (* x_m s_m)))) (/ (cos (* 2.0 x_m)) (* (* c_m s_m) (* x_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) {
double tmp;
if (x_m <= 8e-80) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
} else {
tmp = cos((2.0 * x_m)) / ((c_m * s_m) * (x_m * (x_m * (c_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 <= 8d-80) then
tmp = ((1.0d0 / c_m) / (x_m * s_m)) * ((1.0d0 / c_m) * (1.0d0 / (x_m * s_m)))
else
tmp = cos((2.0d0 * x_m)) / ((c_m * s_m) * (x_m * (x_m * (c_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 <= 8e-80) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
} else {
tmp = Math.cos((2.0 * x_m)) / ((c_m * s_m) * (x_m * (x_m * (c_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 <= 8e-80: tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m))) else: tmp = math.cos((2.0 * x_m)) / ((c_m * s_m) * (x_m * (x_m * (c_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 <= 8e-80) tmp = Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(Float64(1.0 / c_m) * Float64(1.0 / Float64(x_m * s_m)))); else tmp = Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(x_m * Float64(c_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 <= 8e-80)
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
else
tmp = cos((2.0 * x_m)) / ((c_m * s_m) * (x_m * (x_m * (c_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, 8e-80], N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[(c$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])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 8 \cdot 10^{-80}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m} \cdot \left(\frac{1}{c\_m} \cdot \frac{1}{x\_m \cdot s\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 7.99999999999999969e-80Initial program 62.8%
associate-/r*62.8%
cos-neg62.8%
distribute-rgt-neg-out62.8%
distribute-rgt-neg-out62.8%
*-commutative62.8%
distribute-rgt-neg-in62.8%
metadata-eval62.8%
*-commutative62.8%
associate-*l*56.9%
unpow256.9%
Simplified56.9%
Taylor expanded in x around 0 51.0%
associate-/r*51.0%
*-commutative51.0%
unpow251.0%
unpow251.0%
swap-sqr66.7%
unpow266.7%
associate-/r*66.7%
unpow266.7%
unpow266.7%
swap-sqr82.2%
unpow282.2%
*-commutative82.2%
associate-*l*83.0%
Simplified83.0%
associate-*r*82.2%
*-commutative82.2%
add-sqr-sqrt82.2%
sqrt-div82.2%
metadata-eval82.2%
*-commutative82.2%
associate-*r*79.8%
unpow279.8%
sqrt-prod47.9%
add-sqr-sqrt55.3%
*-commutative55.3%
sqrt-div55.3%
metadata-eval55.3%
*-commutative55.3%
associate-*r*57.4%
unpow257.4%
sqrt-prod43.4%
add-sqr-sqrt83.1%
*-commutative83.1%
Applied egg-rr83.1%
*-commutative83.1%
associate-*r*79.9%
associate-/r*79.9%
div-inv79.9%
*-commutative79.9%
*-commutative79.9%
Applied egg-rr79.9%
Taylor expanded in x around 0 82.4%
associate-/r*82.4%
Simplified82.4%
if 7.99999999999999969e-80 < x Initial program 77.4%
add-sqr-sqrt77.3%
pow277.3%
sqrt-prod77.4%
sqrt-pow186.1%
metadata-eval86.1%
pow186.1%
sqrt-prod88.5%
*-commutative88.5%
sqrt-prod90.9%
sqrt-pow199.4%
metadata-eval99.4%
pow199.4%
associate-*r*99.5%
add-sqr-sqrt99.7%
*-commutative99.7%
Applied egg-rr99.7%
*-commutative99.7%
associate-*r*99.6%
unpow299.6%
associate-*r*98.4%
*-commutative98.4%
*-commutative98.4%
Applied egg-rr98.4%
Final simplification87.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 (<= s_m 5.3e+194) (/ (cos (* 2.0 x_m)) (* (* x_m c_m) (* s_m (* x_m (* c_m s_m))))) (* (/ (/ 1.0 c_m) (* x_m s_m)) (* (/ 1.0 c_m) (/ 1.0 (* 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 (s_m <= 5.3e+194) {
tmp = cos((2.0 * x_m)) / ((x_m * c_m) * (s_m * (x_m * (c_m * s_m))));
} else {
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (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 (s_m <= 5.3d+194) then
tmp = cos((2.0d0 * x_m)) / ((x_m * c_m) * (s_m * (x_m * (c_m * s_m))))
else
tmp = ((1.0d0 / c_m) / (x_m * s_m)) * ((1.0d0 / c_m) * (1.0d0 / (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 (s_m <= 5.3e+194) {
tmp = Math.cos((2.0 * x_m)) / ((x_m * c_m) * (s_m * (x_m * (c_m * s_m))));
} else {
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (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 s_m <= 5.3e+194: tmp = math.cos((2.0 * x_m)) / ((x_m * c_m) * (s_m * (x_m * (c_m * s_m)))) else: tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (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 (s_m <= 5.3e+194) tmp = Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * Float64(c_m * s_m))))); else tmp = Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(Float64(1.0 / c_m) * Float64(1.0 / Float64(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 (s_m <= 5.3e+194)
tmp = cos((2.0 * x_m)) / ((x_m * c_m) * (s_m * (x_m * (c_m * s_m))));
else
tmp = ((1.0 / c_m) / (x_m * s_m)) * ((1.0 / c_m) * (1.0 / (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[s$95$m, 5.3e+194], N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;s\_m \leq 5.3 \cdot 10^{+194}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m} \cdot \left(\frac{1}{c\_m} \cdot \frac{1}{x\_m \cdot s\_m}\right)\\
\end{array}
\end{array}
if s < 5.30000000000000005e194Initial program 66.7%
add-sqr-sqrt66.7%
pow266.7%
sqrt-prod66.7%
sqrt-pow174.5%
metadata-eval74.5%
pow174.5%
sqrt-prod38.7%
*-commutative38.7%
sqrt-prod39.6%
sqrt-pow145.7%
metadata-eval45.7%
pow145.7%
associate-*r*45.7%
add-sqr-sqrt96.4%
*-commutative96.4%
Applied egg-rr96.4%
unpow296.4%
associate-*r*95.3%
*-commutative95.3%
associate-*r*96.9%
associate-*l*93.0%
*-commutative93.0%
*-commutative93.0%
Applied egg-rr93.0%
if 5.30000000000000005e194 < s Initial program 72.4%
associate-/r*72.4%
cos-neg72.4%
distribute-rgt-neg-out72.4%
distribute-rgt-neg-out72.4%
*-commutative72.4%
distribute-rgt-neg-in72.4%
metadata-eval72.4%
*-commutative72.4%
associate-*l*66.6%
unpow266.6%
Simplified66.6%
Taylor expanded in x around 0 66.6%
associate-/r*66.6%
*-commutative66.6%
unpow266.6%
unpow266.6%
swap-sqr86.0%
unpow286.0%
associate-/r*85.8%
unpow285.8%
unpow285.8%
swap-sqr99.6%
unpow299.6%
*-commutative99.6%
associate-*l*91.1%
Simplified91.1%
associate-*r*99.6%
*-commutative99.6%
add-sqr-sqrt99.5%
sqrt-div99.5%
metadata-eval99.5%
*-commutative99.5%
associate-*r*91.1%
unpow291.1%
sqrt-prod52.4%
add-sqr-sqrt81.8%
*-commutative81.8%
sqrt-div81.8%
metadata-eval81.8%
*-commutative81.8%
associate-*r*81.8%
unpow281.8%
sqrt-prod52.4%
add-sqr-sqrt91.2%
*-commutative91.2%
Applied egg-rr91.2%
*-commutative91.2%
associate-*r*91.2%
associate-/r*91.2%
div-inv91.3%
*-commutative91.3%
*-commutative91.3%
Applied egg-rr91.3%
Taylor expanded in x around 0 99.9%
associate-/r*99.9%
Simplified99.9%
Final simplification93.6%
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)))) (/ (/ (cos (* 2.0 x_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 = c_m * (x_m * s_m);
return (cos((2.0 * x_m)) / 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 = (cos((2.0d0 * x_m)) / 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 (Math.cos((2.0 * x_m)) / 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 (math.cos((2.0 * x_m)) / 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(c_m * Float64(x_m * s_m)) return Float64(Float64(cos(Float64(2.0 * x_m)) / 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 = (cos((2.0 * x_m)) / 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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Cos[N[(2.0 * x$95$m), $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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{\frac{\cos \left(2 \cdot x\_m\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 67.2%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
sqrt-prod39.1%
*-commutative39.1%
sqrt-prod40.0%
sqrt-pow146.6%
metadata-eval46.6%
pow146.6%
associate-*r*46.6%
add-sqr-sqrt96.6%
*-commutative96.6%
Applied egg-rr96.6%
div-inv96.6%
*-commutative96.6%
associate-*r*97.4%
pow-flip97.5%
*-commutative97.5%
metadata-eval97.5%
Applied egg-rr97.5%
*-commutative97.5%
associate-*r*96.7%
Simplified96.7%
associate-*r*97.5%
*-commutative97.5%
metadata-eval97.5%
pow-div97.4%
inv-pow97.4%
pow197.4%
associate-*r/97.4%
un-div-inv97.4%
*-commutative97.4%
associate-*r*94.6%
*-commutative94.6%
*-commutative94.6%
associate-*r*96.7%
*-commutative96.7%
Applied egg-rr96.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (* (/ (/ 1.0 c_m) (* x_m s_m)) (* (/ 1.0 c_m) (/ 1.0 (* 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)) * ((1.0 / c_m) * (1.0 / (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)) * ((1.0d0 / c_m) * (1.0d0 / (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)) * ((1.0 / c_m) * (1.0 / (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)) * ((1.0 / c_m) * (1.0 / (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(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(Float64(1.0 / c_m) * Float64(1.0 / 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)) * ((1.0 / c_m) * (1.0 / (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[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * s$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{\frac{1}{c\_m}}{x\_m \cdot s\_m} \cdot \left(\frac{1}{c\_m} \cdot \frac{1}{x\_m \cdot s\_m}\right)
\end{array}
Initial program 67.2%
associate-/r*67.2%
cos-neg67.2%
distribute-rgt-neg-out67.2%
distribute-rgt-neg-out67.2%
*-commutative67.2%
distribute-rgt-neg-in67.2%
metadata-eval67.2%
*-commutative67.2%
associate-*l*60.7%
unpow260.7%
Simplified60.7%
Taylor expanded in x around 0 55.6%
associate-/r*55.6%
*-commutative55.6%
unpow255.6%
unpow255.6%
swap-sqr68.3%
unpow268.3%
associate-/r*68.3%
unpow268.3%
unpow268.3%
swap-sqr81.3%
unpow281.3%
*-commutative81.3%
associate-*l*81.9%
Simplified81.9%
associate-*r*81.3%
*-commutative81.3%
add-sqr-sqrt81.3%
sqrt-div81.3%
metadata-eval81.3%
*-commutative81.3%
associate-*r*79.6%
unpow279.6%
sqrt-prod47.3%
add-sqr-sqrt59.4%
*-commutative59.4%
sqrt-div59.4%
metadata-eval59.4%
*-commutative59.4%
associate-*r*60.9%
unpow260.9%
sqrt-prod44.2%
add-sqr-sqrt81.9%
*-commutative81.9%
Applied egg-rr81.9%
*-commutative81.9%
associate-*r*79.7%
associate-/r*79.7%
div-inv79.7%
*-commutative79.7%
*-commutative79.7%
Applied egg-rr79.7%
Taylor expanded in x around 0 81.4%
associate-/r*81.4%
Simplified81.4%
Final simplification81.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(Float64(Float64(1.0 / c_m) / 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[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * N[(x$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}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 67.2%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
sqrt-prod39.1%
*-commutative39.1%
sqrt-prod40.0%
sqrt-pow146.6%
metadata-eval46.6%
pow146.6%
associate-*r*46.6%
add-sqr-sqrt96.6%
*-commutative96.6%
Applied egg-rr96.6%
div-inv96.6%
*-commutative96.6%
associate-*r*97.4%
pow-flip97.5%
*-commutative97.5%
metadata-eval97.5%
Applied egg-rr97.5%
*-commutative97.5%
associate-*r*96.7%
Simplified96.7%
associate-*r*97.5%
*-commutative97.5%
metadata-eval97.5%
pow-div97.4%
inv-pow97.4%
pow197.4%
associate-*r/97.4%
un-div-inv97.4%
*-commutative97.4%
associate-*r*94.6%
*-commutative94.6%
*-commutative94.6%
associate-*r*96.7%
*-commutative96.7%
Applied egg-rr96.7%
Taylor expanded in x around 0 81.4%
associate-/r*81.4%
Simplified81.4%
Final simplification81.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 (* 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(c_m * Float64(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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 67.2%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
sqrt-prod39.1%
*-commutative39.1%
sqrt-prod40.0%
sqrt-pow146.6%
metadata-eval46.6%
pow146.6%
associate-*r*46.6%
add-sqr-sqrt96.6%
*-commutative96.6%
Applied egg-rr96.6%
div-inv96.6%
*-commutative96.6%
associate-*r*97.4%
pow-flip97.5%
*-commutative97.5%
metadata-eval97.5%
Applied egg-rr97.5%
*-commutative97.5%
associate-*r*96.7%
Simplified96.7%
associate-*r*97.5%
*-commutative97.5%
metadata-eval97.5%
pow-div97.4%
inv-pow97.4%
pow197.4%
associate-*r/97.4%
un-div-inv97.4%
*-commutative97.4%
associate-*r*94.6%
*-commutative94.6%
*-commutative94.6%
associate-*r*96.7%
*-commutative96.7%
Applied egg-rr96.7%
Taylor expanded in x around 0 81.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 s_m) (* x_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 * s_m) * (x_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 * s_m) * (x_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 * s_m) * (x_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 * s_m) * (x_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(1.0 / Float64(Float64(c_m * s_m) * Float64(x_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 * s_m) * (x_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[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[(c$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}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 67.2%
add-sqr-sqrt67.1%
pow267.1%
sqrt-prod67.1%
sqrt-pow175.1%
metadata-eval75.1%
pow175.1%
sqrt-prod39.1%
*-commutative39.1%
sqrt-prod40.0%
sqrt-pow146.6%
metadata-eval46.6%
pow146.6%
associate-*r*46.6%
add-sqr-sqrt96.6%
*-commutative96.6%
Applied egg-rr96.6%
*-commutative96.6%
associate-*r*97.4%
unpow297.4%
associate-*r*94.8%
*-commutative94.8%
*-commutative94.8%
Applied egg-rr94.8%
Taylor expanded in x around 0 80.0%
Final simplification80.0%
herbie shell --seed 2024146
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))