
(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 16 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)
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 (<= c_m 9.5e-230)
(/ (cos (* 2.0 x)) (pow (* x (* c_m s_m)) 2.0))
(/ (/ (cos (+ x x)) t_0) t_0))))s_m = fabs(s);
c_m = fabs(c);
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 (c_m <= 9.5e-230) {
tmp = cos((2.0 * x)) / pow((x * (c_m * s_m)), 2.0);
} else {
tmp = (cos((x + x)) / t_0) / t_0;
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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 (c_m <= 9.5d-230) then
tmp = cos((2.0d0 * x)) / ((x * (c_m * s_m)) ** 2.0d0)
else
tmp = (cos((x + x)) / t_0) / t_0
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 (c_m <= 9.5e-230) {
tmp = Math.cos((2.0 * x)) / Math.pow((x * (c_m * s_m)), 2.0);
} else {
tmp = (Math.cos((x + x)) / t_0) / t_0;
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 c_m <= 9.5e-230: tmp = math.cos((2.0 * x)) / math.pow((x * (c_m * s_m)), 2.0) else: tmp = (math.cos((x + x)) / t_0) / t_0 return tmp
s_m = abs(s) c_m = abs(c) 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 (c_m <= 9.5e-230) tmp = Float64(cos(Float64(2.0 * x)) / (Float64(x * Float64(c_m * s_m)) ^ 2.0)); else tmp = Float64(Float64(cos(Float64(x + x)) / t_0) / t_0); end return tmp end
s_m = abs(s);
c_m = abs(c);
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 (c_m <= 9.5e-230)
tmp = cos((2.0 * x)) / ((x * (c_m * s_m)) ^ 2.0);
else
tmp = (cos((x + x)) / t_0) / t_0;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[c$95$m, 9.5e-230], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[Power[N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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}\;c\_m \leq 9.5 \cdot 10^{-230}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{{\left(x \cdot \left(c\_m \cdot s\_m\right)\right)}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x + x\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if c < 9.5000000000000004e-230Initial program 62.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-*.f6496.9
Applied rewrites96.9%
if 9.5000000000000004e-230 < c Initial program 59.5%
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.8
Applied rewrites96.8%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.6
lift-*.f64N/A
count-2N/A
lift-+.f6497.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6496.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6498.3
Applied rewrites98.3%
Final simplification97.4%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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)))))
-1e-187)
(/ (fma x (* x -2.0) 1.0) (* x (* c_m (* s_m t_0))))
(/ (/ 1.0 t_0) t_0))))s_m = fabs(s);
c_m = fabs(c);
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))))) <= -1e-187) {
tmp = fma(x, (x * -2.0), 1.0) / (x * (c_m * (s_m * t_0)));
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = abs(s) c_m = abs(c) 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))))) <= -1e-187) tmp = Float64(fma(x, Float64(x * -2.0), 1.0) / Float64(x * Float64(c_m * Float64(s_m * t_0)))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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], -1e-187], N[(N[(x * N[(x * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(x * N[(c$95$m * N[(s$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 -1 \cdot 10^{-187}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, x \cdot -2, 1\right)}{x \cdot \left(c\_m \cdot \left(s\_m \cdot t\_0\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{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))) < -1e-187Initial program 47.2%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6481.2
Applied rewrites81.2%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6423.8
Applied rewrites23.8%
if -1e-187 < (/.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 62.5%
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-*.f6475.0
Applied rewrites75.0%
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 rewrites86.4%
Final simplification81.5%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 1350000000.0)
(/ (/ (fma x (* x -2.0) 1.0) t_1) t_1)
(if (<= x 5.8e+229)
(/ t_0 (* s_m (* c_m (* x (* x (* c_m s_m))))))
(/ t_0 (* x (* c_m (* s_m (* s_m (* c_m x))))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 1350000000.0) {
tmp = (fma(x, (x * -2.0), 1.0) / t_1) / t_1;
} else if (x <= 5.8e+229) {
tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m)))));
} else {
tmp = t_0 / (x * (c_m * (s_m * (s_m * (c_m * x)))));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) 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 <= 1350000000.0) tmp = Float64(Float64(fma(x, Float64(x * -2.0), 1.0) / t_1) / t_1); elseif (x <= 5.8e+229) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(x * Float64(x * Float64(c_m * s_m)))))); else tmp = Float64(t_0 / Float64(x * Float64(c_m * Float64(s_m * Float64(s_m * Float64(c_m * x)))))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 1350000000.0], N[(N[(N[(x * N[(x * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x, 5.8e+229], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(x * N[(c$95$m * N[(s$95$m * N[(s$95$m * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 1350000000:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, x \cdot -2, 1\right)}{t\_1}}{t\_1}\\
\mathbf{elif}\;x \leq 5.8 \cdot 10^{+229}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x \cdot \left(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(c\_m \cdot x\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 1.35e9Initial program 60.5%
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.7
Applied rewrites96.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.7
lift-*.f64N/A
count-2N/A
lift-+.f6496.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6498.0
Applied rewrites98.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
if 1.35e9 < x < 5.79999999999999963e229Initial program 71.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.9
Applied rewrites95.9%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.5
lift-*.f64N/A
count-2N/A
lift-+.f6497.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6499.6
Applied rewrites99.6%
count-2N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/l/N/A
pow2N/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6495.9
lift-*.f64N/A
count-2N/A
lift-+.f6495.9
lift-pow.f64N/A
Applied rewrites89.8%
if 5.79999999999999963e229 < x Initial program 48.5%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6486.2
Applied rewrites86.2%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6490.8
Applied rewrites90.8%
count-2N/A
lift-+.f6490.8
Applied rewrites90.8%
Final simplification78.6%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 1350000000.0)
(/ (/ (fma x (* x -2.0) 1.0) t_1) t_1)
(if (<= x 2e+230)
(/ t_0 (* s_m (* c_m (* x (* x (* c_m s_m))))))
(/ t_0 (* x (* c_m (* s_m t_1))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 1350000000.0) {
tmp = (fma(x, (x * -2.0), 1.0) / t_1) / t_1;
} else if (x <= 2e+230) {
tmp = t_0 / (s_m * (c_m * (x * (x * (c_m * s_m)))));
} else {
tmp = t_0 / (x * (c_m * (s_m * t_1)));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) 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 <= 1350000000.0) tmp = Float64(Float64(fma(x, Float64(x * -2.0), 1.0) / t_1) / t_1); elseif (x <= 2e+230) tmp = Float64(t_0 / Float64(s_m * Float64(c_m * Float64(x * Float64(x * Float64(c_m * s_m)))))); else tmp = Float64(t_0 / Float64(x * Float64(c_m * Float64(s_m * t_1)))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 1350000000.0], N[(N[(N[(x * N[(x * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x, 2e+230], N[(t$95$0 / N[(s$95$m * N[(c$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(x * N[(c$95$m * N[(s$95$m * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 1350000000:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, x \cdot -2, 1\right)}{t\_1}}{t\_1}\\
\mathbf{elif}\;x \leq 2 \cdot 10^{+230}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x \cdot \left(c\_m \cdot \left(s\_m \cdot t\_1\right)\right)}\\
\end{array}
\end{array}
if x < 1.35e9Initial program 60.5%
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.7
Applied rewrites96.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.7
lift-*.f64N/A
count-2N/A
lift-+.f6496.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6498.0
Applied rewrites98.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
if 1.35e9 < x < 2.0000000000000002e230Initial program 71.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.9
Applied rewrites95.9%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.5
lift-*.f64N/A
count-2N/A
lift-+.f6497.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6499.6
Applied rewrites99.6%
count-2N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/l/N/A
pow2N/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6495.9
lift-*.f64N/A
count-2N/A
lift-+.f6495.9
lift-pow.f64N/A
Applied rewrites89.8%
if 2.0000000000000002e230 < x Initial program 48.5%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6486.2
Applied rewrites86.2%
count-2N/A
lift-+.f6486.2
Applied rewrites86.2%
Final simplification78.2%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 3.2e+14)
(/ (/ (cos (+ x x)) t_0) t_0)
(/ (cos (* 2.0 x)) (* s_m (* (* c_m x) (* s_m (* c_m x))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 3.2e+14) {
tmp = (cos((x + x)) / t_0) / t_0;
} else {
tmp = cos((2.0 * x)) / (s_m * ((c_m * x) * (s_m * (c_m * x))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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 (x <= 3.2d+14) then
tmp = (cos((x + x)) / t_0) / t_0
else
tmp = cos((2.0d0 * x)) / (s_m * ((c_m * x) * (s_m * (c_m * x))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 (x <= 3.2e+14) {
tmp = (Math.cos((x + x)) / t_0) / t_0;
} else {
tmp = Math.cos((2.0 * x)) / (s_m * ((c_m * x) * (s_m * (c_m * x))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 x <= 3.2e+14: tmp = (math.cos((x + x)) / t_0) / t_0 else: tmp = math.cos((2.0 * x)) / (s_m * ((c_m * x) * (s_m * (c_m * x)))) return tmp
s_m = abs(s) c_m = abs(c) 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 <= 3.2e+14) tmp = Float64(Float64(cos(Float64(x + x)) / t_0) / t_0); else tmp = Float64(cos(Float64(2.0 * x)) / Float64(s_m * Float64(Float64(c_m * x) * Float64(s_m * Float64(c_m * x))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
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 (x <= 3.2e+14)
tmp = (cos((x + x)) / t_0) / t_0;
else
tmp = cos((2.0 * x)) / (s_m * ((c_m * x) * (s_m * (c_m * x))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 3.2e+14], N[(N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(c$95$m * x), $MachinePrecision] * N[(s$95$m * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 3.2 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\cos \left(x + x\right)}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{s\_m \cdot \left(\left(c\_m \cdot x\right) \cdot \left(s\_m \cdot \left(c\_m \cdot x\right)\right)\right)}\\
\end{array}
\end{array}
if x < 3.2e14Initial program 60.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-*.f6496.4
Applied rewrites96.4%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.8
lift-*.f64N/A
count-2N/A
lift-+.f6496.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6498.0
Applied rewrites98.0%
if 3.2e14 < x Initial program 64.2%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6487.8
Applied rewrites87.8%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6486.4
Applied rewrites86.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites91.1%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6492.5
Applied rewrites92.5%
Final simplification96.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 (* 2.0 x))) (t_1 (* c_m (* x s_m))))
(if (<= x 22500000000.0)
(/ t_0 (* t_1 t_1))
(/ t_0 (* s_m (* (* c_m x) (* s_m (* c_m x))))))))s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((2.0 * x));
double t_1 = c_m * (x * s_m);
double tmp;
if (x <= 22500000000.0) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / (s_m * ((c_m * x) * (s_m * (c_m * x))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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((2.0d0 * x))
t_1 = c_m * (x * s_m)
if (x <= 22500000000.0d0) then
tmp = t_0 / (t_1 * t_1)
else
tmp = t_0 / (s_m * ((c_m * x) * (s_m * (c_m * x))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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((2.0 * x));
double t_1 = c_m * (x * s_m);
double tmp;
if (x <= 22500000000.0) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / (s_m * ((c_m * x) * (s_m * (c_m * x))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((2.0 * x)) t_1 = c_m * (x * s_m) tmp = 0 if x <= 22500000000.0: tmp = t_0 / (t_1 * t_1) else: tmp = t_0 / (s_m * ((c_m * x) * (s_m * (c_m * x)))) return tmp
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = cos(Float64(2.0 * x)) t_1 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (x <= 22500000000.0) tmp = Float64(t_0 / Float64(t_1 * t_1)); else tmp = Float64(t_0 / Float64(s_m * Float64(Float64(c_m * x) * Float64(s_m * Float64(c_m * x))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((2.0 * x));
t_1 = c_m * (x * s_m);
tmp = 0.0;
if (x <= 22500000000.0)
tmp = t_0 / (t_1 * t_1);
else
tmp = t_0 / (s_m * ((c_m * x) * (s_m * (c_m * x))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 22500000000.0], N[(t$95$0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(s$95$m * N[(N[(c$95$m * x), $MachinePrecision] * N[(s$95$m * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
t_1 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;x \leq 22500000000:\\
\;\;\;\;\frac{t\_0}{t\_1 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{s\_m \cdot \left(\left(c\_m \cdot x\right) \cdot \left(s\_m \cdot \left(c\_m \cdot x\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.25e10Initial program 60.5%
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.7
Applied rewrites96.7%
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
lower-*.f6496.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.5
Applied rewrites97.5%
if 2.25e10 < x Initial program 63.7%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6487.0
Applied rewrites87.0%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6485.6
Applied rewrites85.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.2%
associate-*r*N/A
lift-*.f64N/A
lower-*.f6491.5
Applied rewrites91.5%
Final simplification96.0%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 (<= c_m 8.2e-230)
(/ (cos (+ x x)) (* s_m (* (* c_m x) (* x (* c_m s_m)))))
(/ (cos (* 2.0 x)) (* t_0 t_0)))))s_m = fabs(s);
c_m = fabs(c);
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 (c_m <= 8.2e-230) {
tmp = cos((x + x)) / (s_m * ((c_m * x) * (x * (c_m * s_m))));
} else {
tmp = cos((2.0 * x)) / (t_0 * t_0);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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 (c_m <= 8.2d-230) then
tmp = cos((x + x)) / (s_m * ((c_m * x) * (x * (c_m * s_m))))
else
tmp = cos((2.0d0 * x)) / (t_0 * t_0)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 (c_m <= 8.2e-230) {
tmp = Math.cos((x + x)) / (s_m * ((c_m * x) * (x * (c_m * s_m))));
} else {
tmp = Math.cos((2.0 * x)) / (t_0 * t_0);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 c_m <= 8.2e-230: tmp = math.cos((x + x)) / (s_m * ((c_m * x) * (x * (c_m * s_m)))) else: tmp = math.cos((2.0 * x)) / (t_0 * t_0) return tmp
s_m = abs(s) c_m = abs(c) 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 (c_m <= 8.2e-230) tmp = Float64(cos(Float64(x + x)) / Float64(s_m * Float64(Float64(c_m * x) * Float64(x * Float64(c_m * s_m))))); else tmp = Float64(cos(Float64(2.0 * x)) / Float64(t_0 * t_0)); end return tmp end
s_m = abs(s);
c_m = abs(c);
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 (c_m <= 8.2e-230)
tmp = cos((x + x)) / (s_m * ((c_m * x) * (x * (c_m * s_m))));
else
tmp = cos((2.0 * x)) / (t_0 * t_0);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[c$95$m, 8.2e-230], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(c$95$m * x), $MachinePrecision] * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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}\;c\_m \leq 8.2 \cdot 10^{-230}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{s\_m \cdot \left(\left(c\_m \cdot x\right) \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if c < 8.2000000000000003e-230Initial program 62.3%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6488.3
Applied rewrites88.3%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6488.4
Applied rewrites88.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites87.5%
count-2N/A
lift-+.f6487.5
Applied rewrites87.5%
if 8.2000000000000003e-230 < c Initial program 59.5%
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.8
Applied rewrites96.8%
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
lower-*.f6496.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6496.6
Applied rewrites96.6%
Final simplification90.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 1350000000.0)
(/ (/ (fma x (* x -2.0) 1.0) t_0) t_0)
(/ (cos (+ x x)) (* s_m (* (* c_m x) (* x (* c_m s_m))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 1350000000.0) {
tmp = (fma(x, (x * -2.0), 1.0) / t_0) / t_0;
} else {
tmp = cos((x + x)) / (s_m * ((c_m * x) * (x * (c_m * s_m))));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) 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 <= 1350000000.0) tmp = Float64(Float64(fma(x, Float64(x * -2.0), 1.0) / t_0) / t_0); else tmp = Float64(cos(Float64(x + x)) / Float64(s_m * Float64(Float64(c_m * x) * Float64(x * Float64(c_m * s_m))))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 1350000000.0], N[(N[(N[(x * N[(x * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(N[(c$95$m * x), $MachinePrecision] * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 1350000000:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, x \cdot -2, 1\right)}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{s\_m \cdot \left(\left(c\_m \cdot x\right) \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 1.35e9Initial program 60.5%
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.7
Applied rewrites96.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.7
lift-*.f64N/A
count-2N/A
lift-+.f6496.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6498.0
Applied rewrites98.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
if 1.35e9 < x Initial program 63.7%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6487.0
Applied rewrites87.0%
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6485.6
Applied rewrites85.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.2%
count-2N/A
lift-+.f6490.2
Applied rewrites90.2%
Final simplification78.6%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 9.8e-34)
(/ (/ 1.0 t_0) t_0)
(/ (cos (+ x x)) (* x (* (* c_m s_m) (* x (* c_m s_m))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 9.8e-34) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x + x)) / (x * ((c_m * s_m) * (x * (c_m * s_m))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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 (x <= 9.8d-34) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x + x)) / (x * ((c_m * s_m) * (x * (c_m * s_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 (x <= 9.8e-34) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x + x)) / (x * ((c_m * s_m) * (x * (c_m * s_m))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 x <= 9.8e-34: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x + x)) / (x * ((c_m * s_m) * (x * (c_m * s_m)))) return tmp
s_m = abs(s) c_m = abs(c) 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 <= 9.8e-34) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x + x)) / Float64(x * Float64(Float64(c_m * s_m) * Float64(x * Float64(c_m * s_m))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
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 (x <= 9.8e-34)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x + x)) / (x * ((c_m * s_m) * (x * (c_m * s_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 9.8e-34], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(x * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 9.8 \cdot 10^{-34}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{x \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if x < 9.79999999999999925e-34Initial program 60.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-*.f6472.0
Applied rewrites72.0%
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 rewrites85.7%
if 9.79999999999999925e-34 < x Initial program 64.9%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6487.9
Applied rewrites87.9%
count-2N/A
lift-+.f6487.9
Applied rewrites87.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6489.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6491.9
Applied rewrites91.9%
Final simplification87.3%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 1350000000.0)
(/ (/ (fma x (* x -2.0) 1.0) t_0) t_0)
(/ (cos (+ x x)) (* s_m (* c_m (* x (* x (* c_m s_m)))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 1350000000.0) {
tmp = (fma(x, (x * -2.0), 1.0) / t_0) / t_0;
} else {
tmp = cos((x + x)) / (s_m * (c_m * (x * (x * (c_m * s_m)))));
}
return tmp;
}
s_m = abs(s) c_m = abs(c) 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 <= 1350000000.0) tmp = Float64(Float64(fma(x, Float64(x * -2.0), 1.0) / t_0) / t_0); else tmp = Float64(cos(Float64(x + x)) / Float64(s_m * Float64(c_m * Float64(x * Float64(x * Float64(c_m * s_m)))))); end return tmp end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 1350000000.0], N[(N[(N[(x * N[(x * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(c$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 1350000000:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, x \cdot -2, 1\right)}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 1.35e9Initial program 60.5%
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.7
Applied rewrites96.7%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.7
lift-*.f64N/A
count-2N/A
lift-+.f6496.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6498.0
Applied rewrites98.0%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
if 1.35e9 < x Initial program 63.7%
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-*.f6497.2
Applied rewrites97.2%
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.3
lift-*.f64N/A
count-2N/A
lift-+.f6498.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6496.7
Applied rewrites96.7%
count-2N/A
lift-*.f64N/A
lift-cos.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-/l/N/A
pow2N/A
lower-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f6497.2
lift-*.f64N/A
count-2N/A
lift-+.f6497.2
lift-pow.f64N/A
Applied rewrites82.8%
Final simplification76.7%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 6.2e-43)
(/ (/ 1.0 t_0) t_0)
(/ (cos (+ x x)) (* c_m (* s_m (* x (* x (* c_m s_m)))))))))s_m = fabs(s);
c_m = fabs(c);
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 <= 6.2e-43) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x + x)) / (c_m * (s_m * (x * (x * (c_m * s_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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 (x <= 6.2d-43) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x + x)) / (c_m * (s_m * (x * (x * (c_m * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 (x <= 6.2e-43) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x + x)) / (c_m * (s_m * (x * (x * (c_m * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 x <= 6.2e-43: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x + x)) / (c_m * (s_m * (x * (x * (c_m * s_m))))) return tmp
s_m = abs(s) c_m = abs(c) 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 <= 6.2e-43) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x + x)) / Float64(c_m * Float64(s_m * Float64(x * Float64(x * Float64(c_m * s_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
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 (x <= 6.2e-43)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x + x)) / (c_m * (s_m * (x * (x * (c_m * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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, 6.2e-43], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * N[(s$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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 6.2 \cdot 10^{-43}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{c\_m \cdot \left(s\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 6.1999999999999999e-43Initial program 60.4%
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
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 rewrites85.5%
if 6.1999999999999999e-43 < x Initial program 63.7%
lift-pow.f64N/A
lift-pow.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/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-*.f6487.2
Applied rewrites87.2%
count-2N/A
lift-+.f6487.2
Applied rewrites87.2%
Taylor expanded in c around 0
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6487.2
Applied rewrites87.2%
Final simplification85.9%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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 (<= x 5.5e-163) (/ 1.0 (* c_m (* x (* c_m (* s_m (* x s_m)))))) (/ 1.0 (* c_m (* c_m (* s_m (* s_m (* x x))))))))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if (x <= 5.5e-163) {
tmp = 1.0 / (c_m * (x * (c_m * (s_m * (x * s_m)))));
} else {
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
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 (x <= 5.5d-163) then
tmp = 1.0d0 / (c_m * (x * (c_m * (s_m * (x * s_m)))))
else
tmp = 1.0d0 / (c_m * (c_m * (s_m * (s_m * (x * x)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if (x <= 5.5e-163) {
tmp = 1.0 / (c_m * (x * (c_m * (s_m * (x * s_m)))));
} else {
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if x <= 5.5e-163: tmp = 1.0 / (c_m * (x * (c_m * (s_m * (x * s_m))))) else: tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x))))) return tmp
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (x <= 5.5e-163) tmp = Float64(1.0 / Float64(c_m * Float64(x * Float64(c_m * Float64(s_m * Float64(x * s_m)))))); else tmp = Float64(1.0 / Float64(c_m * Float64(c_m * Float64(s_m * Float64(s_m * Float64(x * x)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
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 (x <= 5.5e-163)
tmp = 1.0 / (c_m * (x * (c_m * (s_m * (x * s_m)))));
else
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $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[x, 5.5e-163], N[(1.0 / N[(c$95$m * N[(x * N[(c$95$m * N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $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 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 5.5 \cdot 10^{-163}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(x \cdot \left(c\_m \cdot \left(s\_m \cdot \left(x \cdot s\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 5.4999999999999998e-163Initial program 59.5%
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-*.f6469.7
Applied rewrites69.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6478.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
Applied rewrites80.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f6477.9
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6471.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6471.3
Applied rewrites71.3%
if 5.4999999999999998e-163 < x Initial program 64.5%
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.0
Applied rewrites98.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-*.f6467.0
Applied rewrites67.0%
Final simplification69.7%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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)))) (/ (/ 1.0 t_0) t_0)))
s_m = fabs(s);
c_m = fabs(c);
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 (1.0 / t_0) / t_0;
}
s_m = abs(s)
c_m = abs(c)
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 = (1.0d0 / t_0) / t_0
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 (1.0 / t_0) / t_0;
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 (1.0 / t_0) / t_0
s_m = abs(s) c_m = abs(c) 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(Float64(1.0 / t_0) / t_0) end
s_m = abs(s);
c_m = abs(c);
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 = (1.0 / t_0) / t_0;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 61.3%
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-*.f6469.6
Applied rewrites69.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 rewrites80.1%
Final simplification80.1%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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)))) (/ 1.0 (* t_0 t_0))))
s_m = fabs(s);
c_m = fabs(c);
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 1.0 / (t_0 * t_0);
}
s_m = abs(s)
c_m = abs(c)
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 = 1.0d0 / (t_0 * t_0)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 1.0 / (t_0 * t_0);
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 1.0 / (t_0 * t_0)
s_m = abs(s) c_m = abs(c) 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(1.0 / Float64(t_0 * t_0)) end
s_m = abs(s);
c_m = abs(c);
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 = 1.0 / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[(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, 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{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 61.3%
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-*.f6469.6
Applied rewrites69.6%
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-*.f6479.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6478.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6479.8
Applied rewrites79.8%
Final simplification79.8%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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 (/ 1.0 (* c_m (* (* x s_m) (* c_m (* x s_m))))))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
}
s_m = abs(s)
c_m = abs(c)
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 = 1.0d0 / (c_m * ((x * s_m) * (c_m * (x * s_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))))
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m))))) end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $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[(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}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\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}
Initial program 61.3%
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-*.f6469.6
Applied rewrites69.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6476.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
Applied rewrites78.1%
Final simplification78.1%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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 (/ 1.0 (* c_m (* c_m (* s_m (* s_m (* x x)))))))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))));
}
s_m = abs(s)
c_m = abs(c)
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 = 1.0d0 / (c_m * (c_m * (s_m * (s_m * (x * x)))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))));
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))))
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(c_m * Float64(s_m * Float64(s_m * Float64(x * x)))))) end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / (c_m * (c_m * (s_m * (s_m * (x * x)))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $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[(1.0 / N[(c$95$m * N[(c$95$m * N[(s$95$m * N[(s$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)\right)}
\end{array}
Initial program 61.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-*.f6496.9
Applied rewrites96.9%
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.1
Applied rewrites66.1%
herbie shell --seed 2024220
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))