
(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) c_m = (fabs.f64 c) 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 x)) (* t_0 t_0))))
s_m = fabs(s);
c_m = fabs(c);
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 + x)) / (t_0 * t_0);
}
s_m = abs(s)
c_m = abs(c)
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 + x)) / (t_0 * t_0)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 + x)) / (t_0 * t_0);
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 + x)) / (t_0 * t_0)
s_m = abs(s) c_m = abs(c) 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(cos(Float64(x + x)) / Float64(t_0 * t_0)) end
s_m = abs(s);
c_m = abs(c);
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 + x)) / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\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{\cos \left(x + x\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-downN/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
lower-*.f64N/A
lower-*.f6497.0
Applied rewrites97.0%
lift-*.f64N/A
count-2N/A
lift-+.f6497.0
lift-pow.f64N/A
unpow2N/A
lower-*.f6497.0
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6494.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6496.1
Applied rewrites96.1%
Final simplification96.1%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
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 (/ (cos (* x 2.0)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0))))))
(t_1 (* x (* c_m s_m))))
(if (<= t_0 (- INFINITY))
(/ (* x (* x -2.0)) (* t_1 t_1))
(if (<= t_0 -2e-154)
(/ (cos (+ x x)) (* (* c_m c_m) (* s_m (* s_m (* x x)))))
(/ (/ 1.0 t_1) t_1)))))s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = cos((x * 2.0)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))));
double t_1 = x * (c_m * s_m);
double tmp;
if (t_0 <= -((double) INFINITY)) {
tmp = (x * (x * -2.0)) / (t_1 * t_1);
} else if (t_0 <= -2e-154) {
tmp = cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))));
} else {
tmp = (1.0 / t_1) / t_1;
}
return tmp;
}
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = Math.cos((x * 2.0)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))));
double t_1 = x * (c_m * s_m);
double tmp;
if (t_0 <= -Double.POSITIVE_INFINITY) {
tmp = (x * (x * -2.0)) / (t_1 * t_1);
} else if (t_0 <= -2e-154) {
tmp = Math.cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))));
} else {
tmp = (1.0 / t_1) / t_1;
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = math.cos((x * 2.0)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0)))) t_1 = x * (c_m * s_m) tmp = 0 if t_0 <= -math.inf: tmp = (x * (x * -2.0)) / (t_1 * t_1) elif t_0 <= -2e-154: tmp = math.cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x)))) else: tmp = (1.0 / t_1) / t_1 return tmp
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(cos(Float64(x * 2.0)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) t_1 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (t_0 <= Float64(-Inf)) tmp = Float64(Float64(x * Float64(x * -2.0)) / Float64(t_1 * t_1)); elseif (t_0 <= -2e-154) tmp = Float64(cos(Float64(x + x)) / Float64(Float64(c_m * c_m) * Float64(s_m * Float64(s_m * Float64(x * x))))); else tmp = Float64(Float64(1.0 / t_1) / t_1); end return tmp end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = cos((x * 2.0)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))));
t_1 = x * (c_m * s_m);
tmp = 0.0;
if (t_0 <= -Inf)
tmp = (x * (x * -2.0)) / (t_1 * t_1);
elseif (t_0 <= -2e-154)
tmp = cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))));
else
tmp = (1.0 / t_1) / t_1;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
code[x_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(x * N[(x * -2.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -2e-154], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(N[(c$95$m * c$95$m), $MachinePrecision] * N[(s$95$m * N[(s$95$m * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$1), $MachinePrecision] / t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{\cos \left(x \cdot 2\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)}\\
t_1 := x \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;t\_0 \leq -\infty:\\
\;\;\;\;\frac{x \cdot \left(x \cdot -2\right)}{t\_1 \cdot t\_1}\\
\mathbf{elif}\;t\_0 \leq -2 \cdot 10^{-154}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{\left(c\_m \cdot c\_m\right) \cdot \left(s\_m \cdot \left(s\_m \cdot \left(x \cdot x\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_1}}{t\_1}\\
\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))) < -inf.0Initial program 63.8%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6492.4
Applied rewrites92.4%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6463.8
Applied rewrites63.8%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f6463.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6463.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6463.8
Applied rewrites63.8%
Taylor expanded in x around inf
Applied rewrites63.8%
if -inf.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))) < -1.9999999999999999e-154Initial program 99.0%
lift-*.f64N/A
count-2N/A
lower-+.f6499.0
lift-pow.f64N/A
unpow2N/A
lower-*.f6499.0
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6499.2
Applied rewrites99.2%
if -1.9999999999999999e-154 < (/.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 65.6%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6474.9
Applied rewrites74.9%
Applied rewrites78.7%
Applied rewrites86.9%
Final simplification86.2%
s_m = (fabs.f64 s)
c_m = (fabs.f64 c)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x c_m s_m)
:precision binary64
(let* ((t_0 (* x (* c_m s_m))))
(if (<=
(/ (cos (* x 2.0)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
-2e-154)
(/ (* x (* x -2.0)) (* t_0 t_0))
(/ (/ 1.0 t_0) t_0))))s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
double tmp;
if ((cos((x * 2.0)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -2e-154) {
tmp = (x * (x * -2.0)) / (t_0 * t_0);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = x * (c_m * s_m)
if ((cos((x * 2.0d0)) / ((c_m ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= (-2d-154)) then
tmp = (x * (x * (-2.0d0))) / (t_0 * t_0)
else
tmp = (1.0d0 / t_0) / t_0
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
double tmp;
if ((Math.cos((x * 2.0)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= -2e-154) {
tmp = (x * (x * -2.0)) / (t_0 * t_0);
} else {
tmp = (1.0 / t_0) / t_0;
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) tmp = 0 if (math.cos((x * 2.0)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= -2e-154: tmp = (x * (x * -2.0)) / (t_0 * t_0) else: tmp = (1.0 / t_0) / t_0 return tmp
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) tmp = 0.0 if (Float64(cos(Float64(x * 2.0)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -2e-154) tmp = Float64(Float64(x * Float64(x * -2.0)) / Float64(t_0 * t_0)); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return tmp end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = 0.0;
if ((cos((x * 2.0)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= -2e-154)
tmp = (x * (x * -2.0)) / (t_0 * t_0);
else
tmp = (1.0 / t_0) / t_0;
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c$95$m, 2.0], $MachinePrecision] * N[(x * N[(x * N[Power[s$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -2e-154], N[(N[(x * N[(x * -2.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c\_m \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(x \cdot 2\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -2 \cdot 10^{-154}:\\
\;\;\;\;\frac{x \cdot \left(x \cdot -2\right)}{t\_0 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\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.9999999999999999e-154Initial program 78.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6494.9
Applied rewrites94.9%
Taylor expanded in x around 0
+-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6439.9
Applied rewrites39.9%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f6439.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6439.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f6439.9
Applied rewrites39.9%
Taylor expanded in x around inf
Applied rewrites39.9%
if -1.9999999999999999e-154 < (/.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 65.6%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6474.9
Applied rewrites74.9%
Applied rewrites78.7%
Applied rewrites86.9%
Final simplification82.9%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (if (<= s_m 1.28e+199) (/ 1.0 (* c_m (* (* s_m (* x s_m)) (* x c_m)))) (/ 1.0 (* c_m (* s_m (* c_m (* x (* x s_m))))))))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double tmp;
if (s_m <= 1.28e+199) {
tmp = 1.0 / (c_m * ((s_m * (x * s_m)) * (x * c_m)));
} else {
tmp = 1.0 / (c_m * (s_m * (c_m * (x * (x * s_m)))));
}
return tmp;
}
s_m = abs(s)
c_m = abs(c)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: tmp
if (s_m <= 1.28d+199) then
tmp = 1.0d0 / (c_m * ((s_m * (x * s_m)) * (x * c_m)))
else
tmp = 1.0d0 / (c_m * (s_m * (c_m * (x * (x * s_m)))))
end if
code = tmp
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double tmp;
if (s_m <= 1.28e+199) {
tmp = 1.0 / (c_m * ((s_m * (x * s_m)) * (x * c_m)));
} else {
tmp = 1.0 / (c_m * (s_m * (c_m * (x * (x * s_m)))));
}
return tmp;
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): tmp = 0 if s_m <= 1.28e+199: tmp = 1.0 / (c_m * ((s_m * (x * s_m)) * (x * c_m))) else: tmp = 1.0 / (c_m * (s_m * (c_m * (x * (x * s_m))))) return tmp
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) tmp = 0.0 if (s_m <= 1.28e+199) tmp = Float64(1.0 / Float64(c_m * Float64(Float64(s_m * Float64(x * s_m)) * Float64(x * c_m)))); else tmp = Float64(1.0 / Float64(c_m * Float64(s_m * Float64(c_m * Float64(x * Float64(x * s_m)))))); end return tmp end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp_2 = code(x, c_m, s_m)
tmp = 0.0;
if (s_m <= 1.28e+199)
tmp = 1.0 / (c_m * ((s_m * (x * s_m)) * (x * c_m)));
else
tmp = 1.0 / (c_m * (s_m * (c_m * (x * (x * s_m)))));
end
tmp_2 = tmp;
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := If[LessEqual[s$95$m, 1.28e+199], N[(1.0 / N[(c$95$m * N[(N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision] * N[(x * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c$95$m * N[(s$95$m * N[(c$95$m * N[(x * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
\mathbf{if}\;s\_m \leq 1.28 \cdot 10^{+199}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(\left(s\_m \cdot \left(x \cdot s\_m\right)\right) \cdot \left(x \cdot c\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot s\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if s < 1.2799999999999999e199Initial program 66.2%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6466.4
Applied rewrites66.4%
Applied rewrites71.1%
if 1.2799999999999999e199 < s Initial program 71.5%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6488.5
Applied rewrites88.5%
Applied rewrites80.1%
Applied rewrites88.0%
Applied rewrites92.1%
Final simplification73.1%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* x (* c_m s_m)))) (/ (/ 1.0 t_0) t_0)))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return (1.0 / t_0) / t_0;
}
s_m = abs(s)
c_m = abs(c)
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 = x * (c_m * s_m)
code = (1.0d0 / t_0) / t_0
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return (1.0 / t_0) / t_0;
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) return (1.0 / t_0) / t_0
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) return Float64(Float64(1.0 / t_0) / t_0) end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = (1.0 / t_0) / t_0;
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c\_m \cdot s\_m\right)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites72.0%
Applied rewrites79.5%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (let* ((t_0 (* x (* c_m s_m)))) (/ 1.0 (* t_0 t_0))))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return 1.0 / (t_0 * t_0);
}
s_m = abs(s)
c_m = abs(c)
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 = x * (c_m * s_m)
code = 1.0d0 / (t_0 * t_0)
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
double t_0 = x * (c_m * s_m);
return 1.0 / (t_0 * t_0);
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): t_0 = x * (c_m * s_m) return 1.0 / (t_0 * t_0)
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) t_0 = Float64(x * Float64(c_m * s_m)) return Float64(1.0 / Float64(t_0 * t_0)) end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
t_0 = x * (c_m * s_m);
tmp = 1.0 / (t_0 * t_0);
end
s_m = N[Abs[s], $MachinePrecision]
c_m = N[Abs[c], $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[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := x \cdot \left(c\_m \cdot s\_m\right)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites72.0%
Applied rewrites79.4%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x c_m s_m) :precision binary64 (/ 1.0 (* (* x s_m) (* c_m (* c_m (* x s_m))))))
s_m = fabs(s);
c_m = fabs(c);
assert(x < c_m && c_m < s_m);
double code(double x, double c_m, double s_m) {
return 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))));
}
s_m = abs(s)
c_m = abs(c)
NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x, c_m, s_m)
real(8), intent (in) :: x
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((x * s_m) * (c_m * (c_m * (x * s_m))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
assert x < c_m && c_m < s_m;
public static double code(double x, double c_m, double s_m) {
return 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))));
}
s_m = math.fabs(s) c_m = math.fabs(c) [x, c_m, s_m] = sort([x, c_m, s_m]) def code(x, c_m, s_m): return 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))))
s_m = abs(s) c_m = abs(c) x, c_m, s_m = sort([x, c_m, s_m]) function code(x, c_m, s_m) return Float64(1.0 / Float64(Float64(x * s_m) * Float64(c_m * Float64(c_m * Float64(x * s_m))))) end
s_m = abs(s);
c_m = abs(c);
x, c_m, s_m = num2cell(sort([x, c_m, s_m])){:}
function tmp = code(x, c_m, s_m)
tmp = 1.0 / ((x * s_m) * (c_m * (c_m * (x * s_m))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] NOTE: x, c_m, and s_m should be sorted in increasing order before calling this function. code[x_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{\left(x \cdot s\_m\right) \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites75.5%
Final simplification75.5%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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)))))))
s_m = fabs(s);
c_m = fabs(c);
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)))));
}
s_m = abs(s)
c_m = abs(c)
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
s_m = Math.abs(s);
c_m = Math.abs(c);
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)))));
}
s_m = math.fabs(s) c_m = math.fabs(c) [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)))))
s_m = abs(s) c_m = abs(c) 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(s_m * Float64(x * Float64(x * Float64(c_m * s_m)))))) end
s_m = abs(s);
c_m = abs(c);
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
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $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[(s$95$m * N[(x * N[(x * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(s\_m \cdot \left(x \cdot \left(x \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites72.0%
Applied rewrites74.2%
Final simplification74.2%
s_m = (fabs.f64 s) c_m = (fabs.f64 c) 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 (* c_m (* x (* x s_m)))))))
s_m = fabs(s);
c_m = fabs(c);
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 * (c_m * (x * (x * s_m)))));
}
s_m = abs(s)
c_m = abs(c)
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 * (c_m * (x * (x * s_m)))))
end function
s_m = Math.abs(s);
c_m = Math.abs(c);
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 * (c_m * (x * (x * s_m)))));
}
s_m = math.fabs(s) c_m = math.fabs(c) [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 * (c_m * (x * (x * s_m)))))
s_m = abs(s) c_m = abs(c) 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(s_m * Float64(c_m * Float64(x * Float64(x * s_m)))))) end
s_m = abs(s);
c_m = abs(c);
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 * (c_m * (x * (x * s_m)))));
end
s_m = N[Abs[s], $MachinePrecision] c_m = N[Abs[c], $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[(s$95$m * N[(c$95$m * N[(x * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
s_m = \left|s\right|
\\
c_m = \left|c\right|
\\
[x, c_m, s_m] = \mathsf{sort}([x, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(s\_m \cdot \left(c\_m \cdot \left(x \cdot \left(x \cdot s\_m\right)\right)\right)\right)}
\end{array}
Initial program 66.7%
Taylor expanded in x around 0
lower-/.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites72.0%
Applied rewrites70.6%
Applied rewrites71.8%
Final simplification71.8%
herbie shell --seed 2024232
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))