
(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 10 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 (* (* s_m x_m) c_m)))
(if (<= x_m 4.9e-36)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* (* s_m c_m) x_m) (* (* c_m x_m) s_m))))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 4.9e-36) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (((s_m * c_m) * x_m) * ((c_m * x_m) * s_m));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (s_m * x_m) * c_m
if (x_m <= 4.9d-36) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / (((s_m * c_m) * x_m) * ((c_m * x_m) * s_m))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 4.9e-36) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / (((s_m * c_m) * x_m) * ((c_m * x_m) * s_m));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (s_m * x_m) * c_m tmp = 0 if x_m <= 4.9e-36: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / (((s_m * c_m) * x_m) * ((c_m * x_m) * s_m)) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 4.9e-36) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(s_m * c_m) * x_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 = (s_m * x_m) * c_m;
tmp = 0.0;
if (x_m <= 4.9e-36)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / (((s_m * c_m) * x_m) * ((c_m * x_m) * s_m));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 4.9e-36], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(N[(c$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
x_m = \left|x\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 4.9 \cdot 10^{-36}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(s\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(\left(c\_m \cdot x\_m\right) \cdot s\_m\right)}\\
\end{array}
\end{array}
if x < 4.8999999999999997e-36Initial program 63.0%
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-*.f6497.2
Applied rewrites97.2%
Taylor expanded in x around 0
Applied rewrites80.9%
Applied rewrites81.2%
if 4.8999999999999997e-36 < x Initial program 81.0%
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.6
Applied rewrites99.6%
lift-*.f64N/A
count-2N/A
lower-+.f6499.6
Applied rewrites99.6%
Applied rewrites98.4%
Final simplification85.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 (* (* 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)))
-2e-83)
(/ (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))) <= -2e-83) {
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))) <= -2e-83) tmp = Float64(fma(-2.0, Float64(x_m * x_m), 1.0) / Float64(t_0 * t_0)); else tmp = Float64(1.0 / Float64(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], -2e-83], N[(N[(-2.0 * N[(x$95$m * x$95$m), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(t$95$1 * t$95$1), $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}\;\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 -2 \cdot 10^{-83}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x\_m \cdot x\_m, 1\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_1 \cdot 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))) < -2.0000000000000001e-83Initial program 54.5%
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.0
Applied rewrites99.0%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6443.3
Applied rewrites43.3%
if -2.0000000000000001e-83 < (/.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 68.9%
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-*.f6497.8
Applied rewrites97.8%
Taylor expanded in x around 0
Applied rewrites84.5%
Applied rewrites84.7%
Final simplification81.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)))
(if (<= x_m 1.4e-9)
(/ 1.0 (* t_0 t_0))
(/ (cos (+ x_m x_m)) (* (* (* (* (* s_m c_m) s_m) x_m) c_m) x_m)))))s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 1.4e-9) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = cos((x_m + x_m)) / (((((s_m * c_m) * s_m) * x_m) * c_m) * x_m);
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (s_m * x_m) * c_m
if (x_m <= 1.4d-9) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = cos((x_m + x_m)) / (((((s_m * c_m) * s_m) * x_m) * c_m) * x_m)
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (s_m * x_m) * c_m;
double tmp;
if (x_m <= 1.4e-9) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = Math.cos((x_m + x_m)) / (((((s_m * c_m) * s_m) * x_m) * c_m) * x_m);
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (s_m * x_m) * c_m tmp = 0 if x_m <= 1.4e-9: tmp = 1.0 / (t_0 * t_0) else: tmp = math.cos((x_m + x_m)) / (((((s_m * c_m) * s_m) * x_m) * c_m) * x_m) return tmp
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(s_m * x_m) * c_m) tmp = 0.0 if (x_m <= 1.4e-9) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(cos(Float64(x_m + x_m)) / Float64(Float64(Float64(Float64(Float64(s_m * c_m) * s_m) * x_m) * c_m) * x_m)); end return tmp end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = (s_m * x_m) * c_m;
tmp = 0.0;
if (x_m <= 1.4e-9)
tmp = 1.0 / (t_0 * t_0);
else
tmp = cos((x_m + x_m)) / (((((s_m * c_m) * s_m) * x_m) * c_m) * x_m);
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
x_m = N[Abs[x], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 1.4e-9], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Cos[N[(x$95$m + x$95$m), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[(N[(s$95$m * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * x$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 := \left(s\_m \cdot x\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 1.4 \cdot 10^{-9}:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m + x\_m\right)}{\left(\left(\left(\left(s\_m \cdot c\_m\right) \cdot s\_m\right) \cdot x\_m\right) \cdot c\_m\right) \cdot x\_m}\\
\end{array}
\end{array}
if x < 1.39999999999999992e-9Initial program 63.2%
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-*.f6497.2
Applied rewrites97.2%
Taylor expanded in x around 0
Applied rewrites81.0%
Applied rewrites81.3%
if 1.39999999999999992e-9 < x Initial program 80.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.6
Applied rewrites99.6%
lift-*.f64N/A
count-2N/A
lower-+.f6499.6
Applied rewrites99.6%
Applied rewrites89.9%
Final simplification83.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 (if (<= (pow s_m 2.0) 5e+297) (/ 1.0 (* (* (* c_m c_m) x_m) (* (* s_m s_m) x_m))) (/ 1.0 (* (* (* (* x_m x_m) s_m) c_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 (pow(s_m, 2.0) <= 5e+297) {
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
} else {
tmp = 1.0 / ((((x_m * x_m) * s_m) * c_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 ** 2.0d0) <= 5d+297) then
tmp = 1.0d0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m))
else
tmp = 1.0d0 / ((((x_m * x_m) * s_m) * c_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 (Math.pow(s_m, 2.0) <= 5e+297) {
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
} else {
tmp = 1.0 / ((((x_m * x_m) * s_m) * c_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 math.pow(s_m, 2.0) <= 5e+297: tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m)) else: tmp = 1.0 / ((((x_m * x_m) * s_m) * c_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 ^ 2.0) <= 5e+297) tmp = Float64(1.0 / Float64(Float64(Float64(c_m * c_m) * x_m) * Float64(Float64(s_m * s_m) * x_m))); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(x_m * x_m) * s_m) * c_m) * Float64(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 ^ 2.0) <= 5e+297)
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
else
tmp = 1.0 / ((((x_m * x_m) * s_m) * c_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[N[Power[s$95$m, 2.0], $MachinePrecision], 5e+297], N[(1.0 / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(N[(s$95$m * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * N[(s$95$m * c$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}\;{s\_m}^{2} \leq 5 \cdot 10^{+297}:\\
\;\;\;\;\frac{1}{\left(\left(c\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(\left(s\_m \cdot s\_m\right) \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(x\_m \cdot x\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if (pow.f64 s #s(literal 2 binary64)) < 4.9999999999999998e297Initial program 68.2%
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-*.f6463.2
Applied rewrites63.2%
Applied rewrites67.6%
Applied rewrites65.3%
Applied rewrites58.9%
if 4.9999999999999998e297 < (pow.f64 s #s(literal 2 binary64)) Initial program 66.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-*.f6476.6
Applied rewrites76.6%
Applied rewrites81.6%
Applied rewrites78.2%
Applied rewrites84.6%
Final simplification64.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))) (/ (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;
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 * x_m) * s_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 * x_m) * s_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 * x_m) * s_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 * x_m) * s_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 * x_m) * s_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 * x$95$m), $MachinePrecision] * s$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 x\_m\right) \cdot s\_m\\
\frac{\cos \left(x\_m + x\_m\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.8%
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-*.f6497.8
Applied rewrites97.8%
lift-*.f64N/A
count-2N/A
lower-+.f6497.8
Applied rewrites97.8%
Final simplification97.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 (<= s_m 5e+149) (/ 1.0 (* (* (* c_m c_m) x_m) (* (* s_m s_m) x_m))) (/ 1.0 (* (* (* (* x_m x_m) c_m) s_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 <= 5e+149) {
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
} else {
tmp = 1.0 / ((((x_m * x_m) * c_m) * s_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 <= 5d+149) then
tmp = 1.0d0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m))
else
tmp = 1.0d0 / ((((x_m * x_m) * c_m) * s_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 <= 5e+149) {
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
} else {
tmp = 1.0 / ((((x_m * x_m) * c_m) * s_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 <= 5e+149: tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m)) else: tmp = 1.0 / ((((x_m * x_m) * c_m) * s_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 <= 5e+149) tmp = Float64(1.0 / Float64(Float64(Float64(c_m * c_m) * x_m) * Float64(Float64(s_m * s_m) * x_m))); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(x_m * x_m) * c_m) * s_m) * Float64(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 <= 5e+149)
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
else
tmp = 1.0 / ((((x_m * x_m) * c_m) * s_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, 5e+149], N[(1.0 / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(N[(s$95$m * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * N[(s$95$m * c$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}\;s\_m \leq 5 \cdot 10^{+149}:\\
\;\;\;\;\frac{1}{\left(\left(c\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(\left(s\_m \cdot s\_m\right) \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(x\_m \cdot x\_m\right) \cdot c\_m\right) \cdot s\_m\right) \cdot \left(s\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if s < 4.9999999999999999e149Initial program 67.1%
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-*.f6465.0
Applied rewrites65.0%
Applied rewrites69.3%
Applied rewrites66.9%
Applied rewrites59.0%
if 4.9999999999999999e149 < s Initial program 72.8%
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-*.f6476.0
Applied rewrites76.0%
Applied rewrites82.0%
Applied rewrites78.5%
Final simplification61.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 (<= s_m 5e+149) (/ 1.0 (* (* (* c_m c_m) x_m) (* (* s_m s_m) x_m))) (/ 1.0 (* (* (* (* (* x_m x_m) c_m) c_m) s_m) s_m))))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (s_m <= 5e+149) {
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
} else {
tmp = 1.0 / (((((x_m * x_m) * c_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 (s_m <= 5d+149) then
tmp = 1.0d0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m))
else
tmp = 1.0d0 / (((((x_m * x_m) * c_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 (s_m <= 5e+149) {
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
} else {
tmp = 1.0 / (((((x_m * x_m) * c_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 s_m <= 5e+149: tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m)) else: tmp = 1.0 / (((((x_m * x_m) * c_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 (s_m <= 5e+149) tmp = Float64(1.0 / Float64(Float64(Float64(c_m * c_m) * x_m) * Float64(Float64(s_m * s_m) * x_m))); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(Float64(x_m * x_m) * c_m) * 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 (s_m <= 5e+149)
tmp = 1.0 / (((c_m * c_m) * x_m) * ((s_m * s_m) * x_m));
else
tmp = 1.0 / (((((x_m * x_m) * c_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[s$95$m, 5e+149], N[(1.0 / N[(N[(N[(c$95$m * c$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] * N[(N[(s$95$m * s$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * 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}\;s\_m \leq 5 \cdot 10^{+149}:\\
\;\;\;\;\frac{1}{\left(\left(c\_m \cdot c\_m\right) \cdot x\_m\right) \cdot \left(\left(s\_m \cdot s\_m\right) \cdot x\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(\left(x\_m \cdot x\_m\right) \cdot c\_m\right) \cdot c\_m\right) \cdot s\_m\right) \cdot s\_m}\\
\end{array}
\end{array}
if s < 4.9999999999999999e149Initial program 67.1%
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-*.f6465.0
Applied rewrites65.0%
Applied rewrites69.3%
Applied rewrites66.9%
Applied rewrites59.0%
if 4.9999999999999999e149 < s Initial program 72.8%
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-*.f6476.0
Applied rewrites76.0%
Applied rewrites82.0%
Applied rewrites78.5%
Taylor expanded in x around 0
Applied rewrites78.8%
Final simplification61.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))) (/ 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(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 = (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[(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(s\_m \cdot x\_m\right) \cdot c\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.8%
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-*.f6497.8
Applied rewrites97.8%
Taylor expanded in x around 0
Applied rewrites78.0%
Applied rewrites78.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 (/ 1.0 (* (* (* s_m c_m) (* (* s_m x_m) c_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 / (((s_m * c_m) * ((s_m * x_m) * c_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 / (((s_m * c_m) * ((s_m * x_m) * c_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 / (((s_m * c_m) * ((s_m * x_m) * c_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 / (((s_m * c_m) * ((s_m * x_m) * c_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(s_m * c_m) * Float64(Float64(s_m * x_m) * c_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 / (((s_m * c_m) * ((s_m * x_m) * c_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[(s$95$m * c$95$m), $MachinePrecision] * N[(N[(s$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision] * x$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{1}{\left(\left(s\_m \cdot c\_m\right) \cdot \left(\left(s\_m \cdot x\_m\right) \cdot c\_m\right)\right) \cdot x\_m}
\end{array}
Initial program 67.8%
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-*.f6497.8
Applied rewrites97.8%
Taylor expanded in x around 0
Applied rewrites78.0%
Applied rewrites74.7%
Final simplification74.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 (* (* (* (* (* x_m x_m) c_m) c_m) s_m) s_m)))
s_m = fabs(s);
c_m = fabs(c);
x_m = fabs(x);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (((((x_m * x_m) * c_m) * c_m) * s_m) * s_m);
}
s_m = abs(s)
c_m = abs(c)
x_m = abs(x)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (((((x_m * x_m) * c_m) * c_m) * s_m) * s_m)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
x_m = Math.abs(x);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (((((x_m * x_m) * c_m) * c_m) * s_m) * s_m);
}
s_m = math.fabs(s) c_m = math.fabs(c) x_m = math.fabs(x) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (((((x_m * x_m) * c_m) * c_m) * s_m) * s_m)
s_m = abs(s) c_m = abs(c) x_m = abs(x) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(Float64(Float64(Float64(x_m * x_m) * c_m) * c_m) * s_m) * s_m)) end
s_m = abs(s);
c_m = abs(c);
x_m = abs(x);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (((((x_m * x_m) * c_m) * c_m) * s_m) * s_m);
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] x_m = N[Abs[x], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * 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])\\
\\
\frac{1}{\left(\left(\left(\left(x\_m \cdot x\_m\right) \cdot c\_m\right) \cdot c\_m\right) \cdot s\_m\right) \cdot s\_m}
\end{array}
Initial program 67.8%
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-*.f6466.3
Applied rewrites66.3%
Applied rewrites70.9%
Applied rewrites68.3%
Taylor expanded in x around 0
Applied rewrites66.1%
herbie shell --seed 2024276
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))