
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (* (/ -1.0 (* (* c_m x) (- s_m))) (/ (/ (cos (* x 2.0)) (* c_m x)) s_m)))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return (-1.0 / ((c_m * x) * -s_m)) * ((cos((x * 2.0)) / (c_m * x)) / s_m);
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = ((-1.0d0) / ((c_m * x) * -s_m)) * ((cos((x * 2.0d0)) / (c_m * x)) / s_m)
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return (-1.0 / ((c_m * x) * -s_m)) * ((Math.cos((x * 2.0)) / (c_m * x)) / s_m);
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return (-1.0 / ((c_m * x) * -s_m)) * ((math.cos((x * 2.0)) / (c_m * x)) / s_m)
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(Float64(-1.0 / Float64(Float64(c_m * x) * Float64(-s_m))) * Float64(Float64(cos(Float64(x * 2.0)) / Float64(c_m * x)) / s_m)) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = (-1.0 / ((c_m * x) * -s_m)) * ((cos((x * 2.0)) / (c_m * x)) / s_m);
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(N[(-1.0 / N[(N[(c$95$m * x), $MachinePrecision] * (-s$95$m)), $MachinePrecision]), $MachinePrecision] * N[(N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(c$95$m * x), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{-1}{\left(c_m \cdot x\right) \cdot \left(-s_m\right)} \cdot \frac{\frac{\cos \left(x \cdot 2\right)}{c_m \cdot x}}{s_m}
\end{array}
Initial program 63.6%
*-un-lft-identity63.6%
add-sqr-sqrt63.5%
times-frac63.5%
Applied egg-rr98.1%
*-un-lft-identity98.1%
associate-*r*96.4%
times-frac96.1%
*-commutative96.1%
Applied egg-rr96.1%
unpow-196.1%
associate-*r/96.0%
unpow-196.0%
associate-*l/96.0%
*-lft-identity96.0%
Simplified96.0%
frac-2neg96.0%
metadata-eval96.0%
div-inv96.0%
*-commutative96.0%
associate-*r*93.0%
distribute-rgt-neg-in93.0%
Applied egg-rr93.0%
associate-*r/93.0%
metadata-eval93.0%
distribute-rgt-neg-out93.0%
associate-*r*96.0%
*-commutative96.0%
associate-*r*97.4%
distribute-rgt-neg-in97.4%
Simplified97.4%
Final simplification97.4%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ (/ (cos (* x 2.0)) c_m) (* (* x s_m) (* c_m (* x s_m)))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return (cos((x * 2.0)) / c_m) / ((x * s_m) * (c_m * (x * s_m)));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (cos((x * 2.0d0)) / c_m) / ((x * s_m) * (c_m * (x * s_m)))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return (Math.cos((x * 2.0)) / c_m) / ((x * s_m) * (c_m * (x * s_m)));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return (math.cos((x * 2.0)) / c_m) / ((x * s_m) * (c_m * (x * s_m)))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(Float64(cos(Float64(x * 2.0)) / c_m) / Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m)))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = (cos((x * 2.0)) / c_m) / ((x * s_m) * (c_m * (x * s_m)));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] / N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{\frac{\cos \left(x \cdot 2\right)}{c_m}}{\left(x \cdot s_m\right) \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)}
\end{array}
Initial program 63.6%
*-un-lft-identity63.6%
add-sqr-sqrt63.5%
times-frac63.5%
Applied egg-rr98.1%
*-commutative98.1%
associate-/r*98.2%
frac-times91.7%
div-inv91.7%
*-commutative91.7%
Applied egg-rr91.7%
Final simplification91.7%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* c_m (* x s_m)))) (/ (/ (cos (* x 2.0)) t_0) t_0)))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
return (cos((x * 2.0)) / t_0) / t_0;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = c_m * (x * s_m)
code = (cos((x * 2.0d0)) / t_0) / t_0
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
return (Math.cos((x * 2.0)) / t_0) / t_0;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = c_m * (x * s_m) return (math.cos((x * 2.0)) / t_0) / t_0
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) return Float64(Float64(cos(Float64(x * 2.0)) / t_0) / t_0) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = c_m * (x * s_m);
tmp = (cos((x * 2.0)) / t_0) / t_0;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x \cdot s_m\right)\\
\frac{\frac{\cos \left(x \cdot 2\right)}{t_0}}{t_0}
\end{array}
\end{array}
Initial program 63.6%
*-un-lft-identity63.6%
add-sqr-sqrt63.5%
times-frac63.5%
Applied egg-rr98.1%
associate-*l/98.1%
*-un-lft-identity98.1%
div-inv98.2%
div-inv98.1%
*-commutative98.1%
Applied egg-rr98.1%
Final simplification98.1%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (if (<= x 3.25e+162) (/ (/ 1.0 c_m) (* (* x s_m) (* c_m (* x s_m)))) (/ (/ -1.0 (* c_m x)) (* (* c_m x) (pow s_m 2.0)))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if (x <= 3.25e+162) {
tmp = (1.0 / c_m) / ((x * s_m) * (c_m * (x * s_m)));
} else {
tmp = (-1.0 / (c_m * x)) / ((c_m * x) * pow(s_m, 2.0));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x <= 3.25d+162) then
tmp = (1.0d0 / c_m) / ((x * s_m) * (c_m * (x * s_m)))
else
tmp = ((-1.0d0) / (c_m * x)) / ((c_m * x) * (s_m ** 2.0d0))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if (x <= 3.25e+162) {
tmp = (1.0 / c_m) / ((x * s_m) * (c_m * (x * s_m)));
} else {
tmp = (-1.0 / (c_m * x)) / ((c_m * x) * Math.pow(s_m, 2.0));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if x <= 3.25e+162: tmp = (1.0 / c_m) / ((x * s_m) * (c_m * (x * s_m))) else: tmp = (-1.0 / (c_m * x)) / ((c_m * x) * math.pow(s_m, 2.0)) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (x <= 3.25e+162) tmp = Float64(Float64(1.0 / c_m) / Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m)))); else tmp = Float64(Float64(-1.0 / Float64(c_m * x)) / Float64(Float64(c_m * x) * (s_m ^ 2.0))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if (x <= 3.25e+162)
tmp = (1.0 / c_m) / ((x * s_m) * (c_m * (x * s_m)));
else
tmp = (-1.0 / (c_m * x)) / ((c_m * x) * (s_m ^ 2.0));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[x, 3.25e+162], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / N[(c$95$m * x), $MachinePrecision]), $MachinePrecision] / N[(N[(c$95$m * x), $MachinePrecision] * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 3.25 \cdot 10^{+162}:\\
\;\;\;\;\frac{\frac{1}{c_m}}{\left(x \cdot s_m\right) \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{c_m \cdot x}}{\left(c_m \cdot x\right) \cdot {s_m}^{2}}\\
\end{array}
\end{array}
if x < 3.2500000000000002e162Initial program 63.5%
*-un-lft-identity63.5%
add-sqr-sqrt63.5%
times-frac63.5%
Applied egg-rr97.9%
*-un-lft-identity97.9%
associate-*r*97.2%
times-frac96.8%
*-commutative96.8%
Applied egg-rr96.8%
unpow-196.8%
associate-*r/96.8%
unpow-196.8%
associate-*l/96.8%
*-lft-identity96.8%
Simplified96.8%
Taylor expanded in x around 0 78.5%
associate-/r*78.5%
Simplified78.5%
associate-/l/79.0%
*-commutative79.0%
frac-times75.0%
*-un-lft-identity75.0%
Applied egg-rr75.0%
if 3.2500000000000002e162 < x Initial program 63.7%
*-un-lft-identity63.7%
add-sqr-sqrt63.7%
times-frac63.7%
Applied egg-rr99.7%
*-un-lft-identity99.7%
associate-*r*90.1%
times-frac90.0%
*-commutative90.0%
Applied egg-rr90.0%
unpow-190.0%
associate-*r/90.0%
unpow-190.0%
associate-*l/90.0%
*-lft-identity90.0%
Simplified90.0%
Taylor expanded in x around 0 67.7%
associate-/r*67.7%
Simplified67.7%
frac-2neg67.7%
metadata-eval67.7%
associate-*r*67.7%
distribute-rgt-neg-out67.7%
frac-times67.7%
associate-/l/67.7%
*-commutative67.7%
div-inv67.7%
add-sqr-sqrt32.2%
sqrt-unprod64.2%
sqr-neg64.2%
sqrt-unprod37.5%
add-sqr-sqrt73.4%
associate-*l*68.6%
pow268.6%
Applied egg-rr68.6%
Final simplification74.2%
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x s_m))))
(if (<= x 3.25e+162)
(/ (/ 1.0 c_m) (* (* x s_m) t_0))
(/ 1.0 (* (* s_m t_0) (* c_m (- x)))))))c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double tmp;
if (x <= 3.25e+162) {
tmp = (1.0 / c_m) / ((x * s_m) * t_0);
} else {
tmp = 1.0 / ((s_m * t_0) * (c_m * -x));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x * s_m)
if (x <= 3.25d+162) then
tmp = (1.0d0 / c_m) / ((x * s_m) * t_0)
else
tmp = 1.0d0 / ((s_m * t_0) * (c_m * -x))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = c_m * (x * s_m);
double tmp;
if (x <= 3.25e+162) {
tmp = (1.0 / c_m) / ((x * s_m) * t_0);
} else {
tmp = 1.0 / ((s_m * t_0) * (c_m * -x));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = c_m * (x * s_m) tmp = 0 if x <= 3.25e+162: tmp = (1.0 / c_m) / ((x * s_m) * t_0) else: tmp = 1.0 / ((s_m * t_0) * (c_m * -x)) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (x <= 3.25e+162) tmp = Float64(Float64(1.0 / c_m) / Float64(Float64(x * s_m) * t_0)); else tmp = Float64(1.0 / Float64(Float64(s_m * t_0) * Float64(c_m * Float64(-x)))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = c_m * (x * s_m);
tmp = 0.0;
if (x <= 3.25e+162)
tmp = (1.0 / c_m) / ((x * s_m) * t_0);
else
tmp = 1.0 / ((s_m * t_0) * (c_m * -x));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 3.25e+162], N[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x * s$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(s$95$m * t$95$0), $MachinePrecision] * N[(c$95$m * (-x)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c_m \cdot \left(x \cdot s_m\right)\\
\mathbf{if}\;x \leq 3.25 \cdot 10^{+162}:\\
\;\;\;\;\frac{\frac{1}{c_m}}{\left(x \cdot s_m\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(s_m \cdot t_0\right) \cdot \left(c_m \cdot \left(-x\right)\right)}\\
\end{array}
\end{array}
if x < 3.2500000000000002e162Initial program 63.5%
*-un-lft-identity63.5%
add-sqr-sqrt63.5%
times-frac63.5%
Applied egg-rr97.9%
*-un-lft-identity97.9%
associate-*r*97.2%
times-frac96.8%
*-commutative96.8%
Applied egg-rr96.8%
unpow-196.8%
associate-*r/96.8%
unpow-196.8%
associate-*l/96.8%
*-lft-identity96.8%
Simplified96.8%
Taylor expanded in x around 0 78.5%
associate-/r*78.5%
Simplified78.5%
associate-/l/79.0%
*-commutative79.0%
frac-times75.0%
*-un-lft-identity75.0%
Applied egg-rr75.0%
if 3.2500000000000002e162 < x Initial program 63.7%
Taylor expanded in x around 0 59.2%
associate-/r*55.7%
*-commutative55.7%
unpow255.7%
unpow255.7%
swap-sqr61.3%
unpow261.3%
associate-/r*64.7%
unpow264.7%
unpow264.7%
swap-sqr68.1%
unpow268.1%
*-commutative68.1%
Simplified68.1%
unpow268.1%
associate-*r*68.1%
*-commutative68.1%
associate-*l*67.9%
Applied egg-rr67.9%
add-sqr-sqrt67.9%
sqrt-unprod67.9%
sqr-neg67.9%
associate-*r*67.9%
*-commutative67.9%
associate-*l*67.9%
unpow267.9%
associate-*r*67.9%
*-commutative67.9%
associate-*l*67.9%
unpow267.9%
sqrt-unprod0.0%
add-sqr-sqrt74.3%
Applied egg-rr70.1%
neg-sub074.3%
*-commutative74.3%
associate-*r*75.0%
*-commutative75.0%
Simplified75.0%
unpow275.0%
associate-*r*73.7%
associate-*l*73.4%
Applied egg-rr73.4%
Final simplification74.8%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (if (<= s_m 2.05e+189) (/ 1.0 (* (* c_m x) (* s_m (* c_m (* x s_m))))) (/ 1.0 (* (* c_m s_m) (* x (* x (* c_m s_m)))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if (s_m <= 2.05e+189) {
tmp = 1.0 / ((c_m * x) * (s_m * (c_m * (x * s_m))));
} else {
tmp = 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))));
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (s_m <= 2.05d+189) then
tmp = 1.0d0 / ((c_m * x) * (s_m * (c_m * (x * s_m))))
else
tmp = 1.0d0 / ((c_m * s_m) * (x * (x * (c_m * s_m))))
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if (s_m <= 2.05e+189) {
tmp = 1.0 / ((c_m * x) * (s_m * (c_m * (x * s_m))));
} else {
tmp = 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))));
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if s_m <= 2.05e+189: tmp = 1.0 / ((c_m * x) * (s_m * (c_m * (x * s_m)))) else: tmp = 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m)))) return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (s_m <= 2.05e+189) tmp = Float64(1.0 / Float64(Float64(c_m * x) * Float64(s_m * Float64(c_m * Float64(x * s_m))))); else tmp = Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x * Float64(x * Float64(c_m * s_m))))); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if (s_m <= 2.05e+189)
tmp = 1.0 / ((c_m * x) * (s_m * (c_m * (x * s_m))));
else
tmp = 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))));
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[s$95$m, 2.05e+189], N[(1.0 / N[(N[(c$95$m * x), $MachinePrecision] * N[(s$95$m * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;s_m \leq 2.05 \cdot 10^{+189}:\\
\;\;\;\;\frac{1}{\left(c_m \cdot x\right) \cdot \left(s_m \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(c_m \cdot s_m\right) \cdot \left(x \cdot \left(x \cdot \left(c_m \cdot s_m\right)\right)\right)}\\
\end{array}
\end{array}
if s < 2.0500000000000001e189Initial program 63.4%
Taylor expanded in x around 0 53.3%
associate-/r*52.9%
*-commutative52.9%
unpow252.9%
unpow252.9%
swap-sqr62.0%
unpow262.0%
associate-/r*62.4%
unpow262.4%
unpow262.4%
swap-sqr75.7%
unpow275.7%
*-commutative75.7%
Simplified75.7%
*-commutative75.7%
pow275.7%
associate-*r*75.6%
associate-*l*74.2%
Applied egg-rr74.2%
if 2.0500000000000001e189 < s Initial program 65.2%
Taylor expanded in x around 0 60.0%
associate-/r*60.0%
*-commutative60.0%
unpow260.0%
unpow260.0%
swap-sqr84.4%
unpow284.4%
associate-/r*84.4%
unpow284.4%
unpow284.4%
swap-sqr95.8%
unpow295.8%
*-commutative95.8%
Simplified95.8%
unpow295.8%
associate-*r*84.9%
*-commutative84.9%
associate-*l*84.8%
Applied egg-rr84.8%
Taylor expanded in c around 0 84.8%
associate-*r*84.9%
Simplified84.9%
Final simplification75.2%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* (* x s_m) (* c_m (* x s_m))))) (if (<= x 3.25e+162) (/ 1.0 (* c_m t_0)) (/ (/ -1.0 c_m) t_0))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = (x * s_m) * (c_m * (x * s_m));
double tmp;
if (x <= 3.25e+162) {
tmp = 1.0 / (c_m * t_0);
} else {
tmp = (-1.0 / c_m) / t_0;
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (x * s_m) * (c_m * (x * s_m))
if (x <= 3.25d+162) then
tmp = 1.0d0 / (c_m * t_0)
else
tmp = ((-1.0d0) / c_m) / t_0
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = (x * s_m) * (c_m * (x * s_m));
double tmp;
if (x <= 3.25e+162) {
tmp = 1.0 / (c_m * t_0);
} else {
tmp = (-1.0 / c_m) / t_0;
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = (x * s_m) * (c_m * (x * s_m)) tmp = 0 if x <= 3.25e+162: tmp = 1.0 / (c_m * t_0) else: tmp = (-1.0 / c_m) / t_0 return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m))) tmp = 0.0 if (x <= 3.25e+162) tmp = Float64(1.0 / Float64(c_m * t_0)); else tmp = Float64(Float64(-1.0 / c_m) / t_0); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = (x * s_m) * (c_m * (x * s_m));
tmp = 0.0;
if (x <= 3.25e+162)
tmp = 1.0 / (c_m * t_0);
else
tmp = (-1.0 / c_m) / t_0;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 3.25e+162], N[(1.0 / N[(c$95$m * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / c$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot s_m\right) \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\\
\mathbf{if}\;x \leq 3.25 \cdot 10^{+162}:\\
\;\;\;\;\frac{1}{c_m \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{c_m}}{t_0}\\
\end{array}
\end{array}
if x < 3.2500000000000002e162Initial program 63.5%
Taylor expanded in x around 0 53.3%
associate-/r*53.3%
*-commutative53.3%
unpow253.3%
unpow253.3%
swap-sqr64.6%
unpow264.6%
associate-/r*64.5%
unpow264.5%
unpow264.5%
swap-sqr78.8%
unpow278.8%
*-commutative78.8%
Simplified78.8%
*-commutative78.8%
pow278.8%
*-commutative78.8%
associate-*r*74.8%
Applied egg-rr74.8%
if 3.2500000000000002e162 < x Initial program 63.7%
*-un-lft-identity63.7%
add-sqr-sqrt63.7%
times-frac63.7%
Applied egg-rr99.7%
*-un-lft-identity99.7%
associate-*r*90.1%
times-frac90.0%
*-commutative90.0%
Applied egg-rr90.0%
unpow-190.0%
associate-*r/90.0%
unpow-190.0%
associate-*l/90.0%
*-lft-identity90.0%
Simplified90.0%
Taylor expanded in x around 0 67.7%
associate-/r*67.7%
Simplified67.7%
associate-/l/68.1%
*-commutative68.1%
frac-2neg68.1%
metadata-eval68.1%
associate-*r*67.7%
distribute-rgt-neg-out67.7%
frac-times67.8%
neg-mul-167.8%
distribute-neg-frac67.8%
metadata-eval67.8%
add-sqr-sqrt32.3%
sqrt-unprod63.6%
sqr-neg63.6%
sqrt-unprod36.9%
add-sqr-sqrt72.3%
associate-*r*73.6%
Applied egg-rr73.6%
Final simplification74.7%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* (* x s_m) (* c_m (* x s_m))))) (if (<= x 3.25e+162) (/ (/ 1.0 c_m) t_0) (/ (/ -1.0 c_m) t_0))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = (x * s_m) * (c_m * (x * s_m));
double tmp;
if (x <= 3.25e+162) {
tmp = (1.0 / c_m) / t_0;
} else {
tmp = (-1.0 / c_m) / t_0;
}
return tmp;
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (x * s_m) * (c_m * (x * s_m))
if (x <= 3.25d+162) then
tmp = (1.0d0 / c_m) / t_0
else
tmp = ((-1.0d0) / c_m) / t_0
end if
code = tmp
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = (x * s_m) * (c_m * (x * s_m));
double tmp;
if (x <= 3.25e+162) {
tmp = (1.0 / c_m) / t_0;
} else {
tmp = (-1.0 / c_m) / t_0;
}
return tmp;
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = (x * s_m) * (c_m * (x * s_m)) tmp = 0 if x <= 3.25e+162: tmp = (1.0 / c_m) / t_0 else: tmp = (-1.0 / c_m) / t_0 return tmp
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m))) tmp = 0.0 if (x <= 3.25e+162) tmp = Float64(Float64(1.0 / c_m) / t_0); else tmp = Float64(Float64(-1.0 / c_m) / t_0); end return tmp end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = (x * s_m) * (c_m * (x * s_m));
tmp = 0.0;
if (x <= 3.25e+162)
tmp = (1.0 / c_m) / t_0;
else
tmp = (-1.0 / c_m) / t_0;
end
tmp_2 = tmp;
end
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 3.25e+162], N[(N[(1.0 / c$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(-1.0 / c$95$m), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x \cdot s_m\right) \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\\
\mathbf{if}\;x \leq 3.25 \cdot 10^{+162}:\\
\;\;\;\;\frac{\frac{1}{c_m}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-1}{c_m}}{t_0}\\
\end{array}
\end{array}
if x < 3.2500000000000002e162Initial program 63.5%
*-un-lft-identity63.5%
add-sqr-sqrt63.5%
times-frac63.5%
Applied egg-rr97.9%
*-un-lft-identity97.9%
associate-*r*97.2%
times-frac96.8%
*-commutative96.8%
Applied egg-rr96.8%
unpow-196.8%
associate-*r/96.8%
unpow-196.8%
associate-*l/96.8%
*-lft-identity96.8%
Simplified96.8%
Taylor expanded in x around 0 78.5%
associate-/r*78.5%
Simplified78.5%
associate-/l/79.0%
*-commutative79.0%
frac-times75.0%
*-un-lft-identity75.0%
Applied egg-rr75.0%
if 3.2500000000000002e162 < x Initial program 63.7%
*-un-lft-identity63.7%
add-sqr-sqrt63.7%
times-frac63.7%
Applied egg-rr99.7%
*-un-lft-identity99.7%
associate-*r*90.1%
times-frac90.0%
*-commutative90.0%
Applied egg-rr90.0%
unpow-190.0%
associate-*r/90.0%
unpow-190.0%
associate-*l/90.0%
*-lft-identity90.0%
Simplified90.0%
Taylor expanded in x around 0 67.7%
associate-/r*67.7%
Simplified67.7%
associate-/l/68.1%
*-commutative68.1%
frac-2neg68.1%
metadata-eval68.1%
associate-*r*67.7%
distribute-rgt-neg-out67.7%
frac-times67.8%
neg-mul-167.8%
distribute-neg-frac67.8%
metadata-eval67.8%
add-sqr-sqrt32.3%
sqrt-unprod63.6%
sqr-neg63.6%
sqrt-unprod36.9%
add-sqr-sqrt72.3%
associate-*r*73.6%
Applied egg-rr73.6%
Final simplification74.8%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* (* c_m s_m) (* x (* c_m (* x s_m))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * (x * (c_m * (x * s_m))))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x * Float64(c_m * Float64(x * s_m))))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * (x * (c_m * (x * s_m))));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{\left(c_m \cdot s_m\right) \cdot \left(x \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\right)}
\end{array}
Initial program 63.6%
Taylor expanded in x around 0 54.0%
associate-/r*53.6%
*-commutative53.6%
unpow253.6%
unpow253.6%
swap-sqr64.2%
unpow264.2%
associate-/r*64.6%
unpow264.6%
unpow264.6%
swap-sqr77.6%
unpow277.6%
*-commutative77.6%
Simplified77.6%
unpow277.6%
associate-*r*75.4%
*-commutative75.4%
associate-*l*73.4%
Applied egg-rr73.4%
Final simplification73.4%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* (* c_m s_m) (* x (* x (* c_m s_m))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * (x * (x * (c_m * s_m))))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x * Float64(x * Float64(c_m * s_m))))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * (x * (x * (c_m * s_m))));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{\left(c_m \cdot s_m\right) \cdot \left(x \cdot \left(x \cdot \left(c_m \cdot s_m\right)\right)\right)}
\end{array}
Initial program 63.6%
Taylor expanded in x around 0 54.0%
associate-/r*53.6%
*-commutative53.6%
unpow253.6%
unpow253.6%
swap-sqr64.2%
unpow264.2%
associate-/r*64.6%
unpow264.6%
unpow264.6%
swap-sqr77.6%
unpow277.6%
*-commutative77.6%
Simplified77.6%
unpow277.6%
associate-*r*75.4%
*-commutative75.4%
associate-*l*73.4%
Applied egg-rr73.4%
Taylor expanded in c around 0 73.4%
associate-*r*73.7%
Simplified73.7%
Final simplification73.7%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* (* x s_m) (* c_m (* c_m (* x s_m))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((x * s_m) * (c_m * (c_m * (x * s_m))))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(Float64(x * s_m) * Float64(c_m * Float64(c_m * Float64(x * s_m))))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{\left(x \cdot s_m\right) \cdot \left(c_m \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\right)}
\end{array}
Initial program 63.6%
Taylor expanded in x around 0 54.0%
associate-/r*53.6%
*-commutative53.6%
unpow253.6%
unpow253.6%
swap-sqr64.2%
unpow264.2%
associate-/r*64.6%
unpow264.6%
unpow264.6%
swap-sqr77.6%
unpow277.6%
*-commutative77.6%
Simplified77.6%
*-commutative77.6%
pow277.6%
associate-*r*74.6%
Applied egg-rr74.6%
Final simplification74.6%
c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* c_m (* (* x s_m) (* c_m (* x s_m))))))
c_m = fabs(c);
s_m = fabs(s);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
}
c_m = abs(c)
s_m = abs(s)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x * s_m) * (c_m * (x * s_m))))
end function
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
}
c_m = math.fabs(c) s_m = math.fabs(s) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))))
c_m = abs(c) s_m = abs(s) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x * s_m) * Float64(c_m * Float64(x * s_m))))) end
c_m = abs(c);
s_m = abs(s);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / (c_m * ((x * s_m) * (c_m * (x * s_m))));
end
c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{c_m \cdot \left(\left(x \cdot s_m\right) \cdot \left(c_m \cdot \left(x \cdot s_m\right)\right)\right)}
\end{array}
Initial program 63.6%
Taylor expanded in x around 0 54.0%
associate-/r*53.6%
*-commutative53.6%
unpow253.6%
unpow253.6%
swap-sqr64.2%
unpow264.2%
associate-/r*64.6%
unpow264.6%
unpow264.6%
swap-sqr77.6%
unpow277.6%
*-commutative77.6%
Simplified77.6%
*-commutative77.6%
pow277.6%
*-commutative77.6%
associate-*r*74.0%
Applied egg-rr74.0%
Final simplification74.0%
herbie shell --seed 2023339
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))