
(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 12 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 5e-147)
(/ (/ (/ t_0 (* c_m (* x_m s_m))) (* x_m s_m)) c_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 <= 5e-147) {
tmp = ((t_0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_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 <= 5d-147) then
tmp = ((t_0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_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 <= 5e-147) {
tmp = ((t_0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_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 <= 5e-147: tmp = ((t_0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_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 <= 5e-147) tmp = Float64(Float64(Float64(t_0 / Float64(c_m * Float64(x_m * s_m))) / Float64(x_m * s_m)) / c_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 <= 5e-147)
tmp = ((t_0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_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, 5e-147], N[(N[(N[(t$95$0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $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 5 \cdot 10^{-147}:\\
\;\;\;\;\frac{\frac{\frac{t\_0}{c\_m \cdot \left(x\_m \cdot s\_m\right)}}{x\_m \cdot s\_m}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot {\left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}^{-2}\\
\end{array}
\end{array}
if x < 5.00000000000000013e-147Initial program 57.7%
*-un-lft-identity57.7%
add-sqr-sqrt57.7%
times-frac57.7%
sqrt-prod57.7%
sqrt-pow142.0%
metadata-eval42.0%
pow142.0%
*-commutative42.0%
associate-*r*37.2%
unpow237.2%
pow-prod-down42.0%
sqrt-pow140.5%
metadata-eval40.5%
pow140.5%
*-commutative40.5%
Applied egg-rr96.0%
associate-*l/96.0%
*-un-lft-identity96.0%
*-commutative96.0%
associate-/r*93.0%
*-commutative93.0%
Applied egg-rr93.0%
if 5.00000000000000013e-147 < x Initial program 67.8%
*-un-lft-identity67.8%
add-sqr-sqrt67.8%
times-frac67.8%
sqrt-prod67.7%
sqrt-pow151.2%
metadata-eval51.2%
pow151.2%
*-commutative51.2%
associate-*r*50.3%
unpow250.3%
pow-prod-down51.2%
sqrt-pow147.8%
metadata-eval47.8%
pow147.8%
*-commutative47.8%
Applied egg-rr98.0%
Taylor expanded in c around 0 63.0%
associate-/r*63.0%
*-commutative63.0%
*-commutative63.0%
unpow263.0%
unpow263.0%
swap-sqr77.5%
unpow277.5%
associate-/l/77.3%
*-commutative77.3%
unpow277.3%
unpow277.3%
swap-sqr97.3%
associate-/l/97.9%
*-lft-identity97.9%
associate-*l/98.0%
associate-/r/97.2%
associate-/r/97.3%
Simplified97.9%
Final simplification95.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))) (t_1 (cos (* x_m 2.0))))
(if (<= (pow c_m 2.0) 0.0)
(/ (/ t_1 c_m) (* (* x_m s_m) t_0))
(/ (/ t_1 (* c_m t_0)) (* x_m s_m)))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (pow(c_m, 2.0) <= 0.0) {
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0);
} else {
tmp = (t_1 / (c_m * t_0)) / (x_m * s_m);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
t_1 = cos((x_m * 2.0d0))
if ((c_m ** 2.0d0) <= 0.0d0) then
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0)
else
tmp = (t_1 / (c_m * t_0)) / (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 t_0 = c_m * (x_m * s_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (Math.pow(c_m, 2.0) <= 0.0) {
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0);
} else {
tmp = (t_1 / (c_m * t_0)) / (x_m * s_m);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if math.pow(c_m, 2.0) <= 0.0: tmp = (t_1 / c_m) / ((x_m * s_m) * t_0) else: tmp = (t_1 / (c_m * t_0)) / (x_m * s_m) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if ((c_m ^ 2.0) <= 0.0) tmp = Float64(Float64(t_1 / c_m) / Float64(Float64(x_m * s_m) * t_0)); else tmp = Float64(Float64(t_1 / Float64(c_m * t_0)) / Float64(x_m * s_m)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if ((c_m ^ 2.0) <= 0.0)
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0);
else
tmp = (t_1 / (c_m * t_0)) / (x_m * s_m);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Power[c$95$m, 2.0], $MachinePrecision], 0.0], N[(N[(t$95$1 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / N[(c$95$m * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * s$95$m), $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)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;{c\_m}^{2} \leq 0:\\
\;\;\;\;\frac{\frac{t\_1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{c\_m \cdot t\_0}}{x\_m \cdot s\_m}\\
\end{array}
\end{array}
if (pow.f64 c #s(literal 2 binary64)) < 0.0Initial program 51.2%
*-un-lft-identity51.2%
add-sqr-sqrt51.2%
times-frac51.2%
sqrt-prod51.2%
sqrt-pow128.2%
metadata-eval28.2%
pow128.2%
*-commutative28.2%
associate-*r*26.4%
unpow226.4%
pow-prod-down28.2%
sqrt-pow119.5%
metadata-eval19.5%
pow119.5%
*-commutative19.5%
Applied egg-rr92.6%
*-commutative92.6%
associate-/r*92.7%
frac-times91.0%
div-inv91.0%
*-commutative91.0%
Applied egg-rr91.0%
if 0.0 < (pow.f64 c #s(literal 2 binary64)) Initial program 65.1%
*-un-lft-identity65.1%
add-sqr-sqrt65.1%
times-frac65.1%
sqrt-prod65.1%
sqrt-pow151.0%
metadata-eval51.0%
pow151.0%
*-commutative51.0%
associate-*r*47.5%
unpow247.5%
pow-prod-down51.0%
sqrt-pow150.5%
metadata-eval50.5%
pow150.5%
*-commutative50.5%
Applied egg-rr98.1%
Taylor expanded in c around 0 59.6%
associate-/r*59.6%
*-commutative59.6%
*-commutative59.6%
unpow259.6%
unpow259.6%
swap-sqr81.1%
unpow281.1%
associate-/l/80.6%
*-commutative80.6%
unpow280.6%
unpow280.6%
swap-sqr96.7%
associate-/l/98.0%
*-lft-identity98.0%
associate-*l/98.1%
associate-/r/96.7%
associate-/r/96.8%
Simplified97.2%
*-commutative97.2%
associate-*r*98.1%
metadata-eval98.1%
pow-div98.1%
inv-pow98.1%
associate-/r*98.1%
pow198.1%
associate-/l/94.3%
associate-/l*94.3%
div-inv94.3%
associate-/r*94.8%
associate-/l/94.0%
Applied egg-rr94.0%
Final simplification93.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) s_m) (/ (cos (* x_m 2.0)) 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) {
return (((1.0 / x_m) / s_m) * (cos((x_m * 2.0)) / c_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 / x_m) / s_m) * (cos((x_m * 2.0d0)) / c_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 / x_m) / s_m) * (Math.cos((x_m * 2.0)) / c_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 / x_m) / s_m) * (math.cos((x_m * 2.0)) / c_m)) / (c_m * (x_m * s_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(Float64(Float64(1.0 / x_m) / s_m) * Float64(cos(Float64(x_m * 2.0)) / c_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 / x_m) / s_m) * (cos((x_m * 2.0)) / c_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[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] * N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\frac{1}{x\_m}}{s\_m} \cdot \frac{\cos \left(x\_m \cdot 2\right)}{c\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 62.0%
*-un-lft-identity62.0%
add-sqr-sqrt62.0%
times-frac62.0%
sqrt-prod62.0%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.8%
unpow242.8%
pow-prod-down45.9%
sqrt-pow143.6%
metadata-eval43.6%
pow143.6%
*-commutative43.6%
Applied egg-rr96.9%
Taylor expanded in c around 0 56.5%
associate-/r*56.5%
*-commutative56.5%
*-commutative56.5%
unpow256.5%
unpow256.5%
swap-sqr76.0%
unpow276.0%
associate-/l/75.6%
*-commutative75.6%
unpow275.6%
unpow275.6%
swap-sqr95.8%
associate-/l/96.8%
*-lft-identity96.8%
associate-*l/96.9%
associate-/r/95.8%
associate-/r/95.8%
Simplified97.8%
*-commutative97.8%
associate-*r*96.8%
metadata-eval96.8%
pow-div96.8%
inv-pow96.8%
associate-/r*96.9%
pow196.9%
associate-/l/93.6%
associate-/l*93.6%
div-inv93.6%
*-commutative93.6%
associate-/r*96.9%
Applied egg-rr96.9%
clear-num96.8%
associate-/r/96.6%
associate-/r*96.7%
Applied egg-rr96.7%
Final simplification96.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (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 62.0%
*-un-lft-identity62.0%
add-sqr-sqrt62.0%
times-frac62.0%
sqrt-prod62.0%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.8%
unpow242.8%
pow-prod-down45.9%
sqrt-pow143.6%
metadata-eval43.6%
pow143.6%
*-commutative43.6%
Applied egg-rr96.9%
*-commutative96.9%
associate-/r*96.9%
frac-times93.6%
div-inv93.6%
*-commutative93.6%
Applied egg-rr93.6%
Final simplification93.6%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (/ (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(Float64(cos(Float64(x_m * 2.0)) / c_m) / Float64(x_m * s_m)) / Float64(c_m * Float64(x_m * s_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = ((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[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{c\_m}}{x\_m \cdot s\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 62.0%
*-un-lft-identity62.0%
add-sqr-sqrt62.0%
times-frac62.0%
sqrt-prod62.0%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.8%
unpow242.8%
pow-prod-down45.9%
sqrt-pow143.6%
metadata-eval43.6%
pow143.6%
*-commutative43.6%
Applied egg-rr96.9%
Taylor expanded in c around 0 56.5%
associate-/r*56.5%
*-commutative56.5%
*-commutative56.5%
unpow256.5%
unpow256.5%
swap-sqr76.0%
unpow276.0%
associate-/l/75.6%
*-commutative75.6%
unpow275.6%
unpow275.6%
swap-sqr95.8%
associate-/l/96.8%
*-lft-identity96.8%
associate-*l/96.9%
associate-/r/95.8%
associate-/r/95.8%
Simplified97.8%
*-commutative97.8%
associate-*r*96.8%
metadata-eval96.8%
pow-div96.8%
inv-pow96.8%
associate-/r*96.9%
pow196.9%
associate-/l/93.6%
associate-/l*93.6%
div-inv93.6%
*-commutative93.6%
associate-/r*96.9%
Applied egg-rr96.9%
Final simplification96.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 (pow (/ 1.0 (/ 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 / (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 / (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 / (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 / (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(1.0 / Float64(1.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 = (1.0 / (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[(1.0 / N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $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{1}{\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}}\right)}^{-2}
\end{array}
Initial program 62.0%
*-un-lft-identity62.0%
add-sqr-sqrt62.0%
times-frac62.0%
sqrt-prod62.0%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.8%
unpow242.8%
pow-prod-down45.9%
sqrt-pow143.6%
metadata-eval43.6%
pow143.6%
*-commutative43.6%
Applied egg-rr96.9%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/l/66.1%
*-commutative66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
associate-/l/81.3%
*-lft-identity81.3%
associate-*l/81.3%
unpow-181.3%
unpow-181.3%
pow-sqr81.3%
metadata-eval81.3%
associate-*r*81.6%
Simplified81.6%
associate-*r*81.3%
/-rgt-identity81.3%
clear-num81.3%
Applied egg-rr81.3%
Final simplification81.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 (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 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 = (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((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((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(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 = (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[(c$95$m * 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(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}^{-2}
\end{array}
Initial program 62.0%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/r*66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
pow-flip81.3%
*-commutative81.3%
metadata-eval81.3%
Applied egg-rr81.3%
Final simplification81.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 (/ 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 62.0%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/r*66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
pow-flip81.3%
*-commutative81.3%
pow-flip80.6%
metadata-eval80.6%
unpow280.6%
frac-times81.3%
Applied egg-rr81.3%
Final simplification81.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 (/ (/ (/ 1.0 x_m) s_m) c_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 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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(Float64(Float64(1.0 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] / c$95$m), $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{\frac{\frac{1}{x\_m}}{s\_m}}{c\_m}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 62.0%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/r*66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
unpow280.6%
associate-*r*78.4%
*-commutative78.4%
associate-*l*77.0%
Applied egg-rr77.0%
Taylor expanded in c around 0 77.0%
*-commutative77.0%
associate-*r*78.3%
Simplified78.3%
metadata-eval78.3%
associate-*r*77.0%
associate-*r*78.4%
associate-*r*80.6%
*-commutative80.6%
frac-times81.3%
*-commutative81.3%
associate-/r*81.1%
associate-/r*81.1%
*-commutative81.1%
associate-/r*81.1%
associate-/r*81.1%
Applied egg-rr81.1%
Final simplification81.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 s_m) (* x_m (* c_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(c_m * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 62.0%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/r*66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
unpow280.6%
associate-*r*78.4%
*-commutative78.4%
associate-*l*77.0%
Applied egg-rr77.0%
Final simplification77.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 s_m) (* x_m (* x_m (* c_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(x_m * Float64(c_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * (x_m * (x_m * (c_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 62.0%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/r*66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
unpow280.6%
associate-*r*78.4%
*-commutative78.4%
associate-*l*77.0%
Applied egg-rr77.0%
Taylor expanded in c around 0 77.0%
*-commutative77.0%
associate-*r*78.3%
Simplified78.3%
Taylor expanded in c around 0 77.0%
associate-*r*78.3%
Simplified78.3%
Final simplification78.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 (* 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 62.0%
Taylor expanded in x around 0 53.0%
associate-/r*53.0%
*-commutative53.0%
unpow253.0%
unpow253.0%
swap-sqr66.5%
unpow266.5%
associate-/r*66.1%
unpow266.1%
unpow266.1%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
*-commutative80.6%
unpow280.6%
Applied egg-rr80.6%
Final simplification80.6%
herbie shell --seed 2024110
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))