
(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 13 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}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
(FPCore (x c s)
:precision binary64
(let* ((t_0 (* s (* x c))) (t_1 (cos (* x 2.0))))
(if (<= x 4.8e+75)
(* (/ (/ 1.0 c) (* x s)) (/ t_1 (* c (* x s))))
(/ 1.0 (* (/ t_0 t_1) t_0)))))x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = s * (x * c);
double t_1 = cos((x * 2.0));
double tmp;
if (x <= 4.8e+75) {
tmp = ((1.0 / c) / (x * s)) * (t_1 / (c * (x * s)));
} else {
tmp = 1.0 / ((t_0 / t_1) * t_0);
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = s * (x * c)
t_1 = cos((x * 2.0d0))
if (x <= 4.8d+75) then
tmp = ((1.0d0 / c) / (x * s)) * (t_1 / (c * (x * s)))
else
tmp = 1.0d0 / ((t_0 / t_1) * t_0)
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = s * (x * c);
double t_1 = Math.cos((x * 2.0));
double tmp;
if (x <= 4.8e+75) {
tmp = ((1.0 / c) / (x * s)) * (t_1 / (c * (x * s)));
} else {
tmp = 1.0 / ((t_0 / t_1) * t_0);
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = s * (x * c) t_1 = math.cos((x * 2.0)) tmp = 0 if x <= 4.8e+75: tmp = ((1.0 / c) / (x * s)) * (t_1 / (c * (x * s))) else: tmp = 1.0 / ((t_0 / t_1) * t_0) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = Float64(s * Float64(x * c)) t_1 = cos(Float64(x * 2.0)) tmp = 0.0 if (x <= 4.8e+75) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s)) * Float64(t_1 / Float64(c * Float64(x * s)))); else tmp = Float64(1.0 / Float64(Float64(t_0 / t_1) * t_0)); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = s * (x * c);
t_1 = cos((x * 2.0));
tmp = 0.0;
if (x <= 4.8e+75)
tmp = ((1.0 / c) / (x * s)) * (t_1 / (c * (x * s)));
else
tmp = 1.0 / ((t_0 / t_1) * t_0);
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x, 4.8e+75], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(t$95$0 / t$95$1), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := s \cdot \left(x \cdot c\right)\\
t_1 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;x \leq 4.8 \cdot 10^{+75}:\\
\;\;\;\;\frac{\frac{1}{c}}{x \cdot s} \cdot \frac{t_1}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{t_0}{t_1} \cdot t_0}\\
\end{array}
\end{array}
if x < 4.8e75Initial program 67.3%
unpow267.3%
*-commutative67.3%
unpow267.3%
Simplified67.3%
*-un-lft-identity67.3%
add-sqr-sqrt67.2%
times-frac67.2%
sqrt-prod67.3%
sqrt-prod34.1%
add-sqr-sqrt47.8%
associate-*r*44.3%
sqrt-prod44.3%
sqrt-prod17.7%
add-sqr-sqrt45.7%
sqrt-prod24.3%
add-sqr-sqrt47.2%
*-commutative47.2%
Applied egg-rr98.0%
Taylor expanded in c around 0 98.0%
associate-/r*98.0%
Simplified98.0%
if 4.8e75 < x Initial program 64.4%
unpow264.4%
*-commutative64.4%
unpow264.4%
Simplified64.4%
*-un-lft-identity64.4%
add-sqr-sqrt64.4%
times-frac64.3%
sqrt-prod64.3%
sqrt-prod35.1%
add-sqr-sqrt57.8%
associate-*r*55.5%
sqrt-prod55.5%
sqrt-prod57.8%
add-sqr-sqrt57.8%
sqrt-prod30.9%
add-sqr-sqrt55.5%
*-commutative55.5%
Applied egg-rr97.6%
Taylor expanded in c around 0 97.6%
associate-/r*97.7%
Simplified97.7%
*-commutative97.7%
clear-num97.8%
associate-/l/97.6%
*-commutative97.6%
*-commutative97.6%
frac-times97.8%
metadata-eval97.8%
associate-*r*92.4%
*-commutative92.4%
associate-*r*94.2%
*-commutative94.2%
Applied egg-rr94.2%
Final simplification97.3%
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
(FPCore (x c s)
:precision binary64
(let* ((t_0 (/ 1.0 (* s (* x c)))))
(if (<= x 8.4e-29)
(pow (* c (* x s)) -2.0)
(if (<= x 2.45e+154)
(/ (cos (* x 2.0)) (* s (* (* x x) (* c (* c s)))))
(* t_0 t_0)))))x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = 1.0 / (s * (x * c));
double tmp;
if (x <= 8.4e-29) {
tmp = pow((c * (x * s)), -2.0);
} else if (x <= 2.45e+154) {
tmp = cos((x * 2.0)) / (s * ((x * x) * (c * (c * s))));
} else {
tmp = t_0 * t_0;
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 / (s * (x * c))
if (x <= 8.4d-29) then
tmp = (c * (x * s)) ** (-2.0d0)
else if (x <= 2.45d+154) then
tmp = cos((x * 2.0d0)) / (s * ((x * x) * (c * (c * s))))
else
tmp = t_0 * t_0
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = 1.0 / (s * (x * c));
double tmp;
if (x <= 8.4e-29) {
tmp = Math.pow((c * (x * s)), -2.0);
} else if (x <= 2.45e+154) {
tmp = Math.cos((x * 2.0)) / (s * ((x * x) * (c * (c * s))));
} else {
tmp = t_0 * t_0;
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = 1.0 / (s * (x * c)) tmp = 0 if x <= 8.4e-29: tmp = math.pow((c * (x * s)), -2.0) elif x <= 2.45e+154: tmp = math.cos((x * 2.0)) / (s * ((x * x) * (c * (c * s)))) else: tmp = t_0 * t_0 return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = Float64(1.0 / Float64(s * Float64(x * c))) tmp = 0.0 if (x <= 8.4e-29) tmp = Float64(c * Float64(x * s)) ^ -2.0; elseif (x <= 2.45e+154) tmp = Float64(cos(Float64(x * 2.0)) / Float64(s * Float64(Float64(x * x) * Float64(c * Float64(c * s))))); else tmp = Float64(t_0 * t_0); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = 1.0 / (s * (x * c));
tmp = 0.0;
if (x <= 8.4e-29)
tmp = (c * (x * s)) ^ -2.0;
elseif (x <= 2.45e+154)
tmp = cos((x * 2.0)) / (s * ((x * x) * (c * (c * s))));
else
tmp = t_0 * t_0;
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[(1.0 / N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 8.4e-29], N[Power[N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], If[LessEqual[x, 2.45e+154], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s * N[(N[(x * x), $MachinePrecision] * N[(c * N[(c * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * t$95$0), $MachinePrecision]]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := \frac{1}{s \cdot \left(x \cdot c\right)}\\
\mathbf{if}\;x \leq 8.4 \cdot 10^{-29}:\\
\;\;\;\;{\left(c \cdot \left(x \cdot s\right)\right)}^{-2}\\
\mathbf{elif}\;x \leq 2.45 \cdot 10^{+154}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{s \cdot \left(\left(x \cdot x\right) \cdot \left(c \cdot \left(c \cdot s\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t_0 \cdot t_0\\
\end{array}
\end{array}
if x < 8.39999999999999958e-29Initial program 66.1%
*-commutative66.1%
associate-*r*60.6%
associate-*r*59.6%
unpow259.6%
unswap-sqr74.2%
unpow274.2%
swap-sqr97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in x around 0 57.1%
unpow257.1%
unpow257.1%
*-commutative57.1%
unpow257.1%
Simplified57.1%
add-sqr-sqrt57.1%
pow257.1%
sqrt-div57.1%
metadata-eval57.1%
sqrt-prod57.1%
sqrt-prod33.5%
add-sqr-sqrt65.2%
sqrt-prod67.0%
sqrt-prod28.4%
add-sqr-sqrt75.3%
sqrt-prod49.1%
add-sqr-sqrt88.2%
pow288.2%
inv-pow88.2%
inv-pow88.2%
pow-prod-up88.1%
metadata-eval88.1%
Applied egg-rr88.1%
if 8.39999999999999958e-29 < x < 2.4500000000000001e154Initial program 77.7%
*-commutative77.7%
associate-*l*77.7%
associate-*r*77.6%
*-commutative77.6%
unpow277.6%
associate-*r*86.5%
associate-*r*89.9%
*-commutative89.9%
unpow289.9%
Simplified89.9%
Taylor expanded in c around 0 89.9%
*-commutative89.9%
unpow289.9%
associate-*l*89.9%
Simplified89.9%
if 2.4500000000000001e154 < x Initial program 61.1%
associate-/r*61.1%
unpow261.1%
*-commutative61.1%
unpow261.1%
Simplified61.1%
Taylor expanded in x around 0 57.8%
unpow257.8%
Simplified57.8%
add-sqr-sqrt57.8%
pow257.8%
sqrt-div57.8%
sqrt-div57.8%
metadata-eval57.8%
sqrt-prod40.2%
add-sqr-sqrt66.7%
associate-*r*63.4%
sqrt-prod63.4%
sqrt-unprod67.1%
add-sqr-sqrt67.1%
sqrt-prod30.2%
add-sqr-sqrt69.7%
*-commutative69.7%
pow269.7%
associate-/l/69.7%
*-commutative69.7%
*-commutative69.7%
Applied egg-rr69.1%
Final simplification85.7%
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
(FPCore (x c s)
:precision binary64
(let* ((t_0 (cos (* x 2.0))))
(if (<= x 2e-24)
(pow (* c (* x s)) -2.0)
(if (<= x 1.3e+178)
(/ t_0 (* x (* x (* (* c s) (* c s)))))
(/ t_0 (* x (* (* c (* x c)) (* s s))))))))x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = cos((x * 2.0));
double tmp;
if (x <= 2e-24) {
tmp = pow((c * (x * s)), -2.0);
} else if (x <= 1.3e+178) {
tmp = t_0 / (x * (x * ((c * s) * (c * s))));
} else {
tmp = t_0 / (x * ((c * (x * c)) * (s * s)));
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x * 2.0d0))
if (x <= 2d-24) then
tmp = (c * (x * s)) ** (-2.0d0)
else if (x <= 1.3d+178) then
tmp = t_0 / (x * (x * ((c * s) * (c * s))))
else
tmp = t_0 / (x * ((c * (x * c)) * (s * s)))
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = Math.cos((x * 2.0));
double tmp;
if (x <= 2e-24) {
tmp = Math.pow((c * (x * s)), -2.0);
} else if (x <= 1.3e+178) {
tmp = t_0 / (x * (x * ((c * s) * (c * s))));
} else {
tmp = t_0 / (x * ((c * (x * c)) * (s * s)));
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = math.cos((x * 2.0)) tmp = 0 if x <= 2e-24: tmp = math.pow((c * (x * s)), -2.0) elif x <= 1.3e+178: tmp = t_0 / (x * (x * ((c * s) * (c * s)))) else: tmp = t_0 / (x * ((c * (x * c)) * (s * s))) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = cos(Float64(x * 2.0)) tmp = 0.0 if (x <= 2e-24) tmp = Float64(c * Float64(x * s)) ^ -2.0; elseif (x <= 1.3e+178) tmp = Float64(t_0 / Float64(x * Float64(x * Float64(Float64(c * s) * Float64(c * s))))); else tmp = Float64(t_0 / Float64(x * Float64(Float64(c * Float64(x * c)) * Float64(s * s)))); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = cos((x * 2.0));
tmp = 0.0;
if (x <= 2e-24)
tmp = (c * (x * s)) ^ -2.0;
elseif (x <= 1.3e+178)
tmp = t_0 / (x * (x * ((c * s) * (c * s))));
else
tmp = t_0 / (x * ((c * (x * c)) * (s * s)));
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x, 2e-24], N[Power[N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], If[LessEqual[x, 1.3e+178], N[(t$95$0 / N[(x * N[(x * N[(N[(c * s), $MachinePrecision] * N[(c * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(x * N[(N[(c * N[(x * c), $MachinePrecision]), $MachinePrecision] * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;x \leq 2 \cdot 10^{-24}:\\
\;\;\;\;{\left(c \cdot \left(x \cdot s\right)\right)}^{-2}\\
\mathbf{elif}\;x \leq 1.3 \cdot 10^{+178}:\\
\;\;\;\;\frac{t_0}{x \cdot \left(x \cdot \left(\left(c \cdot s\right) \cdot \left(c \cdot s\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{x \cdot \left(\left(c \cdot \left(x \cdot c\right)\right) \cdot \left(s \cdot s\right)\right)}\\
\end{array}
\end{array}
if x < 1.99999999999999985e-24Initial program 66.3%
*-commutative66.3%
associate-*r*60.8%
associate-*r*59.8%
unpow259.8%
unswap-sqr74.3%
unpow274.3%
swap-sqr97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in x around 0 57.3%
unpow257.3%
unpow257.3%
*-commutative57.3%
unpow257.3%
Simplified57.3%
add-sqr-sqrt57.3%
pow257.3%
sqrt-div57.3%
metadata-eval57.3%
sqrt-prod57.3%
sqrt-prod33.3%
add-sqr-sqrt65.4%
sqrt-prod67.2%
sqrt-prod28.8%
add-sqr-sqrt75.5%
sqrt-prod49.3%
add-sqr-sqrt88.2%
pow288.2%
inv-pow88.2%
inv-pow88.2%
pow-prod-up88.2%
metadata-eval88.2%
Applied egg-rr88.2%
if 1.99999999999999985e-24 < x < 1.3e178Initial program 76.0%
associate-*r*76.0%
*-commutative76.0%
associate-*r*75.9%
unpow275.9%
unpow275.9%
Simplified75.9%
Taylor expanded in c around 0 75.9%
*-commutative75.9%
unpow275.9%
associate-*r*79.0%
*-commutative79.0%
Simplified79.0%
Taylor expanded in c around 0 75.9%
associate-*r*76.0%
*-commutative76.0%
*-commutative76.0%
unpow276.0%
unpow276.0%
unswap-sqr87.2%
Simplified87.2%
if 1.3e178 < x Initial program 60.4%
associate-*r*63.4%
*-commutative63.4%
associate-*r*63.3%
unpow263.3%
unpow263.3%
Simplified63.3%
Taylor expanded in c around 0 63.3%
*-commutative63.3%
unpow263.3%
associate-*r*78.7%
*-commutative78.7%
Simplified78.7%
Final simplification86.9%
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
(FPCore (x c s)
:precision binary64
(let* ((t_0 (cos (* x 2.0))) (t_1 (* c (* x s))))
(if (<= x 2000000000.0)
(/ (/ t_0 t_1) t_1)
(* (/ 1.0 s) (/ t_0 (* (* x c) (* s (* x c))))))))x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = cos((x * 2.0));
double t_1 = c * (x * s);
double tmp;
if (x <= 2000000000.0) {
tmp = (t_0 / t_1) / t_1;
} else {
tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c))));
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x * 2.0d0))
t_1 = c * (x * s)
if (x <= 2000000000.0d0) then
tmp = (t_0 / t_1) / t_1
else
tmp = (1.0d0 / s) * (t_0 / ((x * c) * (s * (x * c))))
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = Math.cos((x * 2.0));
double t_1 = c * (x * s);
double tmp;
if (x <= 2000000000.0) {
tmp = (t_0 / t_1) / t_1;
} else {
tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c))));
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = math.cos((x * 2.0)) t_1 = c * (x * s) tmp = 0 if x <= 2000000000.0: tmp = (t_0 / t_1) / t_1 else: tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c)))) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = cos(Float64(x * 2.0)) t_1 = Float64(c * Float64(x * s)) tmp = 0.0 if (x <= 2000000000.0) tmp = Float64(Float64(t_0 / t_1) / t_1); else tmp = Float64(Float64(1.0 / s) * Float64(t_0 / Float64(Float64(x * c) * Float64(s * Float64(x * c))))); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = cos((x * 2.0));
t_1 = c * (x * s);
tmp = 0.0;
if (x <= 2000000000.0)
tmp = (t_0 / t_1) / t_1;
else
tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c))));
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 2000000000.0], N[(N[(t$95$0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(1.0 / s), $MachinePrecision] * N[(t$95$0 / N[(N[(x * c), $MachinePrecision] * N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(x \cdot 2\right)\\
t_1 := c \cdot \left(x \cdot s\right)\\
\mathbf{if}\;x \leq 2000000000:\\
\;\;\;\;\frac{\frac{t_0}{t_1}}{t_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s} \cdot \frac{t_0}{\left(x \cdot c\right) \cdot \left(s \cdot \left(x \cdot c\right)\right)}\\
\end{array}
\end{array}
if x < 2e9Initial program 66.8%
unpow266.8%
*-commutative66.8%
unpow266.8%
Simplified66.8%
*-un-lft-identity66.8%
add-sqr-sqrt66.8%
times-frac66.8%
sqrt-prod66.8%
sqrt-prod33.8%
add-sqr-sqrt47.2%
associate-*r*43.5%
sqrt-prod43.5%
sqrt-prod15.5%
add-sqr-sqrt44.9%
sqrt-prod23.9%
add-sqr-sqrt47.6%
*-commutative47.6%
Applied egg-rr97.9%
associate-*l/97.9%
*-un-lft-identity97.9%
Applied egg-rr97.9%
if 2e9 < x Initial program 66.3%
*-commutative66.3%
associate-*r*62.4%
associate-*r*61.6%
unpow261.6%
unswap-sqr75.2%
unpow275.2%
swap-sqr95.0%
*-commutative95.0%
*-commutative95.0%
*-commutative95.0%
*-commutative95.0%
Simplified95.0%
*-un-lft-identity95.0%
associate-*l*95.1%
times-frac95.1%
*-commutative95.1%
Applied egg-rr95.1%
Final simplification97.2%
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
(FPCore (x c s)
:precision binary64
(let* ((t_0 (cos (* x 2.0))))
(if (<= x 1760000000.0)
(* (/ (/ 1.0 c) (* x s)) (/ t_0 (* c (* x s))))
(* (/ 1.0 s) (/ t_0 (* (* x c) (* s (* x c))))))))x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = cos((x * 2.0));
double tmp;
if (x <= 1760000000.0) {
tmp = ((1.0 / c) / (x * s)) * (t_0 / (c * (x * s)));
} else {
tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c))));
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x * 2.0d0))
if (x <= 1760000000.0d0) then
tmp = ((1.0d0 / c) / (x * s)) * (t_0 / (c * (x * s)))
else
tmp = (1.0d0 / s) * (t_0 / ((x * c) * (s * (x * c))))
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = Math.cos((x * 2.0));
double tmp;
if (x <= 1760000000.0) {
tmp = ((1.0 / c) / (x * s)) * (t_0 / (c * (x * s)));
} else {
tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c))));
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = math.cos((x * 2.0)) tmp = 0 if x <= 1760000000.0: tmp = ((1.0 / c) / (x * s)) * (t_0 / (c * (x * s))) else: tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c)))) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = cos(Float64(x * 2.0)) tmp = 0.0 if (x <= 1760000000.0) tmp = Float64(Float64(Float64(1.0 / c) / Float64(x * s)) * Float64(t_0 / Float64(c * Float64(x * s)))); else tmp = Float64(Float64(1.0 / s) * Float64(t_0 / Float64(Float64(x * c) * Float64(s * Float64(x * c))))); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = cos((x * 2.0));
tmp = 0.0;
if (x <= 1760000000.0)
tmp = ((1.0 / c) / (x * s)) * (t_0 / (c * (x * s)));
else
tmp = (1.0 / s) * (t_0 / ((x * c) * (s * (x * c))));
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x, 1760000000.0], N[(N[(N[(1.0 / c), $MachinePrecision] / N[(x * s), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / s), $MachinePrecision] * N[(t$95$0 / N[(N[(x * c), $MachinePrecision] * N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;x \leq 1760000000:\\
\;\;\;\;\frac{\frac{1}{c}}{x \cdot s} \cdot \frac{t_0}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s} \cdot \frac{t_0}{\left(x \cdot c\right) \cdot \left(s \cdot \left(x \cdot c\right)\right)}\\
\end{array}
\end{array}
if x < 1.76e9Initial program 66.8%
unpow266.8%
*-commutative66.8%
unpow266.8%
Simplified66.8%
*-un-lft-identity66.8%
add-sqr-sqrt66.8%
times-frac66.8%
sqrt-prod66.8%
sqrt-prod33.8%
add-sqr-sqrt47.2%
associate-*r*43.5%
sqrt-prod43.5%
sqrt-prod15.5%
add-sqr-sqrt44.9%
sqrt-prod23.9%
add-sqr-sqrt47.6%
*-commutative47.6%
Applied egg-rr97.9%
Taylor expanded in c around 0 97.9%
associate-/r*97.9%
Simplified97.9%
if 1.76e9 < x Initial program 66.3%
*-commutative66.3%
associate-*r*62.4%
associate-*r*61.6%
unpow261.6%
unswap-sqr75.2%
unpow275.2%
swap-sqr95.0%
*-commutative95.0%
*-commutative95.0%
*-commutative95.0%
*-commutative95.0%
Simplified95.0%
*-un-lft-identity95.0%
associate-*l*95.1%
times-frac95.1%
*-commutative95.1%
Applied egg-rr95.1%
Final simplification97.3%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (if (<= x 3.6e-24) (pow (* c (* x s)) -2.0) (/ (cos (* x 2.0)) (* x (* x (* (* c s) (* c s)))))))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double tmp;
if (x <= 3.6e-24) {
tmp = pow((c * (x * s)), -2.0);
} else {
tmp = cos((x * 2.0)) / (x * (x * ((c * s) * (c * s))));
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: tmp
if (x <= 3.6d-24) then
tmp = (c * (x * s)) ** (-2.0d0)
else
tmp = cos((x * 2.0d0)) / (x * (x * ((c * s) * (c * s))))
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double tmp;
if (x <= 3.6e-24) {
tmp = Math.pow((c * (x * s)), -2.0);
} else {
tmp = Math.cos((x * 2.0)) / (x * (x * ((c * s) * (c * s))));
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): tmp = 0 if x <= 3.6e-24: tmp = math.pow((c * (x * s)), -2.0) else: tmp = math.cos((x * 2.0)) / (x * (x * ((c * s) * (c * s)))) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) tmp = 0.0 if (x <= 3.6e-24) tmp = Float64(c * Float64(x * s)) ^ -2.0; else tmp = Float64(cos(Float64(x * 2.0)) / Float64(x * Float64(x * Float64(Float64(c * s) * Float64(c * s))))); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
tmp = 0.0;
if (x <= 3.6e-24)
tmp = (c * (x * s)) ^ -2.0;
else
tmp = cos((x * 2.0)) / (x * (x * ((c * s) * (c * s))));
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. code[x_, c_, s_] := If[LessEqual[x, 3.6e-24], N[Power[N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x * N[(x * N[(N[(c * s), $MachinePrecision] * N[(c * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3.6 \cdot 10^{-24}:\\
\;\;\;\;{\left(c \cdot \left(x \cdot s\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{x \cdot \left(x \cdot \left(\left(c \cdot s\right) \cdot \left(c \cdot s\right)\right)\right)}\\
\end{array}
\end{array}
if x < 3.6000000000000001e-24Initial program 66.3%
*-commutative66.3%
associate-*r*60.8%
associate-*r*59.8%
unpow259.8%
unswap-sqr74.3%
unpow274.3%
swap-sqr97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in x around 0 57.3%
unpow257.3%
unpow257.3%
*-commutative57.3%
unpow257.3%
Simplified57.3%
add-sqr-sqrt57.3%
pow257.3%
sqrt-div57.3%
metadata-eval57.3%
sqrt-prod57.3%
sqrt-prod33.3%
add-sqr-sqrt65.4%
sqrt-prod67.2%
sqrt-prod28.8%
add-sqr-sqrt75.5%
sqrt-prod49.3%
add-sqr-sqrt88.2%
pow288.2%
inv-pow88.2%
inv-pow88.2%
pow-prod-up88.2%
metadata-eval88.2%
Applied egg-rr88.2%
if 3.6000000000000001e-24 < x Initial program 67.9%
associate-*r*69.5%
*-commutative69.5%
associate-*r*69.4%
unpow269.4%
unpow269.4%
Simplified69.4%
Taylor expanded in c around 0 69.4%
*-commutative69.4%
unpow269.4%
associate-*r*78.8%
*-commutative78.8%
Simplified78.8%
Taylor expanded in c around 0 69.4%
associate-*r*66.4%
*-commutative66.4%
*-commutative66.4%
unpow266.4%
unpow266.4%
unswap-sqr80.7%
Simplified80.7%
Final simplification86.4%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (let* ((t_0 (* c (* x s)))) (if (<= x 5e-31) (pow t_0 -2.0) (/ (cos (* x 2.0)) (* (* s (* x c)) t_0)))))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = c * (x * s);
double tmp;
if (x <= 5e-31) {
tmp = pow(t_0, -2.0);
} else {
tmp = cos((x * 2.0)) / ((s * (x * c)) * t_0);
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c * (x * s)
if (x <= 5d-31) then
tmp = t_0 ** (-2.0d0)
else
tmp = cos((x * 2.0d0)) / ((s * (x * c)) * t_0)
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = c * (x * s);
double tmp;
if (x <= 5e-31) {
tmp = Math.pow(t_0, -2.0);
} else {
tmp = Math.cos((x * 2.0)) / ((s * (x * c)) * t_0);
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = c * (x * s) tmp = 0 if x <= 5e-31: tmp = math.pow(t_0, -2.0) else: tmp = math.cos((x * 2.0)) / ((s * (x * c)) * t_0) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = Float64(c * Float64(x * s)) tmp = 0.0 if (x <= 5e-31) tmp = t_0 ^ -2.0; else tmp = Float64(cos(Float64(x * 2.0)) / Float64(Float64(s * Float64(x * c)) * t_0)); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = c * (x * s);
tmp = 0.0;
if (x <= 5e-31)
tmp = t_0 ^ -2.0;
else
tmp = cos((x * 2.0)) / ((s * (x * c)) * t_0);
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 5e-31], N[Power[t$95$0, -2.0], $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := c \cdot \left(x \cdot s\right)\\
\mathbf{if}\;x \leq 5 \cdot 10^{-31}:\\
\;\;\;\;{t_0}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{\left(s \cdot \left(x \cdot c\right)\right) \cdot t_0}\\
\end{array}
\end{array}
if x < 5e-31Initial program 66.1%
*-commutative66.1%
associate-*r*60.6%
associate-*r*59.6%
unpow259.6%
unswap-sqr74.2%
unpow274.2%
swap-sqr97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in x around 0 57.1%
unpow257.1%
unpow257.1%
*-commutative57.1%
unpow257.1%
Simplified57.1%
add-sqr-sqrt57.1%
pow257.1%
sqrt-div57.1%
metadata-eval57.1%
sqrt-prod57.1%
sqrt-prod33.5%
add-sqr-sqrt65.2%
sqrt-prod67.0%
sqrt-prod28.4%
add-sqr-sqrt75.3%
sqrt-prod49.1%
add-sqr-sqrt88.2%
pow288.2%
inv-pow88.2%
inv-pow88.2%
pow-prod-up88.1%
metadata-eval88.1%
Applied egg-rr88.1%
if 5e-31 < x Initial program 68.5%
*-commutative68.5%
associate-*r*64.8%
associate-*r*64.0%
unpow264.0%
unswap-sqr76.8%
unpow276.8%
swap-sqr95.3%
*-commutative95.3%
*-commutative95.3%
*-commutative95.3%
*-commutative95.3%
Simplified95.3%
Taylor expanded in s around 0 94.1%
Final simplification89.6%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (let* ((t_0 (* s (* x c)))) (if (<= x 8e-29) (pow (* c (* x s)) -2.0) (/ (cos (* x 2.0)) (* t_0 t_0)))))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = s * (x * c);
double tmp;
if (x <= 8e-29) {
tmp = pow((c * (x * s)), -2.0);
} else {
tmp = cos((x * 2.0)) / (t_0 * t_0);
}
return tmp;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = s * (x * c)
if (x <= 8d-29) then
tmp = (c * (x * s)) ** (-2.0d0)
else
tmp = cos((x * 2.0d0)) / (t_0 * t_0)
end if
code = tmp
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = s * (x * c);
double tmp;
if (x <= 8e-29) {
tmp = Math.pow((c * (x * s)), -2.0);
} else {
tmp = Math.cos((x * 2.0)) / (t_0 * t_0);
}
return tmp;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = s * (x * c) tmp = 0 if x <= 8e-29: tmp = math.pow((c * (x * s)), -2.0) else: tmp = math.cos((x * 2.0)) / (t_0 * t_0) return tmp
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = Float64(s * Float64(x * c)) tmp = 0.0 if (x <= 8e-29) tmp = Float64(c * Float64(x * s)) ^ -2.0; else tmp = Float64(cos(Float64(x * 2.0)) / Float64(t_0 * t_0)); end return tmp end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp_2 = code(x, c, s)
t_0 = s * (x * c);
tmp = 0.0;
if (x <= 8e-29)
tmp = (c * (x * s)) ^ -2.0;
else
tmp = cos((x * 2.0)) / (t_0 * t_0);
end
tmp_2 = tmp;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 8e-29], N[Power[N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := s \cdot \left(x \cdot c\right)\\
\mathbf{if}\;x \leq 8 \cdot 10^{-29}:\\
\;\;\;\;{\left(c \cdot \left(x \cdot s\right)\right)}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{t_0 \cdot t_0}\\
\end{array}
\end{array}
if x < 7.99999999999999955e-29Initial program 66.1%
*-commutative66.1%
associate-*r*60.6%
associate-*r*59.6%
unpow259.6%
unswap-sqr74.2%
unpow274.2%
swap-sqr97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in x around 0 57.1%
unpow257.1%
unpow257.1%
*-commutative57.1%
unpow257.1%
Simplified57.1%
add-sqr-sqrt57.1%
pow257.1%
sqrt-div57.1%
metadata-eval57.1%
sqrt-prod57.1%
sqrt-prod33.5%
add-sqr-sqrt65.2%
sqrt-prod67.0%
sqrt-prod28.4%
add-sqr-sqrt75.3%
sqrt-prod49.1%
add-sqr-sqrt88.2%
pow288.2%
inv-pow88.2%
inv-pow88.2%
pow-prod-up88.1%
metadata-eval88.1%
Applied egg-rr88.1%
if 7.99999999999999955e-29 < x Initial program 68.5%
*-commutative68.5%
associate-*r*64.8%
associate-*r*64.0%
unpow264.0%
unswap-sqr76.8%
unpow276.8%
swap-sqr95.3%
*-commutative95.3%
*-commutative95.3%
*-commutative95.3%
*-commutative95.3%
Simplified95.3%
Final simplification89.9%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (pow (* c (* x s)) -2.0))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
return pow((c * (x * s)), -2.0);
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = (c * (x * s)) ** (-2.0d0)
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
return Math.pow((c * (x * s)), -2.0);
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): return math.pow((c * (x * s)), -2.0)
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) return Float64(c * Float64(x * s)) ^ -2.0 end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp = code(x, c, s)
tmp = (c * (x * s)) ^ -2.0;
end
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. code[x_, c_, s_] := N[Power[N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
{\left(c \cdot \left(x \cdot s\right)\right)}^{-2}
\end{array}
Initial program 66.7%
*-commutative66.7%
associate-*r*61.7%
associate-*r*60.7%
unpow260.7%
unswap-sqr74.8%
unpow274.8%
swap-sqr96.6%
*-commutative96.6%
*-commutative96.6%
*-commutative96.6%
*-commutative96.6%
Simplified96.6%
Taylor expanded in x around 0 56.1%
unpow256.1%
unpow256.1%
*-commutative56.1%
unpow256.1%
Simplified56.1%
add-sqr-sqrt56.1%
pow256.1%
sqrt-div56.1%
metadata-eval56.1%
sqrt-prod56.1%
sqrt-prod32.8%
add-sqr-sqrt63.4%
sqrt-prod64.8%
sqrt-prod36.2%
add-sqr-sqrt71.6%
sqrt-prod45.3%
add-sqr-sqrt81.7%
pow281.7%
inv-pow81.7%
inv-pow81.7%
pow-prod-up81.7%
metadata-eval81.7%
Applied egg-rr81.7%
Final simplification81.7%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (let* ((t_0 (/ 1.0 (* c (* x s))))) (* t_0 t_0)))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = 1.0 / (c * (x * s));
return t_0 * t_0;
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
t_0 = 1.0d0 / (c * (x * s))
code = t_0 * t_0
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = 1.0 / (c * (x * s));
return t_0 * t_0;
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = 1.0 / (c * (x * s)) return t_0 * t_0
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = Float64(1.0 / Float64(c * Float64(x * s))) return Float64(t_0 * t_0) end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp = code(x, c, s)
t_0 = 1.0 / (c * (x * s));
tmp = t_0 * t_0;
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[(1.0 / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c \cdot \left(x \cdot s\right)}\\
t_0 \cdot t_0
\end{array}
\end{array}
Initial program 66.7%
*-commutative66.7%
associate-*r*61.7%
associate-*r*60.7%
unpow260.7%
unswap-sqr74.8%
unpow274.8%
swap-sqr96.6%
*-commutative96.6%
*-commutative96.6%
*-commutative96.6%
*-commutative96.6%
Simplified96.6%
Taylor expanded in x around 0 56.1%
unpow256.1%
unpow256.1%
*-commutative56.1%
unpow256.1%
Simplified56.1%
add-sqr-sqrt56.1%
pow256.1%
sqrt-div56.1%
metadata-eval56.1%
sqrt-prod56.1%
sqrt-prod32.8%
add-sqr-sqrt63.4%
sqrt-prod64.8%
sqrt-prod36.2%
add-sqr-sqrt71.6%
sqrt-prod45.3%
add-sqr-sqrt81.7%
pow281.7%
Applied egg-rr81.7%
Final simplification81.7%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (/ 1.0 (* (* c c) (* (* s s) (* x x)))))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
return 1.0 / ((c * c) * ((s * s) * (x * x)));
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = 1.0d0 / ((c * c) * ((s * s) * (x * x)))
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
return 1.0 / ((c * c) * ((s * s) * (x * x)));
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): return 1.0 / ((c * c) * ((s * s) * (x * x)))
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) return Float64(1.0 / Float64(Float64(c * c) * Float64(Float64(s * s) * Float64(x * x)))) end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp = code(x, c, s)
tmp = 1.0 / ((c * c) * ((s * s) * (x * x)));
end
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. code[x_, c_, s_] := N[(1.0 / N[(N[(c * c), $MachinePrecision] * N[(N[(s * s), $MachinePrecision] * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\frac{1}{\left(c \cdot c\right) \cdot \left(\left(s \cdot s\right) \cdot \left(x \cdot x\right)\right)}
\end{array}
Initial program 66.7%
*-commutative66.7%
associate-*r*61.7%
associate-*r*60.7%
unpow260.7%
unswap-sqr74.8%
unpow274.8%
swap-sqr96.6%
*-commutative96.6%
*-commutative96.6%
*-commutative96.6%
*-commutative96.6%
Simplified96.6%
Taylor expanded in x around 0 56.1%
unpow256.1%
unpow256.1%
*-commutative56.1%
unpow256.1%
Simplified56.1%
Final simplification56.1%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (let* ((t_0 (* s (* x c)))) (/ 1.0 (* t_0 t_0))))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
double t_0 = s * (x * c);
return 1.0 / (t_0 * t_0);
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
real(8) :: t_0
t_0 = s * (x * c)
code = 1.0d0 / (t_0 * t_0)
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
double t_0 = s * (x * c);
return 1.0 / (t_0 * t_0);
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): t_0 = s * (x * c) return 1.0 / (t_0 * t_0)
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) t_0 = Float64(s * Float64(x * c)) return Float64(1.0 / Float64(t_0 * t_0)) end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp = code(x, c, s)
t_0 = s * (x * c);
tmp = 1.0 / (t_0 * t_0);
end
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
code[x_, c_, s_] := Block[{t$95$0 = N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
t_0 := s \cdot \left(x \cdot c\right)\\
\frac{1}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 66.7%
unpow266.7%
*-commutative66.7%
unpow266.7%
Simplified66.7%
*-un-lft-identity66.7%
add-sqr-sqrt66.7%
times-frac66.7%
sqrt-prod66.7%
sqrt-prod34.3%
add-sqr-sqrt49.7%
associate-*r*46.5%
sqrt-prod46.5%
sqrt-prod25.4%
add-sqr-sqrt48.0%
sqrt-prod25.5%
add-sqr-sqrt48.8%
*-commutative48.8%
Applied egg-rr97.9%
Taylor expanded in c around 0 97.9%
associate-/r*98.0%
Simplified98.0%
*-commutative98.0%
clear-num98.0%
associate-/l/97.9%
*-commutative97.9%
*-commutative97.9%
frac-times97.9%
metadata-eval97.9%
associate-*r*95.1%
*-commutative95.1%
associate-*r*96.7%
*-commutative96.7%
Applied egg-rr96.7%
Taylor expanded in x around 0 80.0%
*-commutative80.0%
associate-*l*80.7%
*-commutative80.7%
Simplified80.7%
Final simplification80.7%
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. (FPCore (x c s) :precision binary64 (/ (/ 1.0 c) (* (* x s) (* c (* x s)))))
x = abs(x);
c = abs(c);
s = abs(s);
assert(c < s);
double code(double x, double c, double s) {
return (1.0 / c) / ((x * s) * (c * (x * s)));
}
NOTE: x should be positive before calling this function
NOTE: c should be positive before calling this function
NOTE: s should be positive before calling this function
NOTE: c and s should be sorted in increasing order before calling this function.
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = (1.0d0 / c) / ((x * s) * (c * (x * s)))
end function
x = Math.abs(x);
c = Math.abs(c);
s = Math.abs(s);
assert c < s;
public static double code(double x, double c, double s) {
return (1.0 / c) / ((x * s) * (c * (x * s)));
}
x = abs(x) c = abs(c) s = abs(s) [c, s] = sort([c, s]) def code(x, c, s): return (1.0 / c) / ((x * s) * (c * (x * s)))
x = abs(x) c = abs(c) s = abs(s) c, s = sort([c, s]) function code(x, c, s) return Float64(Float64(1.0 / c) / Float64(Float64(x * s) * Float64(c * Float64(x * s)))) end
x = abs(x)
c = abs(c)
s = abs(s)
c, s = num2cell(sort([c, s])){:}
function tmp = code(x, c, s)
tmp = (1.0 / c) / ((x * s) * (c * (x * s)));
end
NOTE: x should be positive before calling this function NOTE: c should be positive before calling this function NOTE: s should be positive before calling this function NOTE: c and s should be sorted in increasing order before calling this function. code[x_, c_, s_] := N[(N[(1.0 / c), $MachinePrecision] / N[(N[(x * s), $MachinePrecision] * N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\frac{\frac{1}{c}}{\left(x \cdot s\right) \cdot \left(c \cdot \left(x \cdot s\right)\right)}
\end{array}
Initial program 66.7%
unpow266.7%
*-commutative66.7%
unpow266.7%
Simplified66.7%
*-un-lft-identity66.7%
add-sqr-sqrt66.7%
times-frac66.7%
sqrt-prod66.7%
sqrt-prod34.3%
add-sqr-sqrt49.7%
associate-*r*46.5%
sqrt-prod46.5%
sqrt-prod25.4%
add-sqr-sqrt48.0%
sqrt-prod25.5%
add-sqr-sqrt48.8%
*-commutative48.8%
Applied egg-rr97.9%
Taylor expanded in x around 0 55.3%
*-commutative55.3%
unpow255.3%
unpow255.3%
swap-sqr67.3%
unpow267.3%
swap-sqr80.7%
associate-*r*80.0%
associate-*r*81.7%
associate-/r*81.7%
*-lft-identity81.7%
associate-*l/81.7%
unpow-181.7%
unpow-181.7%
pow-sqr81.7%
associate-*r*80.8%
*-commutative80.8%
metadata-eval80.8%
Simplified80.8%
*-commutative80.8%
associate-*r*81.7%
metadata-eval81.7%
pow-prod-up81.7%
inv-pow81.7%
inv-pow81.7%
*-commutative81.7%
*-commutative81.7%
associate-/l/81.8%
frac-times80.6%
*-un-lft-identity80.6%
associate-*r*79.0%
*-commutative79.0%
Applied egg-rr79.0%
Taylor expanded in s around 0 80.6%
Final simplification80.6%
herbie shell --seed 2023213
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))