
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (+ x_m x_m))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 9e-86)
(/ (/ 1.0 t_1) t_1)
(if (<= x_m 1e+167)
(/ t_0 (* (* c_m s_m) (* s_m (* x_m (* x_m c_m)))))
(/ t_0 (* (* (* x_m c_m) (* x_m c_m)) (* s_m s_m)))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 9e-86) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1e+167) {
tmp = t_0 / ((c_m * s_m) * (s_m * (x_m * (x_m * c_m))));
} else {
tmp = t_0 / (((x_m * c_m) * (x_m * c_m)) * (s_m * s_m));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m + x_m))
t_1 = c_m * (x_m * s_m)
if (x_m <= 9d-86) then
tmp = (1.0d0 / t_1) / t_1
else if (x_m <= 1d+167) then
tmp = t_0 / ((c_m * s_m) * (s_m * (x_m * (x_m * c_m))))
else
tmp = t_0 / (((x_m * c_m) * (x_m * c_m)) * (s_m * s_m))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m + x_m));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 9e-86) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1e+167) {
tmp = t_0 / ((c_m * s_m) * (s_m * (x_m * (x_m * c_m))));
} else {
tmp = t_0 / (((x_m * c_m) * (x_m * c_m)) * (s_m * s_m));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m + x_m)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 9e-86: tmp = (1.0 / t_1) / t_1 elif x_m <= 1e+167: tmp = t_0 / ((c_m * s_m) * (s_m * (x_m * (x_m * c_m)))) else: tmp = t_0 / (((x_m * c_m) * (x_m * c_m)) * (s_m * s_m)) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m + x_m)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 9e-86) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x_m <= 1e+167) tmp = Float64(t_0 / Float64(Float64(c_m * s_m) * Float64(s_m * Float64(x_m * Float64(x_m * c_m))))); else tmp = Float64(t_0 / Float64(Float64(Float64(x_m * c_m) * Float64(x_m * c_m)) * Float64(s_m * s_m))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m + x_m));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 9e-86)
tmp = (1.0 / t_1) / t_1;
elseif (x_m <= 1e+167)
tmp = t_0 / ((c_m * s_m) * (s_m * (x_m * (x_m * c_m))));
else
tmp = t_0 / (((x_m * c_m) * (x_m * c_m)) * (s_m * s_m));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 9e-86], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 1e+167], N[(t$95$0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m + x\_m\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 9 \cdot 10^{-86}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 10^{+167}:\\
\;\;\;\;\frac{t\_0}{\left(c\_m \cdot s\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(\left(x\_m \cdot c\_m\right) \cdot \left(x\_m \cdot c\_m\right)\right) \cdot \left(s\_m \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 8.9999999999999995e-86Initial program 64.6%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6467.6
Applied rewrites67.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
Applied rewrites83.1%
if 8.9999999999999995e-86 < x < 1e167Initial program 71.4%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6498.5
Applied rewrites98.5%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6498.5
lift-*.f64N/A
count-2N/A
lift-+.f6498.5
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6498.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.0
Applied rewrites97.0%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6493.8
Applied rewrites93.8%
if 1e167 < x Initial program 58.3%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6491.7
Applied rewrites91.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6491.7
lift-*.f64N/A
count-2N/A
lift-+.f6491.7
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6483.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6483.6
Applied rewrites83.6%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6483.6
Applied rewrites83.6%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lower-*.f64N/A
lower-*.f6483.1
Applied rewrites83.1%
Final simplification85.5%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0
(/
(cos (* x_m 2.0))
(* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))))
(if (<= t_0 -2e-138)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(if (<= t_0 1e+17)
(/ 1.0 (* s_m (* c_m (* c_m (* x_m (* x_m s_m))))))
(/ 1.0 (* x_m (* (* c_m (* x_m s_m)) (* c_m s_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))));
double tmp;
if (t_0 <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= 1e+17) {
tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (x_m * s_m)))));
} else {
tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))
if (t_0 <= (-2d-138)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else if (t_0 <= 1d+17) then
tmp = 1.0d0 / (s_m * (c_m * (c_m * (x_m * (x_m * s_m)))))
else
tmp = 1.0d0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))));
double tmp;
if (t_0 <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= 1e+17) {
tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (x_m * s_m)))));
} else {
tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0)))) tmp = 0 if t_0 <= -2e-138: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) elif t_0 <= 1e+17: tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (x_m * s_m))))) else: tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) tmp = 0.0 if (t_0 <= -2e-138) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); elseif (t_0 <= 1e+17) tmp = Float64(1.0 / Float64(s_m * Float64(c_m * Float64(c_m * Float64(x_m * Float64(x_m * s_m)))))); else tmp = Float64(1.0 / Float64(x_m * Float64(Float64(c_m * Float64(x_m * s_m)) * Float64(c_m * s_m)))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))));
tmp = 0.0;
if (t_0 <= -2e-138)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
elseif (t_0 <= 1e+17)
tmp = 1.0 / (s_m * (c_m * (c_m * (x_m * (x_m * s_m)))));
else
tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-138], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1e+17], N[(1.0 / N[(s$95$m * N[(c$95$m * N[(c$95$m * N[(x$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)}\\
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{elif}\;t\_0 \leq 10^{+17}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right) \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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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))) < 1e17Initial program 77.1%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.8
Applied rewrites72.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lift-*.f64N/A
Applied rewrites88.0%
if 1e17 < (/.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 51.9%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.3
Applied rewrites72.3%
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6480.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6479.4
Applied rewrites79.4%
Final simplification80.0%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0
(/
(cos (* x_m 2.0))
(* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))))
(if (<= t_0 -2e-138)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(if (<= t_0 INFINITY)
(/ 1.0 (* c_m (* c_m (* (* x_m s_m) (* x_m s_m)))))
(/ 1.0 (* x_m (* (* c_m (* x_m s_m)) (* c_m s_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))));
double tmp;
if (t_0 <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= ((double) INFINITY)) {
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
} else {
tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)));
}
return tmp;
}
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))));
double tmp;
if (t_0 <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
} else {
tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0)))) tmp = 0 if t_0 <= -2e-138: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) elif t_0 <= math.inf: tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m)))) else: tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) tmp = 0.0 if (t_0 <= -2e-138) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); elseif (t_0 <= Inf) tmp = Float64(1.0 / Float64(c_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * s_m))))); else tmp = Float64(1.0 / Float64(x_m * Float64(Float64(c_m * Float64(x_m * s_m)) * Float64(c_m * s_m)))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))));
tmp = 0.0;
if (t_0 <= -2e-138)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
elseif (t_0 <= Inf)
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
else
tmp = 1.0 / (x_m * ((c_m * (x_m * s_m)) * (c_m * s_m)));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-138], N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(1.0 / N[(c$95$m * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(x$95$m * N[(N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)}\\
\mathbf{if}\;t\_0 \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{elif}\;t\_0 \leq \infty:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{x\_m \cdot \left(\left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right) \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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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 78.2%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.0
Applied rewrites95.0%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6476.7
Applied rewrites76.7%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6484.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6484.1
Applied rewrites84.1%
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%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6447.3
Applied rewrites47.3%
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6465.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6463.7
Applied rewrites63.7%
Final simplification77.2%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-2e-138)
(/ (+ -2.0 (/ 1.0 (* x_m x_m))) (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -2e-138) {
tmp = (-2.0 + (1.0 / (x_m * x_m))) / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-2d-138)) then
tmp = ((-2.0d0) + (1.0d0 / (x_m * x_m))) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -2e-138) {
tmp = (-2.0 + (1.0 / (x_m * x_m))) / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -2e-138: tmp = (-2.0 + (1.0 / (x_m * x_m))) / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -2e-138) tmp = Float64(Float64(-2.0 + Float64(1.0 / Float64(x_m * x_m))) / 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
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -2e-138)
tmp = (-2.0 + (1.0 / (x_m * x_m))) / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], N[(N[(-2.0 + N[(1.0 / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 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}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{-2 + \frac{1}{x\_m \cdot x\_m}}{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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
associate-*r*N/A
associate-/l/N/A
associate-*r/N/A
metadata-evalN/A
div-subN/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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.9%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.5
Applied rewrites72.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6482.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6482.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6484.7
Applied rewrites84.7%
Final simplification81.1%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-2e-138)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-2d-138)) 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
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -2e-138: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -2e-138) 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
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -2e-138)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], 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}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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.9%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.5
Applied rewrites72.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6482.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6482.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6484.7
Applied rewrites84.7%
Final simplification81.1%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-2e-138)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* (* c_m s_m) (* x_m (* s_m (* x_m c_m)))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-2d-138)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -2e-138: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m)))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -2e-138) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(s_m * Float64(x_m * c_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -2e-138)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], 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[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot \left(x\_m \cdot c\_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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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.9%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.8
Applied rewrites95.8%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6495.8
lift-*.f64N/A
count-2N/A
lift-+.f6495.8
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6494.2
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6493.2
Applied rewrites93.2%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6493.9
Applied rewrites93.9%
Taylor expanded in x around 0
Applied rewrites82.4%
Final simplification79.0%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-2e-138)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* c_m (* c_m (* (* x_m s_m) (* x_m s_m)))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-2d-138)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -2e-138: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m)))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -2e-138) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(c_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * s_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -2e-138)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], 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[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\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(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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.9%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.8
Applied rewrites95.8%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6470.6
Applied rewrites70.6%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6476.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
Final simplification73.8%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* x_m 2.0)) (* (pow c_m 2.0) (* x_m (* x_m (pow s_m 2.0)))))
-2e-138)
(/ -2.0 (* c_m (* c_m (* s_m s_m))))
(/ 1.0 (* c_m (* c_m (* s_m (* s_m (* x_m x_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((x_m * 2.0)) / (pow(c_m, 2.0) * (x_m * (x_m * pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x_m * x_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((x_m * 2.0d0)) / ((c_m ** 2.0d0) * (x_m * (x_m * (s_m ** 2.0d0))))) <= (-2d-138)) then
tmp = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
else
tmp = 1.0d0 / (c_m * (c_m * (s_m * (s_m * (x_m * x_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if ((Math.cos((x_m * 2.0)) / (Math.pow(c_m, 2.0) * (x_m * (x_m * Math.pow(s_m, 2.0))))) <= -2e-138) {
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
} else {
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x_m * x_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if (math.cos((x_m * 2.0)) / (math.pow(c_m, 2.0) * (x_m * (x_m * math.pow(s_m, 2.0))))) <= -2e-138: tmp = -2.0 / (c_m * (c_m * (s_m * s_m))) else: tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x_m * x_m))))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(x_m * 2.0)) / Float64((c_m ^ 2.0) * Float64(x_m * Float64(x_m * (s_m ^ 2.0))))) <= -2e-138) tmp = Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(c_m * Float64(c_m * Float64(s_m * Float64(s_m * Float64(x_m * x_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if ((cos((x_m * 2.0)) / ((c_m ^ 2.0) * (x_m * (x_m * (s_m ^ 2.0))))) <= -2e-138)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
else
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x_m * x_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x$95$m * N[(x$95$m * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-138], 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[(c$95$m * N[(s$95$m * N[(s$95$m * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(x\_m \cdot 2\right)}{{c\_m}^{2} \cdot \left(x\_m \cdot \left(x\_m \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-138}:\\
\;\;\;\;\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(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x\_m \cdot x\_m\right)\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))) < -2.00000000000000013e-138Initial program 77.0%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.4
Applied rewrites85.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6449.0
Applied rewrites49.0%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.2
Applied rewrites49.2%
if -2.00000000000000013e-138 < (/.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.9%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.8
Applied rewrites95.8%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6470.6
Applied rewrites70.6%
Final simplification68.4%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= (pow s_m 2.0) 2e+274)
(/ (cos (+ x_m x_m)) (* c_m (* (* x_m c_m) (* s_m (* x_m s_m)))))
(/ 1.0 (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (pow(s_m, 2.0) <= 2e+274) {
tmp = cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if ((s_m ** 2.0d0) <= 2d+274) then
tmp = cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))))
else
tmp = 1.0d0 / (t_0 * t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (Math.pow(s_m, 2.0) <= 2e+274) {
tmp = Math.cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
} else {
tmp = 1.0 / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if math.pow(s_m, 2.0) <= 2e+274: tmp = math.cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m)))) else: tmp = 1.0 / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if ((s_m ^ 2.0) <= 2e+274) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(c_m * Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * s_m))))); else tmp = Float64(1.0 / Float64(t_0 * t_0)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if ((s_m ^ 2.0) <= 2e+274)
tmp = cos((x_m + x_m)) / (c_m * ((x_m * c_m) * (s_m * (x_m * s_m))));
else
tmp = 1.0 / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[s$95$m, 2.0], $MachinePrecision], 2e+274], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;{s\_m}^{2} \leq 2 \cdot 10^{+274}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{c\_m \cdot \left(\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if (pow.f64 s #s(literal 2 binary64)) < 1.99999999999999984e274Initial program 69.2%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.9
Applied rewrites96.9%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6496.9
lift-*.f64N/A
count-2N/A
lift-+.f6496.9
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6494.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6493.6
Applied rewrites93.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*l*N/A
Applied rewrites87.9%
if 1.99999999999999984e274 < (pow.f64 s #s(literal 2 binary64)) Initial program 54.6%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.0
Applied rewrites72.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6484.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6484.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6491.3
Applied rewrites91.3%
Final simplification88.9%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= x_m 2.2e-86)
(/ (/ 1.0 t_0) t_0)
(/ (cos (+ x_m x_m)) (* (* c_m s_m) (* x_m (* s_m (* x_m c_m))))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.2e-86) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 2.2d-86) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 2.2e-86) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if x_m <= 2.2e-86: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m)))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 2.2e-86) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(s_m * Float64(x_m * c_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 2.2e-86)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (s_m * (x_m * c_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.2e-86], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 2.2 \cdot 10^{-86}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.2000000000000002e-86Initial program 64.6%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6467.6
Applied rewrites67.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
Applied rewrites83.1%
if 2.2000000000000002e-86 < x Initial program 66.4%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.9
Applied rewrites95.9%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6495.9
lift-*.f64N/A
count-2N/A
lift-+.f6495.9
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6492.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6491.9
Applied rewrites91.9%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6492.9
Applied rewrites92.9%
Final simplification86.7%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (if (<= x_m 4e-126) (/ 1.0 (* c_m (* c_m (* (* x_m s_m) (* x_m s_m))))) (/ (cos (+ x_m x_m)) (* (* c_m s_m) (* x_m (* c_m (* x_m s_m)))))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 4e-126) {
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
} else {
tmp = cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 4d-126) then
tmp = 1.0d0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))))
else
tmp = cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 4e-126) {
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
} else {
tmp = Math.cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 4e-126: tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m)))) else: tmp = math.cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m)))) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 4e-126) tmp = Float64(1.0 / Float64(c_m * Float64(c_m * Float64(Float64(x_m * s_m) * Float64(x_m * s_m))))); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(c_m * Float64(x_m * s_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 4e-126)
tmp = 1.0 / (c_m * (c_m * ((x_m * s_m) * (x_m * s_m))));
else
tmp = cos((x_m + x_m)) / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 4e-126], N[(1.0 / N[(c$95$m * N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 4 \cdot 10^{-126}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 3.9999999999999998e-126Initial program 64.2%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6495.3
Applied rewrites95.3%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6466.8
Applied rewrites66.8%
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
unswap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6475.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6475.0
lift-*.f64N/A
*-commutativeN/A
lower-*.f6475.0
Applied rewrites75.0%
if 3.9999999999999998e-126 < x Initial program 66.9%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.3
Applied rewrites96.3%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
lift-/.f6496.3
lift-*.f64N/A
count-2N/A
lift-+.f6496.3
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6493.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6492.8
Applied rewrites92.8%
Final simplification82.2%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ -2.0 (* c_m (* c_m (* s_m s_m)))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (-2.0d0) / (c_m * (c_m * (s_m * s_m)))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return -2.0 / (c_m * (c_m * (s_m * s_m)));
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return -2.0 / (c_m * (c_m * (s_m * s_m)))
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s_m * s_m)))) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = -2.0 / (c_m * (c_m * (s_m * s_m)));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, 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.3%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6480.8
Applied rewrites80.8%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6454.6
Applied rewrites54.6%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6428.2
Applied rewrites28.2%
herbie shell --seed 2024216
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))