
(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 15 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
(if (<= x_m 8e-67)
(/ (/ (/ 1.0 (* c_m (* x_m s_m))) (* x_m s_m)) c_m)
(*
(/ (cos (* x_m 2.0)) (* s_m (* x_m c_m)))
(* (/ 1.0 (* x_m c_m)) (/ 1.0 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) {
double tmp;
if (x_m <= 8e-67) {
tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m;
} else {
tmp = (cos((x_m * 2.0)) / (s_m * (x_m * c_m))) * ((1.0 / (x_m * c_m)) * (1.0 / s_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 <= 8d-67) then
tmp = ((1.0d0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m
else
tmp = (cos((x_m * 2.0d0)) / (s_m * (x_m * c_m))) * ((1.0d0 / (x_m * c_m)) * (1.0d0 / s_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 <= 8e-67) {
tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m;
} else {
tmp = (Math.cos((x_m * 2.0)) / (s_m * (x_m * c_m))) * ((1.0 / (x_m * c_m)) * (1.0 / s_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 <= 8e-67: tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m else: tmp = (math.cos((x_m * 2.0)) / (s_m * (x_m * c_m))) * ((1.0 / (x_m * c_m)) * (1.0 / s_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 <= 8e-67) tmp = Float64(Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) / Float64(x_m * s_m)) / c_m); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(s_m * Float64(x_m * c_m))) * Float64(Float64(1.0 / Float64(x_m * c_m)) * Float64(1.0 / s_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 <= 8e-67)
tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m;
else
tmp = (cos((x_m * 2.0)) / (s_m * (x_m * c_m))) * ((1.0 / (x_m * c_m)) * (1.0 / s_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, 8e-67], N[(N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(1.0 / s$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}
\mathbf{if}\;x\_m \leq 8 \cdot 10^{-67}:\\
\;\;\;\;\frac{\frac{\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}}{x\_m \cdot s\_m}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{s\_m \cdot \left(x\_m \cdot c\_m\right)} \cdot \left(\frac{1}{x\_m \cdot c\_m} \cdot \frac{1}{s\_m}\right)\\
\end{array}
\end{array}
if x < 7.99999999999999954e-67Initial program 65.1%
*-un-lft-identity65.1%
add-sqr-sqrt65.1%
times-frac65.1%
sqrt-prod65.1%
sqrt-pow147.5%
metadata-eval47.5%
pow147.5%
*-commutative47.5%
associate-*r*44.1%
unpow244.1%
pow-prod-down47.5%
sqrt-pow146.4%
metadata-eval46.4%
pow146.4%
*-commutative46.4%
Applied egg-rr95.7%
associate-*l/95.7%
*-un-lft-identity95.7%
*-commutative95.7%
associate-/r*93.4%
*-commutative93.4%
Applied egg-rr93.4%
Taylor expanded in x around 0 80.7%
if 7.99999999999999954e-67 < x Initial program 63.6%
*-un-lft-identity63.6%
add-sqr-sqrt63.6%
times-frac63.6%
sqrt-prod63.6%
sqrt-pow143.8%
metadata-eval43.8%
pow143.8%
*-commutative43.8%
associate-*r*40.3%
unpow240.3%
pow-prod-down43.8%
sqrt-pow146.2%
metadata-eval46.2%
pow146.2%
*-commutative46.2%
Applied egg-rr96.1%
associate-/r*96.2%
inv-pow96.2%
metadata-eval96.2%
associate-/r*96.2%
frac-times73.2%
metadata-eval73.2%
inv-pow73.2%
*-commutative73.2%
pow273.2%
Applied egg-rr73.2%
associate-*l/73.2%
*-lft-identity73.2%
*-commutative73.2%
Simplified73.2%
div-inv73.2%
*-commutative73.2%
pow273.2%
times-frac96.2%
associate-/r*96.2%
associate-*r*95.1%
associate-/r*95.1%
associate-*r*98.3%
Applied egg-rr98.3%
inv-pow98.3%
unpow-prod-down98.4%
inv-pow98.4%
inv-pow98.4%
Applied egg-rr98.4%
Final simplification86.6%
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))) (t_1 (cos (* x_m 2.0))))
(if (<= x_m 2e+86)
(* (/ 1.0 t_0) (/ t_1 t_0))
(* (/ t_1 (* x_m c_m)) (/ (/ 1.0 (* 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) {
double t_0 = c_m * (x_m * s_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (x_m <= 2e+86) {
tmp = (1.0 / t_0) * (t_1 / t_0);
} else {
tmp = (t_1 / (x_m * c_m)) * ((1.0 / (s_m * (x_m * c_m))) / s_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 = c_m * (x_m * s_m)
t_1 = cos((x_m * 2.0d0))
if (x_m <= 2d+86) then
tmp = (1.0d0 / t_0) * (t_1 / t_0)
else
tmp = (t_1 / (x_m * c_m)) * ((1.0d0 / (s_m * (x_m * c_m))) / s_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 = c_m * (x_m * s_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 2e+86) {
tmp = (1.0 / t_0) * (t_1 / t_0);
} else {
tmp = (t_1 / (x_m * c_m)) * ((1.0 / (s_m * (x_m * c_m))) / s_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 = c_m * (x_m * s_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 2e+86: tmp = (1.0 / t_0) * (t_1 / t_0) else: tmp = (t_1 / (x_m * c_m)) * ((1.0 / (s_m * (x_m * c_m))) / s_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(c_m * Float64(x_m * s_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 2e+86) tmp = Float64(Float64(1.0 / t_0) * Float64(t_1 / t_0)); else tmp = Float64(Float64(t_1 / Float64(x_m * c_m)) * Float64(Float64(1.0 / Float64(s_m * Float64(x_m * c_m))) / s_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 = c_m * (x_m * s_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 2e+86)
tmp = (1.0 / t_0) * (t_1 / t_0);
else
tmp = (t_1 / (x_m * c_m)) * ((1.0 / (s_m * (x_m * c_m))) / s_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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 2e+86], N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(t$95$1 / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / s$95$m), $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)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 2 \cdot 10^{+86}:\\
\;\;\;\;\frac{1}{t\_0} \cdot \frac{t\_1}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{x\_m \cdot c\_m} \cdot \frac{\frac{1}{s\_m \cdot \left(x\_m \cdot c\_m\right)}}{s\_m}\\
\end{array}
\end{array}
if x < 2e86Initial program 66.5%
*-un-lft-identity66.5%
add-sqr-sqrt66.5%
times-frac66.5%
sqrt-prod66.5%
sqrt-pow145.6%
metadata-eval45.6%
pow145.6%
*-commutative45.6%
associate-*r*42.7%
unpow242.7%
pow-prod-down45.6%
sqrt-pow147.1%
metadata-eval47.1%
pow147.1%
*-commutative47.1%
Applied egg-rr96.3%
if 2e86 < x Initial program 56.8%
*-un-lft-identity56.8%
add-sqr-sqrt56.8%
times-frac56.8%
sqrt-prod56.8%
sqrt-pow149.2%
metadata-eval49.2%
pow149.2%
*-commutative49.2%
associate-*r*43.2%
unpow243.2%
pow-prod-down49.2%
sqrt-pow143.3%
metadata-eval43.3%
pow143.3%
*-commutative43.3%
Applied egg-rr93.9%
associate-*l/93.8%
*-un-lft-identity93.8%
*-commutative93.8%
associate-/r*92.2%
*-commutative92.2%
Applied egg-rr92.2%
associate-/l/93.8%
div-inv93.9%
associate-*r*92.2%
times-frac90.3%
associate-*r*95.8%
Applied egg-rr95.8%
Final simplification96.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
(let* ((t_0 (* s_m (* x_m c_m))))
(if (<= x_m 7e-68)
(/ (/ (/ 1.0 (* c_m (* x_m s_m))) (* x_m s_m)) c_m)
(* (/ (cos (* x_m 2.0)) 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 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 7e-68) {
tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m;
} else {
tmp = (cos((x_m * 2.0)) / 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) :: tmp
t_0 = s_m * (x_m * c_m)
if (x_m <= 7d-68) then
tmp = ((1.0d0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m
else
tmp = (cos((x_m * 2.0d0)) / 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 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 7e-68) {
tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m;
} else {
tmp = (Math.cos((x_m * 2.0)) / 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 = s_m * (x_m * c_m) tmp = 0 if x_m <= 7e-68: tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m else: tmp = (math.cos((x_m * 2.0)) / 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(s_m * Float64(x_m * c_m)) tmp = 0.0 if (x_m <= 7e-68) tmp = Float64(Float64(Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) / Float64(x_m * s_m)) / c_m); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / 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 = s_m * (x_m * c_m);
tmp = 0.0;
if (x_m <= 7e-68)
tmp = ((1.0 / (c_m * (x_m * s_m))) / (x_m * s_m)) / c_m;
else
tmp = (cos((x_m * 2.0)) / 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[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 7e-68], N[(N[(N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 7 \cdot 10^{-68}:\\
\;\;\;\;\frac{\frac{\frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}}{x\_m \cdot s\_m}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot 2\right)}{t\_0} \cdot \frac{1}{t\_0}\\
\end{array}
\end{array}
if x < 7.00000000000000026e-68Initial program 65.1%
*-un-lft-identity65.1%
add-sqr-sqrt65.1%
times-frac65.1%
sqrt-prod65.1%
sqrt-pow147.5%
metadata-eval47.5%
pow147.5%
*-commutative47.5%
associate-*r*44.1%
unpow244.1%
pow-prod-down47.5%
sqrt-pow146.4%
metadata-eval46.4%
pow146.4%
*-commutative46.4%
Applied egg-rr95.7%
associate-*l/95.7%
*-un-lft-identity95.7%
*-commutative95.7%
associate-/r*93.4%
*-commutative93.4%
Applied egg-rr93.4%
Taylor expanded in x around 0 80.7%
if 7.00000000000000026e-68 < x Initial program 63.6%
*-un-lft-identity63.6%
add-sqr-sqrt63.6%
times-frac63.6%
sqrt-prod63.6%
sqrt-pow143.8%
metadata-eval43.8%
pow143.8%
*-commutative43.8%
associate-*r*40.3%
unpow240.3%
pow-prod-down43.8%
sqrt-pow146.2%
metadata-eval46.2%
pow146.2%
*-commutative46.2%
Applied egg-rr96.1%
associate-/r*96.2%
inv-pow96.2%
metadata-eval96.2%
associate-/r*96.2%
frac-times73.2%
metadata-eval73.2%
inv-pow73.2%
*-commutative73.2%
pow273.2%
Applied egg-rr73.2%
associate-*l/73.2%
*-lft-identity73.2%
*-commutative73.2%
Simplified73.2%
div-inv73.2%
*-commutative73.2%
pow273.2%
times-frac96.2%
associate-/r*96.2%
associate-*r*95.1%
associate-/r*95.1%
associate-*r*98.3%
Applied egg-rr98.3%
Final simplification86.6%
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))) (t_1 (cos (* x_m 2.0))))
(if (<= c_m 2.15e-193)
(/ (/ t_1 c_m) (* (* x_m s_m) t_0))
(/ (/ (/ t_1 t_0) 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) {
double t_0 = c_m * (x_m * s_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (c_m <= 2.15e-193) {
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0);
} else {
tmp = ((t_1 / t_0) / c_m) / (x_m * s_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 = c_m * (x_m * s_m)
t_1 = cos((x_m * 2.0d0))
if (c_m <= 2.15d-193) then
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0)
else
tmp = ((t_1 / t_0) / c_m) / (x_m * s_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 = c_m * (x_m * s_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (c_m <= 2.15e-193) {
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0);
} else {
tmp = ((t_1 / t_0) / c_m) / (x_m * s_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 = c_m * (x_m * s_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if c_m <= 2.15e-193: tmp = (t_1 / c_m) / ((x_m * s_m) * t_0) else: tmp = ((t_1 / t_0) / c_m) / (x_m * s_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(c_m * Float64(x_m * s_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (c_m <= 2.15e-193) tmp = Float64(Float64(t_1 / c_m) / Float64(Float64(x_m * s_m) * t_0)); else tmp = Float64(Float64(Float64(t_1 / t_0) / c_m) / Float64(x_m * s_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 = c_m * (x_m * s_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (c_m <= 2.15e-193)
tmp = (t_1 / c_m) / ((x_m * s_m) * t_0);
else
tmp = ((t_1 / t_0) / c_m) / (x_m * s_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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 2.15e-193], N[(N[(t$95$1 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$1 / t$95$0), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $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)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;c\_m \leq 2.15 \cdot 10^{-193}:\\
\;\;\;\;\frac{\frac{t\_1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{t\_1}{t\_0}}{c\_m}}{x\_m \cdot s\_m}\\
\end{array}
\end{array}
if c < 2.1500000000000001e-193Initial program 63.4%
*-un-lft-identity63.4%
add-sqr-sqrt63.4%
times-frac63.5%
sqrt-prod63.5%
sqrt-pow132.7%
metadata-eval32.7%
pow132.7%
*-commutative32.7%
associate-*r*29.9%
unpow229.9%
pow-prod-down32.7%
sqrt-pow141.2%
metadata-eval41.2%
pow141.2%
*-commutative41.2%
Applied egg-rr94.6%
associate-*l/94.6%
*-un-lft-identity94.6%
associate-/r*94.7%
associate-/l/92.6%
*-commutative92.6%
Applied egg-rr92.6%
if 2.1500000000000001e-193 < c Initial program 66.3%
*-un-lft-identity66.3%
add-sqr-sqrt66.3%
times-frac66.3%
sqrt-prod66.3%
sqrt-pow166.3%
metadata-eval66.3%
pow166.3%
*-commutative66.3%
associate-*r*61.7%
unpow261.7%
pow-prod-down66.3%
sqrt-pow153.9%
metadata-eval53.9%
pow153.9%
*-commutative53.9%
Applied egg-rr97.6%
associate-*l/97.7%
*-un-lft-identity97.7%
associate-/r*92.6%
*-commutative92.6%
Applied egg-rr92.6%
Final simplification92.6%
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)) (* c_m (* x_m s_m)))))
(if (<= c_m 4.3e-193)
(/ (/ t_0 (* x_m s_m)) c_m)
(/ (/ t_0 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) {
double t_0 = cos((x_m * 2.0)) / (c_m * (x_m * s_m));
double tmp;
if (c_m <= 4.3e-193) {
tmp = (t_0 / (x_m * s_m)) / c_m;
} else {
tmp = (t_0 / c_m) / (x_m * s_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)) / (c_m * (x_m * s_m))
if (c_m <= 4.3d-193) then
tmp = (t_0 / (x_m * s_m)) / c_m
else
tmp = (t_0 / c_m) / (x_m * s_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)) / (c_m * (x_m * s_m));
double tmp;
if (c_m <= 4.3e-193) {
tmp = (t_0 / (x_m * s_m)) / c_m;
} else {
tmp = (t_0 / c_m) / (x_m * s_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)) / (c_m * (x_m * s_m)) tmp = 0 if c_m <= 4.3e-193: tmp = (t_0 / (x_m * s_m)) / c_m else: tmp = (t_0 / c_m) / (x_m * s_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(cos(Float64(x_m * 2.0)) / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (c_m <= 4.3e-193) tmp = Float64(Float64(t_0 / Float64(x_m * s_m)) / c_m); else tmp = Float64(Float64(t_0 / c_m) / Float64(x_m * s_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)) / (c_m * (x_m * s_m));
tmp = 0.0;
if (c_m <= 4.3e-193)
tmp = (t_0 / (x_m * s_m)) / c_m;
else
tmp = (t_0 / c_m) / (x_m * s_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[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 4.3e-193], N[(N[(t$95$0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(t$95$0 / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $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{\cos \left(x\_m \cdot 2\right)}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;c\_m \leq 4.3 \cdot 10^{-193}:\\
\;\;\;\;\frac{\frac{t\_0}{x\_m \cdot s\_m}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_0}{c\_m}}{x\_m \cdot s\_m}\\
\end{array}
\end{array}
if c < 4.3000000000000002e-193Initial program 63.4%
*-un-lft-identity63.4%
add-sqr-sqrt63.4%
times-frac63.5%
sqrt-prod63.5%
sqrt-pow132.7%
metadata-eval32.7%
pow132.7%
*-commutative32.7%
associate-*r*29.9%
unpow229.9%
pow-prod-down32.7%
sqrt-pow141.2%
metadata-eval41.2%
pow141.2%
*-commutative41.2%
Applied egg-rr94.6%
associate-*l/94.6%
*-un-lft-identity94.6%
*-commutative94.6%
associate-/r*92.2%
*-commutative92.2%
Applied egg-rr92.2%
if 4.3000000000000002e-193 < c Initial program 66.3%
*-un-lft-identity66.3%
add-sqr-sqrt66.3%
times-frac66.3%
sqrt-prod66.3%
sqrt-pow166.3%
metadata-eval66.3%
pow166.3%
*-commutative66.3%
associate-*r*61.7%
unpow261.7%
pow-prod-down66.3%
sqrt-pow153.9%
metadata-eval53.9%
pow153.9%
*-commutative53.9%
Applied egg-rr97.6%
associate-*l/97.7%
*-un-lft-identity97.7%
associate-/r*92.6%
*-commutative92.6%
Applied egg-rr92.6%
Final simplification92.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 (* c_m (* x_m s_m)))) (* (/ 1.0 t_0) (/ (cos (* x_m 2.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) * (cos((x_m * 2.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) * (cos((x_m * 2.0d0)) / 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) * (Math.cos((x_m * 2.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) * (math.cos((x_m * 2.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(Float64(1.0 / t_0) * Float64(cos(Float64(x_m * 2.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) * (cos((x_m * 2.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[(N[(1.0 / t$95$0), $MachinePrecision] * N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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 \frac{\cos \left(x\_m \cdot 2\right)}{t\_0}
\end{array}
\end{array}
Initial program 64.6%
*-un-lft-identity64.6%
add-sqr-sqrt64.6%
times-frac64.6%
sqrt-prod64.6%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
associate-*r*42.8%
unpow242.8%
pow-prod-down46.3%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
Applied egg-rr95.8%
Final simplification95.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 (/ (/ (cos (* x_m 2.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 (cos((x_m * 2.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 = (cos((x_m * 2.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 (Math.cos((x_m * 2.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 (math.cos((x_m * 2.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(cos(Float64(x_m * 2.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 = (cos((x_m * 2.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[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / 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{\cos \left(x\_m \cdot 2\right)}{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.6%
*-un-lft-identity64.6%
add-sqr-sqrt64.6%
times-frac64.6%
sqrt-prod64.6%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
associate-*r*42.8%
unpow242.8%
pow-prod-down46.3%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
Applied egg-rr95.8%
associate-*l/95.8%
*-un-lft-identity95.8%
associate-/r*95.9%
associate-/l/93.3%
*-commutative93.3%
Applied egg-rr93.3%
Final simplification93.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 (* c_m (* x_m s_m)))) (if (<= x_m 1.3e+33) (pow t_0 -2.0) (/ (/ -1.0 (* x_m c_m)) (* s_m 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);
double tmp;
if (x_m <= 1.3e+33) {
tmp = pow(t_0, -2.0);
} else {
tmp = (-1.0 / (x_m * c_m)) / (s_m * 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) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 1.3d+33) then
tmp = t_0 ** (-2.0d0)
else
tmp = ((-1.0d0) / (x_m * c_m)) / (s_m * 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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.3e+33) {
tmp = Math.pow(t_0, -2.0);
} else {
tmp = (-1.0 / (x_m * c_m)) / (s_m * 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 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.3e+33: tmp = math.pow(t_0, -2.0) else: tmp = (-1.0 / (x_m * c_m)) / (s_m * 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(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.3e+33) tmp = t_0 ^ -2.0; else tmp = Float64(Float64(-1.0 / Float64(x_m * c_m)) / Float64(s_m * 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 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.3e+33)
tmp = t_0 ^ -2.0;
else
tmp = (-1.0 / (x_m * c_m)) / (s_m * 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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.3e+33], N[Power[t$95$0, -2.0], $MachinePrecision], N[(N[(-1.0 / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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)\\
\mathbf{if}\;x\_m \leq 1.3 \cdot 10^{+33}:\\
\;\;\;\;{t\_0}^{-2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{x\_m \cdot c\_m}}{s\_m \cdot t\_0}\\
\end{array}
\end{array}
if x < 1.2999999999999999e33Initial program 66.0%
Taylor expanded in x around 0 55.3%
associate-/r*55.3%
*-commutative55.3%
unpow255.3%
unpow255.3%
swap-sqr66.4%
unpow266.4%
associate-/r*66.4%
unpow266.4%
unpow266.4%
swap-sqr80.8%
unpow280.8%
*-commutative80.8%
Simplified80.8%
pow-flip81.0%
*-commutative81.0%
metadata-eval81.0%
Applied egg-rr81.0%
if 1.2999999999999999e33 < x Initial program 60.7%
*-un-lft-identity60.7%
add-sqr-sqrt60.7%
times-frac60.7%
sqrt-prod60.7%
sqrt-pow147.4%
metadata-eval47.4%
pow147.4%
*-commutative47.4%
associate-*r*42.7%
unpow242.7%
pow-prod-down47.4%
sqrt-pow145.8%
metadata-eval45.8%
pow145.8%
*-commutative45.8%
Applied egg-rr95.1%
Taylor expanded in x around 0 50.8%
*-commutative50.8%
associate-/l/50.8%
*-commutative50.8%
associate-/r*50.8%
Simplified50.8%
div-inv50.8%
Applied egg-rr50.8%
clear-num50.8%
associate-*r*50.8%
div-inv50.8%
frac-times50.8%
metadata-eval50.8%
frac-times50.8%
metadata-eval50.8%
*-commutative50.8%
*-commutative50.8%
associate-*r*51.3%
clear-num51.3%
associate-/r*51.3%
frac-2neg51.3%
metadata-eval51.3%
frac-times50.6%
add-sqr-sqrt27.8%
sqrt-unprod54.7%
Applied egg-rr58.5%
Final simplification75.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 (let* ((t_0 (/ (/ 1.0 s_m) x_m)) (t_1 (* c_m (* x_m s_m)))) (if (<= x_m 1.3e+33) (/ (/ t_0 c_m) t_1) (/ -1.0 (* t_1 (/ c_m 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 / s_m) / x_m;
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.3e+33) {
tmp = (t_0 / c_m) / t_1;
} else {
tmp = -1.0 / (t_1 * (c_m / 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 = (1.0d0 / s_m) / x_m
t_1 = c_m * (x_m * s_m)
if (x_m <= 1.3d+33) then
tmp = (t_0 / c_m) / t_1
else
tmp = (-1.0d0) / (t_1 * (c_m / 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 = (1.0 / s_m) / x_m;
double t_1 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.3e+33) {
tmp = (t_0 / c_m) / t_1;
} else {
tmp = -1.0 / (t_1 * (c_m / 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 = (1.0 / s_m) / x_m t_1 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.3e+33: tmp = (t_0 / c_m) / t_1 else: tmp = -1.0 / (t_1 * (c_m / 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(1.0 / s_m) / x_m) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.3e+33) tmp = Float64(Float64(t_0 / c_m) / t_1); else tmp = Float64(-1.0 / Float64(t_1 * Float64(c_m / 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 = (1.0 / s_m) / x_m;
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.3e+33)
tmp = (t_0 / c_m) / t_1;
else
tmp = -1.0 / (t_1 * (c_m / 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[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.3e+33], N[(N[(t$95$0 / c$95$m), $MachinePrecision] / t$95$1), $MachinePrecision], N[(-1.0 / N[(t$95$1 * N[(c$95$m / t$95$0), $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{\frac{1}{s\_m}}{x\_m}\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.3 \cdot 10^{+33}:\\
\;\;\;\;\frac{\frac{t\_0}{c\_m}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{t\_1 \cdot \frac{c\_m}{t\_0}}\\
\end{array}
\end{array}
if x < 1.2999999999999999e33Initial program 66.0%
*-un-lft-identity66.0%
add-sqr-sqrt66.0%
times-frac65.9%
sqrt-prod65.9%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.9%
unpow242.9%
pow-prod-down45.9%
sqrt-pow146.5%
metadata-eval46.5%
pow146.5%
*-commutative46.5%
Applied egg-rr96.1%
Taylor expanded in x around 0 81.0%
*-commutative81.0%
associate-/l/81.0%
*-commutative81.0%
associate-/r*81.1%
Simplified81.1%
div-inv81.0%
Applied egg-rr81.0%
associate-*r*80.5%
associate-*l/80.5%
*-un-lft-identity80.5%
un-div-inv80.5%
associate-*r*81.1%
Applied egg-rr81.1%
if 1.2999999999999999e33 < x Initial program 60.7%
*-un-lft-identity60.7%
add-sqr-sqrt60.7%
times-frac60.7%
sqrt-prod60.7%
sqrt-pow147.4%
metadata-eval47.4%
pow147.4%
*-commutative47.4%
associate-*r*42.7%
unpow242.7%
pow-prod-down47.4%
sqrt-pow145.8%
metadata-eval45.8%
pow145.8%
*-commutative45.8%
Applied egg-rr95.1%
Taylor expanded in x around 0 50.8%
*-commutative50.8%
associate-/l/50.8%
*-commutative50.8%
associate-/r*50.8%
Simplified50.8%
div-inv50.8%
Applied egg-rr50.8%
*-commutative50.8%
clear-num50.8%
frac-2neg50.8%
metadata-eval50.8%
associate-*r*50.8%
frac-times50.8%
metadata-eval50.8%
un-div-inv50.8%
add-sqr-sqrt27.6%
sqrt-unprod54.5%
sqr-neg54.5%
sqrt-unprod26.8%
add-sqr-sqrt58.5%
associate-*r*58.7%
Applied egg-rr58.7%
Final simplification75.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 (* c_m (* x_m s_m))))
(if (<= x_m 1.3e+33)
(/ (/ (/ (/ 1.0 s_m) x_m) c_m) t_0)
(/ (/ (/ (/ -1.0 s_m) x_m) c_m) 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);
double tmp;
if (x_m <= 1.3e+33) {
tmp = (((1.0 / s_m) / x_m) / c_m) / t_0;
} else {
tmp = (((-1.0 / s_m) / x_m) / c_m) / 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) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 1.3d+33) then
tmp = (((1.0d0 / s_m) / x_m) / c_m) / t_0
else
tmp = ((((-1.0d0) / s_m) / x_m) / c_m) / 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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.3e+33) {
tmp = (((1.0 / s_m) / x_m) / c_m) / t_0;
} else {
tmp = (((-1.0 / s_m) / x_m) / c_m) / 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 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.3e+33: tmp = (((1.0 / s_m) / x_m) / c_m) / t_0 else: tmp = (((-1.0 / s_m) / x_m) / c_m) / 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(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.3e+33) tmp = Float64(Float64(Float64(Float64(1.0 / s_m) / x_m) / c_m) / t_0); else tmp = Float64(Float64(Float64(Float64(-1.0 / s_m) / x_m) / c_m) / 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 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.3e+33)
tmp = (((1.0 / s_m) / x_m) / c_m) / t_0;
else
tmp = (((-1.0 / s_m) / x_m) / c_m) / 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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.3e+33], N[(N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(N[(-1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;x\_m \leq 1.3 \cdot 10^{+33}:\\
\;\;\;\;\frac{\frac{\frac{\frac{1}{s\_m}}{x\_m}}{c\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{\frac{-1}{s\_m}}{x\_m}}{c\_m}}{t\_0}\\
\end{array}
\end{array}
if x < 1.2999999999999999e33Initial program 66.0%
*-un-lft-identity66.0%
add-sqr-sqrt66.0%
times-frac65.9%
sqrt-prod65.9%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.9%
unpow242.9%
pow-prod-down45.9%
sqrt-pow146.5%
metadata-eval46.5%
pow146.5%
*-commutative46.5%
Applied egg-rr96.1%
Taylor expanded in x around 0 81.0%
*-commutative81.0%
associate-/l/81.0%
*-commutative81.0%
associate-/r*81.1%
Simplified81.1%
div-inv81.0%
Applied egg-rr81.0%
associate-*r*80.5%
associate-*l/80.5%
*-un-lft-identity80.5%
un-div-inv80.5%
associate-*r*81.1%
Applied egg-rr81.1%
if 1.2999999999999999e33 < x Initial program 60.7%
*-un-lft-identity60.7%
add-sqr-sqrt60.7%
times-frac60.7%
sqrt-prod60.7%
sqrt-pow147.4%
metadata-eval47.4%
pow147.4%
*-commutative47.4%
associate-*r*42.7%
unpow242.7%
pow-prod-down47.4%
sqrt-pow145.8%
metadata-eval45.8%
pow145.8%
*-commutative45.8%
Applied egg-rr95.1%
Taylor expanded in x around 0 50.8%
*-commutative50.8%
associate-/l/50.8%
*-commutative50.8%
associate-/r*50.8%
Simplified50.8%
div-inv50.8%
Applied egg-rr50.8%
Applied egg-rr58.7%
Final simplification75.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 (* c_m (* x_m s_m))))
(if (<= x_m 1.3e+33)
(/ (/ (/ (/ 1.0 s_m) x_m) c_m) t_0)
(/ (/ -1.0 (* x_m c_m)) (* s_m 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);
double tmp;
if (x_m <= 1.3e+33) {
tmp = (((1.0 / s_m) / x_m) / c_m) / t_0;
} else {
tmp = (-1.0 / (x_m * c_m)) / (s_m * 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) :: tmp
t_0 = c_m * (x_m * s_m)
if (x_m <= 1.3d+33) then
tmp = (((1.0d0 / s_m) / x_m) / c_m) / t_0
else
tmp = ((-1.0d0) / (x_m * c_m)) / (s_m * 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 = c_m * (x_m * s_m);
double tmp;
if (x_m <= 1.3e+33) {
tmp = (((1.0 / s_m) / x_m) / c_m) / t_0;
} else {
tmp = (-1.0 / (x_m * c_m)) / (s_m * 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 = c_m * (x_m * s_m) tmp = 0 if x_m <= 1.3e+33: tmp = (((1.0 / s_m) / x_m) / c_m) / t_0 else: tmp = (-1.0 / (x_m * c_m)) / (s_m * 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(c_m * Float64(x_m * s_m)) tmp = 0.0 if (x_m <= 1.3e+33) tmp = Float64(Float64(Float64(Float64(1.0 / s_m) / x_m) / c_m) / t_0); else tmp = Float64(Float64(-1.0 / Float64(x_m * c_m)) / Float64(s_m * 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 = c_m * (x_m * s_m);
tmp = 0.0;
if (x_m <= 1.3e+33)
tmp = (((1.0 / s_m) / x_m) / c_m) / t_0;
else
tmp = (-1.0 / (x_m * c_m)) / (s_m * 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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 1.3e+33], N[(N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(-1.0 / N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision] / N[(s$95$m * 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)\\
\mathbf{if}\;x\_m \leq 1.3 \cdot 10^{+33}:\\
\;\;\;\;\frac{\frac{\frac{\frac{1}{s\_m}}{x\_m}}{c\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{x\_m \cdot c\_m}}{s\_m \cdot t\_0}\\
\end{array}
\end{array}
if x < 1.2999999999999999e33Initial program 66.0%
*-un-lft-identity66.0%
add-sqr-sqrt66.0%
times-frac65.9%
sqrt-prod65.9%
sqrt-pow145.9%
metadata-eval45.9%
pow145.9%
*-commutative45.9%
associate-*r*42.9%
unpow242.9%
pow-prod-down45.9%
sqrt-pow146.5%
metadata-eval46.5%
pow146.5%
*-commutative46.5%
Applied egg-rr96.1%
Taylor expanded in x around 0 81.0%
*-commutative81.0%
associate-/l/81.0%
*-commutative81.0%
associate-/r*81.1%
Simplified81.1%
div-inv81.0%
Applied egg-rr81.0%
associate-*r*80.5%
associate-*l/80.5%
*-un-lft-identity80.5%
un-div-inv80.5%
associate-*r*81.1%
Applied egg-rr81.1%
if 1.2999999999999999e33 < x Initial program 60.7%
*-un-lft-identity60.7%
add-sqr-sqrt60.7%
times-frac60.7%
sqrt-prod60.7%
sqrt-pow147.4%
metadata-eval47.4%
pow147.4%
*-commutative47.4%
associate-*r*42.7%
unpow242.7%
pow-prod-down47.4%
sqrt-pow145.8%
metadata-eval45.8%
pow145.8%
*-commutative45.8%
Applied egg-rr95.1%
Taylor expanded in x around 0 50.8%
*-commutative50.8%
associate-/l/50.8%
*-commutative50.8%
associate-/r*50.8%
Simplified50.8%
div-inv50.8%
Applied egg-rr50.8%
clear-num50.8%
associate-*r*50.8%
div-inv50.8%
frac-times50.8%
metadata-eval50.8%
frac-times50.8%
metadata-eval50.8%
*-commutative50.8%
*-commutative50.8%
associate-*r*51.3%
clear-num51.3%
associate-/r*51.3%
frac-2neg51.3%
metadata-eval51.3%
frac-times50.6%
add-sqr-sqrt27.8%
sqrt-unprod54.7%
Applied egg-rr58.5%
Final simplification75.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 (/ 1.0 (* (* c_m s_m) (* c_m (* x_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 * s_m) * (c_m * (x_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 * s_m) * (c_m * (x_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 * s_m) * (c_m * (x_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 * s_m) * (c_m * (x_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(c_m * s_m) * Float64(c_m * Float64(x_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 * s_m) * (c_m * (x_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[(c$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$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(c\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 64.6%
Taylor expanded in x around 0 51.0%
associate-/r*51.0%
*-commutative51.0%
unpow251.0%
unpow251.0%
swap-sqr61.4%
unpow261.4%
associate-/r*61.4%
unpow261.4%
unpow261.4%
swap-sqr73.1%
unpow273.1%
*-commutative73.1%
Simplified73.1%
unpow273.1%
associate-*r*71.9%
*-commutative71.9%
associate-*l*70.9%
Applied egg-rr70.9%
pow170.9%
associate-*r*72.8%
Applied egg-rr72.8%
unpow172.8%
*-commutative72.8%
associate-*l*70.9%
*-commutative70.9%
associate-*l*66.9%
*-commutative66.9%
Simplified66.9%
Final simplification66.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 (* (* c_m s_m) (* x_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 * s_m) * (x_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 * s_m) * (x_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 * s_m) * (x_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 * s_m) * (x_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(c_m * s_m) * Float64(x_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 * s_m) * (x_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[(c$95$m * s$95$m), $MachinePrecision] * N[(x$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(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 64.6%
Taylor expanded in x around 0 51.0%
associate-/r*51.0%
*-commutative51.0%
unpow251.0%
unpow251.0%
swap-sqr61.4%
unpow261.4%
associate-/r*61.4%
unpow261.4%
unpow261.4%
swap-sqr73.1%
unpow273.1%
*-commutative73.1%
Simplified73.1%
unpow273.1%
associate-*r*71.9%
*-commutative71.9%
associate-*l*70.9%
Applied egg-rr70.9%
Final simplification70.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 (* 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.6%
Taylor expanded in x around 0 51.0%
associate-/r*51.0%
*-commutative51.0%
unpow251.0%
unpow251.0%
swap-sqr61.4%
unpow261.4%
associate-/r*61.4%
unpow261.4%
unpow261.4%
swap-sqr73.1%
unpow273.1%
*-commutative73.1%
Simplified73.1%
*-commutative73.1%
unpow273.1%
Applied egg-rr73.1%
Final simplification73.1%
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 s_m) x_m) c_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 / s_m) / x_m) / c_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 / s_m) / x_m) / c_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 / s_m) / x_m) / c_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 / s_m) / x_m) / c_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(Float64(Float64(1.0 / s_m) / x_m) / c_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 / s_m) / x_m) / c_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[(N[(N[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$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])\\
\\
\frac{\frac{\frac{\frac{1}{s\_m}}{x\_m}}{c\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 64.6%
*-un-lft-identity64.6%
add-sqr-sqrt64.6%
times-frac64.6%
sqrt-prod64.6%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
associate-*r*42.8%
unpow242.8%
pow-prod-down46.3%
sqrt-pow146.3%
metadata-eval46.3%
pow146.3%
*-commutative46.3%
Applied egg-rr95.8%
Taylor expanded in x around 0 73.2%
*-commutative73.2%
associate-/l/73.2%
*-commutative73.2%
associate-/r*73.3%
Simplified73.3%
div-inv73.2%
Applied egg-rr73.2%
associate-*r*72.8%
associate-*l/72.9%
*-un-lft-identity72.9%
un-div-inv72.9%
associate-*r*73.3%
Applied egg-rr73.3%
Final simplification73.3%
herbie shell --seed 2024060
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))