
(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 (* (* c_m x_m) s_m)))
(if (<= x_m 1e-61)
(/ (/ (/ 1.0 (/ x_m (/ -1.0 s_m))) c_m) (* (* (- x_m) s_m) c_m))
(/ (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 tmp;
if (x_m <= 1e-61) {
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
} 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) :: tmp
t_0 = (c_m * x_m) * s_m
if (x_m <= 1d-61) then
tmp = ((1.0d0 / (x_m / ((-1.0d0) / s_m))) / c_m) / ((-x_m * s_m) * c_m)
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 tmp;
if (x_m <= 1e-61) {
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
} 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 tmp = 0 if x_m <= 1e-61: tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m) 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) tmp = 0.0 if (x_m <= 1e-61) tmp = Float64(Float64(Float64(1.0 / Float64(x_m / Float64(-1.0 / s_m))) / c_m) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); 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;
tmp = 0.0;
if (x_m <= 1e-61)
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
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]}, If[LessEqual[x$95$m, 1e-61], N[(N[(N[(1.0 / N[(x$95$m / N[(-1.0 / s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $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\\
\mathbf{if}\;x\_m \leq 10^{-61}:\\
\;\;\;\;\frac{\frac{\frac{1}{\frac{x\_m}{\frac{-1}{s\_m}}}}{c\_m}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\_m\right)}{t\_0 \cdot t\_0}\\
\end{array}
\end{array}
if x < 1e-61Initial program 66.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.1
Applied rewrites98.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites95.7%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6482.6
Applied rewrites82.6%
Applied rewrites82.6%
if 1e-61 < x Initial program 72.4%
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
unswap-sqrN/A
unswap-sqrN/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.7
Applied rewrites96.7%
Final simplification86.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
(if (<=
(/ (cos (* 2.0 x_m)) (* (* (* (pow s_m 2.0) x_m) x_m) (pow c_m 2.0)))
-1e-181)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* (* (* c_m x_m) s_m) c_m) (* s_m x_m)))
(/ (/ (/ 1.0 (/ x_m (/ -1.0 s_m))) c_m) (* (* (- x_m) s_m) c_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (((pow(s_m, 2.0) * x_m) * x_m) * pow(c_m, 2.0))) <= -1e-181) {
tmp = fma((x_m * x_m), -2.0, 1.0) / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
} else {
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(Float64((s_m ^ 2.0) * x_m) * x_m) * (c_m ^ 2.0))) <= -1e-181) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(Float64(Float64(c_m * x_m) * s_m) * c_m) * Float64(s_m * x_m))); else tmp = Float64(Float64(Float64(1.0 / Float64(x_m / Float64(-1.0 / s_m))) / c_m) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); 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_] := 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], -1e-181], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / N[(x$95$m / N[(-1.0 / s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$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}\;\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 -1 \cdot 10^{-181}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{\frac{x\_m}{\frac{-1}{s\_m}}}}{c\_m}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1.00000000000000005e-181Initial program 80.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6443.0
Applied rewrites43.0%
if -1.00000000000000005e-181 < (/.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 66.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.0%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6487.8
Applied rewrites87.8%
Applied rewrites87.8%
Final simplification83.8%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x_m)) (* (* (* (pow s_m 2.0) x_m) x_m) (pow c_m 2.0)))
-1e-181)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* (* (* c_m x_m) s_m) c_m) (* s_m x_m)))
(/ (/ (/ -1.0 (* s_m x_m)) c_m) (* (* (- x_m) s_m) c_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (((pow(s_m, 2.0) * x_m) * x_m) * pow(c_m, 2.0))) <= -1e-181) {
tmp = fma((x_m * x_m), -2.0, 1.0) / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
} else {
tmp = ((-1.0 / (s_m * x_m)) / c_m) / ((-x_m * s_m) * c_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(Float64((s_m ^ 2.0) * x_m) * x_m) * (c_m ^ 2.0))) <= -1e-181) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(Float64(Float64(c_m * x_m) * s_m) * c_m) * Float64(s_m * x_m))); else tmp = Float64(Float64(Float64(-1.0 / Float64(s_m * x_m)) / c_m) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); 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_] := 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], -1e-181], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 / N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$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}\;\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 -1 \cdot 10^{-181}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{-1}{s\_m \cdot x\_m}}{c\_m}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1.00000000000000005e-181Initial program 80.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6443.0
Applied rewrites43.0%
if -1.00000000000000005e-181 < (/.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 66.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.0%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6487.8
Applied rewrites87.8%
Final simplification83.8%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
x_m = (fabs.f64 x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(if (<=
(/ (cos (* 2.0 x_m)) (* (* (* (pow s_m 2.0) x_m) x_m) (pow c_m 2.0)))
-1e-181)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* (* (* c_m x_m) s_m) c_m) (* s_m x_m)))
(/ (/ -1.0 (* c_m (* s_m x_m))) (* (* (- x_m) s_m) c_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (((pow(s_m, 2.0) * x_m) * x_m) * pow(c_m, 2.0))) <= -1e-181) {
tmp = fma((x_m * x_m), -2.0, 1.0) / ((((c_m * x_m) * s_m) * c_m) * (s_m * x_m));
} else {
tmp = (-1.0 / (c_m * (s_m * x_m))) / ((-x_m * s_m) * c_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(Float64((s_m ^ 2.0) * x_m) * x_m) * (c_m ^ 2.0))) <= -1e-181) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(Float64(Float64(c_m * x_m) * s_m) * c_m) * Float64(s_m * x_m))); else tmp = Float64(Float64(-1.0 / Float64(c_m * Float64(s_m * x_m))) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); 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_] := 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], -1e-181], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$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}\;\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 -1 \cdot 10^{-181}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{c\_m \cdot \left(s\_m \cdot x\_m\right)}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1.00000000000000005e-181Initial program 80.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6443.0
Applied rewrites43.0%
if -1.00000000000000005e-181 < (/.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 66.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.0%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6487.8
Applied rewrites87.8%
Applied rewrites88.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
(if (<=
(/ (cos (* 2.0 x_m)) (* (* (* (pow s_m 2.0) x_m) x_m) (pow c_m 2.0)))
-1e-181)
(/ (fma (* x_m x_m) -2.0 1.0) (* (* (* (* c_m x_m) x_m) s_m) (* c_m s_m)))
(/ (/ -1.0 (* c_m (* s_m x_m))) (* (* (- x_m) s_m) c_m))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if ((cos((2.0 * x_m)) / (((pow(s_m, 2.0) * x_m) * x_m) * pow(c_m, 2.0))) <= -1e-181) {
tmp = fma((x_m * x_m), -2.0, 1.0) / ((((c_m * x_m) * x_m) * s_m) * (c_m * s_m));
} else {
tmp = (-1.0 / (c_m * (s_m * x_m))) / ((-x_m * s_m) * c_m);
}
return tmp;
}
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x_m)) / Float64(Float64(Float64((s_m ^ 2.0) * x_m) * x_m) * (c_m ^ 2.0))) <= -1e-181) tmp = Float64(fma(Float64(x_m * x_m), -2.0, 1.0) / Float64(Float64(Float64(Float64(c_m * x_m) * x_m) * s_m) * Float64(c_m * s_m))); else tmp = Float64(Float64(-1.0 / Float64(c_m * Float64(s_m * x_m))) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); 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_] := 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], -1e-181], N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / N[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$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}\;\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 -1 \cdot 10^{-181}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x\_m \cdot x\_m, -2, 1\right)}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot x\_m\right) \cdot s\_m\right) \cdot \left(c\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{c\_m \cdot \left(s\_m \cdot x\_m\right)}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1.00000000000000005e-181Initial program 80.8%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6478.3
Applied rewrites78.3%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6434.0
Applied rewrites34.0%
if -1.00000000000000005e-181 < (/.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 66.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.5
Applied rewrites97.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.0%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6487.8
Applied rewrites87.8%
Applied rewrites88.4%
Final simplification83.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 (/ (/ (/ (cos (* 2.0 x_m)) (* s_m x_m)) c_m) (* c_m (* s_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 ((cos((2.0 * x_m)) / (s_m * x_m)) / c_m) / (c_m * (s_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 = ((cos((2.0d0 * x_m)) / (s_m * x_m)) / c_m) / (c_m * (s_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 ((Math.cos((2.0 * x_m)) / (s_m * x_m)) / c_m) / (c_m * (s_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 ((math.cos((2.0 * x_m)) / (s_m * x_m)) / c_m) / (c_m * (s_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(Float64(Float64(cos(Float64(2.0 * x_m)) / Float64(s_m * x_m)) / c_m) / Float64(c_m * Float64(s_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 = ((cos((2.0 * x_m)) / (s_m * x_m)) / c_m) / (c_m * (s_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[(N[(N[(N[Cos[N[(2.0 * x$95$m), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(c$95$m * N[(s$95$m * 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{\frac{\frac{\cos \left(2 \cdot x\_m\right)}{s\_m \cdot x\_m}}{c\_m}}{c\_m \cdot \left(s\_m \cdot x\_m\right)}
\end{array}
Initial program 67.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.3%
Final simplification96.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 (if (<= s_m 3.5e+182) (/ (cos (+ x_m x_m)) (* (* (* c_m s_m) (* s_m x_m)) (* c_m x_m))) (/ (/ (/ -1.0 (* s_m x_m)) c_m) (* (* (- x_m) s_m) c_m))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (s_m <= 3.5e+182) {
tmp = cos((x_m + x_m)) / (((c_m * s_m) * (s_m * x_m)) * (c_m * x_m));
} else {
tmp = ((-1.0 / (s_m * x_m)) / c_m) / ((-x_m * s_m) * c_m);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (s_m <= 3.5d+182) then
tmp = cos((x_m + x_m)) / (((c_m * s_m) * (s_m * x_m)) * (c_m * x_m))
else
tmp = (((-1.0d0) / (s_m * x_m)) / c_m) / ((-x_m * s_m) * c_m)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (s_m <= 3.5e+182) {
tmp = Math.cos((x_m + x_m)) / (((c_m * s_m) * (s_m * x_m)) * (c_m * x_m));
} else {
tmp = ((-1.0 / (s_m * x_m)) / c_m) / ((-x_m * s_m) * c_m);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if s_m <= 3.5e+182: tmp = math.cos((x_m + x_m)) / (((c_m * s_m) * (s_m * x_m)) * (c_m * x_m)) else: tmp = ((-1.0 / (s_m * x_m)) / c_m) / ((-x_m * s_m) * c_m) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (s_m <= 3.5e+182) tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(c_m * s_m) * Float64(s_m * x_m)) * Float64(c_m * x_m))); else tmp = Float64(Float64(Float64(-1.0 / Float64(s_m * x_m)) / c_m) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (s_m <= 3.5e+182)
tmp = cos((x_m + x_m)) / (((c_m * s_m) * (s_m * x_m)) * (c_m * x_m));
else
tmp = ((-1.0 / (s_m * x_m)) / c_m) / ((-x_m * s_m) * c_m);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[s$95$m, 3.5e+182], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 / N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$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}\;s\_m \leq 3.5 \cdot 10^{+182}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(c\_m \cdot s\_m\right) \cdot \left(s\_m \cdot x\_m\right)\right) \cdot \left(c\_m \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{-1}{s\_m \cdot x\_m}}{c\_m}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\end{array}
\end{array}
if s < 3.50000000000000023e182Initial program 69.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.3
Applied rewrites98.3%
lift-*.f64N/A
count-2N/A
lower-+.f6498.3
Applied rewrites98.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites91.8%
if 3.50000000000000023e182 < s Initial program 51.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6489.3
Applied rewrites89.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.2%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6496.9
Applied rewrites96.9%
Final simplification92.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 (if (<= x_m 5e-22) (/ (/ (/ 1.0 (/ x_m (/ -1.0 s_m))) c_m) (* (* (- x_m) s_m) c_m)) (/ (cos (+ x_m x_m)) (* (* (* (* c_m x_m) x_m) s_m) (* c_m s_m)))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 5e-22) {
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
} else {
tmp = cos((x_m + x_m)) / ((((c_m * x_m) * x_m) * s_m) * (c_m * s_m));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 5d-22) then
tmp = ((1.0d0 / (x_m / ((-1.0d0) / s_m))) / c_m) / ((-x_m * s_m) * c_m)
else
tmp = cos((x_m + x_m)) / ((((c_m * x_m) * x_m) * s_m) * (c_m * s_m))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 5e-22) {
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
} else {
tmp = Math.cos((x_m + x_m)) / ((((c_m * x_m) * x_m) * s_m) * (c_m * s_m));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 5e-22: tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m) else: tmp = math.cos((x_m + x_m)) / ((((c_m * x_m) * x_m) * s_m) * (c_m * s_m)) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 5e-22) tmp = Float64(Float64(Float64(1.0 / Float64(x_m / Float64(-1.0 / s_m))) / c_m) / Float64(Float64(Float64(-x_m) * s_m) * c_m)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(Float64(c_m * x_m) * x_m) * s_m) * Float64(c_m * s_m))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 5e-22)
tmp = ((1.0 / (x_m / (-1.0 / s_m))) / c_m) / ((-x_m * s_m) * c_m);
else
tmp = cos((x_m + x_m)) / ((((c_m * x_m) * x_m) * s_m) * (c_m * s_m));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 5e-22], N[(N[(N[(1.0 / N[(x$95$m / N[(-1.0 / s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[(c$95$m * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 5 \cdot 10^{-22}:\\
\;\;\;\;\frac{\frac{\frac{1}{\frac{x\_m}{\frac{-1}{s\_m}}}}{c\_m}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(\left(c\_m \cdot x\_m\right) \cdot x\_m\right) \cdot s\_m\right) \cdot \left(c\_m \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 4.99999999999999954e-22Initial program 66.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.2
Applied rewrites98.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites95.9%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6483.6
Applied rewrites83.6%
Applied rewrites83.6%
if 4.99999999999999954e-22 < x Initial program 73.4%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6481.5
Applied rewrites81.5%
lift-*.f64N/A
count-2N/A
lower-+.f6481.5
Applied rewrites81.5%
Final simplification83.2%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* (* c_m s_m) x_m))) (/ (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 * s_m) * x_m;
return cos((x_m + x_m)) / (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 = cos((x_m + x_m)) / (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 Math.cos((x_m + x_m)) / (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 math.cos((x_m + x_m)) / (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(cos(Float64(x_m + x_m)) / Float64(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 = cos((x_m + x_m)) / (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[Cos[N[(x$95$m + 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 s\_m\right) \cdot x\_m\\
\frac{\cos \left(x\_m + x\_m\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
lift-*.f64N/A
count-2N/A
lower-+.f6497.4
Applied rewrites97.4%
Final simplification97.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 (/ (/ -1.0 (* c_m (* s_m x_m))) (* (* (- x_m) s_m) c_m)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (-1.0 / (c_m * (s_m * x_m))) / ((-x_m * s_m) * c_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 * (s_m * x_m))) / ((-x_m * s_m) * c_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 * (s_m * x_m))) / ((-x_m * s_m) * c_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 * (s_m * x_m))) / ((-x_m * s_m) * c_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(c_m * Float64(s_m * x_m))) / Float64(Float64(Float64(-x_m) * s_m) * c_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 * (s_m * x_m))) / ((-x_m * s_m) * c_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[(c$95$m * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[((-x$95$m) * s$95$m), $MachinePrecision] * c$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}{c\_m \cdot \left(s\_m \cdot x\_m\right)}}{\left(\left(-x\_m\right) \cdot s\_m\right) \cdot c\_m}
\end{array}
Initial program 67.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites96.3%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
lower-*.f6480.0
Applied rewrites80.0%
Applied rewrites80.5%
Final simplification80.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 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(1.0 / Float64(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[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(c\_m \cdot s\_m\right) \cdot x\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
Taylor expanded in x around 0
Applied rewrites81.7%
Final simplification81.7%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* (* c_m (* s_m x_m)) c_m) (* s_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 * (s_m * x_m)) * c_m) * (s_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 * (s_m * x_m)) * c_m) * (s_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 * (s_m * x_m)) * c_m) * (s_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 * (s_m * x_m)) * c_m) * (s_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 * Float64(s_m * x_m)) * c_m) * Float64(s_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 * (s_m * x_m)) * c_m) * (s_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 * N[(s$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * 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 \left(s\_m \cdot x\_m\right)\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}
\end{array}
Initial program 67.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6492.5
Applied rewrites92.5%
Taylor expanded in x around 0
Applied rewrites76.8%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.5
Applied rewrites77.5%
Final simplification77.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 (/ 1.0 (* (* (* (* c_m s_m) x_m) c_m) (* s_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 * s_m) * x_m) * c_m) * (s_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 * s_m) * x_m) * c_m) * (s_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 * s_m) * x_m) * c_m) * (s_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 * s_m) * x_m) * c_m) * (s_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(Float64(c_m * s_m) * x_m) * c_m) * Float64(s_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 * s_m) * x_m) * c_m) * (s_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[(N[(c$95$m * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * 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(\left(c\_m \cdot s\_m\right) \cdot x\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot x\_m\right)}
\end{array}
Initial program 67.8%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6484.6
Applied rewrites84.6%
Taylor expanded in x around 0
Applied rewrites74.4%
Applied rewrites76.7%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) x_m = (fabs.f64 x) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* (* (* s_m x_m) x_m) c_m) (* c_m s_m))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((((s_m * x_m) * x_m) * c_m) * (c_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) * x_m) * c_m) * (c_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) * x_m) * c_m) * (c_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) * x_m) * c_m) * (c_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(1.0 / Float64(Float64(Float64(Float64(s_m * x_m) * x_m) * c_m) * Float64(c_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) * x_m) * c_m) * (c_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[(1.0 / N[(N[(N[(N[(s$95$m * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(\left(\left(s\_m \cdot x\_m\right) \cdot x\_m\right) \cdot c\_m\right) \cdot \left(c\_m \cdot s\_m\right)}
\end{array}
Initial program 67.8%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6484.6
Applied rewrites84.6%
Taylor expanded in x around 0
Applied rewrites74.4%
Taylor expanded in x around 0
Applied rewrites71.7%
Final simplification71.7%
herbie shell --seed 2024288
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))