
(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)
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 1.3e-107)
(* (/ (/ 1.0 (* x_m s_m)) c_m) (/ t_0 (* (* x_m s_m) c_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 <= 1.3e-107) {
tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_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 <= 1.3d-107) then
tmp = ((1.0d0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_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 <= 1.3e-107) {
tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_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 <= 1.3e-107: tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_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 <= 1.3e-107) tmp = Float64(Float64(Float64(1.0 / Float64(x_m * s_m)) / c_m) * Float64(t_0 / Float64(Float64(x_m * s_m) * c_m))); else tmp = Float64(Float64(Float64(t_0 / s_m) / 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 <= 1.3e-107)
tmp = ((1.0 / (x_m * s_m)) / c_m) * (t_0 / ((x_m * s_m) * c_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, 1.3e-107], N[(N[(N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(t$95$0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$0 / s$95$m), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $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 1.3 \cdot 10^{-107}:\\
\;\;\;\;\frac{\frac{1}{x\_m \cdot s\_m}}{c\_m} \cdot \frac{t\_0}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{t\_0}{s\_m}}{x\_m \cdot c\_m}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 1.3e-107Initial program 65.5%
unpow265.5%
Applied egg-rr65.5%
Applied egg-rr97.5%
if 1.3e-107 < x Initial program 72.3%
unpow272.3%
Applied egg-rr72.3%
div-inv72.3%
*-commutative72.3%
frac-2neg72.3%
distribute-rgt-neg-in72.3%
*-commutative72.3%
associate-*r*65.6%
pow265.6%
unpow-prod-down79.5%
distribute-rgt-neg-in79.5%
pow279.5%
*-commutative79.5%
unpow-prod-down98.6%
frac-2neg98.6%
pow-flip98.6%
*-commutative98.6%
metadata-eval98.6%
*-commutative98.6%
Applied egg-rr98.6%
*-commutative98.6%
metadata-eval98.6%
pow-div98.6%
inv-pow98.6%
pow198.6%
associate-*r/98.5%
*-commutative98.5%
div-inv98.6%
*-commutative98.6%
*-commutative98.6%
associate-*l*96.3%
*-commutative96.3%
associate-*l*97.2%
Applied egg-rr97.2%
Taylor expanded in x around inf 96.2%
*-commutative96.2%
*-commutative96.2%
associate-*r*97.2%
associate-/r*97.2%
*-commutative97.2%
Simplified97.2%
Final simplification97.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 (* (* x_m s_m) c_m)) (t_1 (cos (* x_m 2.0))))
(if (<= s_m 2.4e+217)
(/ (/ (/ t_1 s_m) (* x_m c_m)) (* s_m (* x_m c_m)))
(* (/ t_1 t_0) (/ 1.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 * s_m) * c_m;
double t_1 = cos((x_m * 2.0));
double tmp;
if (s_m <= 2.4e+217) {
tmp = ((t_1 / s_m) / (x_m * c_m)) / (s_m * (x_m * c_m));
} else {
tmp = (t_1 / t_0) * (1.0 / t_0);
}
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 = (x_m * s_m) * c_m
t_1 = cos((x_m * 2.0d0))
if (s_m <= 2.4d+217) then
tmp = ((t_1 / s_m) / (x_m * c_m)) / (s_m * (x_m * c_m))
else
tmp = (t_1 / t_0) * (1.0d0 / t_0)
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 * s_m) * c_m;
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (s_m <= 2.4e+217) {
tmp = ((t_1 / s_m) / (x_m * c_m)) / (s_m * (x_m * c_m));
} else {
tmp = (t_1 / t_0) * (1.0 / t_0);
}
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 * s_m) * c_m t_1 = math.cos((x_m * 2.0)) tmp = 0 if s_m <= 2.4e+217: tmp = ((t_1 / s_m) / (x_m * c_m)) / (s_m * (x_m * c_m)) else: tmp = (t_1 / t_0) * (1.0 / t_0) 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(Float64(x_m * s_m) * c_m) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (s_m <= 2.4e+217) tmp = Float64(Float64(Float64(t_1 / s_m) / Float64(x_m * c_m)) / Float64(s_m * Float64(x_m * c_m))); else tmp = Float64(Float64(t_1 / t_0) * Float64(1.0 / t_0)); 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 * s_m) * c_m;
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (s_m <= 2.4e+217)
tmp = ((t_1 / s_m) / (x_m * c_m)) / (s_m * (x_m * c_m));
else
tmp = (t_1 / t_0) * (1.0 / t_0);
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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[s$95$m, 2.4e+217], N[(N[(N[(t$95$1 / s$95$m), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / t$95$0), $MachinePrecision] * N[(1.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 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;s\_m \leq 2.4 \cdot 10^{+217}:\\
\;\;\;\;\frac{\frac{\frac{t\_1}{s\_m}}{x\_m \cdot c\_m}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{t\_0} \cdot \frac{1}{t\_0}\\
\end{array}
\end{array}
if s < 2.3999999999999998e217Initial program 68.1%
unpow268.1%
Applied egg-rr68.1%
div-inv68.1%
*-commutative68.1%
frac-2neg68.1%
distribute-rgt-neg-in68.1%
*-commutative68.1%
associate-*r*61.1%
pow261.1%
unpow-prod-down78.5%
distribute-rgt-neg-in78.5%
pow278.5%
*-commutative78.5%
unpow-prod-down97.4%
frac-2neg97.4%
pow-flip97.7%
*-commutative97.7%
metadata-eval97.7%
*-commutative97.7%
Applied egg-rr97.7%
*-commutative97.7%
metadata-eval97.7%
pow-div97.7%
inv-pow97.7%
pow197.7%
associate-*r/97.7%
*-commutative97.7%
div-inv97.7%
*-commutative97.7%
*-commutative97.7%
associate-*l*94.8%
*-commutative94.8%
associate-*l*96.3%
Applied egg-rr96.3%
Taylor expanded in x around inf 94.8%
*-commutative94.8%
*-commutative94.8%
associate-*r*96.3%
associate-/r*96.3%
*-commutative96.3%
Simplified96.3%
if 2.3999999999999998e217 < s Initial program 61.1%
*-un-lft-identity61.1%
add-sqr-sqrt61.1%
times-frac61.1%
Applied egg-rr99.7%
Final simplification96.5%
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 (* (* x_m s_m) c_m))))
(if (<= x_m 1.26e-107)
(* t_0 t_0)
(/ (/ (/ (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 t_0 = 1.0 / ((x_m * s_m) * c_m);
double tmp;
if (x_m <= 1.26e-107) {
tmp = t_0 * t_0;
} 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) :: t_0
real(8) :: tmp
t_0 = 1.0d0 / ((x_m * s_m) * c_m)
if (x_m <= 1.26d-107) then
tmp = t_0 * t_0
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 t_0 = 1.0 / ((x_m * s_m) * c_m);
double tmp;
if (x_m <= 1.26e-107) {
tmp = t_0 * t_0;
} 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): t_0 = 1.0 / ((x_m * s_m) * c_m) tmp = 0 if x_m <= 1.26e-107: tmp = t_0 * t_0 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) t_0 = Float64(1.0 / Float64(Float64(x_m * s_m) * c_m)) tmp = 0.0 if (x_m <= 1.26e-107) tmp = Float64(t_0 * t_0); else tmp = Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / s_m) / 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 = 1.0 / ((x_m * s_m) * c_m);
tmp = 0.0;
if (x_m <= 1.26e-107)
tmp = t_0 * t_0;
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_] := Block[{t$95$0 = N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.26e-107], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $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 := \frac{1}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
\mathbf{if}\;x\_m \leq 1.26 \cdot 10^{-107}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m}}{x\_m \cdot c\_m}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 1.2599999999999999e-107Initial program 65.5%
*-un-lft-identity65.5%
add-sqr-sqrt65.5%
times-frac65.5%
Applied egg-rr97.5%
Taylor expanded in x around 0 85.6%
if 1.2599999999999999e-107 < x Initial program 72.3%
unpow272.3%
Applied egg-rr72.3%
div-inv72.3%
*-commutative72.3%
frac-2neg72.3%
distribute-rgt-neg-in72.3%
*-commutative72.3%
associate-*r*65.6%
pow265.6%
unpow-prod-down79.5%
distribute-rgt-neg-in79.5%
pow279.5%
*-commutative79.5%
unpow-prod-down98.6%
frac-2neg98.6%
pow-flip98.6%
*-commutative98.6%
metadata-eval98.6%
*-commutative98.6%
Applied egg-rr98.6%
*-commutative98.6%
metadata-eval98.6%
pow-div98.6%
inv-pow98.6%
pow198.6%
associate-*r/98.5%
*-commutative98.5%
div-inv98.6%
*-commutative98.6%
*-commutative98.6%
associate-*l*96.3%
*-commutative96.3%
associate-*l*97.2%
Applied egg-rr97.2%
Taylor expanded in x around inf 96.2%
*-commutative96.2%
*-commutative96.2%
associate-*r*97.2%
associate-/r*97.2%
*-commutative97.2%
Simplified97.2%
Final simplification89.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 (let* ((t_0 (* s_m (* x_m c_m))) (t_1 (/ 1.0 (* (* x_m s_m) c_m)))) (if (<= x_m 1.16e-107) (* t_1 t_1) (/ (/ (cos (* x_m 2.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 = s_m * (x_m * c_m);
double t_1 = 1.0 / ((x_m * s_m) * c_m);
double tmp;
if (x_m <= 1.16e-107) {
tmp = t_1 * t_1;
} else {
tmp = (cos((x_m * 2.0)) / t_0) / t_0;
}
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 = s_m * (x_m * c_m)
t_1 = 1.0d0 / ((x_m * s_m) * c_m)
if (x_m <= 1.16d-107) then
tmp = t_1 * t_1
else
tmp = (cos((x_m * 2.0d0)) / t_0) / t_0
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 = s_m * (x_m * c_m);
double t_1 = 1.0 / ((x_m * s_m) * c_m);
double tmp;
if (x_m <= 1.16e-107) {
tmp = t_1 * t_1;
} else {
tmp = (Math.cos((x_m * 2.0)) / t_0) / t_0;
}
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 = s_m * (x_m * c_m) t_1 = 1.0 / ((x_m * s_m) * c_m) tmp = 0 if x_m <= 1.16e-107: tmp = t_1 * t_1 else: tmp = (math.cos((x_m * 2.0)) / t_0) / t_0 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(s_m * Float64(x_m * c_m)) t_1 = Float64(1.0 / Float64(Float64(x_m * s_m) * c_m)) tmp = 0.0 if (x_m <= 1.16e-107) tmp = Float64(t_1 * t_1); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / t_0); 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 = s_m * (x_m * c_m);
t_1 = 1.0 / ((x_m * s_m) * c_m);
tmp = 0.0;
if (x_m <= 1.16e-107)
tmp = t_1 * t_1;
else
tmp = (cos((x_m * 2.0)) / t_0) / t_0;
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[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.16e-107], N[(t$95$1 * t$95$1), $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|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
t_1 := \frac{1}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
\mathbf{if}\;x\_m \leq 1.16 \cdot 10^{-107}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 1.16e-107Initial program 65.5%
*-un-lft-identity65.5%
add-sqr-sqrt65.5%
times-frac65.5%
Applied egg-rr97.5%
Taylor expanded in x around 0 85.6%
if 1.16e-107 < x Initial program 72.3%
unpow272.3%
Applied egg-rr72.3%
div-inv72.3%
*-commutative72.3%
frac-2neg72.3%
distribute-rgt-neg-in72.3%
*-commutative72.3%
associate-*r*65.6%
pow265.6%
unpow-prod-down79.5%
distribute-rgt-neg-in79.5%
pow279.5%
*-commutative79.5%
unpow-prod-down98.6%
frac-2neg98.6%
pow-flip98.6%
*-commutative98.6%
metadata-eval98.6%
*-commutative98.6%
Applied egg-rr98.6%
*-commutative98.6%
metadata-eval98.6%
pow-div98.6%
inv-pow98.6%
pow198.6%
associate-*r/98.5%
*-commutative98.5%
div-inv98.6%
*-commutative98.6%
*-commutative98.6%
associate-*l*96.3%
*-commutative96.3%
associate-*l*97.2%
Applied egg-rr97.2%
Final simplification89.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
(let* ((t_0 (* (* x_m s_m) c_m)) (t_1 (/ 1.0 t_0)))
(if (<= x_m 9.2e-108)
(* t_1 t_1)
(/ (/ (cos (* x_m 2.0)) t_0) (* 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 * s_m) * c_m;
double t_1 = 1.0 / t_0;
double tmp;
if (x_m <= 9.2e-108) {
tmp = t_1 * t_1;
} else {
tmp = (cos((x_m * 2.0)) / t_0) / (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 = (x_m * s_m) * c_m
t_1 = 1.0d0 / t_0
if (x_m <= 9.2d-108) then
tmp = t_1 * t_1
else
tmp = (cos((x_m * 2.0d0)) / t_0) / (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 * s_m) * c_m;
double t_1 = 1.0 / t_0;
double tmp;
if (x_m <= 9.2e-108) {
tmp = t_1 * t_1;
} else {
tmp = (Math.cos((x_m * 2.0)) / t_0) / (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 * s_m) * c_m t_1 = 1.0 / t_0 tmp = 0 if x_m <= 9.2e-108: tmp = t_1 * t_1 else: tmp = (math.cos((x_m * 2.0)) / t_0) / (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(Float64(x_m * s_m) * c_m) t_1 = Float64(1.0 / t_0) tmp = 0.0 if (x_m <= 9.2e-108) tmp = Float64(t_1 * t_1); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / 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 * s_m) * c_m;
t_1 = 1.0 / t_0;
tmp = 0.0;
if (x_m <= 9.2e-108)
tmp = t_1 * t_1;
else
tmp = (cos((x_m * 2.0)) / t_0) / (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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 / t$95$0), $MachinePrecision]}, If[LessEqual[x$95$m, 9.2e-108], N[(t$95$1 * t$95$1), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $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 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
t_1 := \frac{1}{t\_0}\\
\mathbf{if}\;x\_m \leq 9.2 \cdot 10^{-108}:\\
\;\;\;\;t\_1 \cdot t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{s\_m \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 9.19999999999999983e-108Initial program 65.5%
*-un-lft-identity65.5%
add-sqr-sqrt65.5%
times-frac65.5%
Applied egg-rr97.5%
Taylor expanded in x around 0 85.6%
if 9.19999999999999983e-108 < x Initial program 72.3%
unpow272.3%
Applied egg-rr72.3%
div-inv72.3%
*-commutative72.3%
frac-2neg72.3%
distribute-rgt-neg-in72.3%
*-commutative72.3%
associate-*r*65.6%
pow265.6%
unpow-prod-down79.5%
distribute-rgt-neg-in79.5%
pow279.5%
*-commutative79.5%
unpow-prod-down98.6%
frac-2neg98.6%
pow-flip98.6%
*-commutative98.6%
metadata-eval98.6%
*-commutative98.6%
Applied egg-rr98.6%
*-commutative98.6%
metadata-eval98.6%
pow-div98.6%
inv-pow98.6%
pow198.6%
associate-*r/98.5%
*-commutative98.5%
div-inv98.6%
*-commutative98.6%
*-commutative98.6%
associate-*l*96.3%
*-commutative96.3%
associate-*l*97.2%
Applied egg-rr97.2%
Taylor expanded in s around 0 96.2%
Final simplification89.0%
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 s_m) c_m))) (/ (/ (cos (* x_m 2.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 * s_m) * c_m;
return (cos((x_m * 2.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 * s_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);
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 * s_m) * c_m;
return (Math.cos((x_m * 2.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 * s_m) * c_m return (math.cos((x_m * 2.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(Float64(x_m * s_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);
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 * s_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]
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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $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|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 67.7%
Applied egg-rr97.1%
rem-cube-cbrt97.5%
frac-2neg97.5%
add-sqr-sqrt0.0%
associate-/r*0.0%
Applied egg-rr97.8%
Final simplification97.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 (/ (/ 1.0 (* x_m s_m)) c_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 / (x_m * s_m)) / c_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 / (x_m * s_m)) / c_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 / (x_m * s_m)) / c_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 / (x_m * s_m)) / c_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(Float64(1.0 / Float64(x_m * s_m)) / c_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 / (x_m * s_m)) / c_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[(N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $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{\frac{1}{x\_m \cdot s\_m}}{c\_m}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 67.7%
Taylor expanded in x around 0 55.0%
associate-/r*55.0%
*-commutative55.0%
unpow255.0%
unpow255.0%
swap-sqr68.2%
unpow268.2%
associate-/r*68.9%
unpow268.9%
unpow268.9%
swap-sqr79.7%
unpow279.7%
*-commutative79.7%
Simplified79.7%
metadata-eval79.7%
*-commutative79.7%
unpow279.7%
frac-times79.8%
*-commutative79.8%
associate-/r*79.8%
*-commutative79.8%
associate-/r*79.8%
Applied egg-rr79.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 (/ 1.0 (* (* x_m s_m) c_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 / ((x_m * s_m) * c_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 / ((x_m * s_m) * c_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 / ((x_m * s_m) * c_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 / ((x_m * s_m) * c_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(Float64(x_m * s_m) * c_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 / ((x_m * s_m) * c_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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $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}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 67.7%
*-un-lft-identity67.7%
add-sqr-sqrt67.6%
times-frac67.6%
Applied egg-rr97.8%
Taylor expanded in x around 0 79.8%
Final simplification79.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 s_m) c_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 * s_m) * c_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 * s_m) * c_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 * s_m) * c_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 * s_m) * c_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(Float64(x_m * s_m) * c_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 * s_m) * c_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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $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 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 67.7%
Taylor expanded in x around 0 55.0%
associate-/r*55.0%
*-commutative55.0%
unpow255.0%
unpow255.0%
swap-sqr68.2%
unpow268.2%
associate-/r*68.9%
unpow268.9%
unpow268.9%
swap-sqr79.7%
unpow279.7%
*-commutative79.7%
Simplified79.7%
*-commutative79.7%
unpow279.7%
Applied egg-rr79.7%
Final simplification79.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) (* (* x_m s_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) {
return 1.0 / (c_m * ((x_m * s_m) * ((x_m * s_m) * c_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) * ((x_m * s_m) * c_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) * ((x_m * s_m) * c_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) * ((x_m * s_m) * c_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(c_m * Float64(Float64(x_m * s_m) * Float64(Float64(x_m * s_m) * c_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) * ((x_m * s_m) * c_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[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(N[(x$95$m * s$95$m), $MachinePrecision] * 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])\\
\\
\frac{1}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)\right)}
\end{array}
Initial program 67.7%
Taylor expanded in x around 0 55.0%
associate-/r*55.0%
*-commutative55.0%
unpow255.0%
unpow255.0%
swap-sqr68.2%
unpow268.2%
associate-/r*68.9%
unpow268.9%
unpow268.9%
swap-sqr79.7%
unpow279.7%
*-commutative79.7%
Simplified79.7%
*-commutative79.7%
unpow279.7%
associate-*l*77.6%
Applied egg-rr77.6%
Final simplification77.6%
herbie shell --seed 2024113
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))