
(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 11 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 2.95e-8) (/ (* (/ -1.0 (* x_m s_m)) (/ -1.0 c_m)) (* (* x_m s_m) c_m)) (/ (/ (cos (* x_m 2.0)) s_m) (* (* x_m c_m) (* s_m (* x_m c_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 2.95e-8) {
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m);
} else {
tmp = (cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (x_m <= 2.95d-8) then
tmp = (((-1.0d0) / (x_m * s_m)) * ((-1.0d0) / c_m)) / ((x_m * s_m) * c_m)
else
tmp = (cos((x_m * 2.0d0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double tmp;
if (x_m <= 2.95e-8) {
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m);
} else {
tmp = (Math.cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): tmp = 0 if x_m <= 2.95e-8: tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m) else: tmp = (math.cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) tmp = 0.0 if (x_m <= 2.95e-8) tmp = Float64(Float64(Float64(-1.0 / Float64(x_m * s_m)) * Float64(-1.0 / c_m)) / Float64(Float64(x_m * s_m) * c_m)); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / s_m) / Float64(Float64(x_m * c_m) * Float64(s_m * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
tmp = 0.0;
if (x_m <= 2.95e-8)
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m);
else
tmp = (cos((x_m * 2.0)) / s_m) / ((x_m * c_m) * (s_m * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := If[LessEqual[x$95$m, 2.95e-8], N[(N[(N[(-1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x\_m \leq 2.95 \cdot 10^{-8}:\\
\;\;\;\;\frac{\frac{-1}{x\_m \cdot s\_m} \cdot \frac{-1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m}}{\left(x\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 2.9499999999999999e-8Initial program 75.1%
Taylor expanded in x around 0 65.1%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
unpow265.1%
swap-sqr78.6%
unpow278.6%
associate-/r*79.0%
unpow279.0%
unpow279.0%
swap-sqr88.5%
unpow288.5%
*-commutative88.5%
Simplified88.5%
*-commutative88.5%
metadata-eval88.5%
unpow288.5%
frac-times88.7%
Applied egg-rr88.7%
associate-/l/88.7%
associate-/r*88.7%
frac-2neg88.7%
frac-times88.7%
distribute-neg-frac88.7%
metadata-eval88.7%
Applied egg-rr88.7%
if 2.9499999999999999e-8 < x Initial program 65.8%
associate-/l/65.8%
remove-double-neg65.8%
distribute-frac-neg65.8%
distribute-neg-frac65.8%
remove-double-neg65.8%
*-commutative65.8%
associate-*r*60.1%
unpow260.1%
associate-/r*60.0%
cos-neg60.0%
*-commutative60.0%
distribute-rgt-neg-in60.0%
metadata-eval60.0%
Simplified60.0%
associate-/l/60.1%
*-un-lft-identity60.1%
add-sqr-sqrt60.1%
times-frac60.1%
pow-prod-down60.1%
sqrt-pow147.7%
metadata-eval47.7%
pow147.7%
*-commutative47.7%
add-sqr-sqrt0.0%
sqrt-unprod22.4%
*-commutative22.4%
*-commutative22.4%
swap-sqr22.4%
metadata-eval22.4%
metadata-eval22.4%
swap-sqr22.4%
sqrt-unprod47.8%
add-sqr-sqrt47.7%
Applied egg-rr75.4%
div-inv74.0%
frac-times73.7%
*-un-lft-identity73.7%
pow273.7%
frac-times75.1%
unpow-prod-down97.2%
*-commutative97.2%
unpow297.2%
frac-times97.9%
div-inv97.9%
*-un-lft-identity97.9%
associate-*r*96.6%
times-frac92.8%
*-commutative92.8%
Applied egg-rr92.8%
associate-/r*94.0%
associate-/l/94.0%
*-commutative94.0%
Simplified94.0%
clear-num92.8%
associate-/r*92.8%
*-commutative92.8%
frac-times94.6%
*-un-lft-identity94.6%
div-inv94.6%
clear-num94.6%
/-rgt-identity94.6%
associate-*r*96.2%
Applied egg-rr96.2%
Final simplification90.8%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* (* x_m s_m) c_m)))
(if (<= x_m 1e-7)
(/ (* (/ -1.0 (* x_m s_m)) (/ -1.0 c_m)) t_0)
(/ (/ (cos (* x_m 2.0)) s_m) (* t_0 (* x_m c_m))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
double tmp;
if (x_m <= 1e-7) {
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / t_0;
} else {
tmp = (cos((x_m * 2.0)) / s_m) / (t_0 * (x_m * c_m));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = (x_m * s_m) * c_m
if (x_m <= 1d-7) then
tmp = (((-1.0d0) / (x_m * s_m)) * ((-1.0d0) / c_m)) / t_0
else
tmp = (cos((x_m * 2.0d0)) / s_m) / (t_0 * (x_m * c_m))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
double tmp;
if (x_m <= 1e-7) {
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / t_0;
} else {
tmp = (Math.cos((x_m * 2.0)) / s_m) / (t_0 * (x_m * c_m));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (x_m * s_m) * c_m tmp = 0 if x_m <= 1e-7: tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / t_0 else: tmp = (math.cos((x_m * 2.0)) / s_m) / (t_0 * (x_m * c_m)) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(x_m * s_m) * c_m) tmp = 0.0 if (x_m <= 1e-7) tmp = Float64(Float64(Float64(-1.0 / Float64(x_m * s_m)) * Float64(-1.0 / c_m)) / t_0); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / s_m) / Float64(t_0 * Float64(x_m * c_m))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = (x_m * s_m) * c_m;
tmp = 0.0;
if (x_m <= 1e-7)
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / t_0;
else
tmp = (cos((x_m * 2.0)) / s_m) / (t_0 * (x_m * c_m));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, If[LessEqual[x$95$m, 1e-7], N[(N[(N[(-1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / s$95$m), $MachinePrecision] / N[(t$95$0 * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
\mathbf{if}\;x\_m \leq 10^{-7}:\\
\;\;\;\;\frac{\frac{-1}{x\_m \cdot s\_m} \cdot \frac{-1}{c\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{s\_m}}{t\_0 \cdot \left(x\_m \cdot c\_m\right)}\\
\end{array}
\end{array}
if x < 9.9999999999999995e-8Initial program 75.1%
Taylor expanded in x around 0 65.1%
associate-/r*65.1%
*-commutative65.1%
unpow265.1%
unpow265.1%
swap-sqr78.6%
unpow278.6%
associate-/r*79.0%
unpow279.0%
unpow279.0%
swap-sqr88.5%
unpow288.5%
*-commutative88.5%
Simplified88.5%
*-commutative88.5%
metadata-eval88.5%
unpow288.5%
frac-times88.7%
Applied egg-rr88.7%
associate-/l/88.7%
associate-/r*88.7%
frac-2neg88.7%
frac-times88.7%
distribute-neg-frac88.7%
metadata-eval88.7%
Applied egg-rr88.7%
if 9.9999999999999995e-8 < x Initial program 65.8%
associate-/l/65.8%
remove-double-neg65.8%
distribute-frac-neg65.8%
distribute-neg-frac65.8%
remove-double-neg65.8%
*-commutative65.8%
associate-*r*60.1%
unpow260.1%
associate-/r*60.0%
cos-neg60.0%
*-commutative60.0%
distribute-rgt-neg-in60.0%
metadata-eval60.0%
Simplified60.0%
associate-/l/60.1%
*-un-lft-identity60.1%
add-sqr-sqrt60.1%
times-frac60.1%
pow-prod-down60.1%
sqrt-pow147.7%
metadata-eval47.7%
pow147.7%
*-commutative47.7%
add-sqr-sqrt0.0%
sqrt-unprod22.4%
*-commutative22.4%
*-commutative22.4%
swap-sqr22.4%
metadata-eval22.4%
metadata-eval22.4%
swap-sqr22.4%
sqrt-unprod47.8%
add-sqr-sqrt47.7%
Applied egg-rr75.4%
div-inv74.0%
frac-times73.7%
*-un-lft-identity73.7%
pow273.7%
frac-times75.1%
unpow-prod-down97.2%
*-commutative97.2%
unpow297.2%
frac-times97.9%
div-inv97.9%
*-un-lft-identity97.9%
associate-*r*96.6%
times-frac92.8%
*-commutative92.8%
Applied egg-rr92.8%
associate-/r*94.0%
associate-/l/94.0%
*-commutative94.0%
Simplified94.0%
clear-num92.8%
associate-/r*92.8%
*-commutative92.8%
frac-times94.6%
*-un-lft-identity94.6%
div-inv94.6%
clear-num94.6%
/-rgt-identity94.6%
associate-*r*96.2%
Applied egg-rr96.2%
Taylor expanded in c around 0 94.6%
Final simplification90.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 (* (/ (/ (cos (* x_m 2.0)) (* x_m s_m)) c_m) (/ (/ 1.0 (* x_m s_m)) c_m)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return ((cos((x_m * 2.0)) / (x_m * s_m)) / c_m) * ((1.0 / (x_m * s_m)) / c_m);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = ((cos((x_m * 2.0d0)) / (x_m * s_m)) / c_m) * ((1.0d0 / (x_m * s_m)) / c_m)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return ((Math.cos((x_m * 2.0)) / (x_m * s_m)) / c_m) * ((1.0 / (x_m * s_m)) / c_m);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return ((math.cos((x_m * 2.0)) / (x_m * s_m)) / c_m) * ((1.0 / (x_m * s_m)) / c_m)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(x_m * s_m)) / c_m) * Float64(Float64(1.0 / Float64(x_m * s_m)) / c_m)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = ((cos((x_m * 2.0)) / (x_m * s_m)) / c_m) * ((1.0 / (x_m * s_m)) / c_m);
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$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])\\
\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{x\_m \cdot s\_m}}{c\_m} \cdot \frac{\frac{1}{x\_m \cdot s\_m}}{c\_m}
\end{array}
Initial program 72.4%
associate-/l/72.4%
remove-double-neg72.4%
distribute-frac-neg72.4%
distribute-neg-frac72.4%
remove-double-neg72.4%
*-commutative72.4%
associate-*r*66.5%
unpow266.5%
associate-/r*66.2%
cos-neg66.2%
*-commutative66.2%
distribute-rgt-neg-in66.2%
metadata-eval66.2%
Simplified66.2%
associate-/l/66.5%
*-un-lft-identity66.5%
add-sqr-sqrt66.4%
times-frac66.4%
pow-prod-down66.4%
sqrt-pow147.7%
metadata-eval47.7%
pow147.7%
*-commutative47.7%
add-sqr-sqrt26.8%
sqrt-unprod33.3%
*-commutative33.3%
*-commutative33.3%
swap-sqr33.3%
metadata-eval33.3%
metadata-eval33.3%
swap-sqr33.3%
sqrt-unprod20.5%
add-sqr-sqrt47.7%
Applied egg-rr83.1%
*-commutative83.1%
unpow283.1%
times-frac98.5%
*-commutative98.5%
Applied egg-rr98.5%
Final simplification98.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (/ (cos (* x_m 2.0)) c_m) (* (* x_m s_m) (* (* x_m s_m) c_m))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (cos((x_m * 2.0d0)) / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return (Math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return (math.cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(cos(Float64(x_m * 2.0)) / c_m) / Float64(Float64(x_m * s_m) * Float64(Float64(x_m * s_m) * c_m))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = (cos((x_m * 2.0)) / c_m) / ((x_m * s_m) * ((x_m * s_m) * c_m));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(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[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)}
\end{array}
Initial program 72.4%
*-un-lft-identity72.4%
add-sqr-sqrt72.4%
times-frac72.4%
Applied egg-rr98.5%
*-commutative98.5%
associate-/r*98.5%
frac-times96.1%
div-inv96.1%
*-commutative96.1%
Applied egg-rr96.1%
Final simplification96.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 (let* ((t_0 (* (* x_m s_m) c_m))) (/ (/ (cos (* x_m 2.0)) t_0) t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
return (cos((x_m * 2.0)) / t_0) / t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (x_m * s_m) * c_m
code = (cos((x_m * 2.0d0)) / t_0) / t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
return (Math.cos((x_m * 2.0)) / t_0) / t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (x_m * s_m) * c_m return (math.cos((x_m * 2.0)) / t_0) / t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(x_m * s_m) * c_m) return Float64(Float64(cos(Float64(x_m * 2.0)) / t_0) / t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = (x_m * s_m) * c_m;
tmp = (cos((x_m * 2.0)) / t_0) / t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
\frac{\frac{\cos \left(x\_m \cdot 2\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 72.4%
*-un-lft-identity72.4%
add-sqr-sqrt72.4%
times-frac72.4%
Applied egg-rr98.5%
*-commutative98.5%
div-inv98.5%
div-inv98.5%
div-inv98.5%
*-commutative98.5%
Applied egg-rr98.5%
Final simplification98.5%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (/ 1.0 (* (* x_m s_m) c_m)))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / ((x_m * s_m) * c_m);
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = 1.0d0 / ((x_m * s_m) * c_m)
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / ((x_m * s_m) * c_m);
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / ((x_m * s_m) * c_m) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(Float64(x_m * s_m) * c_m)) return Float64(t_0 * t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = 1.0 / ((x_m * s_m) * c_m);
tmp = t_0 * t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(1.0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{\left(x\_m \cdot s\_m\right) \cdot c\_m}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 72.4%
Taylor expanded in x around 0 61.0%
associate-/r*60.6%
*-commutative60.6%
unpow260.6%
unpow260.6%
swap-sqr71.9%
unpow271.9%
associate-/r*72.6%
unpow272.6%
unpow272.6%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
*-commutative80.6%
metadata-eval80.6%
unpow280.6%
frac-times80.7%
Applied egg-rr80.7%
Final simplification80.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (* (/ (/ 1.0 (* x_m s_m)) c_m) (/ (/ (/ 1.0 s_m) x_m) c_m)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return ((1.0 / (x_m * s_m)) / c_m) * (((1.0 / s_m) / x_m) / c_m);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = ((1.0d0 / (x_m * s_m)) / c_m) * (((1.0d0 / s_m) / x_m) / c_m)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return ((1.0 / (x_m * s_m)) / c_m) * (((1.0 / s_m) / x_m) / c_m);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return ((1.0 / (x_m * s_m)) / c_m) * (((1.0 / s_m) / x_m) / c_m)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(Float64(1.0 / Float64(x_m * s_m)) / c_m) * Float64(Float64(Float64(1.0 / s_m) / x_m) / c_m)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = ((1.0 / (x_m * s_m)) / c_m) * (((1.0 / s_m) / x_m) / c_m);
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(N[(1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(N[(N[(1.0 / s$95$m), $MachinePrecision] / x$95$m), $MachinePrecision] / c$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])\\
\\
\frac{\frac{1}{x\_m \cdot s\_m}}{c\_m} \cdot \frac{\frac{\frac{1}{s\_m}}{x\_m}}{c\_m}
\end{array}
Initial program 72.4%
associate-/l/72.4%
remove-double-neg72.4%
distribute-frac-neg72.4%
distribute-neg-frac72.4%
remove-double-neg72.4%
*-commutative72.4%
associate-*r*66.5%
unpow266.5%
associate-/r*66.2%
cos-neg66.2%
*-commutative66.2%
distribute-rgt-neg-in66.2%
metadata-eval66.2%
Simplified66.2%
associate-/l/66.5%
*-un-lft-identity66.5%
add-sqr-sqrt66.4%
times-frac66.4%
pow-prod-down66.4%
sqrt-pow147.7%
metadata-eval47.7%
pow147.7%
*-commutative47.7%
add-sqr-sqrt26.8%
sqrt-unprod33.3%
*-commutative33.3%
*-commutative33.3%
swap-sqr33.3%
metadata-eval33.3%
metadata-eval33.3%
swap-sqr33.3%
sqrt-unprod20.5%
add-sqr-sqrt47.7%
Applied egg-rr83.1%
*-commutative83.1%
unpow283.1%
times-frac98.5%
*-commutative98.5%
Applied egg-rr98.5%
Taylor expanded in x around 0 80.7%
associate-/r*80.7%
Simplified80.7%
Final simplification80.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ (* (/ -1.0 (* x_m s_m)) (/ -1.0 c_m)) (* (* x_m s_m) c_m)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = (((-1.0d0) / (x_m * s_m)) * ((-1.0d0) / c_m)) / ((x_m * s_m) * c_m)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(Float64(Float64(-1.0 / Float64(x_m * s_m)) * Float64(-1.0 / c_m)) / Float64(Float64(x_m * s_m) * c_m)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = ((-1.0 / (x_m * s_m)) * (-1.0 / c_m)) / ((x_m * s_m) * c_m);
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(N[(N[(-1.0 / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$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])\\
\\
\frac{\frac{-1}{x\_m \cdot s\_m} \cdot \frac{-1}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot c\_m}
\end{array}
Initial program 72.4%
Taylor expanded in x around 0 61.0%
associate-/r*60.6%
*-commutative60.6%
unpow260.6%
unpow260.6%
swap-sqr71.9%
unpow271.9%
associate-/r*72.6%
unpow272.6%
unpow272.6%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
*-commutative80.6%
metadata-eval80.6%
unpow280.6%
frac-times80.7%
Applied egg-rr80.7%
associate-/l/80.7%
associate-/r*80.7%
frac-2neg80.7%
frac-times80.7%
distribute-neg-frac80.7%
metadata-eval80.7%
Applied egg-rr80.7%
Final simplification80.7%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* s_m c_m) (* s_m (* x_m (* x_m c_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(s_m * c_m) * Float64(s_m * Float64(x_m * Float64(x_m * c_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((s_m * c_m) * (s_m * (x_m * (x_m * c_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(x$95$m * N[(x$95$m * c$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(s\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(x\_m \cdot \left(x\_m \cdot c\_m\right)\right)\right)}
\end{array}
Initial program 72.4%
Taylor expanded in x around 0 61.0%
associate-/r*60.6%
*-commutative60.6%
unpow260.6%
unpow260.6%
swap-sqr71.9%
unpow271.9%
associate-/r*72.6%
unpow272.6%
unpow272.6%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
unpow280.6%
associate-*r*79.5%
*-commutative79.5%
associate-*l*77.6%
Applied egg-rr77.6%
pow177.6%
associate-*r*76.5%
associate-*r*75.4%
Applied egg-rr75.4%
unpow175.4%
*-commutative75.4%
associate-*l*75.4%
Simplified75.4%
Final simplification75.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 (/ 1.0 (* (* s_m c_m) (* x_m (* (* x_m s_m) c_m)))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_m)));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_m)))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_m)));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_m)))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(s_m * c_m) * Float64(x_m * Float64(Float64(x_m * s_m) * c_m)))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((s_m * c_m) * (x_m * ((x_m * s_m) * c_m)));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(s$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(s\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot c\_m\right)\right)}
\end{array}
Initial program 72.4%
Taylor expanded in x around 0 61.0%
associate-/r*60.6%
*-commutative60.6%
unpow260.6%
unpow260.6%
swap-sqr71.9%
unpow271.9%
associate-/r*72.6%
unpow272.6%
unpow272.6%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
unpow280.6%
associate-*r*79.5%
*-commutative79.5%
associate-*l*77.6%
Applied egg-rr77.6%
Final simplification77.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 (* (* x_m s_m) c_m))) (/ 1.0 (* t_0 t_0))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
return 1.0 / (t_0 * t_0);
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = (x_m * s_m) * c_m
code = 1.0d0 / (t_0 * t_0)
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = (x_m * s_m) * c_m;
return 1.0 / (t_0 * t_0);
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = (x_m * s_m) * c_m return 1.0 / (t_0 * t_0)
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(Float64(x_m * s_m) * c_m) return Float64(1.0 / Float64(t_0 * t_0)) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = (x_m * s_m) * c_m;
tmp = 1.0 / (t_0 * t_0);
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[(x$95$m * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \left(x\_m \cdot s\_m\right) \cdot c\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 72.4%
Taylor expanded in x around 0 61.0%
associate-/r*60.6%
*-commutative60.6%
unpow260.6%
unpow260.6%
swap-sqr71.9%
unpow271.9%
associate-/r*72.6%
unpow272.6%
unpow272.6%
swap-sqr80.6%
unpow280.6%
*-commutative80.6%
Simplified80.6%
*-commutative80.6%
unpow280.6%
Applied egg-rr80.6%
Final simplification80.6%
herbie shell --seed 2024112
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))