
(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 12 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)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (* x_m 2.0))))
(if (<= x_m 5e+26)
(* (/ (/ 1.0 c_m) (* x_m s_m)) (/ t_0 (* c_m (* x_m s_m))))
(/ (/ t_0 s_m) (* (* x_m c_m) (* s_m (* x_m c_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0));
double tmp;
if (x_m <= 5e+26) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * (t_0 / (c_m * (x_m * s_m)));
} else {
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 5d+26) then
tmp = ((1.0d0 / c_m) / (x_m * s_m)) * (t_0 / (c_m * (x_m * s_m)))
else
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 5e+26) {
tmp = ((1.0 / c_m) / (x_m * s_m)) * (t_0 / (c_m * (x_m * s_m)));
} else {
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 5e+26: tmp = ((1.0 / c_m) / (x_m * s_m)) * (t_0 / (c_m * (x_m * s_m))) else: tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 5e+26) tmp = Float64(Float64(Float64(1.0 / c_m) / Float64(x_m * s_m)) * Float64(t_0 / Float64(c_m * Float64(x_m * s_m)))); else tmp = Float64(Float64(t_0 / s_m) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 5e+26)
tmp = ((1.0 / c_m) / (x_m * s_m)) * (t_0 / (c_m * (x_m * s_m)));
else
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 5e+26], N[(N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 5 \cdot 10^{+26}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{x\_m \cdot s\_m} \cdot \frac{t\_0}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 5.0000000000000001e26Initial program 64.0%
associate-/r*64.0%
*-commutative64.0%
unpow264.0%
sqr-neg64.0%
unpow264.0%
cos-neg64.0%
*-commutative64.0%
distribute-rgt-neg-in64.0%
metadata-eval64.0%
unpow264.0%
sqr-neg64.0%
unpow264.0%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Applied egg-rr96.8%
Taylor expanded in c around 0 96.8%
associate-/r*96.9%
Simplified96.9%
if 5.0000000000000001e26 < x Initial program 66.2%
associate-/r*64.5%
*-commutative64.5%
unpow264.5%
sqr-neg64.5%
unpow264.5%
cos-neg64.5%
*-commutative64.5%
distribute-rgt-neg-in64.5%
metadata-eval64.5%
unpow264.5%
sqr-neg64.5%
unpow264.5%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Applied egg-rr96.5%
Taylor expanded in c around 0 96.5%
associate-/r*96.5%
Simplified96.5%
*-un-lft-identity96.5%
associate-*r*93.2%
times-frac93.0%
*-commutative93.0%
Applied egg-rr93.0%
associate-*l/93.1%
*-lft-identity93.1%
Simplified93.1%
*-commutative93.1%
associate-/r*93.2%
frac-times86.8%
*-un-lft-identity86.8%
associate-*r*90.0%
Applied egg-rr90.0%
Final simplification95.4%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (* x_m 2.0))) (t_1 (* c_m (* x_m s_m))))
(if (<= x_m 3.7e+26)
(* (/ t_0 t_1) (/ 1.0 t_1))
(/ (/ t_0 s_m) (* (* x_m c_m) (* s_m (* x_m c_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 3.7e+26) {
tmp = (t_0 / t_1) * (1.0 / t_1);
} else {
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
t_1 = c_m * (x_m * s_m)
if (x_m <= 3.7d+26) then
tmp = (t_0 / t_1) * (1.0d0 / t_1)
else
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0));
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 3.7e+26) {
tmp = (t_0 / t_1) * (1.0 / t_1);
} else {
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 3.7e+26: tmp = (t_0 / t_1) * (1.0 / t_1) else: tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m * 2.0)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 3.7e+26) tmp = Float64(Float64(t_0 / t_1) * Float64(1.0 / t_1)); else tmp = Float64(Float64(t_0 / s_m) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 3.7e+26)
tmp = (t_0 / t_1) * (1.0 / t_1);
else
tmp = (t_0 / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 3.7e+26], N[(N[(t$95$0 / t$95$1), $MachinePrecision] * N[(1.0 / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 3.7 \cdot 10^{+26}:\\
\;\;\;\;\frac{t\_0}{t\_1} \cdot \frac{1}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{s\_m}}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 3.69999999999999988e26Initial program 64.0%
associate-/r*64.0%
*-commutative64.0%
unpow264.0%
sqr-neg64.0%
unpow264.0%
cos-neg64.0%
*-commutative64.0%
distribute-rgt-neg-in64.0%
metadata-eval64.0%
unpow264.0%
sqr-neg64.0%
unpow264.0%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Applied egg-rr96.8%
if 3.69999999999999988e26 < x Initial program 66.2%
associate-/r*64.5%
*-commutative64.5%
unpow264.5%
sqr-neg64.5%
unpow264.5%
cos-neg64.5%
*-commutative64.5%
distribute-rgt-neg-in64.5%
metadata-eval64.5%
unpow264.5%
sqr-neg64.5%
unpow264.5%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Applied egg-rr96.5%
Taylor expanded in c around 0 96.5%
associate-/r*96.5%
Simplified96.5%
*-un-lft-identity96.5%
associate-*r*93.2%
times-frac93.0%
*-commutative93.0%
Applied egg-rr93.0%
associate-*l/93.1%
*-lft-identity93.1%
Simplified93.1%
*-commutative93.1%
associate-/r*93.2%
frac-times86.8%
*-un-lft-identity86.8%
associate-*r*90.0%
Applied egg-rr90.0%
Final simplification95.3%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 2e-12) (* (/ 1.0 (* c_m (* x_m s_m))) (* (/ 1.0 c_m) (/ 1.0 (* x_m s_m)))) (/ (/ (cos (* x_m 2.0)) s_m) (* (* x_m c_m) (* s_m (* x_m c_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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 <= 2e-12) {
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
} else {
tmp = (cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 <= 2d-12) then
tmp = (1.0d0 / (c_m * (x_m * s_m))) * ((1.0d0 / c_m) * (1.0d0 / (x_m * s_m)))
else
tmp = (cos((x_m * 2.0d0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 <= 2e-12) {
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
} else {
tmp = (Math.cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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 <= 2e-12: tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m))) else: tmp = (math.cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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 <= 2e-12) tmp = Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) * Float64(Float64(1.0 / c_m) * Float64(1.0 / Float64(x_m * s_m)))); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / s_m) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 <= 2e-12)
tmp = (1.0 / (c_m * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
else
tmp = (cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $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, 2e-12], N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 2 \cdot 10^{-12}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \left(\frac{1}{c\_m} \cdot \frac{1}{x\_m \cdot s\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m}}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 1.99999999999999996e-12Initial program 63.5%
associate-/r*63.6%
*-commutative63.6%
unpow263.6%
sqr-neg63.6%
unpow263.6%
cos-neg63.6%
*-commutative63.6%
distribute-rgt-neg-in63.6%
metadata-eval63.6%
unpow263.6%
sqr-neg63.6%
unpow263.6%
associate-*r*58.7%
unpow258.7%
*-commutative58.7%
Simplified58.7%
Applied egg-rr96.7%
Taylor expanded in x around 0 80.7%
inv-pow80.7%
*-commutative80.7%
unpow-prod-down80.8%
unpow-180.8%
inv-pow80.8%
Applied egg-rr80.8%
if 1.99999999999999996e-12 < x Initial program 67.3%
associate-/r*65.7%
*-commutative65.7%
unpow265.7%
sqr-neg65.7%
unpow265.7%
cos-neg65.7%
*-commutative65.7%
distribute-rgt-neg-in65.7%
metadata-eval65.7%
unpow265.7%
sqr-neg65.7%
unpow265.7%
associate-*r*60.9%
unpow260.9%
*-commutative60.9%
Simplified60.9%
Applied egg-rr96.7%
Taylor expanded in c around 0 96.7%
associate-/r*96.7%
Simplified96.7%
*-un-lft-identity96.7%
associate-*r*93.8%
times-frac93.5%
*-commutative93.5%
Applied egg-rr93.5%
associate-*l/93.6%
*-lft-identity93.6%
Simplified93.6%
*-commutative93.6%
associate-/r*93.7%
frac-times86.3%
*-un-lft-identity86.3%
associate-*r*89.2%
Applied egg-rr89.2%
Final simplification82.8%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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 (* x_m (* c_m s_m))))
(if (<= c_m 3.5e-44)
(/ (/ 1.0 t_0) t_0)
(/ (/ 1.0 c_m) (* (* x_m s_m) (* s_m (* x_m c_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (c_m * s_m);
double tmp;
if (c_m <= 3.5e-44) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 = x_m * (c_m * s_m)
if (c_m <= 3.5d-44) then
tmp = (1.0d0 / t_0) / t_0
else
tmp = (1.0d0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 = x_m * (c_m * s_m);
double tmp;
if (c_m <= 3.5e-44) {
tmp = (1.0 / t_0) / t_0;
} else {
tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (c_m * s_m) tmp = 0 if c_m <= 3.5e-44: tmp = (1.0 / t_0) / t_0 else: tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(c_m * s_m)) tmp = 0.0 if (c_m <= 3.5e-44) tmp = Float64(Float64(1.0 / t_0) / t_0); else tmp = Float64(Float64(1.0 / c_m) / Float64(Float64(x_m * s_m) * Float64(s_m * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 = x_m * (c_m * s_m);
tmp = 0.0;
if (c_m <= 3.5e-44)
tmp = (1.0 / t_0) / t_0;
else
tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 3.5e-44], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;c\_m \leq 3.5 \cdot 10^{-44}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if c < 3.4999999999999998e-44Initial program 67.7%
associate-/r*67.2%
*-commutative67.2%
unpow267.2%
sqr-neg67.2%
unpow267.2%
cos-neg67.2%
*-commutative67.2%
distribute-rgt-neg-in67.2%
metadata-eval67.2%
unpow267.2%
sqr-neg67.2%
unpow267.2%
associate-*r*62.7%
unpow262.7%
*-commutative62.7%
Simplified62.7%
Applied egg-rr97.0%
unpow-197.0%
clear-num97.0%
unpow297.0%
associate-/r*97.1%
div-inv97.1%
div-inv97.1%
*-commutative97.1%
*-commutative97.1%
associate-*r*94.7%
*-commutative94.7%
associate-*r*97.2%
Applied egg-rr97.2%
Taylor expanded in x around 0 75.7%
if 3.4999999999999998e-44 < c Initial program 56.3%
associate-/r*56.3%
*-commutative56.3%
unpow256.3%
sqr-neg56.3%
unpow256.3%
cos-neg56.3%
*-commutative56.3%
distribute-rgt-neg-in56.3%
metadata-eval56.3%
unpow256.3%
sqr-neg56.3%
unpow256.3%
associate-*r*50.4%
unpow250.4%
*-commutative50.4%
Simplified50.4%
Applied egg-rr95.7%
Taylor expanded in x around 0 80.2%
associate-/r*80.2%
*-commutative80.2%
frac-times76.4%
*-un-lft-identity76.4%
associate-*r*75.8%
Applied egg-rr75.8%
Final simplification75.7%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
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 (* x_m (* c_m s_m))))
(if (<= c_m 0.085)
(/ 1.0 (* t_0 t_0))
(/ (/ 1.0 c_m) (* (* x_m s_m) (* s_m (* x_m c_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (c_m * s_m);
double tmp;
if (c_m <= 0.085) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 = x_m * (c_m * s_m)
if (c_m <= 0.085d0) then
tmp = 1.0d0 / (t_0 * t_0)
else
tmp = (1.0d0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 = x_m * (c_m * s_m);
double tmp;
if (c_m <= 0.085) {
tmp = 1.0 / (t_0 * t_0);
} else {
tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (c_m * s_m) tmp = 0 if c_m <= 0.085: tmp = 1.0 / (t_0 * t_0) else: tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(c_m * s_m)) tmp = 0.0 if (c_m <= 0.085) tmp = Float64(1.0 / Float64(t_0 * t_0)); else tmp = Float64(Float64(1.0 / c_m) / Float64(Float64(x_m * s_m) * Float64(s_m * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 = x_m * (c_m * s_m);
tmp = 0.0;
if (c_m <= 0.085)
tmp = 1.0 / (t_0 * t_0);
else
tmp = (1.0 / c_m) / ((x_m * s_m) * (s_m * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 0.085], N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;c\_m \leq 0.085:\\
\;\;\;\;\frac{1}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if c < 0.0850000000000000061Initial program 69.0%
associate-/r*68.5%
*-commutative68.5%
unpow268.5%
sqr-neg68.5%
unpow268.5%
cos-neg68.5%
*-commutative68.5%
distribute-rgt-neg-in68.5%
metadata-eval68.5%
unpow268.5%
sqr-neg68.5%
unpow268.5%
associate-*r*63.7%
unpow263.7%
*-commutative63.7%
Simplified63.7%
Taylor expanded in x around 0 54.8%
associate-/r*54.3%
*-commutative54.3%
unpow254.3%
unpow254.3%
swap-sqr64.8%
unpow264.8%
associate-/r*65.3%
unpow265.3%
unpow265.3%
swap-sqr76.1%
unpow276.1%
Simplified76.1%
unpow276.1%
*-commutative76.1%
associate-*r*75.2%
*-commutative75.2%
associate-*r*76.2%
Applied egg-rr76.2%
if 0.0850000000000000061 < c Initial program 50.8%
associate-/r*50.9%
*-commutative50.9%
unpow250.9%
sqr-neg50.9%
unpow250.9%
cos-neg50.9%
*-commutative50.9%
distribute-rgt-neg-in50.9%
metadata-eval50.9%
unpow250.9%
sqr-neg50.9%
unpow250.9%
associate-*r*45.8%
unpow245.8%
*-commutative45.8%
Simplified45.8%
Applied egg-rr95.2%
Taylor expanded in x around 0 78.9%
associate-/r*78.9%
*-commutative78.9%
frac-times74.7%
*-un-lft-identity74.7%
associate-*r*74.0%
Applied egg-rr74.0%
Final simplification75.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 (* x_m s_m))) (* (/ 1.0 c_m) (/ 1.0 (* x_m s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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 * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * (x_m * s_m))) * ((1.0d0 / c_m) * (1.0d0 / (x_m * s_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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 * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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(x_m * s_m))) * Float64(Float64(1.0 / c_m) * Float64(1.0 / Float64(x_m * s_m)))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 * (x_m * s_m))) * ((1.0 / c_m) * (1.0 / (x_m * s_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $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[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)} \cdot \left(\frac{1}{c\_m} \cdot \frac{1}{x\_m \cdot s\_m}\right)
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Applied egg-rr96.7%
Taylor expanded in x around 0 76.8%
inv-pow76.8%
*-commutative76.8%
unpow-prod-down76.9%
unpow-176.9%
inv-pow76.9%
Applied egg-rr76.9%
Final simplification76.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 = 1.0d0 / (c_m * (x_m * s_m))
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) return Float64(t_0 * t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 = 1.0 / (c_m * (x_m * s_m));
tmp = t_0 * t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Applied egg-rr96.7%
Taylor expanded in x around 0 76.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (* c_m (* x_m s_m)))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x_m * s_m)
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(c$95$m * N[(x$95$m * s$95$m), $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|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in x around 0 51.8%
associate-/r*51.4%
*-commutative51.4%
unpow251.4%
unpow251.4%
swap-sqr63.0%
unpow263.0%
associate-/r*63.4%
unpow263.4%
unpow263.4%
swap-sqr76.8%
unpow276.8%
Simplified76.8%
Taylor expanded in c around 0 51.8%
associate-*r*51.8%
unpow251.8%
unpow251.8%
swap-sqr66.1%
unpow266.1%
swap-sqr76.9%
associate-/l/76.9%
*-rgt-identity76.9%
associate-*r/76.9%
unpow-176.9%
unpow-176.9%
pow-sqr77.0%
metadata-eval77.0%
associate-*r*76.9%
Simplified76.9%
associate-*r*77.0%
metadata-eval77.0%
pow-sqr76.9%
inv-pow76.9%
inv-pow76.9%
frac-2neg76.9%
metadata-eval76.9%
frac-2neg76.9%
metadata-eval76.9%
frac-times76.9%
metadata-eval76.9%
associate-*r*75.0%
distribute-rgt-neg-in75.0%
*-commutative75.0%
distribute-rgt-neg-in75.0%
associate-*r*76.8%
distribute-rgt-neg-in76.8%
*-commutative76.8%
distribute-rgt-neg-in76.8%
Applied egg-rr76.8%
Final simplification76.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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) (* (* x_m s_m) (* c_m (* x_m s_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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) / ((x_m * s_m) * (c_m * (x_m * s_m)));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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) / ((x_m * s_m) * (c_m * (x_m * s_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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) / ((x_m * s_m) * (c_m * (x_m * s_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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) / ((x_m * s_m) * (c_m * (x_m * s_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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 / c_m) / Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m)))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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) / ((x_m * s_m) * (c_m * (x_m * s_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $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 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in x around 0 51.8%
associate-/r*51.4%
*-commutative51.4%
unpow251.4%
unpow251.4%
swap-sqr63.0%
unpow263.0%
associate-/r*63.4%
unpow263.4%
unpow263.4%
swap-sqr76.8%
unpow276.8%
Simplified76.8%
Taylor expanded in c around 0 51.8%
associate-*r*51.8%
unpow251.8%
unpow251.8%
swap-sqr66.1%
unpow266.1%
swap-sqr76.9%
associate-/l/76.9%
*-rgt-identity76.9%
associate-*r/76.9%
unpow-176.9%
unpow-176.9%
pow-sqr77.0%
metadata-eval77.0%
associate-*r*76.9%
Simplified76.9%
associate-*r*77.0%
metadata-eval77.0%
pow-sqr76.9%
inv-pow76.9%
inv-pow76.9%
frac-2neg76.9%
metadata-eval76.9%
associate-*r*75.0%
associate-/r*75.1%
frac-times72.0%
neg-mul-172.0%
distribute-neg-frac72.0%
metadata-eval72.0%
associate-*r*73.8%
distribute-rgt-neg-in73.8%
*-commutative73.8%
distribute-rgt-neg-in73.8%
*-commutative73.8%
Applied egg-rr73.8%
Final simplification73.8%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 (* x_m (* c_m s_m)))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = x_m * (c_m * s_m);
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 = x_m * (c_m * s_m)
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 = x_m * (c_m * s_m);
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = x_m * (c_m * s_m) return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(x_m * Float64(c_m * s_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 = x_m * (c_m * s_m);
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $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[(x$95$m * N[(c$95$m * s$95$m), $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|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x\_m \cdot \left(c\_m \cdot s\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in x around 0 51.8%
associate-/r*51.4%
*-commutative51.4%
unpow251.4%
unpow251.4%
swap-sqr63.0%
unpow263.0%
associate-/r*63.4%
unpow263.4%
unpow263.4%
swap-sqr76.8%
unpow276.8%
Simplified76.8%
unpow276.8%
*-commutative76.8%
associate-*r*75.0%
*-commutative75.0%
associate-*r*76.9%
Applied egg-rr76.9%
Final simplification76.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 c_m) (* s_m (* x_m (* c_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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 * c_m) * (s_m * (x_m * (c_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * c_m) * (s_m * (x_m * (c_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 * c_m) * (s_m * (x_m * (c_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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 * c_m) * (s_m * (x_m * (c_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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(x_m * c_m) * Float64(s_m * Float64(x_m * Float64(c_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 * c_m) * (s_m * (x_m * (c_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $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[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in x around 0 51.8%
associate-/r*51.4%
*-commutative51.4%
unpow251.4%
unpow251.4%
swap-sqr63.0%
unpow263.0%
associate-/r*63.4%
unpow263.4%
unpow263.4%
swap-sqr76.8%
unpow276.8%
Simplified76.8%
unpow276.8%
associate-*r*76.2%
associate-*l*74.2%
*-commutative74.2%
associate-*r*74.2%
Applied egg-rr74.2%
Final simplification74.2%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) 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 c_m) (* s_m (* c_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
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 * c_m) * (s_m * (c_m * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
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 * c_m) * (s_m * (c_m * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
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 * c_m) * (s_m * (c_m * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [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 * c_m) * (s_m * (c_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) 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(x_m * c_m) * Float64(s_m * Float64(c_m * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
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 * c_m) * (s_m * (c_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $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[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 64.5%
associate-/r*64.1%
*-commutative64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
cos-neg64.1%
*-commutative64.1%
distribute-rgt-neg-in64.1%
metadata-eval64.1%
unpow264.1%
sqr-neg64.1%
unpow264.1%
associate-*r*59.2%
unpow259.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in x around 0 51.8%
associate-/r*51.4%
*-commutative51.4%
unpow251.4%
unpow251.4%
swap-sqr63.0%
unpow263.0%
associate-/r*63.4%
unpow263.4%
unpow263.4%
swap-sqr76.8%
unpow276.8%
Simplified76.8%
unpow276.8%
associate-*r*76.2%
associate-*l*74.2%
*-commutative74.2%
associate-*r*74.2%
Applied egg-rr74.2%
Taylor expanded in c around 0 74.2%
Final simplification74.2%
herbie shell --seed 2024155
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))