
(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 (cos (* x 2.0))))
(if (<= x 11600000000000.0)
(/ (/ (/ t_0 c) (* x s)) (* 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 <= 11600000000000.0) {
tmp = ((t_0 / c) / (x * s)) / (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 <= 11600000000000.0d0) then
tmp = ((t_0 / c) / (x * s)) / (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 <= 11600000000000.0) {
tmp = ((t_0 / c) / (x * s)) / (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 <= 11600000000000.0: tmp = ((t_0 / c) / (x * s)) / (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 <= 11600000000000.0) tmp = Float64(Float64(Float64(t_0 / c) / Float64(x * s)) / 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 <= 11600000000000.0)
tmp = ((t_0 / c) / (x * s)) / (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, 11600000000000.0], N[(N[(N[(t$95$0 / c), $MachinePrecision] / N[(x * s), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s), $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 11600000000000:\\
\;\;\;\;\frac{\frac{\frac{t_0}{c}}{x \cdot s}}{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.16e13Initial program 62.2%
unpow262.2%
*-commutative62.2%
unpow262.2%
Simplified62.2%
*-un-lft-identity62.2%
add-sqr-sqrt62.2%
times-frac62.2%
sqrt-prod62.2%
sqrt-prod26.5%
add-sqr-sqrt38.1%
associate-*r*35.4%
sqrt-prod35.4%
sqrt-prod11.0%
add-sqr-sqrt38.9%
sqrt-prod19.6%
add-sqr-sqrt41.4%
*-commutative41.4%
Applied egg-rr95.9%
associate-*l/95.9%
*-un-lft-identity95.9%
Applied egg-rr95.9%
Taylor expanded in x around inf 95.9%
associate-/r*95.9%
*-commutative95.9%
Simplified95.9%
if 1.16e13 < x Initial program 73.1%
*-commutative73.1%
associate-*r*65.8%
associate-*r*64.1%
unpow264.1%
unswap-sqr82.5%
unpow282.5%
swap-sqr99.2%
*-commutative99.2%
*-commutative99.2%
*-commutative99.2%
*-commutative99.2%
Simplified99.2%
*-un-lft-identity99.2%
associate-*l*99.3%
times-frac99.3%
*-commutative99.3%
Applied egg-rr99.3%
Final simplification96.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 (if (<= x 3.35e-18) (/ (/ (/ 1.0 (* x s)) c) (* c (* x s))) (/ (cos (* x 2.0)) (* s (* (* x x) (* c (* 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.35e-18) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} else {
tmp = cos((x * 2.0)) / (s * ((x * x) * (c * (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.35d-18) then
tmp = ((1.0d0 / (x * s)) / c) / (c * (x * s))
else
tmp = cos((x * 2.0d0)) / (s * ((x * x) * (c * (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.35e-18) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} else {
tmp = Math.cos((x * 2.0)) / (s * ((x * x) * (c * (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.35e-18: tmp = ((1.0 / (x * s)) / c) / (c * (x * s)) else: tmp = math.cos((x * 2.0)) / (s * ((x * x) * (c * (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.35e-18) tmp = Float64(Float64(Float64(1.0 / Float64(x * s)) / c) / Float64(c * Float64(x * s))); else tmp = Float64(cos(Float64(x * 2.0)) / Float64(s * Float64(Float64(x * x) * Float64(c * 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.35e-18)
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
else
tmp = cos((x * 2.0)) / (s * ((x * x) * (c * (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.35e-18], N[(N[(N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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]]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3.35 \cdot 10^{-18}:\\
\;\;\;\;\frac{\frac{\frac{1}{x \cdot s}}{c}}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\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)}\\
\end{array}
\end{array}
if x < 3.3499999999999999e-18Initial program 62.5%
unpow262.5%
*-commutative62.5%
unpow262.5%
Simplified62.5%
*-un-lft-identity62.5%
add-sqr-sqrt62.5%
times-frac62.5%
sqrt-prod62.5%
sqrt-prod27.2%
add-sqr-sqrt38.8%
associate-*r*36.0%
sqrt-prod36.0%
sqrt-prod10.4%
add-sqr-sqrt39.6%
sqrt-prod20.5%
add-sqr-sqrt42.3%
*-commutative42.3%
Applied egg-rr95.7%
associate-*l/95.7%
*-un-lft-identity95.7%
Applied egg-rr95.7%
Taylor expanded in x around inf 95.7%
associate-/r*95.8%
*-commutative95.8%
Simplified95.8%
Taylor expanded in x around 0 81.2%
associate-/r*81.2%
associate-/l/83.2%
associate-/l/83.2%
*-commutative83.2%
Simplified83.2%
if 3.3499999999999999e-18 < x Initial program 70.9%
*-commutative70.9%
associate-*l*64.5%
associate-*r*62.8%
*-commutative62.8%
unpow262.8%
associate-*r*75.1%
associate-*r*79.5%
*-commutative79.5%
unpow279.5%
Simplified79.5%
Taylor expanded in c around 0 79.5%
*-commutative79.5%
unpow279.5%
associate-*l*82.4%
Simplified82.4%
Final simplification83.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. (FPCore (x c s) :precision binary64 (if (<= x 2.8e-5) (/ (/ (/ 1.0 (* x s)) c) (* c (* x s))) (/ (cos (* x 2.0)) (* x (* c (* c (* s (* x 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 <= 2.8e-5) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} else {
tmp = cos((x * 2.0)) / (x * (c * (c * (s * (x * 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 <= 2.8d-5) then
tmp = ((1.0d0 / (x * s)) / c) / (c * (x * s))
else
tmp = cos((x * 2.0d0)) / (x * (c * (c * (s * (x * 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 <= 2.8e-5) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} else {
tmp = Math.cos((x * 2.0)) / (x * (c * (c * (s * (x * 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 <= 2.8e-5: tmp = ((1.0 / (x * s)) / c) / (c * (x * s)) else: tmp = math.cos((x * 2.0)) / (x * (c * (c * (s * (x * 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 <= 2.8e-5) tmp = Float64(Float64(Float64(1.0 / Float64(x * s)) / c) / Float64(c * Float64(x * s))); else tmp = Float64(cos(Float64(x * 2.0)) / Float64(x * Float64(c * Float64(c * Float64(s * Float64(x * 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 <= 2.8e-5)
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
else
tmp = cos((x * 2.0)) / (x * (c * (c * (s * (x * 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, 2.8e-5], N[(N[(N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x * N[(c * N[(c * N[(s * N[(x * s), $MachinePrecision]), $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 2.8 \cdot 10^{-5}:\\
\;\;\;\;\frac{\frac{\frac{1}{x \cdot s}}{c}}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{x \cdot \left(c \cdot \left(c \cdot \left(s \cdot \left(x \cdot s\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.79999999999999996e-5Initial program 63.1%
unpow263.1%
*-commutative63.1%
unpow263.1%
Simplified63.1%
*-un-lft-identity63.1%
add-sqr-sqrt63.1%
times-frac63.1%
sqrt-prod63.1%
sqrt-prod27.2%
add-sqr-sqrt38.7%
associate-*r*36.0%
sqrt-prod35.9%
sqrt-prod10.8%
add-sqr-sqrt39.5%
sqrt-prod20.2%
add-sqr-sqrt41.7%
*-commutative41.7%
Applied egg-rr95.8%
associate-*l/95.8%
*-un-lft-identity95.8%
Applied egg-rr95.8%
Taylor expanded in x around inf 95.8%
associate-/r*95.8%
*-commutative95.8%
Simplified95.8%
Taylor expanded in x around 0 81.5%
associate-/r*81.5%
associate-/l/83.5%
associate-/l/83.4%
*-commutative83.4%
Simplified83.4%
if 2.79999999999999996e-5 < x Initial program 69.5%
associate-*r*69.0%
*-commutative69.0%
associate-*r*68.9%
unpow268.9%
unpow268.9%
Simplified68.9%
Taylor expanded in c around 0 68.9%
unpow268.9%
associate-*r*65.9%
*-commutative65.9%
associate-*r*69.0%
*-commutative69.0%
unpow269.0%
associate-*l*73.6%
*-commutative73.6%
associate-*l*79.8%
Simplified79.8%
Final simplification82.5%
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 0.0195) (/ (/ (/ 1.0 (* x s)) c) (* c (* x s))) (/ (cos (* x 2.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 tmp;
if (x <= 0.0195) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} else {
tmp = cos((x * 2.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) :: tmp
if (x <= 0.0195d0) then
tmp = ((1.0d0 / (x * s)) / c) / (c * (x * s))
else
tmp = cos((x * 2.0d0)) / (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 tmp;
if (x <= 0.0195) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} else {
tmp = Math.cos((x * 2.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): tmp = 0 if x <= 0.0195: tmp = ((1.0 / (x * s)) / c) / (c * (x * s)) else: tmp = math.cos((x * 2.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) tmp = 0.0 if (x <= 0.0195) tmp = Float64(Float64(Float64(1.0 / Float64(x * s)) / c) / Float64(c * Float64(x * s))); else tmp = Float64(cos(Float64(x * 2.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)
tmp = 0.0;
if (x <= 0.0195)
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
else
tmp = cos((x * 2.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_] := If[LessEqual[x, 0.0195], N[(N[(N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / 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}
\mathbf{if}\;x \leq 0.0195:\\
\;\;\;\;\frac{\frac{\frac{1}{x \cdot s}}{c}}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{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 < 0.0195Initial program 63.0%
unpow263.0%
*-commutative63.0%
unpow263.0%
Simplified63.0%
*-un-lft-identity63.0%
add-sqr-sqrt62.9%
times-frac62.9%
sqrt-prod63.0%
sqrt-prod27.0%
add-sqr-sqrt38.8%
associate-*r*36.1%
sqrt-prod36.1%
sqrt-prod11.2%
add-sqr-sqrt39.6%
sqrt-prod20.0%
add-sqr-sqrt41.8%
*-commutative41.8%
Applied egg-rr95.8%
associate-*l/95.8%
*-un-lft-identity95.8%
Applied egg-rr95.8%
Taylor expanded in x around inf 95.8%
associate-/r*95.9%
*-commutative95.9%
Simplified95.9%
Taylor expanded in x around 0 81.5%
associate-/r*81.5%
associate-/l/83.4%
associate-/l/83.4%
*-commutative83.4%
Simplified83.4%
if 0.0195 < x Initial program 70.2%
associate-*r*69.6%
*-commutative69.6%
associate-*r*69.6%
unpow269.6%
unpow269.6%
Simplified69.6%
Taylor expanded in c around 0 69.6%
*-commutative69.6%
unpow269.6%
associate-*r*74.2%
*-commutative74.2%
Simplified74.2%
Final simplification81.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 (* c (* x s))))
(if (<= x 1e-13)
(/ (/ (/ 1.0 (* x s)) c) t_0)
(/ (cos (* x 2.0)) (* t_0 (* 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 = c * (x * s);
double tmp;
if (x <= 1e-13) {
tmp = ((1.0 / (x * s)) / c) / t_0;
} else {
tmp = cos((x * 2.0)) / (t_0 * (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 = c * (x * s)
if (x <= 1d-13) then
tmp = ((1.0d0 / (x * s)) / c) / t_0
else
tmp = cos((x * 2.0d0)) / (t_0 * (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 = c * (x * s);
double tmp;
if (x <= 1e-13) {
tmp = ((1.0 / (x * s)) / c) / t_0;
} else {
tmp = Math.cos((x * 2.0)) / (t_0 * (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 = c * (x * s) tmp = 0 if x <= 1e-13: tmp = ((1.0 / (x * s)) / c) / t_0 else: tmp = math.cos((x * 2.0)) / (t_0 * (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 = Float64(c * Float64(x * s)) tmp = 0.0 if (x <= 1e-13) tmp = Float64(Float64(Float64(1.0 / Float64(x * s)) / c) / t_0); else tmp = Float64(cos(Float64(x * 2.0)) / Float64(t_0 * 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 = c * (x * s);
tmp = 0.0;
if (x <= 1e-13)
tmp = ((1.0 / (x * s)) / c) / t_0;
else
tmp = cos((x * 2.0)) / (t_0 * (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[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1e-13], N[(N[(N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * N[(s * N[(x * c), $MachinePrecision]), $MachinePrecision]), $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 10^{-13}:\\
\;\;\;\;\frac{\frac{\frac{1}{x \cdot s}}{c}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{t_0 \cdot \left(s \cdot \left(x \cdot c\right)\right)}\\
\end{array}
\end{array}
if x < 1e-13Initial program 62.9%
unpow262.9%
*-commutative62.9%
unpow262.9%
Simplified62.9%
*-un-lft-identity62.9%
add-sqr-sqrt62.9%
times-frac62.9%
sqrt-prod62.9%
sqrt-prod27.4%
add-sqr-sqrt38.9%
associate-*r*36.2%
sqrt-prod36.1%
sqrt-prod10.9%
add-sqr-sqrt39.7%
sqrt-prod20.3%
add-sqr-sqrt41.9%
*-commutative41.9%
Applied egg-rr95.8%
associate-*l/95.8%
*-un-lft-identity95.8%
Applied egg-rr95.8%
Taylor expanded in x around inf 95.8%
associate-/r*95.8%
*-commutative95.8%
Simplified95.8%
Taylor expanded in x around 0 81.4%
associate-/r*81.4%
associate-/l/83.4%
associate-/l/83.3%
*-commutative83.3%
Simplified83.3%
if 1e-13 < x Initial program 70.0%
*-commutative70.0%
associate-*r*63.5%
associate-*r*61.9%
unpow261.9%
unswap-sqr78.5%
unpow278.5%
swap-sqr99.2%
*-commutative99.2%
*-commutative99.2%
*-commutative99.2%
*-commutative99.2%
Simplified99.2%
Taylor expanded in s around 0 97.9%
Final simplification87.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))))
(if (<= x 2.25e-13)
(/ (/ (/ 1.0 (* x s)) c) (* c (* x s)))
(/ (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 <= 2.25e-13) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} 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 <= 2.25d-13) then
tmp = ((1.0d0 / (x * s)) / c) / (c * (x * s))
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 <= 2.25e-13) {
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
} 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 <= 2.25e-13: tmp = ((1.0 / (x * s)) / c) / (c * (x * s)) 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 <= 2.25e-13) tmp = Float64(Float64(Float64(1.0 / Float64(x * s)) / c) / Float64(c * Float64(x * s))); 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 <= 2.25e-13)
tmp = ((1.0 / (x * s)) / c) / (c * (x * s));
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, 2.25e-13], N[(N[(N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $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 2.25 \cdot 10^{-13}:\\
\;\;\;\;\frac{\frac{\frac{1}{x \cdot s}}{c}}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x \cdot 2\right)}{t_0 \cdot t_0}\\
\end{array}
\end{array}
if x < 2.25e-13Initial program 62.9%
unpow262.9%
*-commutative62.9%
unpow262.9%
Simplified62.9%
*-un-lft-identity62.9%
add-sqr-sqrt62.9%
times-frac62.9%
sqrt-prod62.9%
sqrt-prod27.4%
add-sqr-sqrt38.9%
associate-*r*36.2%
sqrt-prod36.1%
sqrt-prod10.9%
add-sqr-sqrt39.7%
sqrt-prod20.3%
add-sqr-sqrt41.9%
*-commutative41.9%
Applied egg-rr95.8%
associate-*l/95.8%
*-un-lft-identity95.8%
Applied egg-rr95.8%
Taylor expanded in x around inf 95.8%
associate-/r*95.8%
*-commutative95.8%
Simplified95.8%
Taylor expanded in x around 0 81.4%
associate-/r*81.4%
associate-/l/83.4%
associate-/l/83.3%
*-commutative83.3%
Simplified83.3%
if 2.25e-13 < x Initial program 70.0%
*-commutative70.0%
associate-*r*63.5%
associate-*r*61.9%
unpow261.9%
unswap-sqr78.5%
unpow278.5%
swap-sqr99.2%
*-commutative99.2%
*-commutative99.2%
*-commutative99.2%
*-commutative99.2%
Simplified99.2%
Final simplification87.5%
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))) (t_2 (* c (* x s)))) (if (<= x 9e+119) (/ (/ t_1 t_2) t_2) (/ t_1 (* 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 t_1 = cos((x * 2.0));
double t_2 = c * (x * s);
double tmp;
if (x <= 9e+119) {
tmp = (t_1 / t_2) / t_2;
} else {
tmp = t_1 / (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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = s * (x * c)
t_1 = cos((x * 2.0d0))
t_2 = c * (x * s)
if (x <= 9d+119) then
tmp = (t_1 / t_2) / t_2
else
tmp = t_1 / (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 t_1 = Math.cos((x * 2.0));
double t_2 = c * (x * s);
double tmp;
if (x <= 9e+119) {
tmp = (t_1 / t_2) / t_2;
} else {
tmp = t_1 / (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) t_1 = math.cos((x * 2.0)) t_2 = c * (x * s) tmp = 0 if x <= 9e+119: tmp = (t_1 / t_2) / t_2 else: tmp = t_1 / (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)) t_1 = cos(Float64(x * 2.0)) t_2 = Float64(c * Float64(x * s)) tmp = 0.0 if (x <= 9e+119) tmp = Float64(Float64(t_1 / t_2) / t_2); else tmp = Float64(t_1 / 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);
t_1 = cos((x * 2.0));
t_2 = c * (x * s);
tmp = 0.0;
if (x <= 9e+119)
tmp = (t_1 / t_2) / t_2;
else
tmp = t_1 / (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]}, Block[{t$95$1 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 9e+119], N[(N[(t$95$1 / t$95$2), $MachinePrecision] / t$95$2), $MachinePrecision], N[(t$95$1 / 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)\\
t_1 := \cos \left(x \cdot 2\right)\\
t_2 := c \cdot \left(x \cdot s\right)\\
\mathbf{if}\;x \leq 9 \cdot 10^{+119}:\\
\;\;\;\;\frac{\frac{t_1}{t_2}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{t_0 \cdot t_0}\\
\end{array}
\end{array}
if x < 9.00000000000000039e119Initial program 64.0%
unpow264.0%
*-commutative64.0%
unpow264.0%
Simplified64.0%
*-un-lft-identity64.0%
add-sqr-sqrt63.9%
times-frac64.0%
sqrt-prod64.0%
sqrt-prod27.3%
add-sqr-sqrt39.9%
associate-*r*37.5%
sqrt-prod37.5%
sqrt-prod15.9%
add-sqr-sqrt40.6%
sqrt-prod20.7%
add-sqr-sqrt44.6%
*-commutative44.6%
Applied egg-rr96.3%
associate-*l/96.3%
*-un-lft-identity96.3%
Applied egg-rr96.3%
if 9.00000000000000039e119 < x Initial program 69.8%
*-commutative69.8%
associate-*r*57.2%
associate-*r*57.0%
unpow257.0%
unswap-sqr87.8%
unpow287.8%
swap-sqr99.1%
*-commutative99.1%
*-commutative99.1%
*-commutative99.1%
*-commutative99.1%
Simplified99.1%
Final simplification96.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 (* s (* x c))) (t_1 (cos (* x 2.0))))
(if (<= x 7.2e+117)
(/ (/ (/ t_1 c) (* x s)) (* c (* x s)))
(/ t_1 (* 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 t_1 = cos((x * 2.0));
double tmp;
if (x <= 7.2e+117) {
tmp = ((t_1 / c) / (x * s)) / (c * (x * s));
} else {
tmp = t_1 / (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) :: t_1
real(8) :: tmp
t_0 = s * (x * c)
t_1 = cos((x * 2.0d0))
if (x <= 7.2d+117) then
tmp = ((t_1 / c) / (x * s)) / (c * (x * s))
else
tmp = t_1 / (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 t_1 = Math.cos((x * 2.0));
double tmp;
if (x <= 7.2e+117) {
tmp = ((t_1 / c) / (x * s)) / (c * (x * s));
} else {
tmp = t_1 / (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) t_1 = math.cos((x * 2.0)) tmp = 0 if x <= 7.2e+117: tmp = ((t_1 / c) / (x * s)) / (c * (x * s)) else: tmp = t_1 / (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)) t_1 = cos(Float64(x * 2.0)) tmp = 0.0 if (x <= 7.2e+117) tmp = Float64(Float64(Float64(t_1 / c) / Float64(x * s)) / Float64(c * Float64(x * s))); else tmp = Float64(t_1 / 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);
t_1 = cos((x * 2.0));
tmp = 0.0;
if (x <= 7.2e+117)
tmp = ((t_1 / c) / (x * s)) / (c * (x * s));
else
tmp = t_1 / (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]}, Block[{t$95$1 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x, 7.2e+117], N[(N[(N[(t$95$1 / c), $MachinePrecision] / N[(x * s), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / 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)\\
t_1 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;x \leq 7.2 \cdot 10^{+117}:\\
\;\;\;\;\frac{\frac{\frac{t_1}{c}}{x \cdot s}}{c \cdot \left(x \cdot s\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{t_0 \cdot t_0}\\
\end{array}
\end{array}
if x < 7.20000000000000025e117Initial program 64.0%
unpow264.0%
*-commutative64.0%
unpow264.0%
Simplified64.0%
*-un-lft-identity64.0%
add-sqr-sqrt63.9%
times-frac64.0%
sqrt-prod64.0%
sqrt-prod27.3%
add-sqr-sqrt39.9%
associate-*r*37.5%
sqrt-prod37.5%
sqrt-prod15.9%
add-sqr-sqrt40.6%
sqrt-prod20.7%
add-sqr-sqrt44.6%
*-commutative44.6%
Applied egg-rr96.3%
associate-*l/96.3%
*-un-lft-identity96.3%
Applied egg-rr96.3%
Taylor expanded in x around inf 96.3%
associate-/r*96.3%
*-commutative96.3%
Simplified96.3%
if 7.20000000000000025e117 < x Initial program 69.8%
*-commutative69.8%
associate-*r*57.2%
associate-*r*57.0%
unpow257.0%
unswap-sqr87.8%
unpow287.8%
swap-sqr99.1%
*-commutative99.1%
*-commutative99.1%
*-commutative99.1%
*-commutative99.1%
Simplified99.1%
Final simplification96.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 64.8%
*-commutative64.8%
associate-*r*59.5%
associate-*r*58.8%
unpow258.8%
unswap-sqr72.4%
unpow272.4%
swap-sqr97.6%
*-commutative97.6%
*-commutative97.6%
*-commutative97.6%
*-commutative97.6%
Simplified97.6%
Taylor expanded in x around 0 51.8%
unpow251.8%
unpow251.8%
*-commutative51.8%
unpow251.8%
Simplified51.8%
Final simplification51.8%
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 (* x (* c s)))) (/ 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 = x * (c * s);
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 = x * (c * s)
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 = x * (c * s);
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 = x * (c * s) 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(x * Float64(c * s)) 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 = x * (c * s);
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[(x * N[(c * s), $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 := x \cdot \left(c \cdot s\right)\\
\frac{1}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 64.8%
unpow264.8%
*-commutative64.8%
unpow264.8%
Simplified64.8%
*-un-lft-identity64.8%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.8%
sqrt-prod27.6%
add-sqr-sqrt42.4%
associate-*r*39.8%
sqrt-prod39.8%
sqrt-prod21.7%
add-sqr-sqrt43.0%
sqrt-prod21.3%
add-sqr-sqrt46.3%
*-commutative46.3%
Applied egg-rr96.4%
associate-*l/96.4%
*-un-lft-identity96.4%
Applied egg-rr96.4%
Taylor expanded in x around 0 51.5%
associate-*r*51.7%
*-commutative51.7%
associate-*r*51.8%
associate-/r*51.7%
unpow251.7%
associate-/r*51.7%
*-lft-identity51.7%
associate-*l/51.7%
*-commutative51.7%
unpow251.7%
unpow251.7%
swap-sqr64.4%
times-frac76.8%
unpow276.8%
*-commutative76.8%
associate-/r*77.6%
Simplified77.6%
unpow277.6%
clear-num77.6%
clear-num77.5%
frac-times77.5%
metadata-eval77.5%
div-inv77.5%
clear-num77.6%
div-inv77.6%
clear-num77.6%
/-rgt-identity77.6%
div-inv77.6%
clear-num77.6%
div-inv77.6%
clear-num77.6%
/-rgt-identity77.6%
Applied egg-rr77.6%
Final simplification77.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 (* c (* x s)))) (/ (/ 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 = c * (x * s);
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 = c * (x * s)
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 = c * (x * s);
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 = c * (x * s) 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(c * Float64(x * s)) return Float64(Float64(1.0 / 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 = c * (x * s);
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[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $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)\\
\frac{\frac{1}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 64.8%
unpow264.8%
*-commutative64.8%
unpow264.8%
Simplified64.8%
*-un-lft-identity64.8%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.8%
sqrt-prod27.6%
add-sqr-sqrt42.4%
associate-*r*39.8%
sqrt-prod39.8%
sqrt-prod21.7%
add-sqr-sqrt43.0%
sqrt-prod21.3%
add-sqr-sqrt46.3%
*-commutative46.3%
Applied egg-rr96.4%
associate-*l/96.4%
*-un-lft-identity96.4%
Applied egg-rr96.4%
Taylor expanded in x around 0 76.8%
Final simplification76.8%
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(Float64(1.0 / c) / 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[(N[(1.0 / c), $MachinePrecision] / N[(x * s), $MachinePrecision]), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\frac{\frac{\frac{1}{c}}{x \cdot s}}{c \cdot \left(x \cdot s\right)}
\end{array}
Initial program 64.8%
unpow264.8%
*-commutative64.8%
unpow264.8%
Simplified64.8%
*-un-lft-identity64.8%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.8%
sqrt-prod27.6%
add-sqr-sqrt42.4%
associate-*r*39.8%
sqrt-prod39.8%
sqrt-prod21.7%
add-sqr-sqrt43.0%
sqrt-prod21.3%
add-sqr-sqrt46.3%
*-commutative46.3%
Applied egg-rr96.4%
associate-*l/96.4%
*-un-lft-identity96.4%
Applied egg-rr96.4%
Taylor expanded in x around 0 76.8%
associate-/r*76.8%
Simplified76.8%
Final simplification76.8%
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 (* x s)) c) (* 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 / (x * s)) / c) / (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 / (x * s)) / c) / (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 / (x * s)) / c) / (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 / (x * s)) / c) / (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(Float64(1.0 / Float64(x * s)) / c) / 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 / (x * s)) / c) / (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[(N[(1.0 / N[(x * s), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / N[(c * N[(x * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x = |x|\\
c = |c|\\
s = |s|\\
[c, s] = \mathsf{sort}([c, s])\\
\\
\frac{\frac{\frac{1}{x \cdot s}}{c}}{c \cdot \left(x \cdot s\right)}
\end{array}
Initial program 64.8%
unpow264.8%
*-commutative64.8%
unpow264.8%
Simplified64.8%
*-un-lft-identity64.8%
add-sqr-sqrt64.7%
times-frac64.7%
sqrt-prod64.8%
sqrt-prod27.6%
add-sqr-sqrt42.4%
associate-*r*39.8%
sqrt-prod39.8%
sqrt-prod21.7%
add-sqr-sqrt43.0%
sqrt-prod21.3%
add-sqr-sqrt46.3%
*-commutative46.3%
Applied egg-rr96.4%
associate-*l/96.4%
*-un-lft-identity96.4%
Applied egg-rr96.4%
Taylor expanded in x around inf 96.4%
associate-/r*96.4%
*-commutative96.4%
Simplified96.4%
Taylor expanded in x around 0 75.3%
associate-/r*75.3%
associate-/l/76.8%
associate-/l/76.8%
*-commutative76.8%
Simplified76.8%
Final simplification76.8%
herbie shell --seed 2023217
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))