
(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 8 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}
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x x))) (t_1 (* c_m (* x s_m))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
INFINITY)
(/ t_0 (* t_1 t_1))
(/ t_0 (pow (* x (* c_m s_m)) 2.0)))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((x + x));
double t_1 = c_m * (x * s_m);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= ((double) INFINITY)) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / pow((x * (c_m * s_m)), 2.0);
}
return tmp;
}
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((x + x));
double t_1 = c_m * (x * s_m);
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= Double.POSITIVE_INFINITY) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / Math.pow((x * (c_m * s_m)), 2.0);
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((x + x)) t_1 = c_m * (x * s_m) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= math.inf: tmp = t_0 / (t_1 * t_1) else: tmp = t_0 / math.pow((x * (c_m * s_m)), 2.0) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(x + x)) t_1 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= Inf) tmp = Float64(t_0 / Float64(t_1 * t_1)); else tmp = Float64(t_0 / (Float64(x * Float64(c_m * s_m)) ^ 2.0)); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((x + x));
t_1 = c_m * (x * s_m);
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= Inf)
tmp = t_0 / (t_1 * t_1);
else
tmp = t_0 / ((x * (c_m * s_m)) ^ 2.0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(t$95$0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[Power[N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x + x\right)\\
t_1 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq \infty:\\
\;\;\;\;\frac{t\_0}{t\_1 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{{\left(x \cdot \left(c\_m \cdot s\_m\right)\right)}^{2}}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < +inf.0Initial program 82.7%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.0
Applied egg-rr97.0%
count-2N/A
+-lowering-+.f6497.0
Applied egg-rr97.0%
unpow2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.4
Applied egg-rr99.4%
if +inf.0 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 0.0%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.6
Applied egg-rr97.6%
count-2N/A
+-lowering-+.f6497.6
Applied egg-rr97.6%
Final simplification99.0%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x s_m))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
-5e-192)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* t_0 t_0)))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -5e-192) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x * s_m)
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= (-5d-192)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= -5e-192) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = c_m * (x * s_m) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= -5e-192: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (t_0 * t_0) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -5e-192) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = c_m * (x * s_m);
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= -5e-192)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-192], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -5 \cdot 10^{-192}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -5.0000000000000001e-192Initial program 89.1%
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6466.5
Applied egg-rr66.5%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
--rgt-identityN/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6445.8
Simplified45.8%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.3
Simplified63.3%
Taylor expanded in s around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.3
Simplified63.3%
if -5.0000000000000001e-192 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 63.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.7
Simplified70.7%
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.0
Applied egg-rr85.0%
Final simplification83.5%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
-5e-192)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* c_m (* (* x s_m) (* c_m (* x s_m)))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -5e-192) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= (-5d-192)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (c_m * ((x * s_m) * (c_m * (x * s_m))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= -5e-192) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= -5e-192: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m)))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -5e-192) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(c_m * Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= -5e-192)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-192], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c$95$m * N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -5 \cdot 10^{-192}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(\left(x \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -5.0000000000000001e-192Initial program 89.1%
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6466.5
Applied egg-rr66.5%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
--rgt-identityN/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6445.8
Simplified45.8%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.3
Simplified63.3%
Taylor expanded in s around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6463.3
Simplified63.3%
if -5.0000000000000001e-192 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 63.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.7
Simplified70.7%
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6482.6
Applied egg-rr82.6%
Final simplification81.2%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
2e+135)
(/ -2.0 (* (* s_m s_m) (* c_m c_m)))
(/ 2.0 (- 0.0 (* c_m (* s_m (* c_m s_m)))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= 2e+135) {
tmp = -2.0 / ((s_m * s_m) * (c_m * c_m));
} else {
tmp = 2.0 / (0.0 - (c_m * (s_m * (c_m * s_m))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= 2d+135) then
tmp = (-2.0d0) / ((s_m * s_m) * (c_m * c_m))
else
tmp = 2.0d0 / (0.0d0 - (c_m * (s_m * (c_m * s_m))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= 2e+135) {
tmp = -2.0 / ((s_m * s_m) * (c_m * c_m));
} else {
tmp = 2.0 / (0.0 - (c_m * (s_m * (c_m * s_m))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= 2e+135: tmp = -2.0 / ((s_m * s_m) * (c_m * c_m)) else: tmp = 2.0 / (0.0 - (c_m * (s_m * (c_m * s_m)))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= 2e+135) tmp = Float64(-2.0 / Float64(Float64(s_m * s_m) * Float64(c_m * c_m))); else tmp = Float64(2.0 / Float64(0.0 - Float64(c_m * Float64(s_m * Float64(c_m * s_m))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= 2e+135)
tmp = -2.0 / ((s_m * s_m) * (c_m * c_m));
else
tmp = 2.0 / (0.0 - (c_m * (s_m * (c_m * s_m))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+135], N[(-2.0 / N[(N[(s$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(0.0 - N[(c$95$m * N[(s$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq 2 \cdot 10^{+135}:\\
\;\;\;\;\frac{-2}{\left(s\_m \cdot s\_m\right) \cdot \left(c\_m \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{2}{0 - c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot s\_m\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < 1.99999999999999992e135Initial program 78.6%
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6471.1
Applied egg-rr71.1%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
--rgt-identityN/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6437.7
Simplified37.7%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6451.8
Simplified51.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6453.2
Applied egg-rr53.2%
if 1.99999999999999992e135 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 50.6%
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.8
Applied egg-rr57.8%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
--rgt-identityN/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6447.1
Simplified47.1%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f642.0
Simplified2.0%
frac-2negN/A
metadata-evalN/A
/-lowering-/.f64N/A
neg-sub0N/A
+-inversesN/A
--lowering--.f64N/A
+-inversesN/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.0
Applied egg-rr35.0%
Final simplification44.6%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x x))) (t_1 (* c_m (* x s_m))))
(if (<= x 6e-21)
(/ 1.0 (* t_1 t_1))
(if (<= x 3.5e+166)
(/ t_0 (* s_m (* c_m (* s_m (* c_m (* x x))))))
(/ t_0 (* s_m (* s_m (* x (* c_m (* x c_m))))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((x + x));
double t_1 = c_m * (x * s_m);
double tmp;
if (x <= 6e-21) {
tmp = 1.0 / (t_1 * t_1);
} else if (x <= 3.5e+166) {
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x * x)))));
} else {
tmp = t_0 / (s_m * (s_m * (x * (c_m * (x * c_m)))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x + x))
t_1 = c_m * (x * s_m)
if (x <= 6d-21) then
tmp = 1.0d0 / (t_1 * t_1)
else if (x <= 3.5d+166) then
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x * x)))))
else
tmp = t_0 / (s_m * (s_m * (x * (c_m * (x * c_m)))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((x + x));
double t_1 = c_m * (x * s_m);
double tmp;
if (x <= 6e-21) {
tmp = 1.0 / (t_1 * t_1);
} else if (x <= 3.5e+166) {
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x * x)))));
} else {
tmp = t_0 / (s_m * (s_m * (x * (c_m * (x * c_m)))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((x + x)) t_1 = c_m * (x * s_m) tmp = 0 if x <= 6e-21: tmp = 1.0 / (t_1 * t_1) elif x <= 3.5e+166: tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x * x))))) else: tmp = t_0 / (s_m * (s_m * (x * (c_m * (x * c_m))))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(x + x)) t_1 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (x <= 6e-21) tmp = Float64(1.0 / Float64(t_1 * t_1)); elseif (x <= 3.5e+166) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(s_m * Float64(c_m * Float64(x * x)))))); else tmp = Float64(t_0 / Float64(s_m * Float64(s_m * Float64(x * Float64(c_m * Float64(x * c_m)))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((x + x));
t_1 = c_m * (x * s_m);
tmp = 0.0;
if (x <= 6e-21)
tmp = 1.0 / (t_1 * t_1);
elseif (x <= 3.5e+166)
tmp = t_0 / (s_m * (c_m * (s_m * (c_m * (x * x)))));
else
tmp = t_0 / (s_m * (s_m * (x * (c_m * (x * c_m)))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 6e-21], N[(1.0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.5e+166], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(s$95$m * N[(c$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(s$95$m * N[(x * N[(c$95$m * N[(x * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x + x\right)\\
t_1 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;x \leq 6 \cdot 10^{-21}:\\
\;\;\;\;\frac{1}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;x \leq 3.5 \cdot 10^{+166}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(s\_m \cdot \left(x \cdot \left(c\_m \cdot \left(x \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 5.99999999999999982e-21Initial program 62.1%
Taylor expanded in x around 0
/-lowering-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6466.8
Simplified66.8%
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
swap-sqrN/A
*-commutativeN/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.5
Applied egg-rr84.5%
if 5.99999999999999982e-21 < x < 3.4999999999999999e166Initial program 75.2%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.6
Applied egg-rr98.6%
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
unpow-prod-downN/A
pow2N/A
pow2N/A
swap-sqrN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6491.3
Applied egg-rr91.3%
if 3.4999999999999999e166 < x Initial program 67.7%
associate-/r*N/A
associate-/l/N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.3
Applied egg-rr84.3%
count-2N/A
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.2
Applied egg-rr84.2%
Final simplification85.7%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x s_m))))
(if (<= x 2350.0)
(/ (fma x (fma x -2.0 0.0) 1.0) (* t_0 t_0))
(/ (cos (+ x x)) (* s_m (* s_m (* x (* c_m (* x c_m)))))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double tmp;
if (x <= 2350.0) {
tmp = fma(x, fma(x, -2.0, 0.0), 1.0) / (t_0 * t_0);
} else {
tmp = cos((x + x)) / (s_m * (s_m * (x * (c_m * (x * c_m)))));
}
return tmp;
}
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (x <= 2350.0) tmp = Float64(fma(x, fma(x, -2.0, 0.0), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x + x)) / Float64(s_m * Float64(s_m * Float64(x * Float64(c_m * Float64(x * c_m)))))); end return tmp end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 2350.0], N[(N[(x * N[(x * -2.0 + 0.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(s$95$m * N[(x * N[(c$95$m * N[(x * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;x \leq 2350:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \mathsf{fma}\left(x, -2, 0\right), 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{s\_m \cdot \left(s\_m \cdot \left(x \cdot \left(c\_m \cdot \left(x \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2350Initial program 62.4%
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6460.6
Applied egg-rr60.6%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
--rgt-identityN/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6446.1
Simplified46.1%
*-commutativeN/A
associate-*r*N/A
unswap-sqrN/A
swap-sqrN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.5
Applied egg-rr75.5%
if 2350 < x Initial program 72.7%
associate-/r*N/A
associate-/l/N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
/-lowering-/.f64N/A
associate-/l/N/A
*-commutativeN/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6482.9
Applied egg-rr82.9%
count-2N/A
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
count-2N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.5
Applied egg-rr83.5%
Final simplification77.7%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* c_m (* x s_m)))) (/ (cos (+ x x)) (* t_0 t_0))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
return cos((x + x)) / (t_0 * t_0);
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x * s_m)
code = cos((x + x)) / (t_0 * t_0)
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
return Math.cos((x + x)) / (t_0 * t_0);
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = c_m * (x * s_m) return math.cos((x + x)) / (t_0 * t_0)
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) return Float64(cos(Float64(x + x)) / Float64(t_0 * t_0)) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = c_m * (x * s_m);
tmp = cos((x + x)) / (t_0 * t_0);
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x \cdot s\_m\right)\\
\frac{\cos \left(x + x\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 65.2%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.2
Applied egg-rr97.2%
count-2N/A
+-lowering-+.f6497.2
Applied egg-rr97.2%
unpow2N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.4
Applied egg-rr97.4%
Final simplification97.4%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ -2.0 (* c_m (* c_m (* s_m s_m)))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return -2.0 / (c_m * (c_m * (s_m * s_m)))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 65.2%
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6464.8
Applied egg-rr64.8%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
--rgt-identityN/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6442.2
Simplified42.2%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6428.1
Simplified28.1%
Taylor expanded in s around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6428.1
Simplified28.1%
herbie shell --seed 2024195
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))