
(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 8 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 (let* ((t_0 (cbrt (+ (pow (- (* (+ m n) 0.5) M) 2.0) (+ l (- m n)))))) (/ (cos M) (pow (exp (pow t_0 2.0)) t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = cbrt((pow((((m + n) * 0.5) - M), 2.0) + (l + (m - n))));
return cos(M) / pow(exp(pow(t_0, 2.0)), t_0);
}
public static double code(double K, double m, double n, double M, double l) {
double t_0 = Math.cbrt((Math.pow((((m + n) * 0.5) - M), 2.0) + (l + (m - n))));
return Math.cos(M) / Math.pow(Math.exp(Math.pow(t_0, 2.0)), t_0);
}
function code(K, m, n, M, l) t_0 = cbrt(Float64((Float64(Float64(Float64(m + n) * 0.5) - M) ^ 2.0) + Float64(l + Float64(m - n)))) return Float64(cos(M) / (exp((t_0 ^ 2.0)) ^ t_0)) end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Power[N[(N[Power[N[(N[(N[(m + n), $MachinePrecision] * 0.5), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision] + N[(l + N[(m - n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision]}, N[(N[Cos[M], $MachinePrecision] / N[Power[N[Exp[N[Power[t$95$0, 2.0], $MachinePrecision]], $MachinePrecision], t$95$0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \sqrt[3]{{\left(\left(m + n\right) \cdot 0.5 - M\right)}^{2} + \left(\ell + \left(m - n\right)\right)}\\
\frac{\cos M}{{\left(e^{{t_0}^{2}}\right)}^{t_0}}
\end{array}
\end{array}
Initial program 76.0%
Simplified76.0%
Taylor expanded in K around 0 95.5%
cos-neg95.5%
Simplified95.5%
add-cube-cbrt95.5%
exp-prod95.5%
Applied egg-rr95.5%
Final simplification95.5%
(FPCore (K m n M l) :precision binary64 (/ (cos M) (exp (+ (pow (- (/ (+ m n) 2.0) M) 2.0) (- l (fabs (- n m)))))))
double code(double K, double m, double n, double M, double l) {
return cos(M) / exp((pow((((m + n) / 2.0) - M), 2.0) + (l - fabs((n - 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) / exp((((((m + n) / 2.0d0) - m_1) ** 2.0d0) + (l - abs((n - m)))))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) / Math.exp((Math.pow((((m + n) / 2.0) - M), 2.0) + (l - Math.abs((n - m)))));
}
def code(K, m, n, M, l): return math.cos(M) / math.exp((math.pow((((m + n) / 2.0) - M), 2.0) + (l - math.fabs((n - m)))))
function code(K, m, n, M, l) return Float64(cos(M) / exp(Float64((Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0) + Float64(l - abs(Float64(n - m)))))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) / exp((((((m + n) / 2.0) - M) ^ 2.0) + (l - abs((n - m))))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $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[(n - m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos M}{e^{{\left(\frac{m + n}{2} - M\right)}^{2} + \left(\ell - \left|n - m\right|\right)}}
\end{array}
Initial program 76.0%
Simplified76.0%
Taylor expanded in K around 0 95.5%
cos-neg95.5%
Simplified95.5%
Final simplification95.5%
(FPCore (K m n M l) :precision binary64 (if (<= m -1.5e+41) (/ (cos M) (exp (+ m (pow (- (* m 0.5) M) 2.0)))) (/ (cos M) (exp (+ (pow (- (* n 0.5) M) 2.0) (- l n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1.5e+41) {
tmp = cos(M) / exp((m + pow(((m * 0.5) - M), 2.0)));
} else {
tmp = cos(M) / exp((pow(((n * 0.5) - M), 2.0) + (l - n)));
}
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.5d+41)) then
tmp = cos(m_1) / exp((m + (((m * 0.5d0) - m_1) ** 2.0d0)))
else
tmp = cos(m_1) / exp(((((n * 0.5d0) - m_1) ** 2.0d0) + (l - n)))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -1.5e+41) {
tmp = Math.cos(M) / Math.exp((m + Math.pow(((m * 0.5) - M), 2.0)));
} else {
tmp = Math.cos(M) / Math.exp((Math.pow(((n * 0.5) - M), 2.0) + (l - n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -1.5e+41: tmp = math.cos(M) / math.exp((m + math.pow(((m * 0.5) - M), 2.0))) else: tmp = math.cos(M) / math.exp((math.pow(((n * 0.5) - M), 2.0) + (l - n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -1.5e+41) tmp = Float64(cos(M) / exp(Float64(m + (Float64(Float64(m * 0.5) - M) ^ 2.0)))); else tmp = Float64(cos(M) / exp(Float64((Float64(Float64(n * 0.5) - M) ^ 2.0) + Float64(l - n)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -1.5e+41) tmp = cos(M) / exp((m + (((m * 0.5) - M) ^ 2.0))); else tmp = cos(M) / exp(((((n * 0.5) - M) ^ 2.0) + (l - n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -1.5e+41], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(m + N[Power[N[(N[(m * 0.5), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(N[Power[N[(N[(n * 0.5), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision] + N[(l - n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -1.5 \cdot 10^{+41}:\\
\;\;\;\;\frac{\cos M}{e^{m + {\left(m \cdot 0.5 - M\right)}^{2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos M}{e^{{\left(n \cdot 0.5 - M\right)}^{2} + \left(\ell - n\right)}}\\
\end{array}
\end{array}
if m < -1.4999999999999999e41Initial program 88.3%
Simplified88.3%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
add-cube-cbrt100.0%
exp-prod100.0%
Applied egg-rr100.0%
Taylor expanded in n around 0 100.0%
pow-base-1100.0%
*-lft-identity100.0%
Simplified100.0%
Taylor expanded in l around 0 100.0%
if -1.4999999999999999e41 < m Initial program 72.3%
Simplified72.3%
Taylor expanded in K around 0 94.1%
cos-neg94.1%
Simplified94.1%
add-cube-cbrt94.1%
exp-prod94.1%
Applied egg-rr94.1%
Taylor expanded in m around 0 88.1%
pow-base-188.1%
*-rgt-identity88.1%
associate--l+88.1%
Simplified88.1%
Final simplification90.9%
(FPCore (K m n M l) :precision binary64 (if (<= m -0.0058) (/ (cos M) (exp (+ m (pow (- (* m 0.5) M) 2.0)))) (/ (cos M) (exp (+ (+ m l) (* M M))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -0.0058) {
tmp = cos(M) / exp((m + pow(((m * 0.5) - M), 2.0)));
} else {
tmp = cos(M) / exp(((m + l) + (M * M)));
}
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 <= (-0.0058d0)) then
tmp = cos(m_1) / exp((m + (((m * 0.5d0) - m_1) ** 2.0d0)))
else
tmp = cos(m_1) / exp(((m + l) + (m_1 * m_1)))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -0.0058) {
tmp = Math.cos(M) / Math.exp((m + Math.pow(((m * 0.5) - M), 2.0)));
} else {
tmp = Math.cos(M) / Math.exp(((m + l) + (M * M)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -0.0058: tmp = math.cos(M) / math.exp((m + math.pow(((m * 0.5) - M), 2.0))) else: tmp = math.cos(M) / math.exp(((m + l) + (M * M))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -0.0058) tmp = Float64(cos(M) / exp(Float64(m + (Float64(Float64(m * 0.5) - M) ^ 2.0)))); else tmp = Float64(cos(M) / exp(Float64(Float64(m + l) + Float64(M * M)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -0.0058) tmp = cos(M) / exp((m + (((m * 0.5) - M) ^ 2.0))); else tmp = cos(M) / exp(((m + l) + (M * M))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -0.0058], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(m + N[Power[N[(N[(m * 0.5), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(N[(m + l), $MachinePrecision] + N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -0.0058:\\
\;\;\;\;\frac{\cos M}{e^{m + {\left(m \cdot 0.5 - M\right)}^{2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos M}{e^{\left(m + \ell\right) + M \cdot M}}\\
\end{array}
\end{array}
if m < -0.0058Initial program 85.3%
Simplified85.3%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
add-cube-cbrt100.0%
exp-prod100.0%
Applied egg-rr100.0%
Taylor expanded in n around 0 100.0%
pow-base-1100.0%
*-lft-identity100.0%
Simplified100.0%
Taylor expanded in l around 0 100.0%
if -0.0058 < m Initial program 72.2%
Simplified72.2%
Taylor expanded in K around 0 93.6%
cos-neg93.6%
Simplified93.6%
add-cube-cbrt93.6%
exp-prod93.6%
Applied egg-rr93.6%
Taylor expanded in n around 0 85.5%
pow-base-185.5%
*-lft-identity85.5%
Simplified85.5%
Taylor expanded in m around 0 85.0%
unpow285.0%
Simplified85.0%
Final simplification89.4%
(FPCore (K m n M l) :precision binary64 (/ (cos M) (exp (+ (pow (- (* m 0.5) M) 2.0) (+ m l)))))
double code(double K, double m, double n, double M, double l) {
return cos(M) / exp((pow(((m * 0.5) - M), 2.0) + (m + 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(((((m * 0.5d0) - m_1) ** 2.0d0) + (m + l)))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) / Math.exp((Math.pow(((m * 0.5) - M), 2.0) + (m + l)));
}
def code(K, m, n, M, l): return math.cos(M) / math.exp((math.pow(((m * 0.5) - M), 2.0) + (m + l)))
function code(K, m, n, M, l) return Float64(cos(M) / exp(Float64((Float64(Float64(m * 0.5) - M) ^ 2.0) + Float64(m + l)))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) / exp(((((m * 0.5) - M) ^ 2.0) + (m + l))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(N[Power[N[(N[(m * 0.5), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision] + N[(m + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos M}{e^{{\left(m \cdot 0.5 - M\right)}^{2} + \left(m + \ell\right)}}
\end{array}
Initial program 76.0%
Simplified76.0%
Taylor expanded in K around 0 95.5%
cos-neg95.5%
Simplified95.5%
add-cube-cbrt95.5%
exp-prod95.5%
Applied egg-rr95.5%
Taylor expanded in n around 0 89.8%
pow-base-189.8%
*-lft-identity89.8%
Simplified89.8%
Final simplification89.8%
(FPCore (K m n M l) :precision binary64 (if (<= m -5e+26) (/ (cos M) (exp (+ (+ m l) (* 0.25 (* m m))))) (/ (cos M) (exp (+ (+ m l) (* M M))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -5e+26) {
tmp = cos(M) / exp(((m + l) + (0.25 * (m * m))));
} else {
tmp = cos(M) / exp(((m + l) + (M * M)));
}
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 <= (-5d+26)) then
tmp = cos(m_1) / exp(((m + l) + (0.25d0 * (m * m))))
else
tmp = cos(m_1) / exp(((m + l) + (m_1 * m_1)))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -5e+26) {
tmp = Math.cos(M) / Math.exp(((m + l) + (0.25 * (m * m))));
} else {
tmp = Math.cos(M) / Math.exp(((m + l) + (M * M)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -5e+26: tmp = math.cos(M) / math.exp(((m + l) + (0.25 * (m * m)))) else: tmp = math.cos(M) / math.exp(((m + l) + (M * M))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -5e+26) tmp = Float64(cos(M) / exp(Float64(Float64(m + l) + Float64(0.25 * Float64(m * m))))); else tmp = Float64(cos(M) / exp(Float64(Float64(m + l) + Float64(M * M)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -5e+26) tmp = cos(M) / exp(((m + l) + (0.25 * (m * m)))); else tmp = cos(M) / exp(((m + l) + (M * M))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -5e+26], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(N[(m + l), $MachinePrecision] + N[(0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(N[(m + l), $MachinePrecision] + N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -5 \cdot 10^{+26}:\\
\;\;\;\;\frac{\cos M}{e^{\left(m + \ell\right) + 0.25 \cdot \left(m \cdot m\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos M}{e^{\left(m + \ell\right) + M \cdot M}}\\
\end{array}
\end{array}
if m < -5.0000000000000001e26Initial program 86.4%
Simplified86.4%
Taylor expanded in K around 0 100.0%
cos-neg100.0%
Simplified100.0%
add-cube-cbrt100.0%
exp-prod100.0%
Applied egg-rr100.0%
Taylor expanded in n around 0 100.0%
pow-base-1100.0%
*-lft-identity100.0%
Simplified100.0%
Taylor expanded in M around 0 100.0%
associate-+r+100.0%
+-commutative100.0%
unpow2100.0%
Simplified100.0%
if -5.0000000000000001e26 < m Initial program 72.4%
Simplified72.4%
Taylor expanded in K around 0 93.9%
cos-neg93.9%
Simplified93.9%
add-cube-cbrt93.9%
exp-prod93.9%
Applied egg-rr93.9%
Taylor expanded in n around 0 86.2%
pow-base-186.2%
*-lft-identity86.2%
Simplified86.2%
Taylor expanded in m around 0 84.7%
unpow284.7%
Simplified84.7%
Final simplification88.6%
(FPCore (K m n M l) :precision binary64 (/ (cos M) (exp (+ l (* M M)))))
double code(double K, double m, double n, double M, double l) {
return cos(M) / exp((l + (M * 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) / exp((l + (m_1 * m_1)))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) / Math.exp((l + (M * M)));
}
def code(K, m, n, M, l): return math.cos(M) / math.exp((l + (M * M)))
function code(K, m, n, M, l) return Float64(cos(M) / exp(Float64(l + Float64(M * M)))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) / exp((l + (M * M))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(l + N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos M}{e^{\ell + M \cdot M}}
\end{array}
Initial program 76.0%
Simplified76.0%
Taylor expanded in K around 0 95.5%
cos-neg95.5%
Simplified95.5%
add-cube-cbrt95.5%
exp-prod95.5%
Applied egg-rr95.5%
Taylor expanded in n around 0 89.8%
pow-base-189.8%
*-lft-identity89.8%
Simplified89.8%
Taylor expanded in m around 0 74.5%
+-commutative74.5%
unpow274.5%
Simplified74.5%
Final simplification74.5%
(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 76.0%
Simplified76.0%
Taylor expanded in K around 0 95.5%
cos-neg95.5%
Simplified95.5%
add-cube-cbrt95.5%
exp-prod95.5%
Applied egg-rr95.5%
Taylor expanded in m around inf 5.5%
Final simplification5.5%
herbie shell --seed 2023217
(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)))))))