
(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 11 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 (* s_m (* x_m c_m))))
(if (<= x_m 8.8e-72)
(* (/ (/ (/ 1.0 x_m) s_m) c_m) (/ (/ t_0 (* x_m s_m)) c_m))
(/ (/ t_0 t_1) t_1))))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 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 8.8e-72) {
tmp = (((1.0 / x_m) / s_m) / c_m) * ((t_0 / (x_m * s_m)) / c_m);
} else {
tmp = (t_0 / t_1) / t_1;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
t_1 = s_m * (x_m * c_m)
if (x_m <= 8.8d-72) then
tmp = (((1.0d0 / x_m) / s_m) / c_m) * ((t_0 / (x_m * s_m)) / c_m)
else
tmp = (t_0 / t_1) / t_1
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 = Math.cos((x_m * 2.0));
double t_1 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 8.8e-72) {
tmp = (((1.0 / x_m) / s_m) / c_m) * ((t_0 / (x_m * s_m)) / c_m);
} else {
tmp = (t_0 / t_1) / t_1;
}
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 = math.cos((x_m * 2.0)) t_1 = s_m * (x_m * c_m) tmp = 0 if x_m <= 8.8e-72: tmp = (((1.0 / x_m) / s_m) / c_m) * ((t_0 / (x_m * s_m)) / c_m) else: tmp = (t_0 / t_1) / t_1 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 = Float64(s_m * Float64(x_m * c_m)) tmp = 0.0 if (x_m <= 8.8e-72) tmp = Float64(Float64(Float64(Float64(1.0 / x_m) / s_m) / c_m) * Float64(Float64(t_0 / Float64(x_m * s_m)) / c_m)); else tmp = Float64(Float64(t_0 / t_1) / t_1); 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 = cos((x_m * 2.0));
t_1 = s_m * (x_m * c_m);
tmp = 0.0;
if (x_m <= 8.8e-72)
tmp = (((1.0 / x_m) / s_m) / c_m) * ((t_0 / (x_m * s_m)) / c_m);
else
tmp = (t_0 / t_1) / t_1;
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[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 8.8e-72], N[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(N[(t$95$0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / t$95$1), $MachinePrecision] / t$95$1), $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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 8.8 \cdot 10^{-72}:\\
\;\;\;\;\frac{\frac{\frac{1}{x\_m}}{s\_m}}{c\_m} \cdot \frac{\frac{t\_0}{x\_m \cdot s\_m}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{t\_1}}{t\_1}\\
\end{array}
\end{array}
if x < 8.8000000000000001e-72Initial program 66.2%
associate-/l/66.3%
*-commutative66.3%
associate-*r*59.3%
unpow259.3%
associate-/r*59.3%
cos-neg59.3%
*-commutative59.3%
distribute-rgt-neg-in59.3%
metadata-eval59.3%
Simplified59.3%
associate-/l/59.3%
*-un-lft-identity59.3%
add-sqr-sqrt59.3%
times-frac59.3%
pow-prod-down59.3%
sqrt-pow139.2%
metadata-eval39.2%
pow139.2%
*-commutative39.2%
add-sqr-sqrt32.7%
sqrt-unprod30.7%
swap-sqr30.7%
metadata-eval30.7%
metadata-eval30.7%
swap-sqr30.7%
*-commutative30.7%
*-commutative30.7%
sqrt-unprod4.0%
add-sqr-sqrt39.2%
Applied egg-rr78.7%
unpow278.7%
times-frac97.5%
associate-/r*97.6%
*-commutative97.6%
Applied egg-rr97.6%
if 8.8000000000000001e-72 < x Initial program 71.1%
associate-/r*69.8%
*-commutative69.8%
unpow269.8%
sqr-neg69.8%
unpow269.8%
cos-neg69.8%
*-commutative69.8%
distribute-rgt-neg-in69.8%
metadata-eval69.8%
unpow269.8%
sqr-neg69.8%
unpow269.8%
associate-*r*62.1%
unpow262.1%
*-commutative62.1%
Simplified62.1%
Applied egg-rr97.2%
*-commutative97.2%
div-inv97.2%
div-inv97.2%
div-inv97.2%
*-commutative97.2%
*-commutative97.2%
*-commutative97.2%
associate-*l*95.8%
*-commutative95.8%
*-commutative95.8%
associate-*l*98.0%
Applied egg-rr98.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
(let* ((t_0 (* s_m (* x_m c_m))))
(if (<= x_m 1.5e-41)
(* (/ 1.0 (* c_m (* x_m s_m))) (* (/ (/ 1.0 x_m) s_m) (/ 1.0 c_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 <= 1.5e-41) {
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_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 <= 1.5d-41) then
tmp = (1.0d0 / (c_m * (x_m * s_m))) * (((1.0d0 / x_m) / s_m) * (1.0d0 / c_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 <= 1.5e-41) {
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_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 <= 1.5e-41: tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_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 <= 1.5e-41) tmp = Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(Float64(1.0 / x_m) / s_m) * Float64(1.0 / c_m))); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / t_0); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = s_m * (x_m * c_m);
tmp = 0.0;
if (x_m <= 1.5e-41)
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_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, 1.5e-41], N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] * N[(1.0 / c$95$m), $MachinePrecision]), $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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 1.5 \cdot 10^{-41}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \left(\frac{\frac{1}{x\_m}}{s\_m} \cdot \frac{1}{c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 1.49999999999999994e-41Initial program 65.5%
associate-/r*65.6%
*-commutative65.6%
unpow265.6%
sqr-neg65.6%
unpow265.6%
cos-neg65.6%
*-commutative65.6%
distribute-rgt-neg-in65.6%
metadata-eval65.6%
unpow265.6%
sqr-neg65.6%
unpow265.6%
associate-*r*58.9%
unpow258.9%
*-commutative58.9%
Simplified58.9%
Applied egg-rr97.6%
Taylor expanded in x around 0 89.5%
inv-pow89.5%
*-commutative89.5%
unpow-prod-down89.6%
inv-pow89.6%
associate-/r*89.6%
inv-pow89.6%
Applied egg-rr89.6%
if 1.49999999999999994e-41 < x Initial program 73.4%
associate-/r*72.0%
*-commutative72.0%
unpow272.0%
sqr-neg72.0%
unpow272.0%
cos-neg72.0%
*-commutative72.0%
distribute-rgt-neg-in72.0%
metadata-eval72.0%
unpow272.0%
sqr-neg72.0%
unpow272.0%
associate-*r*63.3%
unpow263.3%
*-commutative63.3%
Simplified63.3%
Applied egg-rr97.0%
*-commutative97.0%
div-inv97.1%
div-inv97.0%
div-inv97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
associate-*l*95.4%
*-commutative95.4%
*-commutative95.4%
associate-*l*98.0%
Applied egg-rr98.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
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 3.4e-71)
(* (/ 1.0 t_0) (* (/ (/ 1.0 x_m) s_m) (/ 1.0 c_m)))
(/ (/ (cos (* x_m 2.0)) t_0) (* s_m (* x_m c_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 3.4e-71) {
tmp = (1.0 / t_0) * (((1.0 / x_m) / s_m) * (1.0 / c_m));
} else {
tmp = (cos((x_m * 2.0)) / t_0) / (s_m * (x_m * c_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 3.4d-71) then
tmp = (1.0d0 / t_0) * (((1.0d0 / x_m) / s_m) * (1.0d0 / c_m))
else
tmp = (cos((x_m * 2.0d0)) / t_0) / (s_m * (x_m * c_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 3.4e-71) {
tmp = (1.0 / t_0) * (((1.0 / x_m) / s_m) * (1.0 / c_m));
} else {
tmp = (Math.cos((x_m * 2.0)) / t_0) / (s_m * (x_m * c_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 3.4e-71: tmp = (1.0 / t_0) * (((1.0 / x_m) / s_m) * (1.0 / c_m)) else: tmp = (math.cos((x_m * 2.0)) / t_0) / (s_m * (x_m * c_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 3.4e-71) tmp = Float64(Float64(1.0 / t_0) * Float64(Float64(Float64(1.0 / x_m) / s_m) * Float64(1.0 / c_m))); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / Float64(s_m * Float64(x_m * c_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 3.4e-71)
tmp = (1.0 / t_0) * (((1.0 / x_m) / s_m) * (1.0 / c_m));
else
tmp = (cos((x_m * 2.0)) / t_0) / (s_m * (x_m * c_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 3.4e-71], N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 3.4 \cdot 10^{-71}:\\
\;\;\;\;\frac{1}{t\_0} \cdot \left(\frac{\frac{1}{x\_m}}{s\_m} \cdot \frac{1}{c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 3.40000000000000003e-71Initial program 66.2%
associate-/r*66.2%
*-commutative66.2%
unpow266.2%
sqr-neg66.2%
unpow266.2%
cos-neg66.2%
*-commutative66.2%
distribute-rgt-neg-in66.2%
metadata-eval66.2%
unpow266.2%
sqr-neg66.2%
unpow266.2%
associate-*r*59.3%
unpow259.3%
*-commutative59.3%
Simplified59.3%
Applied egg-rr97.5%
Taylor expanded in x around 0 89.1%
inv-pow89.1%
*-commutative89.1%
unpow-prod-down89.1%
inv-pow89.1%
associate-/r*89.1%
inv-pow89.1%
Applied egg-rr89.1%
if 3.40000000000000003e-71 < x Initial program 71.1%
associate-/r*69.8%
*-commutative69.8%
unpow269.8%
sqr-neg69.8%
unpow269.8%
cos-neg69.8%
*-commutative69.8%
distribute-rgt-neg-in69.8%
metadata-eval69.8%
unpow269.8%
sqr-neg69.8%
unpow269.8%
associate-*r*62.1%
unpow262.1%
*-commutative62.1%
Simplified62.1%
Applied egg-rr97.2%
*-commutative97.2%
div-inv97.2%
div-inv97.2%
div-inv97.2%
*-commutative97.2%
*-commutative97.2%
*-commutative97.2%
associate-*l*95.8%
*-commutative95.8%
*-commutative95.8%
associate-*l*98.0%
Applied egg-rr98.0%
Taylor expanded in s around 0 95.8%
Final simplification91.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 2.6e+164) (/ (/ (cos (* x_m 2.0)) c_m) (* (* x_m s_m) (* s_m (* x_m c_m)))) (* (/ 1.0 (* c_m (* x_m s_m))) (* (/ (/ 1.0 x_m) s_m) (/ 1.0 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 (s_m <= 2.6e+164) {
tmp = (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
} else {
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / 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 (s_m <= 2.6d+164) then
tmp = (cos((x_m * 2.0d0)) / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)))
else
tmp = (1.0d0 / (c_m * (x_m * s_m))) * (((1.0d0 / x_m) / s_m) * (1.0d0 / 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 (s_m <= 2.6e+164) {
tmp = (Math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
} else {
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / 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 s_m <= 2.6e+164: tmp = (math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m))) else: tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / 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 (s_m <= 2.6e+164) tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / c_m) / Float64(Float64(x_m * s_m) * Float64(s_m * Float64(x_m * c_m)))); else tmp = Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(Float64(1.0 / x_m) / s_m) * Float64(1.0 / 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 (s_m <= 2.6e+164)
tmp = (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
else
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / 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[s$95$m, 2.6e+164], 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[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;s\_m \leq 2.6 \cdot 10^{+164}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \left(\frac{\frac{1}{x\_m}}{s\_m} \cdot \frac{1}{c\_m}\right)\\
\end{array}
\end{array}
if s < 2.5999999999999999e164Initial program 67.7%
associate-/r*67.4%
*-commutative67.4%
unpow267.4%
sqr-neg67.4%
unpow267.4%
cos-neg67.4%
*-commutative67.4%
distribute-rgt-neg-in67.4%
metadata-eval67.4%
unpow267.4%
sqr-neg67.4%
unpow267.4%
associate-*r*59.6%
unpow259.6%
*-commutative59.6%
Simplified59.6%
Applied egg-rr97.5%
*-commutative97.5%
associate-/r*97.6%
frac-times94.8%
div-inv94.8%
*-commutative94.8%
*-commutative94.8%
*-commutative94.8%
associate-*l*93.3%
Applied egg-rr93.3%
if 2.5999999999999999e164 < s Initial program 67.2%
associate-/r*67.2%
*-commutative67.2%
unpow267.2%
sqr-neg67.2%
unpow267.2%
cos-neg67.2%
*-commutative67.2%
distribute-rgt-neg-in67.2%
metadata-eval67.2%
unpow267.2%
sqr-neg67.2%
unpow267.2%
associate-*r*63.6%
unpow263.6%
*-commutative63.6%
Simplified63.6%
Applied egg-rr96.9%
Taylor expanded in x around 0 96.9%
inv-pow96.9%
*-commutative96.9%
unpow-prod-down96.8%
inv-pow96.8%
associate-/r*96.9%
inv-pow96.9%
Applied egg-rr96.9%
Final simplification93.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (cos (* x_m 2.0)) (* c_m (* x_m s_m))) (* x_m (* s_m c_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (cos((x_m * 2.0)) / (c_m * (x_m * s_m))) / (x_m * (s_m * c_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (cos((x_m * 2.0d0)) / (c_m * (x_m * s_m))) / (x_m * (s_m * c_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (Math.cos((x_m * 2.0)) / (c_m * (x_m * s_m))) / (x_m * (s_m * c_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (math.cos((x_m * 2.0)) / (c_m * (x_m * s_m))) / (x_m * (s_m * c_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(c_m * Float64(x_m * s_m))) / Float64(x_m * Float64(s_m * c_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (cos((x_m * 2.0)) / (c_m * (x_m * s_m))) / (x_m * (s_m * c_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{c\_m \cdot \left(x\_m \cdot s\_m\right)}}{x\_m \cdot \left(s\_m \cdot c\_m\right)}
\end{array}
Initial program 67.7%
associate-/l/67.7%
*-commutative67.7%
associate-*r*60.5%
unpow260.5%
associate-/r*60.5%
cos-neg60.5%
*-commutative60.5%
distribute-rgt-neg-in60.5%
metadata-eval60.5%
Simplified60.5%
associate-/l/60.5%
*-un-lft-identity60.5%
add-sqr-sqrt60.5%
times-frac60.5%
pow-prod-down60.5%
sqrt-pow144.2%
metadata-eval44.2%
pow144.2%
*-commutative44.2%
add-sqr-sqrt22.7%
sqrt-unprod29.6%
swap-sqr29.6%
metadata-eval29.6%
metadata-eval29.6%
swap-sqr29.6%
*-commutative29.6%
*-commutative29.6%
sqrt-unprod19.1%
add-sqr-sqrt44.2%
Applied egg-rr79.3%
div-inv78.9%
frac-times78.9%
*-un-lft-identity78.9%
pow278.9%
frac-times79.3%
unpow-prod-down96.9%
*-commutative96.9%
unpow296.9%
frac-times97.4%
*-commutative97.4%
associate-*r/97.4%
associate-*r*95.2%
times-frac92.3%
Applied egg-rr94.5%
frac-times97.3%
associate-*l/97.3%
*-un-lft-identity97.3%
associate-*r*95.2%
*-commutative95.2%
associate-/r*95.2%
associate-*r*97.5%
*-commutative97.5%
associate-*l*96.1%
Applied egg-rr96.1%
Taylor expanded in x around inf 96.1%
*-commutative96.1%
Simplified96.1%
Final simplification96.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (* (/ 1.0 (* c_m (* x_m s_m))) (* (/ (/ 1.0 x_m) s_m) (/ 1.0 c_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (1.0d0 / (c_m * (x_m * s_m))) * (((1.0d0 / x_m) / s_m) * (1.0d0 / c_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(Float64(1.0 / x_m) / s_m) * Float64(1.0 / c_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (1.0 / (c_m * (x_m * s_m))) * (((1.0 / x_m) / s_m) * (1.0 / c_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \left(\frac{\frac{1}{x\_m}}{s\_m} \cdot \frac{1}{c\_m}\right)
\end{array}
Initial program 67.7%
associate-/r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
cos-neg67.3%
*-commutative67.3%
distribute-rgt-neg-in67.3%
metadata-eval67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
associate-*r*60.1%
unpow260.1%
*-commutative60.1%
Simplified60.1%
Applied egg-rr97.4%
Taylor expanded in x around 0 84.0%
inv-pow84.0%
*-commutative84.0%
unpow-prod-down84.1%
inv-pow84.1%
associate-/r*84.1%
inv-pow84.1%
Applied egg-rr84.1%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = 1.0d0 / (c_m * (x_m * s_m))
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) return Float64(t_0 * t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = 1.0 / (c_m * (x_m * s_m));
tmp = t_0 * t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 67.7%
associate-/r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
cos-neg67.3%
*-commutative67.3%
distribute-rgt-neg-in67.3%
metadata-eval67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
associate-*r*60.1%
unpow260.1%
*-commutative60.1%
Simplified60.1%
Applied egg-rr97.4%
Taylor expanded in x around 0 84.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 (let* ((t_0 (* x_m (* s_m c_m)))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = x_m * (s_m * c_m)
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (s_m * c_m);
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (s_m * c_m) return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(s_m * c_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = x_m * (s_m * c_m);
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(s\_m \cdot c\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.7%
associate-/r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
cos-neg67.3%
*-commutative67.3%
distribute-rgt-neg-in67.3%
metadata-eval67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
associate-*r*60.1%
unpow260.1%
*-commutative60.1%
Simplified60.1%
Taylor expanded in x around 0 55.8%
associate-/r*55.4%
*-commutative55.4%
unpow255.4%
unpow255.4%
swap-sqr70.2%
unpow270.2%
associate-/r*70.7%
unpow270.7%
unpow270.7%
swap-sqr84.0%
unpow284.0%
Simplified84.0%
/-rgt-identity84.0%
clear-num84.0%
pow-flip84.0%
*-commutative84.0%
*-commutative84.0%
associate-*l*83.3%
metadata-eval83.3%
Applied egg-rr83.3%
pow-flip83.3%
metadata-eval83.3%
pow283.3%
associate-*r*82.6%
*-commutative82.6%
associate-*r*84.0%
*-commutative84.0%
associate-*l*83.0%
associate-*l*83.7%
Applied egg-rr83.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 (* s_m (* x_m c_m)))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = s_m * (x_m * c_m)
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = s_m * (x_m * c_m);
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.7%
associate-/r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
cos-neg67.3%
*-commutative67.3%
distribute-rgt-neg-in67.3%
metadata-eval67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
associate-*r*60.1%
unpow260.1%
*-commutative60.1%
Simplified60.1%
Taylor expanded in x around 0 55.8%
associate-/r*55.4%
*-commutative55.4%
unpow255.4%
unpow255.4%
swap-sqr70.2%
unpow270.2%
associate-/r*70.7%
unpow270.7%
unpow270.7%
swap-sqr84.0%
unpow284.0%
Simplified84.0%
unpow284.0%
*-commutative84.0%
*-commutative84.0%
*-commutative84.0%
associate-*l*82.6%
*-commutative82.6%
associate-*l*83.3%
Applied egg-rr83.3%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* x_m c_m) (* s_m (* s_m (* x_m c_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(s_m * Float64(x_m * c_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((x_m * c_m) * (s_m * (s_m * (x_m * c_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}
\end{array}
Initial program 67.7%
associate-/r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
cos-neg67.3%
*-commutative67.3%
distribute-rgt-neg-in67.3%
metadata-eval67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
associate-*r*60.1%
unpow260.1%
*-commutative60.1%
Simplified60.1%
Taylor expanded in x around 0 55.8%
associate-/r*55.4%
*-commutative55.4%
unpow255.4%
unpow255.4%
swap-sqr70.2%
unpow270.2%
associate-/r*70.7%
unpow270.7%
unpow270.7%
swap-sqr84.0%
unpow284.0%
Simplified84.0%
unpow284.0%
associate-*r*82.6%
associate-*l*80.7%
*-commutative80.7%
*-commutative80.7%
associate-*l*81.5%
Applied egg-rr81.5%
Final simplification81.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* s_m c_m) (* x_m (* s_m (* x_m c_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(s_m * Float64(x_m * c_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((s_m * c_m) * (x_m * (s_m * (x_m * c_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}
\end{array}
Initial program 67.7%
associate-/r*67.3%
*-commutative67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
cos-neg67.3%
*-commutative67.3%
distribute-rgt-neg-in67.3%
metadata-eval67.3%
unpow267.3%
sqr-neg67.3%
unpow267.3%
associate-*r*60.1%
unpow260.1%
*-commutative60.1%
Simplified60.1%
Taylor expanded in x around 0 55.8%
associate-/r*55.4%
*-commutative55.4%
unpow255.4%
unpow255.4%
swap-sqr70.2%
unpow270.2%
associate-/r*70.7%
unpow270.7%
unpow270.7%
swap-sqr84.0%
unpow284.0%
Simplified84.0%
/-rgt-identity84.0%
clear-num84.0%
associate-/r*84.0%
Applied egg-rr84.0%
*-commutative84.0%
associate-/r*84.0%
remove-double-div84.0%
associate-*r*83.7%
pow283.7%
associate-*r*83.0%
associate-*r*81.9%
associate-*r*80.4%
*-commutative80.4%
associate-*r*80.7%
Applied egg-rr80.7%
*-commutative80.7%
*-commutative80.7%
associate-*l*81.5%
*-commutative81.5%
Simplified81.5%
Final simplification81.5%
herbie shell --seed 2024180
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))