
(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}
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s)
:precision binary64
(let* ((t_0 (cos (* x_m 2.0))) (t_1 (* c_m (* x_m s))))
(if (<= x_m 1.7e-38)
(/ (/ 1.0 t_1) t_1)
(if (<= x_m 1.1e+231)
(/ t_0 (* s (* (* x_m (* x_m c_m)) (* s c_m))))
(/ (/ t_0 (* c_m (* x_m c_m))) (* s (* x_m s)))))))x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = cos((x_m * 2.0));
double t_1 = c_m * (x_m * s);
double tmp;
if (x_m <= 1.7e-38) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.1e+231) {
tmp = t_0 / (s * ((x_m * (x_m * c_m)) * (s * c_m)));
} else {
tmp = (t_0 / (c_m * (x_m * c_m))) / (s * (x_m * s));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
t_1 = c_m * (x_m * s)
if (x_m <= 1.7d-38) then
tmp = (1.0d0 / t_1) / t_1
else if (x_m <= 1.1d+231) then
tmp = t_0 / (s * ((x_m * (x_m * c_m)) * (s * c_m)))
else
tmp = (t_0 / (c_m * (x_m * c_m))) / (s * (x_m * s))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = Math.cos((x_m * 2.0));
double t_1 = c_m * (x_m * s);
double tmp;
if (x_m <= 1.7e-38) {
tmp = (1.0 / t_1) / t_1;
} else if (x_m <= 1.1e+231) {
tmp = t_0 / (s * ((x_m * (x_m * c_m)) * (s * c_m)));
} else {
tmp = (t_0 / (c_m * (x_m * c_m))) / (s * (x_m * s));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = math.cos((x_m * 2.0)) t_1 = c_m * (x_m * s) tmp = 0 if x_m <= 1.7e-38: tmp = (1.0 / t_1) / t_1 elif x_m <= 1.1e+231: tmp = t_0 / (s * ((x_m * (x_m * c_m)) * (s * c_m))) else: tmp = (t_0 / (c_m * (x_m * c_m))) / (s * (x_m * s)) return tmp
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = cos(Float64(x_m * 2.0)) t_1 = Float64(c_m * Float64(x_m * s)) tmp = 0.0 if (x_m <= 1.7e-38) tmp = Float64(Float64(1.0 / t_1) / t_1); elseif (x_m <= 1.1e+231) tmp = Float64(t_0 / Float64(s * Float64(Float64(x_m * Float64(x_m * c_m)) * Float64(s * c_m)))); else tmp = Float64(Float64(t_0 / Float64(c_m * Float64(x_m * c_m))) / Float64(s * Float64(x_m * s))); end return tmp end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp_2 = code(x_m, c_m, s)
t_0 = cos((x_m * 2.0));
t_1 = c_m * (x_m * s);
tmp = 0.0;
if (x_m <= 1.7e-38)
tmp = (1.0 / t_1) / t_1;
elseif (x_m <= 1.1e+231)
tmp = t_0 / (s * ((x_m * (x_m * c_m)) * (s * c_m)));
else
tmp = (t_0 / (c_m * (x_m * c_m))) / (s * (x_m * s));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.7e-38], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[x$95$m, 1.1e+231], N[(t$95$0 / N[(s * N[(N[(x$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(s * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / N[(c$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(s * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\right)\\
\mathbf{if}\;x\_m \leq 1.7 \cdot 10^{-38}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\mathbf{elif}\;x\_m \leq 1.1 \cdot 10^{+231}:\\
\;\;\;\;\frac{t\_0}{s \cdot \left(\left(x\_m \cdot \left(x\_m \cdot c\_m\right)\right) \cdot \left(s \cdot c\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{c\_m \cdot \left(x\_m \cdot c\_m\right)}}{s \cdot \left(x\_m \cdot s\right)}\\
\end{array}
\end{array}
if x < 1.7000000000000001e-38Initial program 68.7%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.7%
Simplified73.7%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.8%
Applied egg-rr85.8%
if 1.7000000000000001e-38 < x < 1.09999999999999996e231Initial program 65.1%
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6482.1%
Applied egg-rr82.1%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6486.9%
Applied egg-rr86.9%
if 1.09999999999999996e231 < x Initial program 52.1%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6488.5%
Applied egg-rr88.5%
*-rgt-identityN/A
associate-*l*N/A
unpow-prod-downN/A
pow2N/A
times-fracN/A
pow2N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
associate-*l*N/A
associate-*l*N/A
*-rgt-identityN/A
*-commutativeN/A
*-commutativeN/A
Applied egg-rr94.9%
Final simplification86.7%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x_m s))))
(if (<= x_m 1e-5)
(/ (/ 1.0 t_0) t_0)
(/ (cos (* x_m 2.0)) (* s (* s (* c_m (* x_m (* x_m c_m)))))))))x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
double tmp;
if (x_m <= 1e-5) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x_m * 2.0)) / (s * (s * (c_m * (x_m * (x_m * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s)
if (x_m <= 1d-5) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x_m * 2.0d0)) / (s * (s * (c_m * (x_m * (x_m * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
double tmp;
if (x_m <= 1e-5) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x_m * 2.0)) / (s * (s * (c_m * (x_m * (x_m * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = c_m * (x_m * s) tmp = 0 if x_m <= 1e-5: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x_m * 2.0)) / (s * (s * (c_m * (x_m * (x_m * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = Float64(c_m * Float64(x_m * s)) tmp = 0.0 if (x_m <= 1e-5) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(s * Float64(s * Float64(c_m * Float64(x_m * Float64(x_m * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp_2 = code(x_m, c_m, s)
t_0 = c_m * (x_m * s);
tmp = 0.0;
if (x_m <= 1e-5)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x_m * 2.0)) / (s * (s * (c_m * (x_m * (x_m * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1e-5], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s * N[(s * N[(c$95$m * N[(x$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\right)\\
\mathbf{if}\;x\_m \leq 10^{-5}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{s \cdot \left(s \cdot \left(c\_m \cdot \left(x\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 1.00000000000000008e-5Initial program 67.6%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6474.5%
Simplified74.5%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6486.4%
Applied egg-rr86.4%
if 1.00000000000000008e-5 < x Initial program 64.1%
*-commutativeN/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6480.1%
Applied egg-rr80.1%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6482.3%
Applied egg-rr82.3%
Final simplification85.3%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x_m s))))
(if (<= x_m 1.55e-38)
(/ (/ 1.0 t_0) t_0)
(/ (cos (* x_m 2.0)) (* (* x_m c_m) (* (* x_m s) (* s c_m)))))))x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
double tmp;
if (x_m <= 1.55e-38) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x_m * 2.0)) / ((x_m * c_m) * ((x_m * s) * (s * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s)
if (x_m <= 1.55d-38) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x_m * 2.0d0)) / ((x_m * c_m) * ((x_m * s) * (s * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
double tmp;
if (x_m <= 1.55e-38) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x_m * 2.0)) / ((x_m * c_m) * ((x_m * s) * (s * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = c_m * (x_m * s) tmp = 0 if x_m <= 1.55e-38: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x_m * 2.0)) / ((x_m * c_m) * ((x_m * s) * (s * c_m))) return tmp
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = Float64(c_m * Float64(x_m * s)) tmp = 0.0 if (x_m <= 1.55e-38) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(Float64(x_m * c_m) * Float64(Float64(x_m * s) * Float64(s * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp_2 = code(x_m, c_m, s)
t_0 = c_m * (x_m * s);
tmp = 0.0;
if (x_m <= 1.55e-38)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x_m * 2.0)) / ((x_m * c_m) * ((x_m * s) * (s * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.55e-38], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(N[(x$95$m * s), $MachinePrecision] * N[(s * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\right)\\
\mathbf{if}\;x\_m \leq 1.55 \cdot 10^{-38}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(\left(x\_m \cdot s\right) \cdot \left(s \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.54999999999999991e-38Initial program 68.7%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.7%
Simplified73.7%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.8%
Applied egg-rr85.8%
if 1.54999999999999991e-38 < x Initial program 62.0%
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.2%
Applied egg-rr94.2%
Final simplification88.4%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s)
:precision binary64
(let* ((t_0 (* c_m (* x_m s))))
(if (<= x_m 2.2e-35)
(/ (/ 1.0 t_0) t_0)
(/ (cos (* x_m 2.0)) (* x_m (* x_m (* s (* c_m (* s c_m)))))))))x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
double tmp;
if (x_m <= 2.2e-35) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = cos((x_m * 2.0)) / (x_m * (x_m * (s * (c_m * (s * c_m)))));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s)
if (x_m <= 2.2d-35) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = cos((x_m * 2.0d0)) / (x_m * (x_m * (s * (c_m * (s * c_m)))))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
double tmp;
if (x_m <= 2.2e-35) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = Math.cos((x_m * 2.0)) / (x_m * (x_m * (s * (c_m * (s * c_m)))));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = c_m * (x_m * s) tmp = 0 if x_m <= 2.2e-35: tmp = (1.0 / t_0) / t_0 else: tmp = math.cos((x_m * 2.0)) / (x_m * (x_m * (s * (c_m * (s * c_m))))) return tmp
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = Float64(c_m * Float64(x_m * s)) tmp = 0.0 if (x_m <= 2.2e-35) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * Float64(x_m * Float64(s * Float64(c_m * Float64(s * c_m)))))); end return tmp end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp_2 = code(x_m, c_m, s)
t_0 = c_m * (x_m * s);
tmp = 0.0;
if (x_m <= 2.2e-35)
tmp = (1.0 / t_0) / t_0;
else
tmp = cos((x_m * 2.0)) / (x_m * (x_m * (s * (c_m * (s * c_m)))));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.2e-35], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * N[(x$95$m * N[(s * N[(c$95$m * N[(s * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\right)\\
\mathbf{if}\;x\_m \leq 2.2 \cdot 10^{-35}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot \left(x\_m \cdot \left(s \cdot \left(c\_m \cdot \left(s \cdot c\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.19999999999999994e-35Initial program 68.3%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.9%
Simplified73.9%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.9%
Applied egg-rr85.9%
if 2.19999999999999994e-35 < x Initial program 62.8%
Taylor expanded in x around inf
/-lowering-/.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6488.5%
Simplified88.5%
Final simplification86.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x_m c_m s) :precision binary64 (let* ((t_0 (* s (* x_m c_m)))) (/ (/ (cos (* x_m 2.0)) t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = s * (x_m * c_m);
return (cos((x_m * 2.0)) / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
t_0 = s * (x_m * c_m)
code = (cos((x_m * 2.0d0)) / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = s * (x_m * c_m);
return (Math.cos((x_m * 2.0)) / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = s * (x_m * c_m) return (math.cos((x_m * 2.0)) / t_0) / t_0
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = Float64(s * Float64(x_m * c_m)) return Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp = code(x_m, c_m, s)
t_0 = s * (x_m * c_m);
tmp = (cos((x_m * 2.0)) / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[(s * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := s \cdot \left(x\_m \cdot c\_m\right)\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.6%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.7%
Applied egg-rr97.7%
*-rgt-identityN/A
unpow2N/A
associate-*l*N/A
times-fracN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-rgt-identityN/A
associate-*l*N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr94.1%
Applied egg-rr98.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x_m c_m s) :precision binary64 (let* ((t_0 (* c_m (* x_m s)))) (/ (/ 1.0 t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
return (1.0 / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
t_0 = c_m * (x_m * s)
code = (1.0d0 / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
return (1.0 / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = c_m * (x_m * s) return (1.0 / t_0) / t_0
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = Float64(c_m * Float64(x_m * s)) return Float64(Float64(1.0 / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp = code(x_m, c_m, s)
t_0 = c_m * (x_m * s);
tmp = (1.0 / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\right)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6472.9%
Simplified72.9%
associate-/l/N/A
associate-/l/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.7%
Applied egg-rr81.7%
Final simplification81.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x_m c_m s) :precision binary64 (let* ((t_0 (* c_m (* x_m s)))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
real(8) :: t_0
t_0 = c_m * (x_m * s)
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
double t_0 = c_m * (x_m * s);
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): t_0 = c_m * (x_m * s) return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) t_0 = Float64(c_m * Float64(x_m * s)) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp = code(x_m, c_m, s)
t_0 = c_m * (x_m * s);
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6472.9%
Simplified72.9%
associate-/l/N/A
pow2N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr73.5%
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
unswap-sqrN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6481.6%
Applied egg-rr81.6%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x_m c_m s) :precision binary64 (/ 1.0 (* c_m (* s (* x_m (* s (* x_m c_m)))))))
x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
return 1.0 / (c_m * (s * (x_m * (s * (x_m * c_m)))));
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = 1.0d0 / (c_m * (s * (x_m * (s * (x_m * c_m)))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
return 1.0 / (c_m * (s * (x_m * (s * (x_m * c_m)))));
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): return 1.0 / (c_m * (s * (x_m * (s * (x_m * c_m)))))
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) return Float64(1.0 / Float64(c_m * Float64(s * Float64(x_m * Float64(s * Float64(x_m * c_m)))))) end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp = code(x_m, c_m, s)
tmp = 1.0 / (c_m * (s * (x_m * (s * (x_m * c_m)))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s_] := N[(1.0 / N[(c$95$m * N[(s * N[(x$95$m * N[(s * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\frac{1}{c\_m \cdot \left(s \cdot \left(x\_m \cdot \left(s \cdot \left(x\_m \cdot c\_m\right)\right)\right)\right)}
\end{array}
Initial program 66.6%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
pow-lowering-pow.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.7%
Applied egg-rr97.7%
Taylor expanded in x around 0
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6477.9%
Simplified77.9%
Final simplification77.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x_m c_m s) :precision binary64 (/ 1.0 (* c_m (* c_m (* x_m (* s (* x_m s)))))))
x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
return 1.0 / (c_m * (c_m * (x_m * (s * (x_m * s)))));
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = 1.0d0 / (c_m * (c_m * (x_m * (s * (x_m * s)))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
return 1.0 / (c_m * (c_m * (x_m * (s * (x_m * s)))));
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): return 1.0 / (c_m * (c_m * (x_m * (s * (x_m * s)))))
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) return Float64(1.0 / Float64(c_m * Float64(c_m * Float64(x_m * Float64(s * Float64(x_m * s)))))) end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp = code(x_m, c_m, s)
tmp = 1.0 / (c_m * (c_m * (x_m * (s * (x_m * s)))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s_] := N[(1.0 / N[(c$95$m * N[(c$95$m * N[(x$95$m * N[(s * N[(x$95$m * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\frac{1}{c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot \left(s \cdot \left(x\_m \cdot s\right)\right)\right)\right)}
\end{array}
Initial program 66.6%
Taylor expanded in x around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
associate-/r*N/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6472.9%
Simplified72.9%
associate-/l/N/A
pow2N/A
associate-/r*N/A
associate-*r*N/A
*-commutativeN/A
pow2N/A
pow-prod-downN/A
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr73.5%
Final simplification73.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. (FPCore (x_m c_m s) :precision binary64 (/ -2.0 (* c_m (* c_m (* s s)))))
x_m = fabs(x);
c_m = fabs(c);
assert(x_m < c_m && c_m < s);
double code(double x_m, double c_m, double s) {
return -2.0 / (c_m * (c_m * (s * s)));
}
x_m = abs(x)
c_m = abs(c)
NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s
code = (-2.0d0) / (c_m * (c_m * (s * s)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
assert x_m < c_m && c_m < s;
public static double code(double x_m, double c_m, double s) {
return -2.0 / (c_m * (c_m * (s * s)));
}
x_m = math.fabs(x) c_m = math.fabs(c) [x_m, c_m, s] = sort([x_m, c_m, s]) def code(x_m, c_m, s): return -2.0 / (c_m * (c_m * (s * s)))
x_m = abs(x) c_m = abs(c) x_m, c_m, s = sort([x_m, c_m, s]) function code(x_m, c_m, s) return Float64(-2.0 / Float64(c_m * Float64(c_m * Float64(s * s)))) end
x_m = abs(x);
c_m = abs(c);
x_m, c_m, s = num2cell(sort([x_m, c_m, s])){:}
function tmp = code(x_m, c_m, s)
tmp = -2.0 / (c_m * (c_m * (s * s)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] NOTE: x_m, c_m, and s should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s_] := N[(-2.0 / N[(c$95$m * N[(c$95$m * N[(s * s), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
[x_m, c_m, s] = \mathsf{sort}([x_m, c_m, s])\\
\\
\frac{-2}{c\_m \cdot \left(c\_m \cdot \left(s \cdot s\right)\right)}
\end{array}
Initial program 66.6%
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6493.3%
Applied egg-rr93.3%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6458.7%
Simplified58.7%
Taylor expanded in x around inf
/-lowering-/.f64N/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6427.4%
Simplified27.4%
herbie shell --seed 2024185
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))