
(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}
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (cos (* 2.0 x))))
(if (<= c 7.5e-53)
(/ t_0 (* c (* x (* s_m (* s_m (* c x))))))
(/ t_0 (* (pow c 2.0) (* x (* s_m (* x s_m))))))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = cos((2.0 * x));
double tmp;
if (c <= 7.5e-53) {
tmp = t_0 / (c * (x * (s_m * (s_m * (c * x)))));
} else {
tmp = t_0 / (pow(c, 2.0) * (x * (s_m * (x * s_m))));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((2.0d0 * x))
if (c <= 7.5d-53) then
tmp = t_0 / (c * (x * (s_m * (s_m * (c * x)))))
else
tmp = t_0 / ((c ** 2.0d0) * (x * (s_m * (x * s_m))))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = Math.cos((2.0 * x));
double tmp;
if (c <= 7.5e-53) {
tmp = t_0 / (c * (x * (s_m * (s_m * (c * x)))));
} else {
tmp = t_0 / (Math.pow(c, 2.0) * (x * (s_m * (x * s_m))));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = math.cos((2.0 * x)) tmp = 0 if c <= 7.5e-53: tmp = t_0 / (c * (x * (s_m * (s_m * (c * x))))) else: tmp = t_0 / (math.pow(c, 2.0) * (x * (s_m * (x * s_m)))) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = cos(Float64(2.0 * x)) tmp = 0.0 if (c <= 7.5e-53) tmp = Float64(t_0 / Float64(c * Float64(x * Float64(s_m * Float64(s_m * Float64(c * x)))))); else tmp = Float64(t_0 / Float64((c ^ 2.0) * Float64(x * Float64(s_m * Float64(x * s_m))))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = cos((2.0 * x));
tmp = 0.0;
if (c <= 7.5e-53)
tmp = t_0 / (c * (x * (s_m * (s_m * (c * x)))));
else
tmp = t_0 / ((c ^ 2.0) * (x * (s_m * (x * s_m))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c, 7.5e-53], N[(t$95$0 / N[(c * N[(x * N[(s$95$m * N[(s$95$m * N[(c * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[Power[c, 2.0], $MachinePrecision] * N[(x * N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(2 \cdot x\right)\\
\mathbf{if}\;c \leq 7.5 \cdot 10^{-53}:\\
\;\;\;\;\frac{t\_0}{c \cdot \left(x \cdot \left(s\_m \cdot \left(s\_m \cdot \left(c \cdot x\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{{c}^{2} \cdot \left(x \cdot \left(s\_m \cdot \left(x \cdot s\_m\right)\right)\right)}\\
\end{array}
\end{array}
if c < 7.5000000000000001e-53Initial program 73.9%
Taylor expanded in c around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.3
Simplified79.3%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6480.9
Simplified80.9%
Taylor expanded in s around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6485.0
Simplified85.0%
Taylor expanded in c around 0
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6492.0
Simplified92.0%
if 7.5000000000000001e-53 < c Initial program 73.1%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6479.3
Simplified79.3%
Final simplification88.8%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c 2.0) (* x (* x (pow s_m 2.0))))) -1e-119) (/ -2.0 (* c (* c (* s_m s_m)))) (/ 1.0 (* c (* s_m (* c (* s_m (* x x))))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double tmp;
if ((cos((2.0 * x)) / (pow(c, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -1e-119) {
tmp = -2.0 / (c * (c * (s_m * s_m)));
} else {
tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x)))));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= (-1d-119)) then
tmp = (-2.0d0) / (c * (c * (s_m * s_m)))
else
tmp = 1.0d0 / (c * (s_m * (c * (s_m * (x * x)))))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= -1e-119) {
tmp = -2.0 / (c * (c * (s_m * s_m)));
} else {
tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x)))));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= -1e-119: tmp = -2.0 / (c * (c * (s_m * s_m))) else: tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x))))) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -1e-119) tmp = Float64(-2.0 / Float64(c * Float64(c * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(c * Float64(s_m * Float64(c * Float64(s_m * Float64(x * x)))))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= -1e-119)
tmp = -2.0 / (c * (c * (s_m * s_m)));
else
tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-119], N[(-2.0 / N[(c * N[(c * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c * N[(s$95$m * N[(c * N[(s$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -1 \cdot 10^{-119}:\\
\;\;\;\;\frac{-2}{c \cdot \left(c \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c \cdot \left(s\_m \cdot \left(c \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1.00000000000000001e-119Initial program 91.7%
Taylor expanded in x around 0
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
lower-/.f64N/A
Simplified33.8%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.4
Simplified46.4%
if -1.00000000000000001e-119 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 71.8%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6475.4
Simplified75.4%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6475.7
Simplified75.7%
Taylor expanded in s around 0
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6476.5
Simplified76.5%
Final simplification73.6%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (if (<= (/ (cos (* 2.0 x)) (* (pow c 2.0) (* x (* x (pow s_m 2.0))))) -1e-119) (/ -2.0 (* c (* c (* s_m s_m)))) (/ 1.0 (* c (* c (* s_m (* s_m (* x x))))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double tmp;
if ((cos((2.0 * x)) / (pow(c, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -1e-119) {
tmp = -2.0 / (c * (c * (s_m * s_m)));
} else {
tmp = 1.0 / (c * (c * (s_m * (s_m * (x * x)))));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: tmp
if ((cos((2.0d0 * x)) / ((c ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= (-1d-119)) then
tmp = (-2.0d0) / (c * (c * (s_m * s_m)))
else
tmp = 1.0d0 / (c * (c * (s_m * (s_m * (x * x)))))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= -1e-119) {
tmp = -2.0 / (c * (c * (s_m * s_m)));
} else {
tmp = 1.0 / (c * (c * (s_m * (s_m * (x * x)))));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= -1e-119: tmp = -2.0 / (c * (c * (s_m * s_m))) else: tmp = 1.0 / (c * (c * (s_m * (s_m * (x * x))))) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -1e-119) tmp = Float64(-2.0 / Float64(c * Float64(c * Float64(s_m * s_m)))); else tmp = Float64(1.0 / Float64(c * Float64(c * Float64(s_m * Float64(s_m * Float64(x * x)))))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
tmp = 0.0;
if ((cos((2.0 * x)) / ((c ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= -1e-119)
tmp = -2.0 / (c * (c * (s_m * s_m)));
else
tmp = 1.0 / (c * (c * (s_m * (s_m * (x * x)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1e-119], N[(-2.0 / N[(c * N[(c * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c * N[(c * N[(s$95$m * N[(s$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -1 \cdot 10^{-119}:\\
\;\;\;\;\frac{-2}{c \cdot \left(c \cdot \left(s\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c \cdot \left(c \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -1.00000000000000001e-119Initial program 91.7%
Taylor expanded in x around 0
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
lower-/.f64N/A
Simplified33.8%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6446.4
Simplified46.4%
if -1.00000000000000001e-119 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 71.8%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6475.4
Simplified75.4%
Final simplification72.6%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(let* ((t_0 (* c (* c (* s_m s_m)))))
(if (<= (/ (cos (* 2.0 x)) (* (pow c 2.0) (* x (* x (pow s_m 2.0))))) 0.0)
(/ -2.0 t_0)
(* x (* 0.6666666666666666 (/ x t_0))))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double t_0 = c * (c * (s_m * s_m));
double tmp;
if ((cos((2.0 * x)) / (pow(c, 2.0) * (x * (x * pow(s_m, 2.0))))) <= 0.0) {
tmp = -2.0 / t_0;
} else {
tmp = x * (0.6666666666666666 * (x / t_0));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c * (c * (s_m * s_m))
if ((cos((2.0d0 * x)) / ((c ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= 0.0d0) then
tmp = (-2.0d0) / t_0
else
tmp = x * (0.6666666666666666d0 * (x / t_0))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double t_0 = c * (c * (s_m * s_m));
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= 0.0) {
tmp = -2.0 / t_0;
} else {
tmp = x * (0.6666666666666666 * (x / t_0));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): t_0 = c * (c * (s_m * s_m)) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= 0.0: tmp = -2.0 / t_0 else: tmp = x * (0.6666666666666666 * (x / t_0)) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) t_0 = Float64(c * Float64(c * Float64(s_m * s_m))) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= 0.0) tmp = Float64(-2.0 / t_0); else tmp = Float64(x * Float64(0.6666666666666666 * Float64(x / t_0))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
t_0 = c * (c * (s_m * s_m));
tmp = 0.0;
if ((cos((2.0 * x)) / ((c ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= 0.0)
tmp = -2.0 / t_0;
else
tmp = x * (0.6666666666666666 * (x / t_0));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
code[x_, c_, s$95$m_] := Block[{t$95$0 = N[(c * N[(c * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(-2.0 / t$95$0), $MachinePrecision], N[(x * N[(0.6666666666666666 * N[(x / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
t_0 := c \cdot \left(c \cdot \left(s\_m \cdot s\_m\right)\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq 0:\\
\;\;\;\;\frac{-2}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(0.6666666666666666 \cdot \frac{x}{t\_0}\right)\\
\end{array}
\end{array}
if (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) < -0.0Initial program 81.8%
Taylor expanded in x around 0
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
lower-/.f64N/A
Simplified41.3%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6454.7
Simplified54.7%
if -0.0 < (/.f64 (cos.f64 (*.f64 #s(literal 2 binary64) x)) (*.f64 (pow.f64 c #s(literal 2 binary64)) (*.f64 (*.f64 x (pow.f64 s #s(literal 2 binary64))) x))) Initial program 67.2%
Taylor expanded in x around 0
lower-/.f64N/A
Simplified62.3%
Taylor expanded in x around inf
associate-*r/N/A
associate-*l/N/A
metadata-evalN/A
associate-*r/N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
metadata-evalN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6448.5
Simplified48.5%
Final simplification51.3%
s_m = (fabs.f64 s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c s_m)
:precision binary64
(if (<= x 2.2e-12)
(/ 1.0 (* c (* s_m (* c (* s_m (* x x))))))
(if (<= x 2.1e+171)
(/ (cos (* 2.0 x)) (* c (* s_m (* s_m (* c (* x x))))))
(/ 1.0 (* c (* x (* c (* x (* s_m s_m)))))))))s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.2e-12) {
tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x)))));
} else if (x <= 2.1e+171) {
tmp = cos((2.0 * x)) / (c * (s_m * (s_m * (c * (x * x)))));
} else {
tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m)))));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: tmp
if (x <= 2.2d-12) then
tmp = 1.0d0 / (c * (s_m * (c * (s_m * (x * x)))))
else if (x <= 2.1d+171) then
tmp = cos((2.0d0 * x)) / (c * (s_m * (s_m * (c * (x * x)))))
else
tmp = 1.0d0 / (c * (x * (c * (x * (s_m * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.2e-12) {
tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x)))));
} else if (x <= 2.1e+171) {
tmp = Math.cos((2.0 * x)) / (c * (s_m * (s_m * (c * (x * x)))));
} else {
tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): tmp = 0 if x <= 2.2e-12: tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x))))) elif x <= 2.1e+171: tmp = math.cos((2.0 * x)) / (c * (s_m * (s_m * (c * (x * x))))) else: tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m))))) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) tmp = 0.0 if (x <= 2.2e-12) tmp = Float64(1.0 / Float64(c * Float64(s_m * Float64(c * Float64(s_m * Float64(x * x)))))); elseif (x <= 2.1e+171) tmp = Float64(cos(Float64(2.0 * x)) / Float64(c * Float64(s_m * Float64(s_m * Float64(c * Float64(x * x)))))); else tmp = Float64(1.0 / Float64(c * Float64(x * Float64(c * Float64(x * Float64(s_m * s_m)))))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
tmp = 0.0;
if (x <= 2.2e-12)
tmp = 1.0 / (c * (s_m * (c * (s_m * (x * x)))));
elseif (x <= 2.1e+171)
tmp = cos((2.0 * x)) / (c * (s_m * (s_m * (c * (x * x)))));
else
tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := If[LessEqual[x, 2.2e-12], N[(1.0 / N[(c * N[(s$95$m * N[(c * N[(s$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.1e+171], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(c * N[(s$95$m * N[(s$95$m * N[(c * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c * N[(x * N[(c * N[(x * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2.2 \cdot 10^{-12}:\\
\;\;\;\;\frac{1}{c \cdot \left(s\_m \cdot \left(c \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\mathbf{elif}\;x \leq 2.1 \cdot 10^{+171}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{c \cdot \left(s\_m \cdot \left(s\_m \cdot \left(c \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c \cdot \left(x \cdot \left(c \cdot \left(x \cdot \left(s\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.19999999999999992e-12Initial program 73.8%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6474.1
Simplified74.1%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6474.2
Simplified74.2%
Taylor expanded in s around 0
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6475.2
Simplified75.2%
if 2.19999999999999992e-12 < x < 2.1000000000000001e171Initial program 78.3%
Taylor expanded in c around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6483.8
Simplified83.8%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6488.4
Simplified88.4%
if 2.1000000000000001e171 < x Initial program 64.1%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.1
Simplified69.1%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.1
Simplified69.1%
Taylor expanded in s around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6473.4
Simplified73.4%
Final simplification77.2%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (if (<= x 2.1e+171) (/ (cos (* 2.0 x)) (* c (* c (* s_m (* s_m (* x x)))))) (/ 1.0 (* c (* x (* c (* x (* s_m s_m))))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.1e+171) {
tmp = cos((2.0 * x)) / (c * (c * (s_m * (s_m * (x * x)))));
} else {
tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m)))));
}
return tmp;
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
real(8) :: tmp
if (x <= 2.1d+171) then
tmp = cos((2.0d0 * x)) / (c * (c * (s_m * (s_m * (x * x)))))
else
tmp = 1.0d0 / (c * (x * (c * (x * (s_m * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
double tmp;
if (x <= 2.1e+171) {
tmp = Math.cos((2.0 * x)) / (c * (c * (s_m * (s_m * (x * x)))));
} else {
tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): tmp = 0 if x <= 2.1e+171: tmp = math.cos((2.0 * x)) / (c * (c * (s_m * (s_m * (x * x))))) else: tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m))))) return tmp
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) tmp = 0.0 if (x <= 2.1e+171) tmp = Float64(cos(Float64(2.0 * x)) / Float64(c * Float64(c * Float64(s_m * Float64(s_m * Float64(x * x)))))); else tmp = Float64(1.0 / Float64(c * Float64(x * Float64(c * Float64(x * Float64(s_m * s_m)))))); end return tmp end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp_2 = code(x, c, s_m)
tmp = 0.0;
if (x <= 2.1e+171)
tmp = cos((2.0 * x)) / (c * (c * (s_m * (s_m * (x * x)))));
else
tmp = 1.0 / (c * (x * (c * (x * (s_m * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := If[LessEqual[x, 2.1e+171], N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(c * N[(c * N[(s$95$m * N[(s$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c * N[(x * N[(c * N[(x * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 2.1 \cdot 10^{+171}:\\
\;\;\;\;\frac{\cos \left(2 \cdot x\right)}{c \cdot \left(c \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c \cdot \left(x \cdot \left(c \cdot \left(x \cdot \left(s\_m \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if x < 2.1000000000000001e171Initial program 74.6%
Taylor expanded in c around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6479.4
Simplified79.4%
if 2.1000000000000001e171 < x Initial program 64.1%
Taylor expanded in x around 0
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.1
Simplified69.1%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6469.1
Simplified69.1%
Taylor expanded in s around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6473.4
Simplified73.4%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (/ (cos (* 2.0 x)) (* c (* x (* s_m (* s_m (* c x)))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
return cos((2.0 * x)) / (c * (x * (s_m * (s_m * (c * x)))));
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
code = cos((2.0d0 * x)) / (c * (x * (s_m * (s_m * (c * x)))))
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
return Math.cos((2.0 * x)) / (c * (x * (s_m * (s_m * (c * x)))));
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): return math.cos((2.0 * x)) / (c * (x * (s_m * (s_m * (c * x)))))
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) return Float64(cos(Float64(2.0 * x)) / Float64(c * Float64(x * Float64(s_m * Float64(s_m * Float64(c * x)))))) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
tmp = cos((2.0 * x)) / (c * (x * (s_m * (s_m * (c * x)))));
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(c * N[(x * N[(s$95$m * N[(s$95$m * N[(c * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\frac{\cos \left(2 \cdot x\right)}{c \cdot \left(x \cdot \left(s\_m \cdot \left(s\_m \cdot \left(c \cdot x\right)\right)\right)\right)}
\end{array}
Initial program 73.7%
Taylor expanded in c around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6478.6
Simplified78.6%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
Taylor expanded in s around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6484.3
Simplified84.3%
Taylor expanded in c around 0
*-commutativeN/A
unpow2N/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6491.3
Simplified91.3%
Final simplification91.3%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (/ (cos (* 2.0 x)) (* c (* x (* c (* s_m (* x s_m)))))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
return cos((2.0 * x)) / (c * (x * (c * (s_m * (x * s_m)))));
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
code = cos((2.0d0 * x)) / (c * (x * (c * (s_m * (x * s_m)))))
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
return Math.cos((2.0 * x)) / (c * (x * (c * (s_m * (x * s_m)))));
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): return math.cos((2.0 * x)) / (c * (x * (c * (s_m * (x * s_m)))))
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) return Float64(cos(Float64(2.0 * x)) / Float64(c * Float64(x * Float64(c * Float64(s_m * Float64(x * s_m)))))) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
tmp = cos((2.0 * x)) / (c * (x * (c * (s_m * (x * s_m)))));
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(c * N[(x * N[(c * N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\frac{\cos \left(2 \cdot x\right)}{c \cdot \left(x \cdot \left(c \cdot \left(s\_m \cdot \left(x \cdot s\_m\right)\right)\right)\right)}
\end{array}
Initial program 73.7%
Taylor expanded in c around 0
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6478.6
Simplified78.6%
Taylor expanded in c around 0
*-commutativeN/A
associate-*l*N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
Taylor expanded in s around 0
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6484.3
Simplified84.3%
Taylor expanded in x around 0
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f6489.5
Simplified89.5%
Final simplification89.5%
s_m = (fabs.f64 s) NOTE: x, c, and s_m should be sorted in increasing order before calling this function. (FPCore (x c s_m) :precision binary64 (/ -2.0 (* c (* c (* s_m s_m)))))
s_m = fabs(s);
assert(x < c && c < s_m);
double code(double x, double c, double s_m) {
return -2.0 / (c * (c * (s_m * s_m)));
}
s_m = abs(s)
NOTE: x, c, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s_m
code = (-2.0d0) / (c * (c * (s_m * s_m)))
end function
s_m = Math.abs(s);
assert x < c && c < s_m;
public static double code(double x, double c, double s_m) {
return -2.0 / (c * (c * (s_m * s_m)));
}
s_m = math.fabs(s) [x, c, s_m] = sort([x, c, s_m]) def code(x, c, s_m): return -2.0 / (c * (c * (s_m * s_m)))
s_m = abs(s) x, c, s_m = sort([x, c, s_m]) function code(x, c, s_m) return Float64(-2.0 / Float64(c * Float64(c * Float64(s_m * s_m)))) end
s_m = abs(s);
x, c, s_m = num2cell(sort([x, c, s_m])){:}
function tmp = code(x, c, s_m)
tmp = -2.0 / (c * (c * (s_m * s_m)));
end
s_m = N[Abs[s], $MachinePrecision] NOTE: x, c, and s_m should be sorted in increasing order before calling this function. code[x_, c_, s$95$m_] := N[(-2.0 / N[(c * N[(c * N[(s$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
[x, c, s_m] = \mathsf{sort}([x, c, s_m])\\
\\
\frac{-2}{c \cdot \left(c \cdot \left(s\_m \cdot s\_m\right)\right)}
\end{array}
Initial program 73.7%
Taylor expanded in x around 0
*-commutativeN/A
associate-*l/N/A
associate-*r/N/A
metadata-evalN/A
distribute-neg-fracN/A
metadata-evalN/A
associate-*r/N/A
lower-/.f64N/A
Simplified50.1%
Taylor expanded in x around inf
lower-/.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6426.2
Simplified26.2%
herbie shell --seed 2024215
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))