
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
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(Float64(c_m * x) * s_m) return Float64(Float64(cos(Float64(x + x)) / 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[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $MachinePrecision]}, N[(N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / 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 := \left(c\_m \cdot x\right) \cdot s\_m\\
\frac{\frac{\cos \left(x + x\right)}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 69.1%
lift-/.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6474.7
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6486.8
Applied rewrites86.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
Applied rewrites97.5%
lift-*.f64N/A
*-commutativeN/A
count-2N/A
lift-+.f6497.5
Applied rewrites97.5%
Final simplification97.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 (* (* c_m x) s_m)))
(if (<=
(/ (cos (* 2.0 x)) (* (* (* (pow s_m 2.0) x) x) (pow c_m 2.0)))
-4e-33)
(/ (fma -2.0 (* x x) 1.0) (* (* (* t_0 s_m) c_m) x))
(pow t_0 -2.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(s_m, 2.0) * x) * x) * pow(c_m, 2.0))) <= -4e-33) {
tmp = fma(-2.0, (x * x), 1.0) / (((t_0 * s_m) * c_m) * x);
} else {
tmp = pow(t_0, -2.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(Float64(c_m * x) * s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64(Float64(Float64((s_m ^ 2.0) * x) * x) * (c_m ^ 2.0))) <= -4e-33) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(Float64(Float64(t_0 * s_m) * c_m) * x)); else tmp = t_0 ^ -2.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[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision] * N[Power[c$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e-33], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[(t$95$0 * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision], N[Power[t$95$0, -2.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 := \left(c\_m \cdot x\right) \cdot s\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{\left(\left({s\_m}^{2} \cdot x\right) \cdot x\right) \cdot {c\_m}^{2}} \leq -4 \cdot 10^{-33}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{\left(\left(t\_0 \cdot s\_m\right) \cdot c\_m\right) \cdot x}\\
\mathbf{else}:\\
\;\;\;\;{t\_0}^{-2}\\
\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))) < -4.0000000000000002e-33Initial program 73.0%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.9
Applied rewrites96.9%
Taylor expanded in x around 0
Applied rewrites0.7%
Applied rewrites0.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6455.3
Applied rewrites55.3%
if -4.0000000000000002e-33 < (/.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 68.6%
Taylor expanded in x around 0
associate-*r*N/A
associate-/l/N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6468.1
Applied rewrites68.1%
Applied rewrites84.2%
Final simplification80.6%
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 s_m 2.0) x) x) (pow c_m 2.0)))
-4e-33)
(/ (fma -2.0 (* x x) 1.0) (* (* (* t_0 s_m) c_m) 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(s_m, 2.0) * x) * x) * pow(c_m, 2.0))) <= -4e-33) {
tmp = fma(-2.0, (x * x), 1.0) / (((t_0 * s_m) * c_m) * 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(Float64(c_m * x) * s_m) tmp = 0.0 if (Float64(cos(Float64(2.0 * x)) / Float64(Float64(Float64((s_m ^ 2.0) * x) * x) * (c_m ^ 2.0))) <= -4e-33) tmp = Float64(fma(-2.0, Float64(x * x), 1.0) / Float64(Float64(Float64(t_0 * s_m) * c_m) * x)); 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[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $MachinePrecision]}, If[LessEqual[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision] * N[Power[c$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -4e-33], N[(N[(-2.0 * N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision] / N[(N[(N[(t$95$0 * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * x), $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 := \left(c\_m \cdot x\right) \cdot s\_m\\
\mathbf{if}\;\frac{\cos \left(2 \cdot x\right)}{\left(\left({s\_m}^{2} \cdot x\right) \cdot x\right) \cdot {c\_m}^{2}} \leq -4 \cdot 10^{-33}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-2, x \cdot x, 1\right)}{\left(\left(t\_0 \cdot s\_m\right) \cdot c\_m\right) \cdot x}\\
\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))) < -4.0000000000000002e-33Initial program 73.0%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.9
Applied rewrites96.9%
Taylor expanded in x around 0
Applied rewrites0.7%
Applied rewrites0.7%
Taylor expanded in x around 0
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6455.3
Applied rewrites55.3%
if -4.0000000000000002e-33 < (/.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 68.6%
lift-/.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6474.5
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6485.4
Applied rewrites85.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
Applied rewrites97.6%
Taylor expanded in x around 0
Applied rewrites84.1%
Final simplification80.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
(if (<=
(/ (cos (* 2.0 x)) (* (* (* (pow s_m 2.0) x) x) (pow c_m 2.0)))
1e+298)
(/ 1.0 (* (* (* s_m x) (* s_m x)) (* c_m c_m)))
(/ 1.0 (* (* (* (* (* s_m x) c_m) s_m) c_m) x))))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 ((cos((2.0 * x)) / (((pow(s_m, 2.0) * x) * x) * pow(c_m, 2.0))) <= 1e+298) {
tmp = 1.0 / (((s_m * x) * (s_m * x)) * (c_m * c_m));
} else {
tmp = 1.0 / (((((s_m * x) * c_m) * s_m) * c_m) * x);
}
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 ((cos((2.0d0 * x)) / ((((s_m ** 2.0d0) * x) * x) * (c_m ** 2.0d0))) <= 1d+298) then
tmp = 1.0d0 / (((s_m * x) * (s_m * x)) * (c_m * c_m))
else
tmp = 1.0d0 / (((((s_m * x) * c_m) * s_m) * c_m) * x)
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 ((Math.cos((2.0 * x)) / (((Math.pow(s_m, 2.0) * x) * x) * Math.pow(c_m, 2.0))) <= 1e+298) {
tmp = 1.0 / (((s_m * x) * (s_m * x)) * (c_m * c_m));
} else {
tmp = 1.0 / (((((s_m * x) * c_m) * s_m) * c_m) * x);
}
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 (math.cos((2.0 * x)) / (((math.pow(s_m, 2.0) * x) * x) * math.pow(c_m, 2.0))) <= 1e+298: tmp = 1.0 / (((s_m * x) * (s_m * x)) * (c_m * c_m)) else: tmp = 1.0 / (((((s_m * x) * c_m) * s_m) * c_m) * x) 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 (Float64(cos(Float64(2.0 * x)) / Float64(Float64(Float64((s_m ^ 2.0) * x) * x) * (c_m ^ 2.0))) <= 1e+298) tmp = Float64(1.0 / Float64(Float64(Float64(s_m * x) * Float64(s_m * x)) * Float64(c_m * c_m))); else tmp = Float64(1.0 / Float64(Float64(Float64(Float64(Float64(s_m * x) * c_m) * s_m) * c_m) * x)); 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 ((cos((2.0 * x)) / ((((s_m ^ 2.0) * x) * x) * (c_m ^ 2.0))) <= 1e+298)
tmp = 1.0 / (((s_m * x) * (s_m * x)) * (c_m * c_m));
else
tmp = 1.0 / (((((s_m * x) * c_m) * s_m) * c_m) * x);
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[N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[Power[s$95$m, 2.0], $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision] * N[Power[c$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e+298], N[(1.0 / N[(N[(N[(s$95$m * x), $MachinePrecision] * N[(s$95$m * x), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(N[(N[(N[(s$95$m * x), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * x), $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}\;\frac{\cos \left(2 \cdot x\right)}{\left(\left({s\_m}^{2} \cdot x\right) \cdot x\right) \cdot {c\_m}^{2}} \leq 10^{+298}:\\
\;\;\;\;\frac{1}{\left(\left(s\_m \cdot x\right) \cdot \left(s\_m \cdot x\right)\right) \cdot \left(c\_m \cdot c\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\left(\left(\left(s\_m \cdot x\right) \cdot c\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot x}\\
\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))) < 9.9999999999999996e297Initial program 79.9%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.6
Applied rewrites97.6%
Taylor expanded in x around 0
Applied rewrites68.1%
Applied rewrites65.4%
if 9.9999999999999996e297 < (/.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 56.4%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.0
Applied rewrites97.0%
Taylor expanded in x around 0
Applied rewrites80.3%
Applied rewrites76.7%
Applied rewrites78.5%
Final simplification71.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 (if (<= (pow s_m 2.0) 5e+307) (/ (cos (+ x x)) (* (* (* s_m s_m) (* c_m x)) (* c_m x))) (/ (/ (pow (* s_m x) -2.0) c_m) c_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 (pow(s_m, 2.0) <= 5e+307) {
tmp = cos((x + x)) / (((s_m * s_m) * (c_m * x)) * (c_m * x));
} else {
tmp = (pow((s_m * x), -2.0) / c_m) / c_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 ** 2.0d0) <= 5d+307) then
tmp = cos((x + x)) / (((s_m * s_m) * (c_m * x)) * (c_m * x))
else
tmp = (((s_m * x) ** (-2.0d0)) / c_m) / c_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 (Math.pow(s_m, 2.0) <= 5e+307) {
tmp = Math.cos((x + x)) / (((s_m * s_m) * (c_m * x)) * (c_m * x));
} else {
tmp = (Math.pow((s_m * x), -2.0) / c_m) / c_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 math.pow(s_m, 2.0) <= 5e+307: tmp = math.cos((x + x)) / (((s_m * s_m) * (c_m * x)) * (c_m * x)) else: tmp = (math.pow((s_m * x), -2.0) / c_m) / c_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 ^ 2.0) <= 5e+307) tmp = Float64(cos(Float64(x + x)) / Float64(Float64(Float64(s_m * s_m) * Float64(c_m * x)) * Float64(c_m * x))); else tmp = Float64(Float64((Float64(s_m * x) ^ -2.0) / c_m) / c_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 ^ 2.0) <= 5e+307)
tmp = cos((x + x)) / (((s_m * s_m) * (c_m * x)) * (c_m * x));
else
tmp = (((s_m * x) ^ -2.0) / c_m) / c_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[N[Power[s$95$m, 2.0], $MachinePrecision], 5e+307], N[(N[Cos[N[(x + x), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(s$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Power[N[(s$95$m * x), $MachinePrecision], -2.0], $MachinePrecision] / c$95$m), $MachinePrecision] / c$95$m), $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}^{2} \leq 5 \cdot 10^{+307}:\\
\;\;\;\;\frac{\cos \left(x + x\right)}{\left(\left(s\_m \cdot s\_m\right) \cdot \left(c\_m \cdot x\right)\right) \cdot \left(c\_m \cdot x\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{{\left(s\_m \cdot x\right)}^{-2}}{c\_m}}{c\_m}\\
\end{array}
\end{array}
if (pow.f64 s #s(literal 2 binary64)) < 5e307Initial program 75.5%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.7
Applied rewrites98.7%
lift-*.f64N/A
count-2N/A
lower-+.f6498.7
Applied rewrites98.7%
Applied rewrites88.6%
if 5e307 < (pow.f64 s #s(literal 2 binary64)) Initial program 47.7%
Taylor expanded in x around 0
associate-*r*N/A
associate-/l/N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6450.0
Applied rewrites50.0%
Applied rewrites78.2%
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 (cos (+ x x))))
(if (<= x 2.8e-63)
(/ (/ (pow (* s_m x) -2.0) c_m) c_m)
(if (<= x 1.1e+88)
(/ t_0 (* (* x x) (* (* c_m s_m) (* c_m s_m))))
(/ t_0 (* (* (* s_m s_m) (* c_m x)) (* c_m x)))))))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 tmp;
if (x <= 2.8e-63) {
tmp = (pow((s_m * x), -2.0) / c_m) / c_m;
} else if (x <= 1.1e+88) {
tmp = t_0 / ((x * x) * ((c_m * s_m) * (c_m * s_m)));
} else {
tmp = t_0 / (((s_m * s_m) * (c_m * x)) * (c_m * x));
}
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 = cos((x + x))
if (x <= 2.8d-63) then
tmp = (((s_m * x) ** (-2.0d0)) / c_m) / c_m
else if (x <= 1.1d+88) then
tmp = t_0 / ((x * x) * ((c_m * s_m) * (c_m * s_m)))
else
tmp = t_0 / (((s_m * s_m) * (c_m * x)) * (c_m * x))
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 = Math.cos((x + x));
double tmp;
if (x <= 2.8e-63) {
tmp = (Math.pow((s_m * x), -2.0) / c_m) / c_m;
} else if (x <= 1.1e+88) {
tmp = t_0 / ((x * x) * ((c_m * s_m) * (c_m * s_m)));
} else {
tmp = t_0 / (((s_m * s_m) * (c_m * x)) * (c_m * x));
}
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)) tmp = 0 if x <= 2.8e-63: tmp = (math.pow((s_m * x), -2.0) / c_m) / c_m elif x <= 1.1e+88: tmp = t_0 / ((x * x) * ((c_m * s_m) * (c_m * s_m))) else: tmp = t_0 / (((s_m * s_m) * (c_m * x)) * (c_m * x)) 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)) tmp = 0.0 if (x <= 2.8e-63) tmp = Float64(Float64((Float64(s_m * x) ^ -2.0) / c_m) / c_m); elseif (x <= 1.1e+88) tmp = Float64(t_0 / Float64(Float64(x * x) * Float64(Float64(c_m * s_m) * Float64(c_m * s_m)))); else tmp = Float64(t_0 / Float64(Float64(Float64(s_m * s_m) * Float64(c_m * x)) * Float64(c_m * x))); 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));
tmp = 0.0;
if (x <= 2.8e-63)
tmp = (((s_m * x) ^ -2.0) / c_m) / c_m;
elseif (x <= 1.1e+88)
tmp = t_0 / ((x * x) * ((c_m * s_m) * (c_m * s_m)));
else
tmp = t_0 / (((s_m * s_m) * (c_m * x)) * (c_m * x));
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]}, If[LessEqual[x, 2.8e-63], N[(N[(N[Power[N[(s$95$m * x), $MachinePrecision], -2.0], $MachinePrecision] / c$95$m), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[x, 1.1e+88], N[(t$95$0 / N[(N[(x * x), $MachinePrecision] * N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(N[(s$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * x), $MachinePrecision]), $MachinePrecision] * N[(c$95$m * x), $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)\\
\mathbf{if}\;x \leq 2.8 \cdot 10^{-63}:\\
\;\;\;\;\frac{\frac{{\left(s\_m \cdot x\right)}^{-2}}{c\_m}}{c\_m}\\
\mathbf{elif}\;x \leq 1.1 \cdot 10^{+88}:\\
\;\;\;\;\frac{t\_0}{\left(x \cdot x\right) \cdot \left(\left(c\_m \cdot s\_m\right) \cdot \left(c\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(\left(s\_m \cdot s\_m\right) \cdot \left(c\_m \cdot x\right)\right) \cdot \left(c\_m \cdot x\right)}\\
\end{array}
\end{array}
if x < 2.8000000000000002e-63Initial program 69.9%
Taylor expanded in x around 0
associate-*r*N/A
associate-/l/N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6461.8
Applied rewrites61.8%
Applied rewrites74.3%
if 2.8000000000000002e-63 < x < 1.10000000000000004e88Initial program 74.8%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6493.4
Applied rewrites93.4%
lift-*.f64N/A
count-2N/A
lower-+.f6493.4
Applied rewrites93.4%
Applied rewrites97.5%
if 1.10000000000000004e88 < x Initial program 64.6%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.0
Applied rewrites98.0%
lift-*.f64N/A
count-2N/A
lower-+.f6498.0
Applied rewrites98.0%
Applied rewrites77.5%
Final simplification77.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))) (/ (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(Float64(c_m * 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[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $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 := \left(c\_m \cdot x\right) \cdot s\_m\\
\frac{\cos \left(x + x\right)}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 69.1%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.3
Applied rewrites97.3%
lift-*.f64N/A
count-2N/A
lower-+.f6497.3
Applied rewrites97.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))) (/ (/ 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(Float64(c_m * 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[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $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 := \left(c\_m \cdot x\right) \cdot s\_m\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 69.1%
lift-/.f64N/A
lift-*.f64N/A
lift-pow.f64N/A
unpow2N/A
associate-*l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6474.7
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-pow.f64N/A
pow2N/A
pow-prod-downN/A
lower-pow.f64N/A
*-commutativeN/A
lower-*.f6486.8
Applied rewrites86.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lift-pow.f64N/A
unpow2N/A
associate-/r*N/A
associate-/l/N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lower-/.f64N/A
Applied rewrites97.5%
Taylor expanded in x around 0
Applied rewrites73.7%
Final simplification73.7%
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(Float64(c_m * x) * 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 = (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[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $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 := \left(c\_m \cdot x\right) \cdot s\_m\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 69.1%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.3
Applied rewrites97.3%
Taylor expanded in x around 0
Applied rewrites73.7%
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 (* (* (* (* (* s_m x) c_m) s_m) c_m) x)))
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 / (((((s_m * x) * c_m) * s_m) * c_m) * x);
}
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 / (((((s_m * x) * c_m) * s_m) * c_m) * x)
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 / (((((s_m * x) * c_m) * s_m) * c_m) * x);
}
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 / (((((s_m * x) * c_m) * s_m) * c_m) * x)
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(Float64(Float64(Float64(s_m * x) * c_m) * s_m) * c_m) * x)) 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 / (((((s_m * x) * c_m) * s_m) * c_m) * x);
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[(N[(N[(N[(s$95$m * x), $MachinePrecision] * c$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * x), $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(\left(\left(\left(s\_m \cdot x\right) \cdot c\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot x}
\end{array}
Initial program 69.1%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.3
Applied rewrites97.3%
Taylor expanded in x around 0
Applied rewrites73.7%
Applied rewrites69.0%
Applied rewrites70.3%
Final simplification70.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 (/ 1.0 (* (* (* (* (* c_m x) s_m) s_m) c_m) x)))
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) * s_m) * c_m) * x);
}
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) * s_m) * c_m) * x)
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) * s_m) * c_m) * x);
}
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) * s_m) * c_m) * x)
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(Float64(Float64(Float64(c_m * x) * s_m) * s_m) * c_m) * x)) 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) * s_m) * c_m) * x);
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[(N[(N[(N[(c$95$m * x), $MachinePrecision] * s$95$m), $MachinePrecision] * s$95$m), $MachinePrecision] * c$95$m), $MachinePrecision] * x), $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(\left(\left(\left(c\_m \cdot x\right) \cdot s\_m\right) \cdot s\_m\right) \cdot c\_m\right) \cdot x}
\end{array}
Initial program 69.1%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
unpow2N/A
unpow2N/A
unswap-sqrN/A
unpow2N/A
unswap-sqrN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6497.3
Applied rewrites97.3%
Taylor expanded in x around 0
Applied rewrites73.7%
Applied rewrites69.0%
Final simplification69.0%
herbie shell --seed 2024273
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))