
(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 10 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 (cos (* x_m 2.0))) (t_1 (cbrt t_0)) (t_2 (* c_m (* x_m s_m))))
(if (<= x_m 1.8e+47)
(* (/ (pow t_1 2.0) t_2) (/ t_1 t_2))
(* (pow (/ -1.0 (* s_m (* x_m c_m))) 2.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 = cos((x_m * 2.0));
double t_1 = cbrt(t_0);
double t_2 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.8e+47) {
tmp = (pow(t_1, 2.0) / t_2) * (t_1 / t_2);
} else {
tmp = pow((-1.0 / (s_m * (x_m * c_m))), 2.0) * t_0;
}
return tmp;
}
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0));
double t_1 = Math.cbrt(t_0);
double t_2 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.8e+47) {
tmp = (Math.pow(t_1, 2.0) / t_2) * (t_1 / t_2);
} else {
tmp = Math.pow((-1.0 / (s_m * (x_m * c_m))), 2.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 = cos(Float64(x_m * 2.0)) t_1 = cbrt(t_0) t_2 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.8e+47) tmp = Float64(Float64((t_1 ^ 2.0) / t_2) * Float64(t_1 / t_2)); else tmp = Float64((Float64(-1.0 / Float64(s_m * Float64(x_m * c_m))) ^ 2.0) * t_0); end return tmp end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Power[t$95$0, 1/3], $MachinePrecision]}, Block[{t$95$2 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.8e+47], N[(N[(N[Power[t$95$1, 2.0], $MachinePrecision] / t$95$2), $MachinePrecision] * N[(t$95$1 / t$95$2), $MachinePrecision]), $MachinePrecision], N[(N[Power[N[(-1.0 / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.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 := \cos \left(x\_m \cdot 2\right)\\
t_1 := \sqrt[3]{t\_0}\\
t_2 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.8 \cdot 10^{+47}:\\
\;\;\;\;\frac{{t\_1}^{2}}{t\_2} \cdot \frac{t\_1}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{-1}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\right)}^{2} \cdot t\_0\\
\end{array}
\end{array}
if x < 1.80000000000000004e47Initial program 65.8%
add-cube-cbrt65.7%
add-sqr-sqrt65.7%
times-frac65.7%
Applied egg-rr96.0%
if 1.80000000000000004e47 < x Initial program 70.1%
*-un-lft-identity70.1%
add-sqr-sqrt70.0%
times-frac70.0%
sqrt-prod70.0%
sqrt-pow157.3%
metadata-eval57.3%
pow157.3%
*-commutative57.3%
associate-*r*57.2%
unpow257.2%
pow-prod-down57.3%
sqrt-pow160.9%
metadata-eval60.9%
pow160.9%
*-commutative60.9%
Applied egg-rr99.6%
*-commutative99.6%
frac-2neg99.6%
frac-2neg99.6%
metadata-eval99.6%
frac-times99.7%
*-commutative99.7%
associate-*r*96.3%
distribute-rgt-neg-in96.3%
associate-*r*96.2%
distribute-rgt-neg-in96.2%
Applied egg-rr96.2%
clear-num96.2%
inv-pow96.2%
Applied egg-rr97.1%
unpow-197.1%
associate-/r/97.1%
unpow297.1%
associate-/r*97.1%
metadata-eval97.1%
associate-*r/97.1%
associate-*l/97.0%
unpow297.0%
*-commutative97.0%
associate-*l*96.2%
Simplified96.2%
Final simplification96.0%
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 1e-24) (* (/ 1.0 (* c_m (* x_m s_m))) (/ (/ 1.0 c_m) (* x_m s_m))) (* (pow (/ -1.0 (* s_m (* x_m c_m))) 2.0) (cos (* x_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) {
double tmp;
if (x_m <= 1e-24) {
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m));
} else {
tmp = pow((-1.0 / (s_m * (x_m * c_m))), 2.0) * cos((x_m * 2.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) :: tmp
if (x_m <= 1d-24) then
tmp = (1.0d0 / (c_m * (x_m * s_m))) * ((1.0d0 / c_m) / (x_m * s_m))
else
tmp = (((-1.0d0) / (s_m * (x_m * c_m))) ** 2.0d0) * cos((x_m * 2.0d0))
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 <= 1e-24) {
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m));
} else {
tmp = Math.pow((-1.0 / (s_m * (x_m * c_m))), 2.0) * Math.cos((x_m * 2.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): tmp = 0 if x_m <= 1e-24: tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m)) else: tmp = math.pow((-1.0 / (s_m * (x_m * c_m))), 2.0) * math.cos((x_m * 2.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) tmp = 0.0 if (x_m <= 1e-24) tmp = Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(1.0 / c_m) / Float64(x_m * s_m))); else tmp = Float64((Float64(-1.0 / Float64(s_m * Float64(x_m * c_m))) ^ 2.0) * cos(Float64(x_m * 2.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)
tmp = 0.0;
if (x_m <= 1e-24)
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m));
else
tmp = ((-1.0 / (s_m * (x_m * c_m))) ^ 2.0) * cos((x_m * 2.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_] := If[LessEqual[x$95$m, 1e-24], N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Power[N[(-1.0 / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[Cos[N[(x$95$m * 2.0), $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 10^{-24}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;{\left(\frac{-1}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\right)}^{2} \cdot \cos \left(x\_m \cdot 2\right)\\
\end{array}
\end{array}
if x < 9.99999999999999924e-25Initial program 65.6%
*-un-lft-identity65.6%
add-sqr-sqrt65.5%
times-frac65.5%
sqrt-prod65.5%
sqrt-pow141.0%
metadata-eval41.0%
pow141.0%
*-commutative41.0%
associate-*r*37.3%
unpow237.3%
pow-prod-down41.1%
sqrt-pow143.5%
metadata-eval43.5%
pow143.5%
*-commutative43.5%
Applied egg-rr96.0%
Taylor expanded in x around 0 77.8%
associate-/r*77.8%
Simplified77.8%
if 9.99999999999999924e-25 < x Initial program 70.1%
*-un-lft-identity70.1%
add-sqr-sqrt70.1%
times-frac70.1%
sqrt-prod70.1%
sqrt-pow154.8%
metadata-eval54.8%
pow154.8%
*-commutative54.8%
associate-*r*54.7%
unpow254.7%
pow-prod-down54.8%
sqrt-pow159.3%
metadata-eval59.3%
pow159.3%
*-commutative59.3%
Applied egg-rr99.5%
*-commutative99.5%
frac-2neg99.5%
frac-2neg99.5%
metadata-eval99.5%
frac-times99.6%
*-commutative99.6%
associate-*r*96.8%
distribute-rgt-neg-in96.8%
associate-*r*96.7%
distribute-rgt-neg-in96.7%
Applied egg-rr96.7%
clear-num96.7%
inv-pow96.7%
Applied egg-rr97.5%
unpow-197.5%
associate-/r/97.5%
unpow297.5%
associate-/r*97.5%
metadata-eval97.5%
associate-*r/97.5%
associate-*l/97.4%
unpow297.4%
*-commutative97.4%
associate-*l*96.6%
Simplified96.6%
Final simplification82.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 (* s_m (* x_m c_m))))
(if (<= x_m 6e-37)
(* (/ 1.0 (* c_m (* x_m s_m))) (/ (/ 1.0 c_m) (* x_m s_m)))
(/ (cos (* x_m 2.0)) (* t_0 t_0)))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 6e-37) {
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m));
} else {
tmp = cos((x_m * 2.0)) / (t_0 * t_0);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = s_m * (x_m * c_m)
if (x_m <= 6d-37) then
tmp = (1.0d0 / (c_m * (x_m * s_m))) * ((1.0d0 / c_m) / (x_m * s_m))
else
tmp = cos((x_m * 2.0d0)) / (t_0 * t_0)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 6e-37) {
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m));
} else {
tmp = Math.cos((x_m * 2.0)) / (t_0 * t_0);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) tmp = 0 if x_m <= 6e-37: tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m)) else: tmp = math.cos((x_m * 2.0)) / (t_0 * t_0) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) tmp = 0.0 if (x_m <= 6e-37) tmp = Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(1.0 / c_m) / Float64(x_m * s_m))); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(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);
tmp = 0.0;
if (x_m <= 6e-37)
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) / (x_m * s_m));
else
tmp = cos((x_m * 2.0)) / (t_0 * t_0);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 6e-37], N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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)\\
\mathbf{if}\;x\_m \leq 6 \cdot 10^{-37}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 6e-37Initial program 65.3%
*-un-lft-identity65.3%
add-sqr-sqrt65.3%
times-frac65.3%
sqrt-prod65.3%
sqrt-pow140.8%
metadata-eval40.8%
pow140.8%
*-commutative40.8%
associate-*r*37.0%
unpow237.0%
pow-prod-down40.9%
sqrt-pow142.9%
metadata-eval42.9%
pow142.9%
*-commutative42.9%
Applied egg-rr95.9%
Taylor expanded in x around 0 77.3%
associate-/r*77.4%
Simplified77.4%
if 6e-37 < x Initial program 70.5%
*-un-lft-identity70.5%
add-sqr-sqrt70.4%
times-frac70.4%
sqrt-prod70.4%
sqrt-pow154.6%
metadata-eval54.6%
pow154.6%
*-commutative54.6%
associate-*r*54.5%
unpow254.5%
pow-prod-down54.6%
sqrt-pow160.2%
metadata-eval60.2%
pow160.2%
*-commutative60.2%
Applied egg-rr99.5%
*-commutative99.5%
frac-2neg99.5%
frac-2neg99.5%
metadata-eval99.5%
frac-times99.6%
*-commutative99.6%
associate-*r*96.9%
distribute-rgt-neg-in96.9%
associate-*r*96.9%
distribute-rgt-neg-in96.9%
Applied egg-rr96.9%
Final simplification82.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 (* (/ 1.0 (* c_m (* x_m s_m))) (* (/ 1.0 c_m) (/ (cos (* x_m 2.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) * (cos((x_m * 2.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) * (cos((x_m * 2.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) * (Math.cos((x_m * 2.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) * (math.cos((x_m * 2.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(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(1.0 / c_m) * Float64(cos(Float64(x_m * 2.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) * (cos((x_m * 2.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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \left(\frac{1}{c\_m} \cdot \frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot s\_m}\right)
\end{array}
Initial program 66.7%
*-un-lft-identity66.7%
add-sqr-sqrt66.6%
times-frac66.7%
sqrt-prod66.6%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*41.7%
unpow241.7%
pow-prod-down44.5%
sqrt-pow147.5%
metadata-eval47.5%
pow147.5%
*-commutative47.5%
Applied egg-rr96.9%
*-un-lft-identity96.9%
times-frac96.9%
*-commutative96.9%
Applied egg-rr96.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 (let* ((t_0 (* c_m (* x_m s_m)))) (/ (/ (cos (* x_m 2.0)) t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return (cos((x_m * 2.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 = (cos((x_m * 2.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 (Math.cos((x_m * 2.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 (math.cos((x_m * 2.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(cos(Float64(x_m * 2.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 = (cos((x_m * 2.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[(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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.7%
*-un-lft-identity66.7%
add-sqr-sqrt66.6%
times-frac66.7%
sqrt-prod66.6%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*41.7%
unpow241.7%
pow-prod-down44.5%
sqrt-pow147.5%
metadata-eval47.5%
pow147.5%
*-commutative47.5%
Applied egg-rr96.9%
associate-*l/96.9%
*-un-lft-identity96.9%
*-commutative96.9%
Applied egg-rr96.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (cos (* x_m 2.0)) c_m) (* (* x_m s_m) (* c_m (* x_m s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (cos((x_m * 2.0d0)) / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (Math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(cos(Float64(x_m * 2.0)) / c_m) / Float64(Float64(x_m * s_m) * Float64(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 = (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * 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{\cos \left(x\_m \cdot 2\right)}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 66.7%
*-un-lft-identity66.7%
add-sqr-sqrt66.6%
times-frac66.7%
sqrt-prod66.6%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*41.7%
unpow241.7%
pow-prod-down44.5%
sqrt-pow147.5%
metadata-eval47.5%
pow147.5%
*-commutative47.5%
Applied egg-rr96.9%
*-commutative96.9%
associate-/r*97.0%
frac-times94.7%
div-inv94.7%
*-commutative94.7%
Applied egg-rr94.7%
Final simplification94.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
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= s_m 1.1e+208)
(/ 1.0 (* (* x_m c_m) (* s_m t_0)))
(/ 1.0 (* (* c_m s_m) (* x_m 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);
double tmp;
if (s_m <= 1.1e+208) {
tmp = 1.0 / ((x_m * c_m) * (s_m * t_0));
} else {
tmp = 1.0 / ((c_m * s_m) * (x_m * t_0));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (s_m <= 1.1d+208) then
tmp = 1.0d0 / ((x_m * c_m) * (s_m * t_0))
else
tmp = 1.0d0 / ((c_m * s_m) * (x_m * 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 = c_m * (x_m * s_m);
double tmp;
if (s_m <= 1.1e+208) {
tmp = 1.0 / ((x_m * c_m) * (s_m * t_0));
} else {
tmp = 1.0 / ((c_m * s_m) * (x_m * 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 = c_m * (x_m * s_m) tmp = 0 if s_m <= 1.1e+208: tmp = 1.0 / ((x_m * c_m) * (s_m * t_0)) else: tmp = 1.0 / ((c_m * s_m) * (x_m * 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(c_m * Float64(x_m * s_m)) tmp = 0.0 if (s_m <= 1.1e+208) tmp = Float64(1.0 / Float64(Float64(x_m * c_m) * Float64(s_m * t_0))); else tmp = Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_m * 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 = c_m * (x_m * s_m);
tmp = 0.0;
if (s_m <= 1.1e+208)
tmp = 1.0 / ((x_m * c_m) * (s_m * t_0));
else
tmp = 1.0 / ((c_m * s_m) * (x_m * 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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[s$95$m, 1.1e+208], N[(1.0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;s\_m \leq 1.1 \cdot 10^{+208}:\\
\;\;\;\;\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot t\_0\right)}\\
\end{array}
\end{array}
if s < 1.10000000000000007e208Initial program 67.3%
Taylor expanded in x around 0 52.4%
associate-/r*51.9%
*-commutative51.9%
unpow251.9%
unpow251.9%
swap-sqr62.1%
unpow262.1%
associate-/r*62.6%
unpow262.6%
unpow262.6%
swap-sqr73.3%
unpow273.3%
*-commutative73.3%
Simplified73.3%
unpow-prod-down62.6%
*-commutative62.6%
unpow-prod-down73.3%
unpow273.3%
associate-*r*72.9%
associate-*l*72.7%
Applied egg-rr72.7%
if 1.10000000000000007e208 < s Initial program 54.8%
Taylor expanded in x around 0 46.5%
associate-/r*46.5%
*-commutative46.5%
unpow246.5%
unpow246.5%
swap-sqr77.4%
unpow277.4%
associate-/r*77.4%
unpow277.4%
unpow277.4%
swap-sqr84.9%
unpow284.9%
*-commutative84.9%
Simplified84.9%
unpow284.9%
associate-*r*77.8%
*-commutative77.8%
associate-*l*77.8%
Applied egg-rr77.8%
Final simplification72.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (* (/ 1.0 (* c_m (* x_m s_m))) (/ (/ 1.0 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))) * ((1.0 / 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))) * ((1.0d0 / 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))) * ((1.0 / 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))) * ((1.0 / 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(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(1.0 / 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))) * ((1.0 / 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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] / 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{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}
\end{array}
Initial program 66.7%
*-un-lft-identity66.7%
add-sqr-sqrt66.6%
times-frac66.7%
sqrt-prod66.6%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*41.7%
unpow241.7%
pow-prod-down44.5%
sqrt-pow147.5%
metadata-eval47.5%
pow147.5%
*-commutative47.5%
Applied egg-rr96.9%
Taylor expanded in x around 0 73.8%
associate-/r*73.9%
Simplified73.9%
Final simplification73.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 (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(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 = 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[(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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0 52.1%
associate-/r*51.6%
*-commutative51.6%
unpow251.6%
unpow251.6%
swap-sqr62.8%
unpow262.8%
associate-/r*63.3%
unpow263.3%
unpow263.3%
swap-sqr73.9%
unpow273.9%
*-commutative73.9%
Simplified73.9%
unpow-prod-down63.3%
*-commutative63.3%
unpow-prod-down73.9%
unpow273.9%
Applied egg-rr73.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* c_m s_m) (* x_m (* c_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_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 * s_m) * (x_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 * s_m) * (x_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 * s_m) * (x_m * (c_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_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 * s_m) * (x_m * (c_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0 52.1%
associate-/r*51.6%
*-commutative51.6%
unpow251.6%
unpow251.6%
swap-sqr62.8%
unpow262.8%
associate-/r*63.3%
unpow263.3%
unpow263.3%
swap-sqr73.9%
unpow273.9%
*-commutative73.9%
Simplified73.9%
unpow273.9%
associate-*r*72.4%
*-commutative72.4%
associate-*l*70.9%
Applied egg-rr70.9%
herbie shell --seed 2024089
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))