
(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))))
(if (<= x_m 220.0)
(* t_0 (/ (/ (/ 1.0 c_m) (* x_m s_m)) (* c_m (* x_m s_m))))
(* t_0 (pow (* s_m (* x_m c_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 t_0 = cos((x_m * 2.0));
double tmp;
if (x_m <= 220.0) {
tmp = t_0 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)));
} else {
tmp = t_0 * pow((s_m * (x_m * c_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) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 220.0d0) then
tmp = t_0 * (((1.0d0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)))
else
tmp = t_0 * ((s_m * (x_m * c_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 t_0 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 220.0) {
tmp = t_0 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)));
} else {
tmp = t_0 * Math.pow((s_m * (x_m * c_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): t_0 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 220.0: tmp = t_0 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m))) else: tmp = t_0 * math.pow((s_m * (x_m * c_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) t_0 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 220.0) tmp = Float64(t_0 * Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) / Float64(c_m * Float64(x_m * s_m)))); else tmp = Float64(t_0 * (Float64(s_m * Float64(x_m * c_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)
t_0 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 220.0)
tmp = t_0 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)));
else
tmp = t_0 * ((s_m * (x_m * c_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_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 220.0], N[(t$95$0 * 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]), $MachinePrecision], N[(t$95$0 * N[Power[N[(s$95$m * N[(x$95$m * c$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])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 220:\\
\;\;\;\;t\_0 \cdot \frac{\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot {\left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}^{-2}\\
\end{array}
\end{array}
if x < 220Initial program 67.4%
*-un-lft-identity67.4%
add-sqr-sqrt67.4%
times-frac67.3%
sqrt-prod67.4%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*38.9%
unpow238.9%
pow-prod-down44.5%
sqrt-pow146.0%
metadata-eval46.0%
pow146.0%
*-commutative46.0%
Applied egg-rr95.9%
Taylor expanded in c around 0 60.6%
*-commutative60.6%
associate-*r*61.2%
unpow261.2%
unpow261.2%
swap-sqr72.4%
unpow272.4%
swap-sqr97.2%
associate-*r*93.7%
*-commutative93.7%
associate-*r*95.9%
*-commutative95.9%
unpow295.9%
*-rgt-identity95.9%
associate-/l*95.9%
unpow295.9%
associate-/l/96.0%
*-lft-identity96.0%
associate-*l/95.9%
Simplified92.7%
associate-*r*96.0%
metadata-eval96.0%
pow-sqr95.9%
unpow-prod-down95.9%
associate-*l*89.8%
inv-pow89.8%
associate-*l*95.9%
associate-/r*96.0%
*-commutative96.0%
associate-/l/96.0%
Applied egg-rr96.0%
if 220 < x Initial program 64.7%
*-un-lft-identity64.7%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.7%
sqrt-pow154.0%
metadata-eval54.0%
pow154.0%
*-commutative54.0%
associate-*r*50.7%
unpow250.7%
pow-prod-down54.1%
sqrt-pow153.7%
metadata-eval53.7%
pow153.7%
*-commutative53.7%
Applied egg-rr98.3%
Taylor expanded in c around 0 57.2%
*-commutative57.2%
associate-*r*57.6%
unpow257.6%
unpow257.6%
swap-sqr75.1%
unpow275.1%
swap-sqr95.8%
associate-*r*94.7%
*-commutative94.7%
associate-*r*98.3%
*-commutative98.3%
unpow298.3%
*-rgt-identity98.3%
associate-/l*98.3%
unpow298.3%
associate-/l/98.3%
*-lft-identity98.3%
associate-*l/98.2%
Simplified93.4%
Final simplification95.3%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* s_m (* x_m c_m))) (t_1 (cos (* x_m 2.0))))
(if (<= x_m 240.0)
(* t_1 (/ (/ (/ 1.0 c_m) (* x_m s_m)) (* c_m (* x_m s_m))))
(/ (/ t_1 t_0) t_0))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (x_m <= 240.0) {
tmp = t_1 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)));
} else {
tmp = (t_1 / t_0) / t_0;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = s_m * (x_m * c_m)
t_1 = cos((x_m * 2.0d0))
if (x_m <= 240.0d0) then
tmp = t_1 * (((1.0d0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)))
else
tmp = (t_1 / t_0) / t_0
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 240.0) {
tmp = t_1 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)));
} else {
tmp = (t_1 / t_0) / t_0;
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 240.0: tmp = t_1 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m))) else: tmp = (t_1 / t_0) / t_0 return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 240.0) tmp = Float64(t_1 * Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) / Float64(c_m * Float64(x_m * s_m)))); else tmp = Float64(Float64(t_1 / t_0) / t_0); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = s_m * (x_m * c_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 240.0)
tmp = t_1 * (((1.0 / c_m) / (x_m * s_m)) / (c_m * (x_m * s_m)));
else
tmp = (t_1 / t_0) / t_0;
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 240.0], N[(t$95$1 * 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]), $MachinePrecision], N[(N[(t$95$1 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 240:\\
\;\;\;\;t\_1 \cdot \frac{\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 240Initial program 67.4%
*-un-lft-identity67.4%
add-sqr-sqrt67.4%
times-frac67.3%
sqrt-prod67.4%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*38.9%
unpow238.9%
pow-prod-down44.5%
sqrt-pow146.0%
metadata-eval46.0%
pow146.0%
*-commutative46.0%
Applied egg-rr95.9%
Taylor expanded in c around 0 60.6%
*-commutative60.6%
associate-*r*61.2%
unpow261.2%
unpow261.2%
swap-sqr72.4%
unpow272.4%
swap-sqr97.2%
associate-*r*93.7%
*-commutative93.7%
associate-*r*95.9%
*-commutative95.9%
unpow295.9%
*-rgt-identity95.9%
associate-/l*95.9%
unpow295.9%
associate-/l/96.0%
*-lft-identity96.0%
associate-*l/95.9%
Simplified92.7%
associate-*r*96.0%
metadata-eval96.0%
pow-sqr95.9%
unpow-prod-down95.9%
associate-*l*89.8%
inv-pow89.8%
associate-*l*95.9%
associate-/r*96.0%
*-commutative96.0%
associate-/l/96.0%
Applied egg-rr96.0%
if 240 < x Initial program 64.7%
*-un-lft-identity64.7%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.7%
sqrt-pow154.0%
metadata-eval54.0%
pow154.0%
*-commutative54.0%
associate-*r*50.7%
unpow250.7%
pow-prod-down54.1%
sqrt-pow153.7%
metadata-eval53.7%
pow153.7%
*-commutative53.7%
Applied egg-rr98.3%
Taylor expanded in c around 0 57.2%
*-commutative57.2%
associate-*r*57.6%
unpow257.6%
unpow257.6%
swap-sqr75.1%
unpow275.1%
swap-sqr95.8%
associate-*r*94.7%
*-commutative94.7%
associate-*r*98.3%
*-commutative98.3%
unpow298.3%
*-rgt-identity98.3%
associate-/l*98.3%
unpow298.3%
associate-/l/98.3%
*-lft-identity98.3%
associate-*l/98.2%
Simplified93.4%
associate-*r*98.3%
metadata-eval98.3%
pow-sqr98.2%
unpow-prod-down98.3%
associate-*l*90.4%
inv-pow90.4%
associate-*l*98.3%
associate-/r*98.3%
*-commutative98.3%
associate-/l/98.4%
Applied egg-rr98.4%
associate-*r/98.3%
associate-/l/98.2%
*-commutative98.2%
div-inv98.3%
associate-*r*92.2%
*-commutative92.2%
associate-*r*93.3%
*-commutative93.3%
Applied egg-rr93.3%
Final simplification95.3%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* s_m (* x_m c_m))) (t_1 (cos (* x_m 2.0))))
(if (<= x_m 155.0)
(/ (/ t_1 c_m) (* (* x_m s_m) (* c_m (* x_m s_m))))
(/ (/ t_1 t_0) t_0))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (x_m <= 155.0) {
tmp = (t_1 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
} else {
tmp = (t_1 / t_0) / t_0;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = s_m * (x_m * c_m)
t_1 = cos((x_m * 2.0d0))
if (x_m <= 155.0d0) then
tmp = (t_1 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)))
else
tmp = (t_1 / t_0) / t_0
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = s_m * (x_m * c_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 155.0) {
tmp = (t_1 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
} else {
tmp = (t_1 / t_0) / t_0;
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = s_m * (x_m * c_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 155.0: tmp = (t_1 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m))) else: tmp = (t_1 / t_0) / t_0 return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(s_m * Float64(x_m * c_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 155.0) tmp = Float64(Float64(t_1 / c_m) / Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m)))); else tmp = Float64(Float64(t_1 / t_0) / t_0); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = s_m * (x_m * c_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 155.0)
tmp = (t_1 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
else
tmp = (t_1 / t_0) / t_0;
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 155.0], N[(N[(t$95$1 / 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], N[(N[(t$95$1 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 155:\\
\;\;\;\;\frac{\frac{t\_1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 155Initial program 67.4%
*-un-lft-identity67.4%
add-sqr-sqrt67.4%
times-frac67.3%
sqrt-prod67.4%
sqrt-pow144.5%
metadata-eval44.5%
pow144.5%
*-commutative44.5%
associate-*r*38.9%
unpow238.9%
pow-prod-down44.5%
sqrt-pow146.0%
metadata-eval46.0%
pow146.0%
*-commutative46.0%
Applied egg-rr95.9%
associate-/r*96.0%
frac-times94.0%
*-un-lft-identity94.0%
*-commutative94.0%
Applied egg-rr94.0%
if 155 < x Initial program 64.7%
*-un-lft-identity64.7%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.7%
sqrt-pow154.0%
metadata-eval54.0%
pow154.0%
*-commutative54.0%
associate-*r*50.7%
unpow250.7%
pow-prod-down54.1%
sqrt-pow153.7%
metadata-eval53.7%
pow153.7%
*-commutative53.7%
Applied egg-rr98.3%
Taylor expanded in c around 0 57.2%
*-commutative57.2%
associate-*r*57.6%
unpow257.6%
unpow257.6%
swap-sqr75.1%
unpow275.1%
swap-sqr95.8%
associate-*r*94.7%
*-commutative94.7%
associate-*r*98.3%
*-commutative98.3%
unpow298.3%
*-rgt-identity98.3%
associate-/l*98.3%
unpow298.3%
associate-/l/98.3%
*-lft-identity98.3%
associate-*l/98.2%
Simplified93.4%
associate-*r*98.3%
metadata-eval98.3%
pow-sqr98.2%
unpow-prod-down98.3%
associate-*l*90.4%
inv-pow90.4%
associate-*l*98.3%
associate-/r*98.3%
*-commutative98.3%
associate-/l/98.4%
Applied egg-rr98.4%
associate-*r/98.3%
associate-/l/98.2%
*-commutative98.2%
div-inv98.3%
associate-*r*92.2%
*-commutative92.2%
associate-*r*93.3%
*-commutative93.3%
Applied egg-rr93.3%
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 (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.6%
*-un-lft-identity66.6%
add-sqr-sqrt66.6%
times-frac66.6%
sqrt-prod66.6%
sqrt-pow147.3%
metadata-eval47.3%
pow147.3%
*-commutative47.3%
associate-*r*42.3%
unpow242.3%
pow-prod-down47.3%
sqrt-pow148.2%
metadata-eval48.2%
pow148.2%
*-commutative48.2%
Applied egg-rr96.6%
*-commutative96.6%
div-inv96.6%
*-commutative96.6%
Applied egg-rr96.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 (/ (/ (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.6%
*-un-lft-identity66.6%
add-sqr-sqrt66.6%
times-frac66.6%
sqrt-prod66.6%
sqrt-pow147.3%
metadata-eval47.3%
pow147.3%
*-commutative47.3%
associate-*r*42.3%
unpow242.3%
pow-prod-down47.3%
sqrt-pow148.2%
metadata-eval48.2%
pow148.2%
*-commutative48.2%
Applied egg-rr96.6%
associate-/r*96.7%
frac-times95.0%
*-un-lft-identity95.0%
*-commutative95.0%
Applied egg-rr95.0%
Final simplification95.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 (pow (/ (/ 1.0 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 pow(((1.0 / 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 = ((1.0d0 / 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.pow(((1.0 / 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.pow(((1.0 / 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(Float64(1.0 / 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 = ((1.0 / 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[Power[N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.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])\\
\\
{\left(\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m}\right)}^{2}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0 52.9%
associate-/r*52.5%
*-commutative52.5%
unpow252.5%
unpow252.5%
swap-sqr62.9%
unpow262.9%
associate-/r*63.3%
unpow263.3%
unpow263.3%
swap-sqr72.9%
unpow272.9%
*-commutative72.9%
Simplified72.9%
*-commutative72.9%
pow272.9%
associate-*r*70.2%
Applied egg-rr70.2%
add-sqr-sqrt70.2%
pow270.2%
sqrt-div70.2%
metadata-eval70.2%
associate-*l*72.9%
sqrt-prod47.1%
add-sqr-sqrt73.0%
*-commutative73.0%
associate-/l/73.0%
Applied egg-rr73.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 (<= c_m 1.25e-259) (/ 1.0 (* x_m (* x_m (* (* c_m s_m) (* c_m s_m))))) (/ 1.0 (* (* x_m s_m) (* c_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) {
double tmp;
if (c_m <= 1.25e-259) {
tmp = 1.0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))));
} else {
tmp = 1.0 / ((x_m * s_m) * (c_m * (c_m * (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 (c_m <= 1.25d-259) then
tmp = 1.0d0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))))
else
tmp = 1.0d0 / ((x_m * s_m) * (c_m * (c_m * (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 (c_m <= 1.25e-259) {
tmp = 1.0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))));
} else {
tmp = 1.0 / ((x_m * s_m) * (c_m * (c_m * (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 c_m <= 1.25e-259: tmp = 1.0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m)))) else: tmp = 1.0 / ((x_m * s_m) * (c_m * (c_m * (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 (c_m <= 1.25e-259) tmp = Float64(1.0 / Float64(x_m * Float64(x_m * Float64(Float64(c_m * s_m) * Float64(c_m * s_m))))); else tmp = Float64(1.0 / Float64(Float64(x_m * s_m) * Float64(c_m * Float64(c_m * 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 (c_m <= 1.25e-259)
tmp = 1.0 / (x_m * (x_m * ((c_m * s_m) * (c_m * s_m))));
else
tmp = 1.0 / ((x_m * s_m) * (c_m * (c_m * (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[c$95$m, 1.25e-259], N[(1.0 / N[(x$95$m * N[(x$95$m * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$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])\\
\\
\begin{array}{l}
\mathbf{if}\;c\_m \leq 1.25 \cdot 10^{-259}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(x\_m \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if c < 1.24999999999999994e-259Initial program 67.2%
Taylor expanded in x around 0 52.2%
associate-/r*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
swap-sqr61.7%
unpow261.7%
associate-/r*62.4%
unpow262.4%
unpow262.4%
swap-sqr74.9%
unpow274.9%
*-commutative74.9%
Simplified74.9%
unpow274.9%
associate-*r*73.1%
add-sqr-sqrt42.1%
associate-*r*42.1%
pow142.1%
metadata-eval42.1%
sqrt-pow132.2%
sqrt-prod32.2%
associate-*r*32.3%
add-sqr-sqrt32.3%
associate-*r*32.3%
pow132.3%
metadata-eval32.3%
sqrt-pow142.0%
sqrt-prod42.0%
unswap-sqr41.9%
add-sqr-sqrt42.0%
add-sqr-sqrt71.4%
Applied egg-rr71.4%
unpow271.4%
Applied egg-rr71.4%
if 1.24999999999999994e-259 < c Initial program 65.9%
Taylor expanded in x around 0 53.8%
associate-/r*53.8%
*-commutative53.8%
unpow253.8%
unpow253.8%
swap-sqr64.4%
unpow264.4%
associate-/r*64.4%
unpow264.4%
unpow264.4%
swap-sqr70.4%
unpow270.4%
*-commutative70.4%
Simplified70.4%
*-commutative70.4%
pow270.4%
associate-*r*69.2%
Applied egg-rr69.2%
Final simplification70.4%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = 1.0d0 / (c_m * (x_m * s_m))
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(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 66.6%
Taylor expanded in x around 0 52.9%
associate-/r*52.5%
*-commutative52.5%
unpow252.5%
unpow252.5%
swap-sqr62.9%
unpow262.9%
associate-/r*63.3%
unpow263.3%
unpow263.3%
swap-sqr72.9%
unpow272.9%
*-commutative72.9%
Simplified72.9%
inv-pow72.9%
*-commutative72.9%
pow-pow73.0%
pow-sqr73.0%
inv-pow73.0%
inv-pow73.0%
Applied egg-rr73.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 (/ (/ 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(1.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 = (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[(1.0 / 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{1}{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.6%
*-un-lft-identity66.6%
add-sqr-sqrt66.6%
times-frac66.6%
sqrt-prod66.6%
sqrt-pow147.3%
metadata-eval47.3%
pow147.3%
*-commutative47.3%
associate-*r*42.3%
unpow242.3%
pow-prod-down47.3%
sqrt-pow148.2%
metadata-eval48.2%
pow148.2%
*-commutative48.2%
Applied egg-rr96.6%
associate-/r*96.7%
inv-pow96.7%
metadata-eval96.7%
frac-times94.9%
metadata-eval94.9%
inv-pow94.9%
*-commutative94.9%
Applied egg-rr94.9%
Taylor expanded in x around 0 72.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) (* 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(1.0 / Float64(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 = 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[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * 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}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0 52.9%
associate-/r*52.5%
*-commutative52.5%
unpow252.5%
unpow252.5%
swap-sqr62.9%
unpow262.9%
associate-/r*63.3%
unpow263.3%
unpow263.3%
swap-sqr72.9%
unpow272.9%
*-commutative72.9%
Simplified72.9%
*-commutative72.9%
pow272.9%
*-commutative72.9%
associate-*r*72.5%
Applied egg-rr72.5%
Final simplification72.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 (* x_m (* x_m (* (* c_m s_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 / (x_m * (x_m * ((c_m * s_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 / (x_m * (x_m * ((c_m * s_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 / (x_m * (x_m * ((c_m * s_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 / (x_m * (x_m * ((c_m * s_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(x_m * Float64(x_m * Float64(Float64(c_m * s_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 / (x_m * (x_m * ((c_m * s_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[(x$95$m * N[(x$95$m * N[(N[(c$95$m * s$95$m), $MachinePrecision] * 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}{x\_m \cdot \left(x\_m \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(c\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0 52.9%
associate-/r*52.5%
*-commutative52.5%
unpow252.5%
unpow252.5%
swap-sqr62.9%
unpow262.9%
associate-/r*63.3%
unpow263.3%
unpow263.3%
swap-sqr72.9%
unpow272.9%
*-commutative72.9%
Simplified72.9%
unpow272.9%
associate-*r*71.9%
add-sqr-sqrt39.7%
associate-*r*39.7%
pow139.7%
metadata-eval39.7%
sqrt-pow131.1%
sqrt-prod31.1%
associate-*r*31.2%
add-sqr-sqrt31.2%
associate-*r*31.2%
pow131.2%
metadata-eval31.2%
sqrt-pow138.5%
sqrt-prod38.5%
unswap-sqr38.4%
add-sqr-sqrt38.5%
add-sqr-sqrt69.1%
Applied egg-rr69.1%
unpow269.1%
Applied egg-rr69.1%
Final simplification69.1%
herbie shell --seed 2024096
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))