
(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 13 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 (cos (+ x x))) (t_1 (* c_m (* x s_m))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
INFINITY)
(/ t_0 (* t_1 t_1))
(/ t_0 (* x (* (* c_m s_m) (* 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) {
double t_0 = cos((x + x));
double t_1 = c_m * (x * s_m);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= ((double) INFINITY)) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * s_m))));
}
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 + x));
double t_1 = c_m * (x * s_m);
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= Double.POSITIVE_INFINITY) {
tmp = t_0 / (t_1 * t_1);
} else {
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * 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): t_0 = math.cos((x + x)) t_1 = c_m * (x * s_m) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= math.inf: tmp = t_0 / (t_1 * t_1) else: tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * 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) t_0 = cos(Float64(x + x)) t_1 = Float64(c_m * Float64(x * s_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= Inf) tmp = Float64(t_0 / Float64(t_1 * t_1)); else tmp = Float64(t_0 / Float64(x * Float64(Float64(c_m * s_m) * Float64(x * Float64(c_m * 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)
t_0 = cos((x + x));
t_1 = c_m * (x * s_m);
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= Inf)
tmp = t_0 / (t_1 * t_1);
else
tmp = t_0 / (x * ((c_m * s_m) * (x * (c_m * 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_] := Block[{t$95$0 = N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $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], Infinity], N[(t$95$0 / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(x * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * N[(c$95$m * 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])\\
\\
\begin{array}{l}
t_0 := \cos \left(x + x\right)\\
t_1 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq \infty:\\
\;\;\;\;\frac{t\_0}{t\_1 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{x \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(x \cdot \left(c\_m \cdot s\_m\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))) < +inf.0Initial program 81.8%
lift-*.f64N/A
count-2N/A
lower-+.f6481.8
lift-pow.f64N/A
unpow2N/A
lower-*.f6481.8
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-*.f6481.4
Applied rewrites81.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
unpow-prod-downN/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6497.8
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6499.7
Applied rewrites99.7%
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))) Initial program 0.0%
lift-*.f64N/A
count-2N/A
lower-+.f640.0
lift-pow.f64N/A
unpow2N/A
lower-*.f640.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-*.f6415.2
Applied rewrites15.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
unpow-prod-downN/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
Applied rewrites83.2%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.1
Applied rewrites97.1%
Final simplification99.3%
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))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
-1e-282)
(/ (cos (+ x x)) (* (* c_m c_m) (* s_m (* s_m (* x x)))))
(/ (/ 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 = c_m * (x * s_m);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -1e-282) {
tmp = cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))));
} 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 = c_m * (x * s_m)
if ((cos((2.0d0 * x)) / ((c_m ** 2.0d0) * (x * (x * (s_m ** 2.0d0))))) <= (-1d-282)) then
tmp = cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))))
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 = c_m * (x * s_m);
double tmp;
if ((Math.cos((2.0 * x)) / (Math.pow(c_m, 2.0) * (x * (x * Math.pow(s_m, 2.0))))) <= -1e-282) {
tmp = Math.cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))));
} 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 = c_m * (x * s_m) tmp = 0 if (math.cos((2.0 * x)) / (math.pow(c_m, 2.0) * (x * (x * math.pow(s_m, 2.0))))) <= -1e-282: tmp = math.cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x)))) 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(c_m * Float64(x * s_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -1e-282) 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_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 = c_m * (x * s_m);
tmp = 0.0;
if ((cos((2.0 * x)) / ((c_m ^ 2.0) * (x * (x * (s_m ^ 2.0))))) <= -1e-282)
tmp = cos((x + x)) / ((c_m * c_m) * (s_m * (s_m * (x * x))));
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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $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], -1e-282], 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$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 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -1 \cdot 10^{-282}:\\
\;\;\;\;\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\_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))) < -1e-282Initial program 56.1%
lift-*.f64N/A
count-2N/A
lower-+.f6456.1
lift-pow.f64N/A
unpow2N/A
lower-*.f6456.1
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-*.f6459.9
Applied rewrites59.9%
if -1e-282 < (/.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 69.9%
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-*.f6479.2
Applied rewrites79.2%
Applied rewrites87.2%
Final simplification84.8%
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))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
-1.0)
(/ (fma x (* x -2.0) 1.0) (* (* c_m s_m) (* x 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 = c_m * (x * s_m);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -1.0) {
tmp = fma(x, (x * -2.0), 1.0) / ((c_m * s_m) * (x * 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(c_m * Float64(x * s_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -1.0) tmp = Float64(fma(x, Float64(x * -2.0), 1.0) / Float64(Float64(c_m * s_m) * Float64(x * t_0))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return 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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $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], -1.0], N[(N[(x * N[(x * -2.0), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x * t$95$0), $MachinePrecision]), $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 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -1:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, x \cdot -2, 1\right)}{\left(c\_m \cdot s\_m\right) \cdot \left(x \cdot t\_0\right)}\\
\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))) < -1Initial program 54.0%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites82.1%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6432.3
Applied rewrites32.3%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
unpow2N/A
Applied rewrites32.1%
if -1 < (/.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 70.0%
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-*.f6478.9
Applied rewrites78.9%
Applied rewrites86.8%
Final simplification82.3%
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))))
(if (<=
(/ (cos (* 2.0 x)) (* (pow c_m 2.0) (* x (* x (pow s_m 2.0)))))
-1.0)
(/ (fma (* x x) -2.0 1.0) (* (* x s_m) (* s_m (* x (* c_m c_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 = c_m * (x * s_m);
double tmp;
if ((cos((2.0 * x)) / (pow(c_m, 2.0) * (x * (x * pow(s_m, 2.0))))) <= -1.0) {
tmp = fma((x * x), -2.0, 1.0) / ((x * s_m) * (s_m * (x * (c_m * c_m))));
} 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(c_m * Float64(x * s_m)) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64((c_m ^ 2.0) * Float64(x * Float64(x * (s_m ^ 2.0))))) <= -1.0) tmp = Float64(fma(Float64(x * x), -2.0, 1.0) / Float64(Float64(x * s_m) * Float64(s_m * Float64(x * Float64(c_m * c_m))))); else tmp = Float64(Float64(1.0 / t_0) / t_0); end return 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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $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], -1.0], N[(N[(N[(x * x), $MachinePrecision] * -2.0 + 1.0), $MachinePrecision] / N[(N[(x * s$95$m), $MachinePrecision] * N[(s$95$m * N[(x * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{{c\_m}^{2} \cdot \left(x \cdot \left(x \cdot {s\_m}^{2}\right)\right)} \leq -1:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot x, -2, 1\right)}{\left(x \cdot s\_m\right) \cdot \left(s\_m \cdot \left(x \cdot \left(c\_m \cdot c\_m\right)\right)\right)}\\
\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))) < -1Initial program 54.0%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6485.9
Applied rewrites85.9%
Taylor expanded in x around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6432.1
Applied rewrites32.1%
if -1 < (/.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 70.0%
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-*.f6478.9
Applied rewrites78.9%
Applied rewrites86.8%
Final simplification82.3%
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))))
(if (<= (pow s_m 2.0) 1e+279)
(/ (cos (+ x x)) (* (* x c_m) (* c_m (* s_m (* x 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 = c_m * (x * s_m);
double tmp;
if (pow(s_m, 2.0) <= 1e+279) {
tmp = cos((x + x)) / ((x * c_m) * (c_m * (s_m * (x * s_m))));
} 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 = c_m * (x * s_m)
if ((s_m ** 2.0d0) <= 1d+279) then
tmp = cos((x + x)) / ((x * c_m) * (c_m * (s_m * (x * s_m))))
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 = c_m * (x * s_m);
double tmp;
if (Math.pow(s_m, 2.0) <= 1e+279) {
tmp = Math.cos((x + x)) / ((x * c_m) * (c_m * (s_m * (x * s_m))));
} 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 = c_m * (x * s_m) tmp = 0 if math.pow(s_m, 2.0) <= 1e+279: tmp = math.cos((x + x)) / ((x * c_m) * (c_m * (s_m * (x * s_m)))) 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(c_m * Float64(x * s_m)) tmp = 0.0 if ((s_m ^ 2.0) <= 1e+279) tmp = Float64(cos(Float64(x + x)) / Float64(Float64(x * c_m) * Float64(c_m * Float64(s_m * Float64(x * s_m))))); 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 = c_m * (x * s_m);
tmp = 0.0;
if ((s_m ^ 2.0) <= 1e+279)
tmp = cos((x + x)) / ((x * c_m) * (c_m * (s_m * (x * s_m))));
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[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[s$95$m, 2.0], $MachinePrecision], 1e+279], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(N[(x * c$95$m), $MachinePrecision] * N[(c$95$m * N[(s$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 := c\_m \cdot \left(x \cdot s\_m\right)\\
\mathbf{if}\;{s\_m}^{2} \leq 10^{+279}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{\left(x \cdot c\_m\right) \cdot \left(c\_m \cdot \left(s\_m \cdot \left(x \cdot s\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if (pow.f64 s #s(literal 2 binary64)) < 1.00000000000000006e279Initial program 71.9%
lift-*.f64N/A
count-2N/A
lower-+.f6471.9
lift-pow.f64N/A
unpow2N/A
lower-*.f6471.9
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-*.f6472.5
Applied rewrites72.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
unpow-prod-downN/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
Applied rewrites89.2%
if 1.00000000000000006e279 < (pow.f64 s #s(literal 2 binary64)) Initial program 59.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-*.f6473.5
Applied rewrites73.5%
Applied rewrites88.1%
Final simplification88.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 (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 68.7%
lift-*.f64N/A
count-2N/A
lower-+.f6468.7
lift-pow.f64N/A
unpow2N/A
lower-*.f6468.7
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-*.f6470.8
Applied rewrites70.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow2N/A
associate-*r*N/A
lift-*.f64N/A
pow2N/A
unpow-prod-downN/A
lift-*.f64N/A
pow2N/A
lift-*.f64N/A
swap-sqrN/A
lift-*.f64N/A
lift-*.f64N/A
lower-*.f6498.1
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6495.9
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f6497.4
Applied rewrites97.4%
Final simplification97.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 (let* ((t_0 (* c_m (* x 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 = c_m * (x * 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 = c_m * (x * 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 = c_m * (x * 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 = c_m * (x * 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(c_m * Float64(x * 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 = c_m * (x * 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[(c$95$m * N[(x * 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 := c\_m \cdot \left(x \cdot s\_m\right)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.5%
Applied rewrites79.8%
Final simplification79.8%
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) (* (* x s_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 / c_m) / ((x * s_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 / c_m) / ((x * s_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 / c_m) / ((x * s_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 / c_m) / ((x * s_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(Float64(1.0 / c_m) / Float64(Float64(x * s_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 / c_m) / ((x * s_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[(N[(1.0 / c$95$m), $MachinePrecision] / N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\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{\frac{1}{c\_m}}{\left(x \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x \cdot s\_m\right)\right)}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.5%
Applied rewrites73.2%
Applied rewrites77.9%
Final simplification77.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 (/ 1.0 (* c_m (* (* x s_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 / (c_m * ((x * s_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 / (c_m * ((x * s_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 / (c_m * ((x * s_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 / (c_m * ((x * s_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(c_m * Float64(Float64(x * s_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 / (c_m * ((x * s_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[(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}
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(\left(x \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.5%
Applied rewrites77.9%
Final simplification77.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 (/ 1.0 (* x (* (* x s_m) (* c_m (* 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 / (x * ((x * s_m) * (c_m * (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 / (x * ((x * s_m) * (c_m * (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 / (x * ((x * s_m) * (c_m * (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 / (x * ((x * s_m) * (c_m * (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(x * Float64(Float64(x * s_m) * Float64(c_m * 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 / (x * ((x * s_m) * (c_m * (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[(x * N[(N[(x * s$95$m), $MachinePrecision] * N[(c$95$m * N[(c$95$m * 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}{x \cdot \left(\left(x \cdot s\_m\right) \cdot \left(c\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.5%
Applied rewrites74.0%
Final simplification74.0%
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 (* c_m (* c_m (* s_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 * (c_m * (c_m * (s_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 * (c_m * (c_m * (s_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 * (c_m * (c_m * (s_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 * (c_m * (c_m * (s_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(x * Float64(c_m * Float64(c_m * Float64(s_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 * (c_m * (c_m * (s_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[(x * N[(c$95$m * N[(c$95$m * N[(s$95$m * 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}{x \cdot \left(c\_m \cdot \left(c\_m \cdot \left(s\_m \cdot \left(x \cdot s\_m\right)\right)\right)\right)}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.5%
Applied rewrites73.5%
Final simplification73.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 (* x (* x (* s_m (* c_m (* 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 / (x * (x * (s_m * (c_m * (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 / (x * (x * (s_m * (c_m * (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 / (x * (x * (s_m * (c_m * (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 / (x * (x * (s_m * (c_m * (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(x * Float64(x * Float64(s_m * Float64(c_m * 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 / (x * (x * (s_m * (c_m * (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[(x * N[(x * N[(s$95$m * N[(c$95$m * 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}{x \cdot \left(x \cdot \left(s\_m \cdot \left(c\_m \cdot \left(c\_m \cdot s\_m\right)\right)\right)\right)}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.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 (* x (* c_m (* c_m (* x (* s_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 / (x * (c_m * (c_m * (x * (s_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 / (x * (c_m * (c_m * (x * (s_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 / (x * (c_m * (c_m * (x * (s_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 / (x * (c_m * (c_m * (x * (s_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(x * Float64(c_m * Float64(c_m * Float64(x * Float64(s_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 / (x * (c_m * (c_m * (x * (s_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[(x * N[(c$95$m * N[(c$95$m * N[(x * N[(s$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}{x \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x \cdot \left(s\_m \cdot s\_m\right)\right)\right)\right)}
\end{array}
Initial program 68.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-*.f6472.5
Applied rewrites72.5%
Taylor expanded in s around 0
Applied rewrites68.3%
Taylor expanded in x around 0
Applied rewrites68.9%
Final simplification68.9%
herbie shell --seed 2024233
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))