
(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 14 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 (* 2.0 x_m))))
(if (<= x_m 5e-145)
(/ t_0 (* (* c_m (pow (* s_m x_m) 2.0)) c_m))
(/ (/ (/ t_0 (* c_m x_m)) s_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 t_0 = cos((2.0 * x_m));
double tmp;
if (x_m <= 5e-145) {
tmp = t_0 / ((c_m * pow((s_m * x_m), 2.0)) * c_m);
} else {
tmp = ((t_0 / (c_m * x_m)) / s_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) :: t_0
real(8) :: tmp
t_0 = cos((2.0d0 * x_m))
if (x_m <= 5d-145) then
tmp = t_0 / ((c_m * ((s_m * x_m) ** 2.0d0)) * c_m)
else
tmp = ((t_0 / (c_m * x_m)) / s_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 t_0 = Math.cos((2.0 * x_m));
double tmp;
if (x_m <= 5e-145) {
tmp = t_0 / ((c_m * Math.pow((s_m * x_m), 2.0)) * c_m);
} else {
tmp = ((t_0 / (c_m * x_m)) / s_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): t_0 = math.cos((2.0 * x_m)) tmp = 0 if x_m <= 5e-145: tmp = t_0 / ((c_m * math.pow((s_m * x_m), 2.0)) * c_m) else: tmp = ((t_0 / (c_m * x_m)) / s_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) t_0 = cos(Float64(2.0 * x_m)) tmp = 0.0 if (x_m <= 5e-145) tmp = Float64(t_0 / Float64(Float64(c_m * (Float64(s_m * x_m) ^ 2.0)) * c_m)); else tmp = Float64(Float64(Float64(t_0 / Float64(c_m * x_m)) / s_m) / Float64(Float64(c_m * 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)
t_0 = cos((2.0 * x_m));
tmp = 0.0;
if (x_m <= 5e-145)
tmp = t_0 / ((c_m * ((s_m * x_m) ^ 2.0)) * c_m);
else
tmp = ((t_0 / (c_m * x_m)) / s_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_] := Block[{t$95$0 = N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 5e-145], N[(t$95$0 / N[(N[(c$95$m * N[Power[N[(s$95$m * x$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$0 / N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision] / N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $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(2 \cdot x\_m\right)\\
\mathbf{if}\;x\_m \leq 5 \cdot 10^{-145}:\\
\;\;\;\;\frac{t\_0}{\left(c\_m \cdot {\left(s\_m \cdot x\_m\right)}^{2}\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{t\_0}{c\_m \cdot x\_m}}{s\_m}}{\left(c\_m \cdot x\_m\right) \cdot s\_m}\\
\end{array}
\end{array}
if x < 4.9999999999999998e-145Initial program 60.7%
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6467.0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6481.3
Applied rewrites81.3%
if 4.9999999999999998e-145 < x Initial program 72.1%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6472.1
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6498.4
Applied rewrites98.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6499.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f6499.7
Applied rewrites99.7%
Final simplification87.6%
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)) (t_1 (* (* s_m x_m) c_m)))
(if (<=
(/ (cos (* 2.0 x_m)) (* (* (* (pow s_m 2.0) x_m) x_m) (pow c_m 2.0)))
-4e-38)
(/ (/ (fma -2.0 (* x_m x_m) 1.0) t_0) t_0)
(/ (/ 1.0 t_1) t_1))))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 t_1 = (s_m * x_m) * c_m;
double tmp;
if ((cos((2.0 * x_m)) / (((pow(s_m, 2.0) * x_m) * x_m) * pow(c_m, 2.0))) <= -4e-38) {
tmp = (fma(-2.0, (x_m * x_m), 1.0) / t_0) / t_0;
} else {
tmp = (1.0 / t_1) / t_1;
}
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(Float64(c_m * x_m) * s_m) t_1 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(Float64((s_m ^ 2.0) * x_m) * x_m) * (c_m ^ 2.0))) <= -4e-38) tmp = Float64(Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / t_0) / t_0); else tmp = Float64(Float64(1.0 / t_1) / t_1); end return 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[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[Power[c$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e-38], N[(N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $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 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
t_1 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{\left(\left({s\_m}^{2} \cdot x\_m\right) \cdot x\_m\right) \cdot {c\_m}^{2}} \leq -4 \cdot 10^{-38}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\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))) < -3.9999999999999998e-38Initial program 65.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6465.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6492.1
Applied rewrites92.1%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6492.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6488.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.1
Applied rewrites96.1%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6441.6
Applied rewrites41.6%
if -3.9999999999999998e-38 < (/.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 64.5%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.9
Applied rewrites97.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.6
Applied rewrites97.6%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites96.0%
Taylor expanded in x around 0
Applied rewrites83.4%
Final simplification79.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 (* (* s_m x_m) c_m)))
(if (<=
(/ (cos (* 2.0 x_m)) (* (* (* (pow s_m 2.0) x_m) x_m) (pow c_m 2.0)))
-4e-38)
(/ (fma -2.0 (* x_m x_m) 1.0) (* (* (* c_m c_m) s_m) (* (* s_m x_m) x_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 = (s_m * x_m) * c_m;
double tmp;
if ((cos((2.0 * x_m)) / (((pow(s_m, 2.0) * x_m) * x_m) * pow(c_m, 2.0))) <= -4e-38) {
tmp = fma(-2.0, (x_m * x_m), 1.0) / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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(Float64(s_m * x_m) * c_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(Float64((s_m ^ 2.0) * x_m) * x_m) * (c_m ^ 2.0))) <= -4e-38) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(Float64(Float64(c_m * c_m) * s_m) * Float64(Float64(s_m * x_m) * x_m))); 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]
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[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[Power[c$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e-38], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(N[(s$95$m * x$95$m), $MachinePrecision] * x$95$m), $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_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\_m\right)}{\left(\left({s\_m}^{2} \cdot x\_m\right) \cdot x\_m\right) \cdot {c\_m}^{2}} \leq -4 \cdot 10^{-38}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{\left(\left(c\_m \cdot c\_m\right) \cdot s\_m\right) \cdot \left(\left(s\_m \cdot x\_m\right) \cdot x\_m\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))) < -3.9999999999999998e-38Initial program 65.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6465.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6492.1
Applied rewrites92.1%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites77.1%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6441.1
Applied rewrites41.1%
if -3.9999999999999998e-38 < (/.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 64.5%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.9
Applied rewrites97.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.6
Applied rewrites97.6%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites96.0%
Taylor expanded in x around 0
Applied rewrites83.4%
Final simplification79.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 (* (* s_m x_m) c_m)) (t_1 (cos (* 2.0 x_m))))
(if (<= c_m 3.6e-185)
(/ (/ (/ t_1 (* c_m x_m)) s_m) (* (* c_m x_m) s_m))
(/ (/ t_1 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 = (s_m * x_m) * c_m;
double t_1 = cos((2.0 * x_m));
double tmp;
if (c_m <= 3.6e-185) {
tmp = ((t_1 / (c_m * x_m)) / s_m) / ((c_m * x_m) * s_m);
} else {
tmp = (t_1 / 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) :: t_1
real(8) :: tmp
t_0 = (s_m * x_m) * c_m
t_1 = cos((2.0d0 * x_m))
if (c_m <= 3.6d-185) then
tmp = ((t_1 / (c_m * x_m)) / s_m) / ((c_m * x_m) * s_m)
else
tmp = (t_1 / 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 = (s_m * x_m) * c_m;
double t_1 = Math.cos((2.0 * x_m));
double tmp;
if (c_m <= 3.6e-185) {
tmp = ((t_1 / (c_m * x_m)) / s_m) / ((c_m * x_m) * s_m);
} else {
tmp = (t_1 / 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 = (s_m * x_m) * c_m t_1 = math.cos((2.0 * x_m)) tmp = 0 if c_m <= 3.6e-185: tmp = ((t_1 / (c_m * x_m)) / s_m) / ((c_m * x_m) * s_m) else: tmp = (t_1 / 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(Float64(s_m * x_m) * c_m) t_1 = cos(Float64(2.0 * x_m)) tmp = 0.0 if (c_m <= 3.6e-185) tmp = Float64(Float64(Float64(t_1 / Float64(c_m * x_m)) / s_m) / Float64(Float64(c_m * x_m) * s_m)); else tmp = Float64(Float64(t_1 / 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 = (s_m * x_m) * c_m;
t_1 = cos((2.0 * x_m));
tmp = 0.0;
if (c_m <= 3.6e-185)
tmp = ((t_1 / (c_m * x_m)) / s_m) / ((c_m * x_m) * s_m);
else
tmp = (t_1 / 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[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 3.6e-185], N[(N[(N[(t$95$1 / N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision] / N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / t$95$0), $MachinePrecision] / t$95$0), $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 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
t_1 := \cos \left(2 \cdot x\_m\right)\\
\mathbf{if}\;c\_m \leq 3.6 \cdot 10^{-185}:\\
\;\;\;\;\frac{\frac{\frac{t\_1}{c\_m \cdot x\_m}}{s\_m}}{\left(c\_m \cdot x\_m\right) \cdot s\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if c < 3.5999999999999998e-185Initial program 63.2%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6463.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.4
Applied rewrites96.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.4
Applied rewrites98.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f6498.5
Applied rewrites98.5%
if 3.5999999999999998e-185 < c Initial program 66.8%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6466.8
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6498.7
Applied rewrites98.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.9
Applied rewrites95.9%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites96.0%
Final simplification97.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 (* (* s_m x_m) c_m)) (t_1 (* (* c_m x_m) s_m)))
(if (<= c_m 3.6e-185)
(/ (/ (cos (+ x_m x_m)) t_1) t_1)
(/ (/ (cos (* 2.0 x_m)) 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 = (s_m * x_m) * c_m;
double t_1 = (c_m * x_m) * s_m;
double tmp;
if (c_m <= 3.6e-185) {
tmp = (cos((x_m + x_m)) / t_1) / t_1;
} else {
tmp = (cos((2.0 * x_m)) / 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) :: t_1
real(8) :: tmp
t_0 = (s_m * x_m) * c_m
t_1 = (c_m * x_m) * s_m
if (c_m <= 3.6d-185) then
tmp = (cos((x_m + x_m)) / t_1) / t_1
else
tmp = (cos((2.0d0 * x_m)) / 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 = (s_m * x_m) * c_m;
double t_1 = (c_m * x_m) * s_m;
double tmp;
if (c_m <= 3.6e-185) {
tmp = (Math.cos((x_m + x_m)) / t_1) / t_1;
} else {
tmp = (Math.cos((2.0 * x_m)) / 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 = (s_m * x_m) * c_m t_1 = (c_m * x_m) * s_m tmp = 0 if c_m <= 3.6e-185: tmp = (math.cos((x_m + x_m)) / t_1) / t_1 else: tmp = (math.cos((2.0 * x_m)) / 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(Float64(s_m * x_m) * c_m) t_1 = Float64(Float64(c_m * x_m) * s_m) tmp = 0.0 if (c_m <= 3.6e-185) tmp = Float64(Float64(cos(Float64(x_m + x_m)) / t_1) / t_1); else tmp = Float64(Float64(cos(Float64(2.0 * x_m)) / 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 = (s_m * x_m) * c_m;
t_1 = (c_m * x_m) * s_m;
tmp = 0.0;
if (c_m <= 3.6e-185)
tmp = (cos((x_m + x_m)) / t_1) / t_1;
else
tmp = (cos((2.0 * x_m)) / 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[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[c$95$m, 3.6e-185], N[(N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $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 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
t_1 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\mathbf{if}\;c\_m \leq 3.6 \cdot 10^{-185}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m + x\_m\right)}{t\_1}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(2 \cdot x\_m\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if c < 3.5999999999999998e-185Initial program 63.2%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6463.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.4
Applied rewrites96.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.4
Applied rewrites98.4%
lift-*.f64N/A
count-2N/A
lower-+.f6498.4
Applied rewrites98.4%
if 3.5999999999999998e-185 < c Initial program 66.8%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6466.8
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6498.7
Applied rewrites98.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.9
Applied rewrites95.9%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites96.0%
Final simplification97.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 (* (* c_m x_m) s_m)) (t_1 (* (* s_m x_m) c_m))) (if (<= x_m 2e-144) (/ (/ 1.0 t_1) t_1) (/ (/ (cos (+ x_m x_m)) 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 t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 2e-144) {
tmp = (1.0 / t_1) / t_1;
} else {
tmp = (cos((x_m + x_m)) / 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) :: t_1
real(8) :: tmp
t_0 = (c_m * x_m) * s_m
t_1 = (s_m * x_m) * c_m
if (x_m <= 2d-144) then
tmp = (1.0d0 / t_1) / t_1
else
tmp = (cos((x_m + x_m)) / 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 t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 2e-144) {
tmp = (1.0 / t_1) / t_1;
} else {
tmp = (Math.cos((x_m + x_m)) / 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 t_1 = (s_m * x_m) * c_m tmp = 0 if x_m <= 2e-144: tmp = (1.0 / t_1) / t_1 else: tmp = (math.cos((x_m + x_m)) / 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(Float64(c_m * x_m) * s_m) t_1 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 2e-144) tmp = Float64(Float64(1.0 / t_1) / t_1); else tmp = Float64(Float64(cos(Float64(x_m + x_m)) / 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;
t_1 = (s_m * x_m) * c_m;
tmp = 0.0;
if (x_m <= 2e-144)
tmp = (1.0 / t_1) / t_1;
else
tmp = (cos((x_m + x_m)) / 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[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 2e-144], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $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 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
t_1 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 2 \cdot 10^{-144}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m + x\_m\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 1.9999999999999999e-144Initial program 60.7%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6460.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.7
Applied rewrites96.7%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6493.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.3
Applied rewrites96.3%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites95.2%
Taylor expanded in x around 0
Applied rewrites76.4%
if 1.9999999999999999e-144 < x Initial program 72.1%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6472.1
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6498.4
Applied rewrites98.4%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6498.6
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.7
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
count-2N/A
lower-+.f6499.6
Applied rewrites99.6%
Final simplification84.3%
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)) (t_1 (* (* s_m x_m) c_m)))
(if (<= x_m 8.8e-72)
(/ (/ 1.0 t_1) t_1)
(/ (cos (* 2.0 x_m)) (* 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 t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 8.8e-72) {
tmp = (1.0 / t_1) / t_1;
} else {
tmp = cos((2.0 * x_m)) / (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) :: t_1
real(8) :: tmp
t_0 = (c_m * x_m) * s_m
t_1 = (s_m * x_m) * c_m
if (x_m <= 8.8d-72) then
tmp = (1.0d0 / t_1) / t_1
else
tmp = cos((2.0d0 * x_m)) / (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 t_1 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 8.8e-72) {
tmp = (1.0 / t_1) / t_1;
} else {
tmp = Math.cos((2.0 * x_m)) / (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 t_1 = (s_m * x_m) * c_m tmp = 0 if x_m <= 8.8e-72: tmp = (1.0 / t_1) / t_1 else: tmp = math.cos((2.0 * x_m)) / (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(Float64(c_m * x_m) * s_m) t_1 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 8.8e-72) tmp = Float64(Float64(1.0 / t_1) / t_1); else tmp = Float64(cos(Float64(2.0 * x_m)) / 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;
t_1 = (s_m * x_m) * c_m;
tmp = 0.0;
if (x_m <= 8.8e-72)
tmp = (1.0 / t_1) / t_1;
else
tmp = cos((2.0 * x_m)) / (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[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 8.8e-72], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Cos[N[(2.0 * x$95$m), $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_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
t_1 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 8.8 \cdot 10^{-72}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 8.8000000000000001e-72Initial program 60.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6460.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6496.9
Applied rewrites96.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6496.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6494.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.5
Applied rewrites96.5%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites95.4%
Taylor expanded in x around 0
Applied rewrites77.6%
if 8.8000000000000001e-72 < x Initial program 73.7%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6499.4
Applied rewrites99.4%
Final simplification84.3%
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 (* (* s_m x_m) c_m)))
(if (<= s_m 1.8e+64)
(/ (cos (+ x_m x_m)) (* (* (* c_m c_m) s_m) (* (* s_m x_m) x_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 = (s_m * x_m) * c_m;
double tmp;
if (s_m <= 1.8e+64) {
tmp = cos((x_m + x_m)) / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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 = (s_m * x_m) * c_m
if (s_m <= 1.8d+64) then
tmp = cos((x_m + x_m)) / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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 = (s_m * x_m) * c_m;
double tmp;
if (s_m <= 1.8e+64) {
tmp = Math.cos((x_m + x_m)) / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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 = (s_m * x_m) * c_m tmp = 0 if s_m <= 1.8e+64: tmp = math.cos((x_m + x_m)) / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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(Float64(s_m * x_m) * c_m) tmp = 0.0 if (s_m <= 1.8e+64) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(c_m * c_m) * s_m) * Float64(Float64(s_m * x_m) * x_m))); else tmp = Float64(Float64(1.0 / 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 = (s_m * x_m) * c_m;
tmp = 0.0;
if (s_m <= 1.8e+64)
tmp = cos((x_m + x_m)) / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[s$95$m, 1.8e+64], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(N[(s$95$m * x$95$m), $MachinePrecision] * x$95$m), $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_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;s\_m \leq 1.8 \cdot 10^{+64}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(c\_m \cdot c\_m\right) \cdot s\_m\right) \cdot \left(\left(s\_m \cdot x\_m\right) \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if s < 1.80000000000000007e64Initial program 67.3%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.3
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.2
Applied rewrites97.2%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites73.7%
lift-*.f64N/A
*-commutativeN/A
count-2N/A
lower-+.f6473.7
Applied rewrites73.7%
if 1.80000000000000007e64 < s Initial program 53.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6453.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.8
Applied rewrites97.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.9
Applied rewrites97.9%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites97.9%
Taylor expanded in x around 0
Applied rewrites89.9%
Final simplification76.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 (if (<= x_m 1e-58) (/ 1.0 (* (* (* c_m c_m) s_m) (* (* s_m x_m) x_m))) (/ (/ 1.0 (* (* c_m x_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 tmp;
if (x_m <= 1e-58) {
tmp = 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_m));
} else {
tmp = (1.0 / ((c_m * x_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) :: tmp
if (x_m <= 1d-58) then
tmp = 1.0d0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_m))
else
tmp = (1.0d0 / ((c_m * x_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 tmp;
if (x_m <= 1e-58) {
tmp = 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_m));
} else {
tmp = (1.0 / ((c_m * x_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): tmp = 0 if x_m <= 1e-58: tmp = 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_m)) else: tmp = (1.0 / ((c_m * x_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) tmp = 0.0 if (x_m <= 1e-58) tmp = Float64(1.0 / Float64(Float64(Float64(c_m * c_m) * s_m) * Float64(Float64(s_m * x_m) * x_m))); else tmp = Float64(Float64(1.0 / Float64(Float64(c_m * x_m) * x_m)) / Float64(Float64(c_m * 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)
tmp = 0.0;
if (x_m <= 1e-58)
tmp = 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_m));
else
tmp = (1.0 / ((c_m * x_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_] := If[LessEqual[x$95$m, 1e-58], N[(1.0 / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(N[(s$95$m * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[(c$95$m * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(c$95$m * s$95$m), $MachinePrecision] * s$95$m), $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 10^{-58}:\\
\;\;\;\;\frac{1}{\left(\left(c\_m \cdot c\_m\right) \cdot s\_m\right) \cdot \left(\left(s\_m \cdot x\_m\right) \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\left(c\_m \cdot x\_m\right) \cdot x\_m}}{\left(c\_m \cdot s\_m\right) \cdot s\_m}\\
\end{array}
\end{array}
if x < 1e-58Initial program 62.5%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6462.5
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.0
Applied rewrites97.0%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites71.2%
Taylor expanded in x around 0
Applied rewrites64.2%
if 1e-58 < x Initial program 70.3%
Taylor expanded in x around 0
associate-*r*N/A
associate-/l/N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6461.1
Applied rewrites61.1%
Applied rewrites61.1%
Applied rewrites62.8%
Final simplification63.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 (let* ((t_0 (* (* s_m x_m) c_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 = (s_m * x_m) * c_m;
return (1.0 / t_0) / t_0;
}
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
t_0 = (s_m * x_m) * c_m
code = (1.0d0 / t_0) / t_0
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 = (s_m * x_m) * c_m;
return (1.0 / t_0) / t_0;
}
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 = (s_m * x_m) * c_m return (1.0 / t_0) / t_0
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(Float64(s_m * x_m) * c_m) return Float64(Float64(1.0 / t_0) / t_0) 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)
t_0 = (s_m * x_m) * c_m;
tmp = (1.0 / t_0) / t_0;
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[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $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_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 64.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.3
Applied rewrites97.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
lift-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lift-/.f64N/A
distribute-neg-frac2N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites96.4%
Taylor expanded in x around 0
Applied rewrites75.4%
Final simplification75.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 s_m) x_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 * s_m) * x_m;
return (1.0 / t_0) / t_0;
}
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
t_0 = (c_m * s_m) * x_m
code = (1.0d0 / t_0) / t_0
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 * s_m) * x_m;
return (1.0 / t_0) / t_0;
}
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 * s_m) * x_m return (1.0 / t_0) / t_0
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(Float64(c_m * s_m) * x_m) return Float64(Float64(1.0 / t_0) / t_0) 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)
t_0 = (c_m * s_m) * x_m;
tmp = (1.0 / t_0) / t_0;
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[(c$95$m * s$95$m), $MachinePrecision] * x$95$m), $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_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\_m\right) \cdot x\_m\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 64.6%
Taylor expanded in x around 0
associate-*r*N/A
associate-/l/N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6462.3
Applied rewrites62.3%
Applied rewrites62.3%
Applied rewrites67.0%
Applied rewrites76.9%
Final simplification76.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))) (/ (/ 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;
return (1.0 / t_0) / t_0;
}
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
t_0 = (c_m * x_m) * s_m
code = (1.0d0 / t_0) / t_0
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;
return (1.0 / t_0) / t_0;
}
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 return (1.0 / t_0) / t_0
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(Float64(c_m * x_m) * s_m) return Float64(Float64(1.0 / t_0) / t_0) 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)
t_0 = (c_m * x_m) * s_m;
tmp = (1.0 / t_0) / t_0;
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[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $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_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot x\_m\right) \cdot s\_m\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 64.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.3
Applied rewrites97.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
Taylor expanded in x around 0
Applied rewrites77.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 (/ (/ 1.0 (* (* s_m x_m) c_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) {
return (1.0 / ((s_m * x_m) * c_m)) / ((c_m * x_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 = (1.0d0 / ((s_m * x_m) * c_m)) / ((c_m * x_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 (1.0 / ((s_m * x_m) * c_m)) / ((c_m * x_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 (1.0 / ((s_m * x_m) * c_m)) / ((c_m * x_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(Float64(1.0 / Float64(Float64(s_m * x_m) * c_m)) / Float64(Float64(c_m * x_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 = (1.0 / ((s_m * x_m) * c_m)) / ((c_m * x_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[(N[(1.0 / N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $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{\frac{1}{\left(s\_m \cdot x\_m\right) \cdot c\_m}}{\left(c\_m \cdot x\_m\right) \cdot s\_m}
\end{array}
Initial program 64.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.3
Applied rewrites97.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6497.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6495.3
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
Taylor expanded in x around 0
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6474.6
Applied rewrites74.6%
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 (/ 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) {
return 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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 = 1.0d0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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(1.0 / Float64(Float64(Float64(c_m * c_m) * s_m) * Float64(Float64(s_m * x_m) * x_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 = 1.0 / (((c_m * c_m) * s_m) * ((s_m * x_m) * x_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[(1.0 / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(N[(s$95$m * x$95$m), $MachinePrecision] * x$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])\\
\\
\frac{1}{\left(\left(c\_m \cdot c\_m\right) \cdot s\_m\right) \cdot \left(\left(s\_m \cdot x\_m\right) \cdot x\_m\right)}
\end{array}
Initial program 64.6%
lift-*.f64N/A
*-commutativeN/A
lower-*.f6464.6
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
pow2N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.3
Applied rewrites97.3%
lift-pow.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
unpow-prod-downN/A
unpow2N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites73.5%
Taylor expanded in x around 0
Applied rewrites63.0%
Final simplification63.0%
herbie shell --seed 2024285
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))