
(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 4.4e-36)
(/ t_0 (* c_m (* (* x_m s_m) (* c_m (* x_m s_m)))))
(/ t_0 (* s_m (* (* x_m c_m) (* s_m (* x_m c_m))))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * -2.0));
double tmp;
if (x_m <= 4.4e-36) {
tmp = t_0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
} else {
tmp = t_0 / (s_m * ((x_m * c_m) * (s_m * (x_m * c_m))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * (-2.0d0)))
if (x_m <= 4.4d-36) then
tmp = t_0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
else
tmp = t_0 / (s_m * ((x_m * c_m) * (s_m * (x_m * c_m))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * -2.0));
double tmp;
if (x_m <= 4.4e-36) {
tmp = t_0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
} else {
tmp = t_0 / (s_m * ((x_m * c_m) * (s_m * (x_m * c_m))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * -2.0)) tmp = 0 if x_m <= 4.4e-36: tmp = t_0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m)))) else: tmp = t_0 / (s_m * ((x_m * c_m) * (s_m * (x_m * c_m)))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m * -2.0)) tmp = 0.0 if (x_m <= 4.4e-36) tmp = Float64(t_0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m))))); else tmp = Float64(t_0 / Float64(s_m * Float64(Float64(x_m * c_m) * 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 = cos((x_m * -2.0));
tmp = 0.0;
if (x_m <= 4.4e-36)
tmp = t_0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
else
tmp = t_0 / (s_m * ((x_m * c_m) * (s_m * (x_m * c_m))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 4.4e-36], N[(t$95$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], N[(t$95$0 / N[(s$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * 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])\\
\\
\begin{array}{l}
t_0 := \cos \left(x_m \cdot -2\right)\\
\mathbf{if}\;x_m \leq 4.4 \cdot 10^{-36}:\\
\;\;\;\;\frac{t_0}{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)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{s_m \cdot \left(\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 4.3999999999999999e-36Initial program 72.2%
associate-/r*71.6%
associate-*l*71.6%
unpow271.6%
sqr-neg71.6%
unpow271.6%
*-commutative71.6%
*-commutative71.6%
associate-/r*72.2%
cos-neg72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
associate-*r*72.8%
*-commutative72.8%
unpow272.8%
sqr-neg72.8%
associate-*l*81.6%
associate-*r*81.5%
Simplified66.3%
Taylor expanded in x around inf 66.3%
associate-/r*65.7%
*-commutative65.7%
unpow265.7%
unpow265.7%
swap-sqr83.1%
unpow283.1%
associate-/r*84.1%
*-commutative84.1%
unpow284.1%
unpow284.1%
swap-sqr98.6%
unpow298.6%
*-commutative98.6%
Simplified98.6%
unpow-prod-down84.1%
*-commutative84.1%
pow-prod-down98.6%
pow298.6%
*-commutative98.6%
associate-*r*97.2%
*-commutative97.2%
*-commutative97.2%
Applied egg-rr97.2%
if 4.3999999999999999e-36 < x Initial program 70.2%
associate-/r*69.3%
associate-*l*69.3%
unpow269.3%
sqr-neg69.3%
unpow269.3%
*-commutative69.3%
*-commutative69.3%
associate-/r*70.2%
cos-neg70.2%
*-commutative70.2%
distribute-rgt-neg-in70.2%
metadata-eval70.2%
associate-*r*71.9%
*-commutative71.9%
unpow271.9%
sqr-neg71.9%
associate-*l*77.0%
associate-*r*81.0%
Simplified62.9%
Taylor expanded in x around inf 62.9%
associate-/r*62.8%
*-commutative62.8%
unpow262.8%
unpow262.8%
swap-sqr77.1%
unpow277.1%
associate-/r*78.0%
*-commutative78.0%
unpow278.0%
unpow278.0%
swap-sqr99.6%
unpow299.6%
associate-*r*97.2%
*-commutative97.2%
Simplified97.2%
unpow297.2%
*-commutative97.2%
*-commutative97.2%
associate-*r*97.3%
associate-*r*94.8%
associate-*r*94.8%
*-commutative94.8%
Applied egg-rr94.8%
Final simplification96.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 (/ (cos (* x_m -2.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) {
return cos((x_m * -2.0)) / pow((s_m * (x_m * c_m)), 2.0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = cos((x_m * (-2.0d0))) / ((s_m * (x_m * c_m)) ** 2.0d0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return Math.cos((x_m * -2.0)) / Math.pow((s_m * (x_m * c_m)), 2.0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return math.cos((x_m * -2.0)) / math.pow((s_m * (x_m * c_m)), 2.0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(cos(Float64(x_m * -2.0)) / (Float64(s_m * Float64(x_m * c_m)) ^ 2.0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = cos((x_m * -2.0)) / ((s_m * (x_m * c_m)) ^ 2.0);
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / 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])\\
\\
\frac{\cos \left(x_m \cdot -2\right)}{{\left(s_m \cdot \left(x_m \cdot c_m\right)\right)}^{2}}
\end{array}
Initial program 71.6%
associate-/r*70.9%
associate-*l*70.9%
unpow270.9%
sqr-neg70.9%
unpow270.9%
*-commutative70.9%
*-commutative70.9%
associate-/r*71.6%
cos-neg71.6%
*-commutative71.6%
distribute-rgt-neg-in71.6%
metadata-eval71.6%
associate-*r*72.5%
*-commutative72.5%
unpow272.5%
sqr-neg72.5%
associate-*l*80.2%
associate-*r*81.3%
Simplified65.3%
Taylor expanded in x around inf 65.3%
associate-/r*64.9%
*-commutative64.9%
unpow264.9%
unpow264.9%
swap-sqr81.3%
unpow281.3%
associate-/r*82.2%
*-commutative82.2%
unpow282.2%
unpow282.2%
swap-sqr98.9%
unpow298.9%
associate-*r*97.7%
*-commutative97.7%
Simplified97.7%
Final simplification97.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 (/ (cos (* x_m -2.0)) (pow (* c_m (* x_m s_m)) 2.0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return cos((x_m * -2.0)) / pow((c_m * (x_m * s_m)), 2.0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = cos((x_m * (-2.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.cos((x_m * -2.0)) / Math.pow((c_m * (x_m * s_m)), 2.0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return math.cos((x_m * -2.0)) / math.pow((c_m * (x_m * s_m)), 2.0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(cos(Float64(x_m * -2.0)) / (Float64(c_m * Float64(x_m * s_m)) ^ 2.0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = cos((x_m * -2.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[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[Power[N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\cos \left(x_m \cdot -2\right)}{{\left(c_m \cdot \left(x_m \cdot s_m\right)\right)}^{2}}
\end{array}
Initial program 71.6%
associate-/r*70.9%
associate-*l*70.9%
unpow270.9%
sqr-neg70.9%
unpow270.9%
*-commutative70.9%
*-commutative70.9%
associate-/r*71.6%
cos-neg71.6%
*-commutative71.6%
distribute-rgt-neg-in71.6%
metadata-eval71.6%
associate-*r*72.5%
*-commutative72.5%
unpow272.5%
sqr-neg72.5%
associate-*l*80.2%
associate-*r*81.3%
Simplified65.3%
Taylor expanded in x around inf 65.3%
associate-/r*64.9%
*-commutative64.9%
unpow264.9%
unpow264.9%
swap-sqr81.3%
unpow281.3%
associate-/r*82.2%
*-commutative82.2%
unpow282.2%
unpow282.2%
swap-sqr98.9%
unpow298.9%
*-commutative98.9%
Simplified98.9%
Final simplification98.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 (if (<= x_m 5.2e-100) (/ (/ 1.0 c_m) (* (* x_m s_m) (* c_m (* x_m s_m)))) (/ (cos (* x_m -2.0)) (* (* x_m (* s_m (* x_m c_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) {
double tmp;
if (x_m <= 5.2e-100) {
tmp = (1.0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
} else {
tmp = cos((x_m * -2.0)) / ((x_m * (s_m * (x_m * c_m))) * (s_m * c_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 5.2d-100) then
tmp = (1.0d0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)))
else
tmp = cos((x_m * (-2.0d0))) / ((x_m * (s_m * (x_m * c_m))) * (s_m * c_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 5.2e-100) {
tmp = (1.0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
} else {
tmp = Math.cos((x_m * -2.0)) / ((x_m * (s_m * (x_m * c_m))) * (s_m * c_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 5.2e-100: tmp = (1.0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m))) else: tmp = math.cos((x_m * -2.0)) / ((x_m * (s_m * (x_m * c_m))) * (s_m * c_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 5.2e-100) tmp = Float64(Float64(1.0 / c_m) / Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m)))); else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(Float64(x_m * Float64(s_m * Float64(x_m * c_m))) * Float64(s_m * c_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 5.2e-100)
tmp = (1.0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
else
tmp = cos((x_m * -2.0)) / ((x_m * (s_m * (x_m * c_m))) * (s_m * c_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 5.2e-100], 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], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;x_m \leq 5.2 \cdot 10^{-100}:\\
\;\;\;\;\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)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot -2\right)}{\left(x_m \cdot \left(s_m \cdot \left(x_m \cdot c_m\right)\right)\right) \cdot \left(s_m \cdot c_m\right)}\\
\end{array}
\end{array}
if x < 5.1999999999999997e-100Initial program 71.4%
Taylor expanded in x around 0 59.7%
associate-/r*59.1%
*-commutative59.1%
unpow259.1%
unpow259.1%
swap-sqr75.7%
unpow275.7%
associate-/r*76.3%
unpow276.3%
unpow276.3%
swap-sqr86.8%
unpow286.8%
*-commutative86.8%
Simplified86.8%
pow-flip86.8%
*-commutative86.8%
pow-flip86.8%
add-sqr-sqrt86.8%
sqrt-div86.8%
metadata-eval86.8%
sqrt-pow163.6%
associate-*r*62.5%
*-commutative62.5%
metadata-eval62.5%
pow162.5%
sqrt-div62.5%
metadata-eval62.5%
sqrt-pow185.4%
associate-*r*86.0%
*-commutative86.0%
metadata-eval86.0%
pow186.0%
Applied egg-rr86.0%
un-div-inv86.0%
*-commutative86.0%
associate-*r*85.5%
associate-/r*85.5%
*-commutative85.5%
associate-*r*86.9%
associate-/l/86.7%
*-commutative86.7%
*-commutative86.7%
Applied egg-rr86.7%
if 5.1999999999999997e-100 < x Initial program 71.9%
associate-/r*71.2%
associate-*l*71.2%
unpow271.2%
sqr-neg71.2%
unpow271.2%
*-commutative71.2%
*-commutative71.2%
associate-/r*71.9%
cos-neg71.9%
*-commutative71.9%
distribute-rgt-neg-in71.9%
metadata-eval71.9%
associate-*r*74.4%
*-commutative74.4%
unpow274.4%
sqr-neg74.4%
associate-*l*78.7%
associate-*r*82.1%
Simplified65.8%
Taylor expanded in x around inf 65.8%
associate-/r*65.7%
*-commutative65.7%
unpow265.7%
unpow265.7%
swap-sqr77.7%
unpow277.7%
associate-/r*78.4%
*-commutative78.4%
unpow278.4%
unpow278.4%
swap-sqr99.7%
unpow299.7%
associate-*r*97.6%
*-commutative97.6%
Simplified97.6%
unpow297.6%
*-commutative97.6%
associate-*r*97.7%
associate-*r*98.7%
associate-*l*96.7%
associate-*r*95.7%
*-commutative95.7%
Applied egg-rr95.7%
Final simplification89.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))))
(if (<= x_m 5e-11)
(/ 1.0 (* t_0 t_0))
(/ (cos (* x_m -2.0)) (* (* x_m c_m) (* s_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 (x_m <= 5e-11) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m * -2.0)) / ((x_m * c_m) * (s_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 (x_m <= 5d-11) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m * (-2.0d0))) / ((x_m * c_m) * (s_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 (x_m <= 5e-11) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m * -2.0)) / ((x_m * c_m) * (s_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 x_m <= 5e-11: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m * -2.0)) / ((x_m * c_m) * (s_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 (x_m <= 5e-11) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m * -2.0)) / Float64(Float64(x_m * c_m) * Float64(s_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 (x_m <= 5e-11)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m * -2.0)) / ((x_m * c_m) * (s_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[x$95$m, 5e-11], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$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}\;x_m \leq 5 \cdot 10^{-11}:\\
\;\;\;\;\frac{1}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x_m \cdot -2\right)}{\left(x_m \cdot c_m\right) \cdot \left(s_m \cdot t_0\right)}\\
\end{array}
\end{array}
if x < 5.00000000000000018e-11Initial program 72.4%
Taylor expanded in x around 0 62.0%
associate-/r*61.4%
*-commutative61.4%
unpow261.4%
unpow261.4%
swap-sqr76.2%
unpow276.2%
associate-/r*76.8%
unpow276.8%
unpow276.8%
swap-sqr88.2%
unpow288.2%
*-commutative88.2%
Simplified88.2%
pow-flip88.2%
*-commutative88.2%
pow-flip88.2%
add-sqr-sqrt88.2%
sqrt-div88.2%
metadata-eval88.2%
sqrt-pow162.7%
associate-*r*61.7%
*-commutative61.7%
metadata-eval61.7%
pow161.7%
sqrt-div61.7%
metadata-eval61.7%
sqrt-pow187.0%
associate-*r*87.4%
*-commutative87.4%
metadata-eval87.4%
pow187.4%
Applied egg-rr87.4%
frac-times87.5%
*-commutative87.5%
associate-*r*87.1%
*-commutative87.1%
associate-*r*88.2%
frac-times88.2%
frac-2neg88.2%
metadata-eval88.2%
frac-2neg88.2%
metadata-eval88.2%
frac-times88.2%
metadata-eval88.2%
distribute-rgt-neg-in88.2%
*-commutative88.2%
distribute-rgt-neg-in88.2%
*-commutative88.2%
Applied egg-rr88.2%
if 5.00000000000000018e-11 < x Initial program 69.4%
associate-/r*68.5%
associate-*l*68.5%
unpow268.5%
sqr-neg68.5%
unpow268.5%
*-commutative68.5%
*-commutative68.5%
associate-/r*69.4%
cos-neg69.4%
*-commutative69.4%
distribute-rgt-neg-in69.4%
metadata-eval69.4%
associate-*r*71.2%
*-commutative71.2%
unpow271.2%
sqr-neg71.2%
associate-*l*76.7%
associate-*r*79.7%
Simplified61.6%
Taylor expanded in x around inf 61.6%
associate-/r*61.5%
*-commutative61.5%
unpow261.5%
unpow261.5%
swap-sqr76.9%
unpow276.9%
associate-/r*77.8%
*-commutative77.8%
unpow277.8%
unpow277.8%
swap-sqr99.6%
unpow299.6%
*-commutative99.6%
Simplified99.6%
unpow-prod-down77.8%
*-commutative77.8%
pow-prod-down99.6%
pow299.6%
associate-*r*97.1%
*-commutative97.1%
associate-*r*94.5%
*-commutative94.5%
Applied egg-rr94.5%
Final simplification90.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)))) (* (/ 1.0 t_0) (/ (cos (* x_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 = c_m * (x_m * s_m);
return (1.0 / t_0) * (cos((x_m * 2.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) * (cos((x_m * 2.0d0)) / 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) * (Math.cos((x_m * 2.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) * (math.cos((x_m * 2.0)) / t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) return Float64(Float64(1.0 / t_0) * Float64(cos(Float64(x_m * 2.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) * (cos((x_m * 2.0)) / t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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 \frac{\cos \left(x_m \cdot 2\right)}{t_0}
\end{array}
\end{array}
Initial program 71.6%
*-un-lft-identity71.6%
add-sqr-sqrt71.6%
times-frac71.5%
Applied egg-rr98.9%
Final simplification98.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)))) (if (<= x_m 1.15e+51) (/ 1.0 (* t_0 t_0)) (- (pow t_0 -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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.15e+51) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = -pow(t_0, -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 = c_m * (x_m * s_m)
if (x_m <= 1.15d+51) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = -(t_0 ** (-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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.15e+51) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = -Math.pow(t_0, -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 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.15e+51: tmp = 1.0 / (t_0 * t_0) else: tmp = -math.pow(t_0, -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 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.15e+51) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(-(t_0 ^ -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 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.15e+51)
tmp = 1.0 / (t_0 * t_0);
else
tmp = -(t_0 ^ -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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.15e+51], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], (-N[Power[t$95$0, -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])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x_m \cdot s_m\right)\\
\mathbf{if}\;x_m \leq 1.15 \cdot 10^{+51}:\\
\;\;\;\;\frac{1}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;-{t_0}^{-2}\\
\end{array}
\end{array}
if x < 1.15000000000000003e51Initial program 71.7%
Taylor expanded in x around 0 60.5%
associate-/r*60.0%
*-commutative60.0%
unpow260.0%
unpow260.0%
swap-sqr73.3%
unpow273.3%
associate-/r*73.8%
unpow273.8%
unpow273.8%
swap-sqr85.0%
unpow285.0%
*-commutative85.0%
Simplified85.0%
pow-flip84.9%
*-commutative84.9%
pow-flip85.0%
add-sqr-sqrt84.9%
sqrt-div84.9%
metadata-eval84.9%
sqrt-pow160.5%
associate-*r*59.5%
*-commutative59.5%
metadata-eval59.5%
pow159.5%
sqrt-div59.5%
metadata-eval59.5%
sqrt-pow183.8%
associate-*r*84.2%
*-commutative84.2%
metadata-eval84.2%
pow184.2%
Applied egg-rr84.2%
frac-times84.3%
*-commutative84.3%
associate-*r*83.9%
*-commutative83.9%
associate-*r*85.0%
frac-times84.9%
frac-2neg84.9%
metadata-eval84.9%
frac-2neg84.9%
metadata-eval84.9%
frac-times85.0%
metadata-eval85.0%
distribute-rgt-neg-in85.0%
*-commutative85.0%
distribute-rgt-neg-in85.0%
*-commutative85.0%
Applied egg-rr85.0%
if 1.15000000000000003e51 < x Initial program 71.3%
Taylor expanded in x around 0 50.3%
associate-/r*50.3%
*-commutative50.3%
unpow250.3%
unpow250.3%
swap-sqr62.7%
unpow262.7%
associate-/r*62.7%
unpow262.7%
unpow262.7%
swap-sqr71.0%
unpow271.0%
*-commutative71.0%
Simplified71.0%
pow-flip71.0%
*-commutative71.0%
pow-flip71.0%
add-sqr-sqrt71.0%
sqrt-div71.0%
metadata-eval71.0%
sqrt-pow176.3%
associate-*r*76.1%
*-commutative76.1%
metadata-eval76.1%
pow176.1%
sqrt-div76.1%
metadata-eval76.1%
sqrt-pow170.8%
associate-*r*70.8%
*-commutative70.8%
metadata-eval70.8%
pow170.8%
Applied egg-rr70.8%
un-div-inv70.8%
*-commutative70.8%
associate-*r*70.8%
associate-/r*70.8%
*-commutative70.8%
associate-*r*71.0%
associate-/l/70.7%
*-commutative70.7%
*-commutative70.7%
Applied egg-rr70.7%
div-inv70.7%
frac-times70.7%
metadata-eval70.7%
*-commutative70.7%
add-sqr-sqrt31.8%
sqrt-unprod71.1%
sqr-neg71.1%
sqrt-unprod39.9%
add-sqr-sqrt72.6%
add-sqr-sqrt32.7%
sqrt-unprod71.4%
sqr-neg71.4%
sqrt-unprod38.9%
add-sqr-sqrt70.7%
associate-*l*71.0%
frac-2neg71.0%
Applied egg-rr72.2%
mul-1-neg72.2%
associate-*r*72.6%
Simplified72.6%
Final simplification82.4%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 5.5e+45)
(/ 1.0 (* t_0 t_0))
(/ 1.0 (* t_0 (* 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) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 5.5e+45) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = 1.0 / (t_0 * (x_m * (s_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 <= 5.5d+45) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = 1.0d0 / (t_0 * (x_m * (s_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 <= 5.5e+45) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = 1.0 / (t_0 * (x_m * (s_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 <= 5.5e+45: tmp = 1.0 / (t_0 * t_0) else: tmp = 1.0 / (t_0 * (x_m * (s_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 <= 5.5e+45) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(1.0 / Float64(t_0 * Float64(x_m * Float64(s_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 <= 5.5e+45)
tmp = 1.0 / (t_0 * t_0);
else
tmp = 1.0 / (t_0 * (x_m * (s_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, 5.5e+45], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * N[(x$95$m * N[(s$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x_m \cdot s_m\right)\\
\mathbf{if}\;x_m \leq 5.5 \cdot 10^{+45}:\\
\;\;\;\;\frac{1}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t_0 \cdot \left(x_m \cdot \left(s_m \cdot c_m\right)\right)}\\
\end{array}
\end{array}
if x < 5.5000000000000001e45Initial program 72.2%
Taylor expanded in x around 0 60.9%
associate-/r*60.4%
*-commutative60.4%
unpow260.4%
unpow260.4%
swap-sqr73.9%
unpow273.9%
associate-/r*74.5%
unpow274.5%
unpow274.5%
swap-sqr85.6%
unpow285.6%
*-commutative85.6%
Simplified85.6%
pow-flip85.6%
*-commutative85.6%
pow-flip85.6%
add-sqr-sqrt85.6%
sqrt-div85.6%
metadata-eval85.6%
sqrt-pow161.2%
associate-*r*60.2%
*-commutative60.2%
metadata-eval60.2%
pow160.2%
sqrt-div60.2%
metadata-eval60.2%
sqrt-pow184.5%
associate-*r*84.9%
*-commutative84.9%
metadata-eval84.9%
pow184.9%
Applied egg-rr84.9%
frac-times85.0%
*-commutative85.0%
associate-*r*84.6%
*-commutative84.6%
associate-*r*85.6%
frac-times85.6%
frac-2neg85.6%
metadata-eval85.6%
frac-2neg85.6%
metadata-eval85.6%
frac-times85.6%
metadata-eval85.6%
distribute-rgt-neg-in85.6%
*-commutative85.6%
distribute-rgt-neg-in85.6%
*-commutative85.6%
Applied egg-rr85.6%
if 5.5000000000000001e45 < x Initial program 69.4%
Taylor expanded in x around 0 49.4%
associate-/r*49.4%
*-commutative49.4%
unpow249.4%
unpow249.4%
swap-sqr61.1%
unpow261.1%
associate-/r*61.1%
unpow261.1%
unpow261.1%
swap-sqr69.3%
unpow269.3%
*-commutative69.3%
Simplified69.3%
pow-flip69.3%
*-commutative69.3%
pow-flip69.3%
add-sqr-sqrt69.3%
sqrt-div69.3%
metadata-eval69.3%
sqrt-pow172.9%
associate-*r*72.7%
*-commutative72.7%
metadata-eval72.7%
pow172.7%
sqrt-div72.7%
metadata-eval72.7%
sqrt-pow169.2%
associate-*r*69.2%
*-commutative69.2%
metadata-eval69.2%
pow169.2%
Applied egg-rr69.2%
frac-times69.2%
*-commutative69.2%
associate-*r*69.2%
*-commutative69.2%
associate-*r*69.3%
frac-times69.3%
frac-2neg69.3%
metadata-eval69.3%
frac-2neg69.3%
metadata-eval69.3%
frac-times69.3%
metadata-eval69.3%
distribute-rgt-neg-in69.3%
*-commutative69.3%
distribute-rgt-neg-in69.3%
*-commutative69.3%
Applied egg-rr69.3%
distribute-rgt-neg-out69.3%
neg-sub067.5%
associate-*r*65.8%
Applied egg-rr65.8%
Final simplification82.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) (* 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 71.6%
Taylor expanded in x around 0 58.4%
associate-/r*58.0%
*-commutative58.0%
unpow258.0%
unpow258.0%
swap-sqr71.1%
unpow271.1%
associate-/r*71.5%
unpow271.5%
unpow271.5%
swap-sqr82.1%
unpow282.1%
*-commutative82.1%
Simplified82.1%
pow-flip82.1%
*-commutative82.1%
pow-flip82.1%
add-sqr-sqrt82.0%
sqrt-div82.0%
metadata-eval82.0%
sqrt-pow163.8%
associate-*r*63.0%
*-commutative63.0%
metadata-eval63.0%
pow163.0%
sqrt-div63.0%
metadata-eval63.0%
sqrt-pow181.1%
associate-*r*81.5%
*-commutative81.5%
metadata-eval81.5%
pow181.5%
Applied egg-rr81.5%
un-div-inv81.5%
*-commutative81.5%
associate-*r*81.2%
associate-/r*81.2%
*-commutative81.2%
associate-*r*82.1%
associate-/l/81.5%
*-commutative81.5%
*-commutative81.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 (let* ((t_0 (* c_m (* x_m s_m)))) (/ (/ 1.0 t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return (1.0 / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x_m * s_m)
code = (1.0d0 / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return (1.0 / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) return (1.0 / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) return Float64(Float64(1.0 / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = (1.0 / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x_m \cdot s_m\right)\\
\frac{\frac{1}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 71.6%
Taylor expanded in x around 0 58.4%
associate-/r*58.0%
*-commutative58.0%
unpow258.0%
unpow258.0%
swap-sqr71.1%
unpow271.1%
associate-/r*71.5%
unpow271.5%
unpow271.5%
swap-sqr82.1%
unpow282.1%
*-commutative82.1%
Simplified82.1%
pow-flip82.1%
*-commutative82.1%
pow-flip82.1%
add-sqr-sqrt82.0%
sqrt-div82.0%
metadata-eval82.0%
sqrt-pow163.8%
associate-*r*63.0%
*-commutative63.0%
metadata-eval63.0%
pow163.0%
sqrt-div63.0%
metadata-eval63.0%
sqrt-pow181.1%
associate-*r*81.5%
*-commutative81.5%
metadata-eval81.5%
pow181.5%
Applied egg-rr81.5%
un-div-inv81.5%
associate-*r*80.8%
*-commutative80.8%
associate-*r*81.2%
associate-*r*81.4%
*-commutative81.4%
associate-*r*82.1%
Applied egg-rr82.1%
Final simplification82.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 (* 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 71.6%
Taylor expanded in x around 0 58.4%
associate-/r*58.0%
*-commutative58.0%
unpow258.0%
unpow258.0%
swap-sqr71.1%
unpow271.1%
associate-/r*71.5%
unpow271.5%
unpow271.5%
swap-sqr82.1%
unpow282.1%
*-commutative82.1%
Simplified82.1%
pow-flip82.1%
*-commutative82.1%
pow-flip82.1%
add-sqr-sqrt82.0%
sqrt-div82.0%
metadata-eval82.0%
sqrt-pow163.8%
associate-*r*63.0%
*-commutative63.0%
metadata-eval63.0%
pow163.0%
sqrt-div63.0%
metadata-eval63.0%
sqrt-pow181.1%
associate-*r*81.5%
*-commutative81.5%
metadata-eval81.5%
pow181.5%
Applied egg-rr81.5%
frac-times81.5%
*-commutative81.5%
associate-*r*81.2%
*-commutative81.2%
associate-*r*82.1%
frac-times82.0%
frac-2neg82.0%
metadata-eval82.0%
frac-2neg82.0%
metadata-eval82.0%
frac-times82.1%
metadata-eval82.1%
distribute-rgt-neg-in82.1%
*-commutative82.1%
distribute-rgt-neg-in82.1%
*-commutative82.1%
Applied egg-rr82.1%
Final simplification82.1%
herbie shell --seed 2024024
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))