
(FPCore (K m n M l) :precision binary64 (* (cos (- (/ (* K (+ m n)) 2.0) M)) (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))
double code(double K, double m, double n, double M, double l) {
return cos((((K * (m + n)) / 2.0) - M)) * exp((-pow((((m + n) / 2.0) - M), 2.0) - (l - fabs((m - n)))));
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos((((k * (m + n)) / 2.0d0) - m_1)) * exp((-((((m + n) / 2.0d0) - m_1) ** 2.0d0) - (l - abs((m - n)))))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos((((K * (m + n)) / 2.0) - M)) * Math.exp((-Math.pow((((m + n) / 2.0) - M), 2.0) - (l - Math.abs((m - n)))));
}
def code(K, m, n, M, l): return math.cos((((K * (m + n)) / 2.0) - M)) * math.exp((-math.pow((((m + n) / 2.0) - M), 2.0) - (l - math.fabs((m - n)))))
function code(K, m, n, M, l) return Float64(cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) * exp(Float64(Float64(-(Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)) - Float64(l - abs(Float64(m - n)))))) end
function tmp = code(K, m, n, M, l) tmp = cos((((K * (m + n)) / 2.0) - M)) * exp((-((((m + n) / 2.0) - M) ^ 2.0) - (l - abs((m - n))))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * N[Exp[N[((-N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]) - N[(l - N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (K m n M l) :precision binary64 (* (cos (- (/ (* K (+ m n)) 2.0) M)) (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))
double code(double K, double m, double n, double M, double l) {
return cos((((K * (m + n)) / 2.0) - M)) * exp((-pow((((m + n) / 2.0) - M), 2.0) - (l - fabs((m - n)))));
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos((((k * (m + n)) / 2.0d0) - m_1)) * exp((-((((m + n) / 2.0d0) - m_1) ** 2.0d0) - (l - abs((m - n)))))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos((((K * (m + n)) / 2.0) - M)) * Math.exp((-Math.pow((((m + n) / 2.0) - M), 2.0) - (l - Math.abs((m - n)))));
}
def code(K, m, n, M, l): return math.cos((((K * (m + n)) / 2.0) - M)) * math.exp((-math.pow((((m + n) / 2.0) - M), 2.0) - (l - math.fabs((m - n)))))
function code(K, m, n, M, l) return Float64(cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) * exp(Float64(Float64(-(Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)) - Float64(l - abs(Float64(m - n)))))) end
function tmp = code(K, m, n, M, l) tmp = cos((((K * (m + n)) / 2.0) - M)) * exp((-((((m + n) / 2.0) - M) ^ 2.0) - (l - abs((m - n))))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * N[Exp[N[((-N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]) - N[(l - N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)}
\end{array}
(FPCore (K m n M l) :precision binary64 (* (cos M) (exp (- (- n m) (+ l (pow (- (* 0.5 (+ n m)) M) 2.0))))))
double code(double K, double m, double n, double M, double l) {
return cos(M) * exp(((n - m) - (l + pow(((0.5 * (n + m)) - M), 2.0))));
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos(m_1) * exp(((n - m) - (l + (((0.5d0 * (n + m)) - m_1) ** 2.0d0))))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) * Math.exp(((n - m) - (l + Math.pow(((0.5 * (n + m)) - M), 2.0))));
}
def code(K, m, n, M, l): return math.cos(M) * math.exp(((n - m) - (l + math.pow(((0.5 * (n + m)) - M), 2.0))))
function code(K, m, n, M, l) return Float64(cos(M) * exp(Float64(Float64(n - m) - Float64(l + (Float64(Float64(0.5 * Float64(n + m)) - M) ^ 2.0))))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) * exp(((n - m) - (l + (((0.5 * (n + m)) - M) ^ 2.0)))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(n - m), $MachinePrecision] - N[(l + N[Power[N[(N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos M \cdot e^{\left(n - m\right) - \left(\ell + {\left(0.5 \cdot \left(n + m\right) - M\right)}^{2}\right)}
\end{array}
Initial program 79.2%
Simplified79.2%
add-sqr-sqrt79.2%
sqrt-unprod79.3%
pow-prod-up79.3%
div-inv79.3%
fma-neg79.3%
metadata-eval79.3%
metadata-eval79.3%
Applied egg-rr79.3%
sqrt-pow179.2%
metadata-eval79.2%
fma-neg79.2%
metadata-eval79.2%
div-inv79.2%
unpow279.2%
div-inv79.2%
metadata-eval79.2%
+-commutative79.2%
div-inv79.2%
metadata-eval79.2%
+-commutative79.2%
Applied egg-rr79.2%
Taylor expanded in K around 0 97.3%
cos-neg97.3%
Simplified97.3%
associate--l-97.3%
add-sqr-sqrt46.1%
fabs-sqr46.1%
add-sqr-sqrt97.3%
pow297.3%
fma-neg97.3%
Applied egg-rr97.3%
+-commutative97.3%
fma-neg97.3%
*-commutative97.3%
+-commutative97.3%
Simplified97.3%
(FPCore (K m n M l)
:precision binary64
(if (<= m -1660000.0)
(* (cos M) (exp (* -0.25 (pow m 2.0))))
(if (<= m 3.8e-164)
(* (cos M) (exp (- (* M (- n M)) (- l (fabs (- n m))))))
(* (cos M) (exp (* -0.25 (pow n 2.0)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1660000.0) {
tmp = cos(M) * exp((-0.25 * pow(m, 2.0)));
} else if (m <= 3.8e-164) {
tmp = cos(M) * exp(((M * (n - M)) - (l - fabs((n - m)))));
} else {
tmp = cos(M) * exp((-0.25 * pow(n, 2.0)));
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (m <= (-1660000.0d0)) then
tmp = cos(m_1) * exp(((-0.25d0) * (m ** 2.0d0)))
else if (m <= 3.8d-164) then
tmp = cos(m_1) * exp(((m_1 * (n - m_1)) - (l - abs((n - m)))))
else
tmp = cos(m_1) * exp(((-0.25d0) * (n ** 2.0d0)))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1660000.0) {
tmp = Math.cos(M) * Math.exp((-0.25 * Math.pow(m, 2.0)));
} else if (m <= 3.8e-164) {
tmp = Math.cos(M) * Math.exp(((M * (n - M)) - (l - Math.abs((n - m)))));
} else {
tmp = Math.cos(M) * Math.exp((-0.25 * Math.pow(n, 2.0)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -1660000.0: tmp = math.cos(M) * math.exp((-0.25 * math.pow(m, 2.0))) elif m <= 3.8e-164: tmp = math.cos(M) * math.exp(((M * (n - M)) - (l - math.fabs((n - m))))) else: tmp = math.cos(M) * math.exp((-0.25 * math.pow(n, 2.0))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -1660000.0) tmp = Float64(cos(M) * exp(Float64(-0.25 * (m ^ 2.0)))); elseif (m <= 3.8e-164) tmp = Float64(cos(M) * exp(Float64(Float64(M * Float64(n - M)) - Float64(l - abs(Float64(n - m)))))); else tmp = Float64(cos(M) * exp(Float64(-0.25 * (n ^ 2.0)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -1660000.0) tmp = cos(M) * exp((-0.25 * (m ^ 2.0))); elseif (m <= 3.8e-164) tmp = cos(M) * exp(((M * (n - M)) - (l - abs((n - m))))); else tmp = cos(M) * exp((-0.25 * (n ^ 2.0))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -1660000.0], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[Power[m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 3.8e-164], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(M * N[(n - M), $MachinePrecision]), $MachinePrecision] - N[(l - N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[Power[n, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1660000:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot {m}^{2}}\\
\mathbf{elif}\;m \leq 3.8 \cdot 10^{-164}:\\
\;\;\;\;\cos M \cdot e^{M \cdot \left(n - M\right) - \left(\ell - \left|n - m\right|\right)}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot {n}^{2}}\\
\end{array}
\end{array}
if m < -1.66e6Initial program 75.9%
Simplified75.9%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in m around inf 100.0%
if -1.66e6 < m < 3.79999999999999989e-164Initial program 89.9%
Simplified89.9%
Taylor expanded in K around 0 94.3%
cos-neg94.3%
Simplified94.3%
Taylor expanded in n around 0 75.0%
+-commutative75.0%
unpow275.0%
distribute-rgt-out79.6%
Simplified79.6%
Taylor expanded in m around 0 79.6%
associate--r+79.6%
fabs-sub79.6%
associate-*r*79.6%
neg-mul-179.6%
cancel-sign-sub79.6%
Simplified79.6%
if 3.79999999999999989e-164 < m Initial program 72.7%
Simplified72.7%
Taylor expanded in K around 0 98.4%
cos-neg98.4%
Simplified98.4%
Taylor expanded in n around inf 59.1%
Final simplification75.3%
(FPCore (K m n M l)
:precision binary64
(if (<= m -1660000.0)
(* (cos M) (exp (* -0.25 (pow m 2.0))))
(if (<= m 1.18e-222)
(* (cos M) (exp (- (pow M 2.0))))
(* (cos M) (exp (* -0.25 (pow n 2.0)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1660000.0) {
tmp = cos(M) * exp((-0.25 * pow(m, 2.0)));
} else if (m <= 1.18e-222) {
tmp = cos(M) * exp(-pow(M, 2.0));
} else {
tmp = cos(M) * exp((-0.25 * pow(n, 2.0)));
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (m <= (-1660000.0d0)) then
tmp = cos(m_1) * exp(((-0.25d0) * (m ** 2.0d0)))
else if (m <= 1.18d-222) then
tmp = cos(m_1) * exp(-(m_1 ** 2.0d0))
else
tmp = cos(m_1) * exp(((-0.25d0) * (n ** 2.0d0)))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1660000.0) {
tmp = Math.cos(M) * Math.exp((-0.25 * Math.pow(m, 2.0)));
} else if (m <= 1.18e-222) {
tmp = Math.cos(M) * Math.exp(-Math.pow(M, 2.0));
} else {
tmp = Math.cos(M) * Math.exp((-0.25 * Math.pow(n, 2.0)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -1660000.0: tmp = math.cos(M) * math.exp((-0.25 * math.pow(m, 2.0))) elif m <= 1.18e-222: tmp = math.cos(M) * math.exp(-math.pow(M, 2.0)) else: tmp = math.cos(M) * math.exp((-0.25 * math.pow(n, 2.0))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -1660000.0) tmp = Float64(cos(M) * exp(Float64(-0.25 * (m ^ 2.0)))); elseif (m <= 1.18e-222) tmp = Float64(cos(M) * exp(Float64(-(M ^ 2.0)))); else tmp = Float64(cos(M) * exp(Float64(-0.25 * (n ^ 2.0)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -1660000.0) tmp = cos(M) * exp((-0.25 * (m ^ 2.0))); elseif (m <= 1.18e-222) tmp = cos(M) * exp(-(M ^ 2.0)); else tmp = cos(M) * exp((-0.25 * (n ^ 2.0))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -1660000.0], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[Power[m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 1.18e-222], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[Power[n, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1660000:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot {m}^{2}}\\
\mathbf{elif}\;m \leq 1.18 \cdot 10^{-222}:\\
\;\;\;\;\cos M \cdot e^{-{M}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot {n}^{2}}\\
\end{array}
\end{array}
if m < -1.66e6Initial program 75.9%
Simplified75.9%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in m around inf 100.0%
if -1.66e6 < m < 1.18000000000000007e-222Initial program 92.5%
Simplified92.5%
Taylor expanded in K around 0 94.8%
cos-neg94.8%
Simplified94.8%
Taylor expanded in M around inf 71.0%
mul-1-neg71.0%
Simplified71.0%
if 1.18000000000000007e-222 < m Initial program 72.4%
Simplified72.4%
Taylor expanded in K around 0 97.7%
cos-neg97.7%
Simplified97.7%
Taylor expanded in n around inf 60.0%
(FPCore (K m n M l) :precision binary64 (if (or (<= M -6.2) (not (<= M 2.35e-32))) (* (cos M) (exp (- (pow M 2.0)))) (* (cos M) (exp (- l)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if ((M <= -6.2) || !(M <= 2.35e-32)) {
tmp = cos(M) * exp(-pow(M, 2.0));
} else {
tmp = cos(M) * exp(-l);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if ((m_1 <= (-6.2d0)) .or. (.not. (m_1 <= 2.35d-32))) then
tmp = cos(m_1) * exp(-(m_1 ** 2.0d0))
else
tmp = cos(m_1) * exp(-l)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if ((M <= -6.2) || !(M <= 2.35e-32)) {
tmp = Math.cos(M) * Math.exp(-Math.pow(M, 2.0));
} else {
tmp = Math.cos(M) * Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if (M <= -6.2) or not (M <= 2.35e-32): tmp = math.cos(M) * math.exp(-math.pow(M, 2.0)) else: tmp = math.cos(M) * math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if ((M <= -6.2) || !(M <= 2.35e-32)) tmp = Float64(cos(M) * exp(Float64(-(M ^ 2.0)))); else tmp = Float64(cos(M) * exp(Float64(-l))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if ((M <= -6.2) || ~((M <= 2.35e-32))) tmp = cos(M) * exp(-(M ^ 2.0)); else tmp = cos(M) * exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[Or[LessEqual[M, -6.2], N[Not[LessEqual[M, 2.35e-32]], $MachinePrecision]], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;M \leq -6.2 \lor \neg \left(M \leq 2.35 \cdot 10^{-32}\right):\\
\;\;\;\;\cos M \cdot e^{-{M}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-\ell}\\
\end{array}
\end{array}
if M < -6.20000000000000018 or 2.3500000000000001e-32 < M Initial program 77.7%
Simplified77.7%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in M around inf 94.8%
mul-1-neg94.8%
Simplified94.8%
if -6.20000000000000018 < M < 2.3500000000000001e-32Initial program 80.9%
Simplified80.9%
Taylor expanded in K around 0 94.6%
cos-neg94.6%
Simplified94.6%
Taylor expanded in l around inf 49.5%
neg-mul-149.5%
Simplified49.5%
Final simplification72.5%
(FPCore (K m n M l)
:precision binary64
(if (<= m -1660000.0)
(* (cos M) (exp (* -0.25 (pow m 2.0))))
(if (<= m 1.05e-181)
(* (cos M) (exp (- (pow M 2.0))))
(* (cos M) (exp (* n (* m -0.5)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1660000.0) {
tmp = cos(M) * exp((-0.25 * pow(m, 2.0)));
} else if (m <= 1.05e-181) {
tmp = cos(M) * exp(-pow(M, 2.0));
} else {
tmp = cos(M) * exp((n * (m * -0.5)));
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (m <= (-1660000.0d0)) then
tmp = cos(m_1) * exp(((-0.25d0) * (m ** 2.0d0)))
else if (m <= 1.05d-181) then
tmp = cos(m_1) * exp(-(m_1 ** 2.0d0))
else
tmp = cos(m_1) * exp((n * (m * (-0.5d0))))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1660000.0) {
tmp = Math.cos(M) * Math.exp((-0.25 * Math.pow(m, 2.0)));
} else if (m <= 1.05e-181) {
tmp = Math.cos(M) * Math.exp(-Math.pow(M, 2.0));
} else {
tmp = Math.cos(M) * Math.exp((n * (m * -0.5)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -1660000.0: tmp = math.cos(M) * math.exp((-0.25 * math.pow(m, 2.0))) elif m <= 1.05e-181: tmp = math.cos(M) * math.exp(-math.pow(M, 2.0)) else: tmp = math.cos(M) * math.exp((n * (m * -0.5))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -1660000.0) tmp = Float64(cos(M) * exp(Float64(-0.25 * (m ^ 2.0)))); elseif (m <= 1.05e-181) tmp = Float64(cos(M) * exp(Float64(-(M ^ 2.0)))); else tmp = Float64(cos(M) * exp(Float64(n * Float64(m * -0.5)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -1660000.0) tmp = cos(M) * exp((-0.25 * (m ^ 2.0))); elseif (m <= 1.05e-181) tmp = cos(M) * exp(-(M ^ 2.0)); else tmp = cos(M) * exp((n * (m * -0.5))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -1660000.0], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[Power[m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 1.05e-181], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(n * N[(m * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1660000:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot {m}^{2}}\\
\mathbf{elif}\;m \leq 1.05 \cdot 10^{-181}:\\
\;\;\;\;\cos M \cdot e^{-{M}^{2}}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{n \cdot \left(m \cdot -0.5\right)}\\
\end{array}
\end{array}
if m < -1.66e6Initial program 75.9%
Simplified75.9%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in m around inf 100.0%
if -1.66e6 < m < 1.05000000000000002e-181Initial program 89.7%
Simplified89.7%
Taylor expanded in K around 0 94.2%
cos-neg94.2%
Simplified94.2%
Taylor expanded in M around inf 69.1%
mul-1-neg69.1%
Simplified69.1%
if 1.05000000000000002e-181 < m Initial program 73.1%
Simplified73.1%
Taylor expanded in K around 0 98.4%
cos-neg98.4%
Simplified98.4%
Taylor expanded in n around 0 72.0%
+-commutative72.0%
unpow272.0%
distribute-rgt-out80.9%
Simplified80.9%
Taylor expanded in n around inf 38.7%
Taylor expanded in M around 0 34.4%
associate-*r*34.4%
*-commutative34.4%
Simplified34.4%
Final simplification60.8%
(FPCore (K m n M l)
:precision binary64
(if (<= l -260.0)
(* (exp l) (cos (- (* 0.5 (* (+ n m) K)) M)))
(if (<= l 1.5e-20)
(* (cos M) (exp (* m (- (* n (/ M m)) (* n 0.5)))))
(* (cos M) (exp (- l))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= -260.0) {
tmp = exp(l) * cos(((0.5 * ((n + m) * K)) - M));
} else if (l <= 1.5e-20) {
tmp = cos(M) * exp((m * ((n * (M / m)) - (n * 0.5))));
} else {
tmp = cos(M) * exp(-l);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (l <= (-260.0d0)) then
tmp = exp(l) * cos(((0.5d0 * ((n + m) * k)) - m_1))
else if (l <= 1.5d-20) then
tmp = cos(m_1) * exp((m * ((n * (m_1 / m)) - (n * 0.5d0))))
else
tmp = cos(m_1) * exp(-l)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= -260.0) {
tmp = Math.exp(l) * Math.cos(((0.5 * ((n + m) * K)) - M));
} else if (l <= 1.5e-20) {
tmp = Math.cos(M) * Math.exp((m * ((n * (M / m)) - (n * 0.5))));
} else {
tmp = Math.cos(M) * Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= -260.0: tmp = math.exp(l) * math.cos(((0.5 * ((n + m) * K)) - M)) elif l <= 1.5e-20: tmp = math.cos(M) * math.exp((m * ((n * (M / m)) - (n * 0.5)))) else: tmp = math.cos(M) * math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= -260.0) tmp = Float64(exp(l) * cos(Float64(Float64(0.5 * Float64(Float64(n + m) * K)) - M))); elseif (l <= 1.5e-20) tmp = Float64(cos(M) * exp(Float64(m * Float64(Float64(n * Float64(M / m)) - Float64(n * 0.5))))); else tmp = Float64(cos(M) * exp(Float64(-l))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= -260.0) tmp = exp(l) * cos(((0.5 * ((n + m) * K)) - M)); elseif (l <= 1.5e-20) tmp = cos(M) * exp((m * ((n * (M / m)) - (n * 0.5)))); else tmp = cos(M) * exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, -260.0], N[(N[Exp[l], $MachinePrecision] * N[Cos[N[(N[(0.5 * N[(N[(n + m), $MachinePrecision] * K), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1.5e-20], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(m * N[(N[(n * N[(M / m), $MachinePrecision]), $MachinePrecision] - N[(n * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -260:\\
\;\;\;\;e^{\ell} \cdot \cos \left(0.5 \cdot \left(\left(n + m\right) \cdot K\right) - M\right)\\
\mathbf{elif}\;\ell \leq 1.5 \cdot 10^{-20}:\\
\;\;\;\;\cos M \cdot e^{m \cdot \left(n \cdot \frac{M}{m} - n \cdot 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-\ell}\\
\end{array}
\end{array}
if l < -260Initial program 73.2%
Simplified73.2%
add-cbrt-cube73.2%
pow373.2%
*-commutative73.2%
div-inv73.2%
associate-*l*73.2%
*-commutative73.2%
metadata-eval73.2%
Applied egg-rr73.2%
Taylor expanded in l around inf 18.7%
neg-mul-122.6%
Simplified18.7%
rem-cbrt-cube18.7%
*-commutative18.7%
add-sqr-sqrt18.7%
sqrt-unprod18.7%
sqr-neg18.7%
sqrt-unprod0.0%
add-sqr-sqrt54.0%
associate-*r*54.0%
+-commutative54.0%
Applied egg-rr54.0%
if -260 < l < 1.50000000000000014e-20Initial program 82.6%
Simplified82.6%
Taylor expanded in K around 0 97.0%
cos-neg97.0%
Simplified97.0%
Taylor expanded in n around 0 71.2%
+-commutative71.2%
unpow271.2%
distribute-rgt-out79.2%
Simplified79.2%
Taylor expanded in n around inf 40.8%
Taylor expanded in m around -inf 40.8%
mul-1-neg40.8%
distribute-rgt-neg-in40.8%
+-commutative40.8%
mul-1-neg40.8%
unsub-neg40.8%
*-commutative40.8%
*-commutative40.8%
associate-/l*44.6%
Simplified44.6%
if 1.50000000000000014e-20 < l Initial program 78.1%
Simplified78.1%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in l around inf 95.4%
neg-mul-195.4%
Simplified95.4%
Final simplification61.1%
(FPCore (K m n M l)
:precision binary64
(if (<= l -260.0)
(* (exp l) (cos (- (* 0.5 (* (+ n m) K)) M)))
(if (<= l 3.45e-15)
(* (cos M) (exp (* n (- M (* m 0.5)))))
(* (cos M) (exp (- l))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= -260.0) {
tmp = exp(l) * cos(((0.5 * ((n + m) * K)) - M));
} else if (l <= 3.45e-15) {
tmp = cos(M) * exp((n * (M - (m * 0.5))));
} else {
tmp = cos(M) * exp(-l);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (l <= (-260.0d0)) then
tmp = exp(l) * cos(((0.5d0 * ((n + m) * k)) - m_1))
else if (l <= 3.45d-15) then
tmp = cos(m_1) * exp((n * (m_1 - (m * 0.5d0))))
else
tmp = cos(m_1) * exp(-l)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= -260.0) {
tmp = Math.exp(l) * Math.cos(((0.5 * ((n + m) * K)) - M));
} else if (l <= 3.45e-15) {
tmp = Math.cos(M) * Math.exp((n * (M - (m * 0.5))));
} else {
tmp = Math.cos(M) * Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= -260.0: tmp = math.exp(l) * math.cos(((0.5 * ((n + m) * K)) - M)) elif l <= 3.45e-15: tmp = math.cos(M) * math.exp((n * (M - (m * 0.5)))) else: tmp = math.cos(M) * math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= -260.0) tmp = Float64(exp(l) * cos(Float64(Float64(0.5 * Float64(Float64(n + m) * K)) - M))); elseif (l <= 3.45e-15) tmp = Float64(cos(M) * exp(Float64(n * Float64(M - Float64(m * 0.5))))); else tmp = Float64(cos(M) * exp(Float64(-l))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= -260.0) tmp = exp(l) * cos(((0.5 * ((n + m) * K)) - M)); elseif (l <= 3.45e-15) tmp = cos(M) * exp((n * (M - (m * 0.5)))); else tmp = cos(M) * exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, -260.0], N[(N[Exp[l], $MachinePrecision] * N[Cos[N[(N[(0.5 * N[(N[(n + m), $MachinePrecision] * K), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.45e-15], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(n * N[(M - N[(m * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -260:\\
\;\;\;\;e^{\ell} \cdot \cos \left(0.5 \cdot \left(\left(n + m\right) \cdot K\right) - M\right)\\
\mathbf{elif}\;\ell \leq 3.45 \cdot 10^{-15}:\\
\;\;\;\;\cos M \cdot e^{n \cdot \left(M - m \cdot 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-\ell}\\
\end{array}
\end{array}
if l < -260Initial program 73.2%
Simplified73.2%
add-cbrt-cube73.2%
pow373.2%
*-commutative73.2%
div-inv73.2%
associate-*l*73.2%
*-commutative73.2%
metadata-eval73.2%
Applied egg-rr73.2%
Taylor expanded in l around inf 18.7%
neg-mul-122.6%
Simplified18.7%
rem-cbrt-cube18.7%
*-commutative18.7%
add-sqr-sqrt18.7%
sqrt-unprod18.7%
sqr-neg18.7%
sqrt-unprod0.0%
add-sqr-sqrt54.0%
associate-*r*54.0%
+-commutative54.0%
Applied egg-rr54.0%
if -260 < l < 3.45000000000000005e-15Initial program 82.7%
Simplified82.7%
Taylor expanded in K around 0 97.0%
cos-neg97.0%
Simplified97.0%
Taylor expanded in n around 0 71.4%
+-commutative71.4%
unpow271.4%
distribute-rgt-out79.3%
Simplified79.3%
Taylor expanded in n around inf 40.9%
if 3.45000000000000005e-15 < l Initial program 77.8%
Simplified77.8%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in l around inf 96.0%
neg-mul-196.0%
Simplified96.0%
Final simplification59.3%
(FPCore (K m n M l)
:precision binary64
(if (<= l 2.4e-145)
(* (cos M) (exp (* M n)))
(if (<= l 3.45e-15)
(* (cos M) (exp (* n (* m -0.5))))
(* (cos M) (exp (- l))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 2.4e-145) {
tmp = cos(M) * exp((M * n));
} else if (l <= 3.45e-15) {
tmp = cos(M) * exp((n * (m * -0.5)));
} else {
tmp = cos(M) * exp(-l);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (l <= 2.4d-145) then
tmp = cos(m_1) * exp((m_1 * n))
else if (l <= 3.45d-15) then
tmp = cos(m_1) * exp((n * (m * (-0.5d0))))
else
tmp = cos(m_1) * exp(-l)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 2.4e-145) {
tmp = Math.cos(M) * Math.exp((M * n));
} else if (l <= 3.45e-15) {
tmp = Math.cos(M) * Math.exp((n * (m * -0.5)));
} else {
tmp = Math.cos(M) * Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= 2.4e-145: tmp = math.cos(M) * math.exp((M * n)) elif l <= 3.45e-15: tmp = math.cos(M) * math.exp((n * (m * -0.5))) else: tmp = math.cos(M) * math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= 2.4e-145) tmp = Float64(cos(M) * exp(Float64(M * n))); elseif (l <= 3.45e-15) tmp = Float64(cos(M) * exp(Float64(n * Float64(m * -0.5)))); else tmp = Float64(cos(M) * exp(Float64(-l))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= 2.4e-145) tmp = cos(M) * exp((M * n)); elseif (l <= 3.45e-15) tmp = cos(M) * exp((n * (m * -0.5))); else tmp = cos(M) * exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, 2.4e-145], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(M * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 3.45e-15], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(n * N[(m * -0.5), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 2.4 \cdot 10^{-145}:\\
\;\;\;\;\cos M \cdot e^{M \cdot n}\\
\mathbf{elif}\;\ell \leq 3.45 \cdot 10^{-15}:\\
\;\;\;\;\cos M \cdot e^{n \cdot \left(m \cdot -0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-\ell}\\
\end{array}
\end{array}
if l < 2.40000000000000015e-145Initial program 78.9%
Simplified78.9%
Taylor expanded in K around 0 96.3%
cos-neg96.3%
Simplified96.3%
Taylor expanded in n around 0 74.8%
+-commutative74.8%
unpow274.8%
distribute-rgt-out81.3%
Simplified81.3%
Taylor expanded in n around inf 37.2%
Taylor expanded in m around 0 31.2%
*-commutative31.2%
*-commutative31.2%
Simplified31.2%
if 2.40000000000000015e-145 < l < 3.45000000000000005e-15Initial program 85.2%
Simplified85.2%
Taylor expanded in K around 0 96.4%
cos-neg96.4%
Simplified96.4%
Taylor expanded in n around 0 66.9%
+-commutative66.9%
unpow266.9%
distribute-rgt-out74.4%
Simplified74.4%
Taylor expanded in n around inf 44.1%
Taylor expanded in M around 0 47.8%
associate-*r*47.8%
*-commutative47.8%
Simplified47.8%
if 3.45000000000000005e-15 < l Initial program 77.8%
Simplified77.8%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in l around inf 96.0%
neg-mul-196.0%
Simplified96.0%
Final simplification51.2%
(FPCore (K m n M l) :precision binary64 (if (<= l 3.45e-15) (* (cos M) (exp (* n (- M (* m 0.5))))) (* (cos M) (exp (- l)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 3.45e-15) {
tmp = cos(M) * exp((n * (M - (m * 0.5))));
} else {
tmp = cos(M) * exp(-l);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (l <= 3.45d-15) then
tmp = cos(m_1) * exp((n * (m_1 - (m * 0.5d0))))
else
tmp = cos(m_1) * exp(-l)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 3.45e-15) {
tmp = Math.cos(M) * Math.exp((n * (M - (m * 0.5))));
} else {
tmp = Math.cos(M) * Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= 3.45e-15: tmp = math.cos(M) * math.exp((n * (M - (m * 0.5)))) else: tmp = math.cos(M) * math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= 3.45e-15) tmp = Float64(cos(M) * exp(Float64(n * Float64(M - Float64(m * 0.5))))); else tmp = Float64(cos(M) * exp(Float64(-l))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= 3.45e-15) tmp = cos(M) * exp((n * (M - (m * 0.5)))); else tmp = cos(M) * exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, 3.45e-15], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(n * N[(M - N[(m * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3.45 \cdot 10^{-15}:\\
\;\;\;\;\cos M \cdot e^{n \cdot \left(M - m \cdot 0.5\right)}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-\ell}\\
\end{array}
\end{array}
if l < 3.45000000000000005e-15Initial program 79.8%
Simplified79.8%
Taylor expanded in K around 0 96.3%
cos-neg96.3%
Simplified96.3%
Taylor expanded in n around 0 73.7%
+-commutative73.7%
unpow273.7%
distribute-rgt-out80.2%
Simplified80.2%
Taylor expanded in n around inf 38.2%
if 3.45000000000000005e-15 < l Initial program 77.8%
Simplified77.8%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in l around inf 96.0%
neg-mul-196.0%
Simplified96.0%
Final simplification54.5%
(FPCore (K m n M l) :precision binary64 (if (<= l 0.0135) (* (cos M) (exp (* M n))) (* (cos M) (exp (- l)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 0.0135) {
tmp = cos(M) * exp((M * n));
} else {
tmp = cos(M) * exp(-l);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (l <= 0.0135d0) then
tmp = cos(m_1) * exp((m_1 * n))
else
tmp = cos(m_1) * exp(-l)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 0.0135) {
tmp = Math.cos(M) * Math.exp((M * n));
} else {
tmp = Math.cos(M) * Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= 0.0135: tmp = math.cos(M) * math.exp((M * n)) else: tmp = math.cos(M) * math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= 0.0135) tmp = Float64(cos(M) * exp(Float64(M * n))); else tmp = Float64(cos(M) * exp(Float64(-l))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= 0.0135) tmp = cos(M) * exp((M * n)); else tmp = cos(M) * exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, 0.0135], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(M * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 0.0135:\\
\;\;\;\;\cos M \cdot e^{M \cdot n}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-\ell}\\
\end{array}
\end{array}
if l < 0.0134999999999999998Initial program 79.6%
Simplified79.6%
Taylor expanded in K around 0 96.4%
cos-neg96.4%
Simplified96.4%
Taylor expanded in n around 0 73.5%
+-commutative73.5%
unpow273.5%
distribute-rgt-out80.0%
Simplified80.0%
Taylor expanded in n around inf 37.9%
Taylor expanded in m around 0 31.8%
*-commutative31.8%
*-commutative31.8%
Simplified31.8%
if 0.0134999999999999998 < l Initial program 78.3%
Simplified78.3%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
Taylor expanded in l around inf 98.6%
neg-mul-198.6%
Simplified98.6%
Final simplification49.8%
(FPCore (K m n M l) :precision binary64 (* (cos M) (exp (- l))))
double code(double K, double m, double n, double M, double l) {
return cos(M) * exp(-l);
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos(m_1) * exp(-l)
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) * Math.exp(-l);
}
def code(K, m, n, M, l): return math.cos(M) * math.exp(-l)
function code(K, m, n, M, l) return Float64(cos(M) * exp(Float64(-l))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) * exp(-l); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos M \cdot e^{-\ell}
\end{array}
Initial program 79.2%
Simplified79.2%
Taylor expanded in K around 0 97.3%
cos-neg97.3%
Simplified97.3%
Taylor expanded in l around inf 39.4%
neg-mul-139.4%
Simplified39.4%
(FPCore (K m n M l) :precision binary64 (cos M))
double code(double K, double m, double n, double M, double l) {
return cos(M);
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos(m_1)
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M);
}
def code(K, m, n, M, l): return math.cos(M)
function code(K, m, n, M, l) return cos(M) end
function tmp = code(K, m, n, M, l) tmp = cos(M); end
code[K_, m_, n_, M_, l_] := N[Cos[M], $MachinePrecision]
\begin{array}{l}
\\
\cos M
\end{array}
Initial program 79.2%
Simplified79.2%
Taylor expanded in K around 0 97.3%
cos-neg97.3%
Simplified97.3%
Taylor expanded in n around 0 76.4%
+-commutative76.4%
unpow276.4%
distribute-rgt-out82.7%
Simplified82.7%
Taylor expanded in n around inf 36.7%
Taylor expanded in n around 0 9.2%
herbie shell --seed 2024096
(FPCore (K m n M l)
:name "Maksimov and Kolovsky, Equation (32)"
:precision binary64
(* (cos (- (/ (* K (+ m n)) 2.0) M)) (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))