
(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 9 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
(let* ((t_0 (* c_m (* x s_m))) (t_1 (cos (* x 2.0))))
(if (<= c_m 1.25e-203)
(/ (/ (/ t_1 s_m) (* c_m x)) (* x (* c_m s_m)))
(/ (/ t_1 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);
double t_1 = cos((x * 2.0));
double tmp;
if (c_m <= 1.25e-203) {
tmp = ((t_1 / s_m) / (c_m * x)) / (x * (c_m * s_m));
} else {
tmp = (t_1 / t_0) / 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) :: t_1
real(8) :: tmp
t_0 = c_m * (x * s_m)
t_1 = cos((x * 2.0d0))
if (c_m <= 1.25d-203) then
tmp = ((t_1 / s_m) / (c_m * x)) / (x * (c_m * s_m))
else
tmp = (t_1 / t_0) / 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 = c_m * (x * s_m);
double t_1 = Math.cos((x * 2.0));
double tmp;
if (c_m <= 1.25e-203) {
tmp = ((t_1 / s_m) / (c_m * x)) / (x * (c_m * s_m));
} else {
tmp = (t_1 / t_0) / 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 = c_m * (x * s_m) t_1 = math.cos((x * 2.0)) tmp = 0 if c_m <= 1.25e-203: tmp = ((t_1 / s_m) / (c_m * x)) / (x * (c_m * s_m)) else: tmp = (t_1 / t_0) / 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(c_m * Float64(x * s_m)) t_1 = cos(Float64(x * 2.0)) tmp = 0.0 if (c_m <= 1.25e-203) tmp = Float64(Float64(Float64(t_1 / s_m) / Float64(c_m * x)) / Float64(x * Float64(c_m * s_m))); else tmp = Float64(Float64(t_1 / t_0) / 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 = c_m * (x * s_m);
t_1 = cos((x * 2.0));
tmp = 0.0;
if (c_m <= 1.25e-203)
tmp = ((t_1 / s_m) / (c_m * x)) / (x * (c_m * s_m));
else
tmp = (t_1 / t_0) / 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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 1.25e-203], N[(N[(N[(t$95$1 / s$95$m), $MachinePrecision] / N[(c$95$m * x), $MachinePrecision]), $MachinePrecision] / N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / 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)\\
t_1 := \cos \left(x \cdot 2\right)\\
\mathbf{if}\;c_m \leq 1.25 \cdot 10^{-203}:\\
\;\;\;\;\frac{\frac{\frac{t_1}{s_m}}{c_m \cdot x}}{x \cdot \left(c_m \cdot s_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t_1}{t_0}}{t_0}\\
\end{array}
\end{array}
if c < 1.25e-203Initial program 66.1%
*-commutative66.1%
associate-*r*61.7%
unpow261.7%
pow-prod-down77.1%
Applied egg-rr77.1%
*-un-lft-identity77.1%
pow-prod-down96.4%
pow296.4%
frac-times96.4%
associate-*r/96.4%
associate-*r*95.8%
times-frac94.4%
associate-/r*94.5%
*-commutative94.5%
Applied egg-rr94.5%
*-commutative94.5%
associate-/l/93.9%
*-commutative93.9%
associate-*r*93.8%
*-commutative93.8%
associate-*r*93.1%
Simplified93.1%
*-commutative93.1%
associate-/l/93.1%
frac-times93.1%
*-un-lft-identity93.1%
associate-*r*95.0%
*-commutative95.0%
associate-*l*93.1%
*-commutative93.1%
associate-*r*93.7%
*-commutative93.7%
associate-*l*96.4%
*-commutative96.4%
associate-/l/96.4%
Applied egg-rr96.9%
*-un-lft-identity96.9%
associate-*r*96.3%
times-frac96.3%
Applied egg-rr96.3%
associate-*l/96.4%
*-lft-identity96.4%
*-commutative96.4%
Simplified96.4%
if 1.25e-203 < c Initial program 62.4%
*-un-lft-identity62.4%
add-sqr-sqrt62.4%
times-frac62.3%
Applied egg-rr98.7%
*-commutative98.7%
associate-*l/98.6%
div-inv98.7%
*-commutative98.7%
Applied egg-rr98.7%
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 (let* ((t_0 (* c_m (* x s_m))) (t_1 (cos (* x 2.0))) (t_2 (* x (* c_m s_m)))) (if (<= c_m 1.02e-232) (/ (/ t_1 t_2) t_2) (/ (/ t_1 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);
double t_1 = cos((x * 2.0));
double t_2 = x * (c_m * s_m);
double tmp;
if (c_m <= 1.02e-232) {
tmp = (t_1 / t_2) / t_2;
} else {
tmp = (t_1 / t_0) / 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_0 = c_m * (x * s_m)
t_1 = cos((x * 2.0d0))
t_2 = x * (c_m * s_m)
if (c_m <= 1.02d-232) then
tmp = (t_1 / t_2) / t_2
else
tmp = (t_1 / t_0) / 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 = c_m * (x * s_m);
double t_1 = Math.cos((x * 2.0));
double t_2 = x * (c_m * s_m);
double tmp;
if (c_m <= 1.02e-232) {
tmp = (t_1 / t_2) / t_2;
} else {
tmp = (t_1 / t_0) / 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 = c_m * (x * s_m) t_1 = math.cos((x * 2.0)) t_2 = x * (c_m * s_m) tmp = 0 if c_m <= 1.02e-232: tmp = (t_1 / t_2) / t_2 else: tmp = (t_1 / t_0) / 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(c_m * Float64(x * s_m)) t_1 = cos(Float64(x * 2.0)) t_2 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (c_m <= 1.02e-232) tmp = Float64(Float64(t_1 / t_2) / t_2); else tmp = Float64(Float64(t_1 / t_0) / 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 = c_m * (x * s_m);
t_1 = cos((x * 2.0));
t_2 = x * (c_m * s_m);
tmp = 0.0;
if (c_m <= 1.02e-232)
tmp = (t_1 / t_2) / t_2;
else
tmp = (t_1 / t_0) / 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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 1.02e-232], N[(N[(t$95$1 / t$95$2), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(t$95$1 / 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)\\
t_1 := \cos \left(x \cdot 2\right)\\
t_2 := x \cdot \left(c_m \cdot s_m\right)\\
\mathbf{if}\;c_m \leq 1.02 \cdot 10^{-232}:\\
\;\;\;\;\frac{\frac{t_1}{t_2}}{t_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t_1}{t_0}}{t_0}\\
\end{array}
\end{array}
if c < 1.0200000000000001e-232Initial program 65.8%
*-commutative65.8%
associate-*r*61.2%
unpow261.2%
pow-prod-down77.4%
Applied egg-rr77.4%
*-un-lft-identity77.4%
pow-prod-down96.2%
pow296.2%
frac-times96.2%
associate-*r/96.2%
associate-*r*95.6%
times-frac94.9%
associate-/r*95.0%
*-commutative95.0%
Applied egg-rr95.0%
*-commutative95.0%
associate-/l/94.2%
*-commutative94.2%
associate-*r*94.2%
*-commutative94.2%
associate-*r*93.4%
Simplified93.4%
*-commutative93.4%
associate-/l/93.4%
frac-times93.4%
*-un-lft-identity93.4%
associate-*r*94.8%
*-commutative94.8%
associate-*l*92.7%
*-commutative92.7%
associate-*r*93.4%
*-commutative93.4%
associate-*l*96.2%
*-commutative96.2%
associate-/l/96.2%
Applied egg-rr96.8%
if 1.0200000000000001e-232 < c Initial program 63.0%
*-un-lft-identity63.0%
add-sqr-sqrt62.9%
times-frac62.9%
Applied egg-rr98.7%
*-commutative98.7%
associate-*l/98.7%
div-inv98.7%
*-commutative98.7%
Applied egg-rr98.7%
Final simplification97.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 (/ (/ (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 64.5%
*-un-lft-identity64.5%
add-sqr-sqrt64.4%
times-frac64.4%
Applied egg-rr97.4%
*-commutative97.4%
associate-/r*97.5%
frac-times92.9%
div-inv92.9%
*-commutative92.9%
Applied egg-rr92.9%
Final simplification92.9%
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 64.5%
*-un-lft-identity64.5%
add-sqr-sqrt64.4%
times-frac64.4%
Applied egg-rr97.4%
*-commutative97.4%
associate-*l/97.4%
div-inv97.4%
*-commutative97.4%
Applied egg-rr97.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 (* (/ 1.0 (* c_m (* x s_m))) (/ (/ 1.0 (* x s_m)) c_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))) * ((1.0 / (x * s_m)) / c_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))) * ((1.0d0 / (x * s_m)) / c_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))) * ((1.0 / (x * s_m)) / c_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))) * ((1.0 / (x * s_m)) / c_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(c_m * Float64(x * s_m))) * Float64(Float64(1.0 / Float64(x * s_m)) / c_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))) * ((1.0 / (x * s_m)) / c_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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] / c$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}{c_m \cdot \left(x \cdot s_m\right)} \cdot \frac{\frac{1}{x \cdot s_m}}{c_m}
\end{array}
Initial program 64.5%
*-un-lft-identity64.5%
add-sqr-sqrt64.4%
times-frac64.4%
Applied egg-rr97.4%
Taylor expanded in x around 0 77.3%
associate-/r*77.3%
*-commutative77.3%
*-rgt-identity77.3%
associate-*r/77.3%
associate-*l/77.3%
*-lft-identity77.3%
*-commutative77.3%
Simplified77.3%
Final simplification77.3%
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 64.5%
Taylor expanded in x around 0 51.5%
associate-/r*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
swap-sqr65.0%
unpow265.0%
associate-/r*65.0%
unpow265.0%
unpow265.0%
swap-sqr77.1%
unpow277.1%
*-commutative77.1%
Simplified77.1%
unpow277.1%
associate-*r*75.1%
*-commutative75.1%
associate-*l*74.3%
Applied egg-rr74.3%
Final simplification74.3%
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 64.5%
Taylor expanded in x around 0 51.5%
associate-/r*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
swap-sqr65.0%
unpow265.0%
associate-/r*65.0%
unpow265.0%
unpow265.0%
swap-sqr77.1%
unpow277.1%
*-commutative77.1%
Simplified77.1%
unpow277.1%
associate-*r*75.1%
*-commutative75.1%
associate-*l*74.3%
Applied egg-rr74.3%
Taylor expanded in c around 0 74.3%
associate-*r*74.8%
Simplified74.8%
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 (let* ((t_0 (* c_m (* x s_m)))) (/ 1.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 1.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 = 1.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 1.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 1.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(1.0 / Float64(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 = 1.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[(1.0 / N[(t$95$0 * t$95$0), $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)\\
\frac{1}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 64.5%
Taylor expanded in x around 0 51.5%
associate-/r*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
swap-sqr65.0%
unpow265.0%
associate-/r*65.0%
unpow265.0%
unpow265.0%
swap-sqr77.1%
unpow277.1%
*-commutative77.1%
Simplified77.1%
*-commutative77.1%
pow277.1%
Applied egg-rr77.1%
Final simplification77.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 (/ 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 64.5%
Taylor expanded in x around 0 51.5%
associate-/r*51.5%
*-commutative51.5%
unpow251.5%
unpow251.5%
swap-sqr65.0%
unpow265.0%
associate-/r*65.0%
unpow265.0%
unpow265.0%
swap-sqr77.1%
unpow277.1%
*-commutative77.1%
Simplified77.1%
*-commutative77.1%
pow277.1%
*-commutative77.1%
associate-*r*74.7%
Applied egg-rr74.7%
Final simplification74.7%
herbie shell --seed 2024020
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))