
(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 7 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 (fma 0.5 (+ m n) (- M)))) (* (cos M) (exp (- (fabs (- n m)) (fma t_0 t_0 l))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = fma(0.5, (m + n), -M);
return cos(M) * exp((fabs((n - m)) - fma(t_0, t_0, l)));
}
function code(K, m, n, M, l) t_0 = fma(0.5, Float64(m + n), Float64(-M)) return Float64(cos(M) * exp(Float64(abs(Float64(n - m)) - fma(t_0, t_0, l)))) end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(0.5 * N[(m + n), $MachinePrecision] + (-M)), $MachinePrecision]}, N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(t$95$0 * t$95$0 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(0.5, m + n, -M\right)\\
\cos M \cdot e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)}
\end{array}
\end{array}
Initial program 81.3%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites97.8%
Final simplification97.8%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (fma 0.5 (+ m n) (- M)))) (* (exp (- (fabs (- n m)) (fma t_0 t_0 l))) 1.0)))
double code(double K, double m, double n, double M, double l) {
double t_0 = fma(0.5, (m + n), -M);
return exp((fabs((n - m)) - fma(t_0, t_0, l))) * 1.0;
}
function code(K, m, n, M, l) t_0 = fma(0.5, Float64(m + n), Float64(-M)) return Float64(exp(Float64(abs(Float64(n - m)) - fma(t_0, t_0, l))) * 1.0) end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(0.5 * N[(m + n), $MachinePrecision] + (-M)), $MachinePrecision]}, N[(N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(t$95$0 * t$95$0 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(0.5, m + n, -M\right)\\
e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)} \cdot 1
\end{array}
\end{array}
Initial program 81.3%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites97.8%
Taylor expanded in M around 0
Applied rewrites97.0%
Final simplification97.0%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (fabs (- n m))) (t_1 (* 1.0 (exp (- t_0 (* M M))))))
(if (<= M -1.15e+122)
t_1
(if (<= M 1.65e+123)
(exp (- t_0 (fma 0.25 (* (+ m n) (+ m n)) l)))
t_1))))
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((n - m));
double t_1 = 1.0 * exp((t_0 - (M * M)));
double tmp;
if (M <= -1.15e+122) {
tmp = t_1;
} else if (M <= 1.65e+123) {
tmp = exp((t_0 - fma(0.25, ((m + n) * (m + n)), l)));
} else {
tmp = t_1;
}
return tmp;
}
function code(K, m, n, M, l) t_0 = abs(Float64(n - m)) t_1 = Float64(1.0 * exp(Float64(t_0 - Float64(M * M)))) tmp = 0.0 if (M <= -1.15e+122) tmp = t_1; elseif (M <= 1.65e+123) tmp = exp(Float64(t_0 - fma(0.25, Float64(Float64(m + n) * Float64(m + n)), l))); else tmp = t_1; end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(1.0 * N[Exp[N[(t$95$0 - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M, -1.15e+122], t$95$1, If[LessEqual[M, 1.65e+123], N[Exp[N[(t$95$0 - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$1]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left|n - m\right|\\
t_1 := 1 \cdot e^{t\_0 - M \cdot M}\\
\mathbf{if}\;M \leq -1.15 \cdot 10^{+122}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;M \leq 1.65 \cdot 10^{+123}:\\
\;\;\;\;e^{t\_0 - \mathsf{fma}\left(0.25, \left(m + n\right) \cdot \left(m + n\right), \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if M < -1.15e122 or 1.65000000000000001e123 < M Initial program 86.1%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites100.0%
Taylor expanded in M around inf
Applied rewrites100.0%
if -1.15e122 < M < 1.65000000000000001e123Initial program 79.2%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites96.8%
Taylor expanded in M around 0
Applied rewrites93.5%
(FPCore (K m n M l) :precision binary64 (if (<= m -55.0) (exp (* (* m m) -0.25)) (exp (- (fabs (- n m)) (* 0.25 (* n n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -55.0) {
tmp = exp(((m * m) * -0.25));
} else {
tmp = exp((fabs((n - m)) - (0.25 * (n * 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 <= (-55.0d0)) then
tmp = exp(((m * m) * (-0.25d0)))
else
tmp = exp((abs((n - m)) - (0.25d0 * (n * 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 <= -55.0) {
tmp = Math.exp(((m * m) * -0.25));
} else {
tmp = Math.exp((Math.abs((n - m)) - (0.25 * (n * n))));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -55.0: tmp = math.exp(((m * m) * -0.25)) else: tmp = math.exp((math.fabs((n - m)) - (0.25 * (n * n)))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -55.0) tmp = exp(Float64(Float64(m * m) * -0.25)); else tmp = exp(Float64(abs(Float64(n - m)) - Float64(0.25 * Float64(n * n)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -55.0) tmp = exp(((m * m) * -0.25)); else tmp = exp((abs((n - m)) - (0.25 * (n * n)))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -55:\\
\;\;\;\;e^{\left(m \cdot m\right) \cdot -0.25}\\
\mathbf{else}:\\
\;\;\;\;e^{\left|n - m\right| - 0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -55Initial program 72.1%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites96.8%
Taylor expanded in m around inf
Applied rewrites98.4%
if -55 < m Initial program 84.2%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites97.1%
Taylor expanded in M around 0
Applied rewrites84.1%
Taylor expanded in n around inf
Applied rewrites51.5%
(FPCore (K m n M l) :precision binary64 (if (<= n 0.008) (exp (* (* m m) -0.25)) (exp (* -0.25 (* n n)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 0.008) {
tmp = exp(((m * m) * -0.25));
} else {
tmp = exp((-0.25 * (n * 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 (n <= 0.008d0) then
tmp = exp(((m * m) * (-0.25d0)))
else
tmp = exp(((-0.25d0) * (n * n)))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 0.008) {
tmp = Math.exp(((m * m) * -0.25));
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if n <= 0.008: tmp = math.exp(((m * m) * -0.25)) else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (n <= 0.008) tmp = exp(Float64(Float64(m * m) * -0.25)); else tmp = exp(Float64(-0.25 * Float64(n * n))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (n <= 0.008) tmp = exp(((m * m) * -0.25)); else tmp = exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 0.008], N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 0.008:\\
\;\;\;\;e^{\left(m \cdot m\right) \cdot -0.25}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if n < 0.0080000000000000002Initial program 82.4%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites97.5%
Taylor expanded in M around 0
Applied rewrites83.9%
Taylor expanded in m around inf
Applied rewrites58.8%
if 0.0080000000000000002 < n Initial program 78.6%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites98.6%
Taylor expanded in M around 0
Applied rewrites95.8%
Taylor expanded in n around inf
Applied rewrites94.4%
Final simplification68.6%
(FPCore (K m n M l) :precision binary64 (if (<= l 0.019) (exp (* (* m m) -0.25)) (exp (- l))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 0.019) {
tmp = exp(((m * m) * -0.25));
} else {
tmp = 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.019d0) then
tmp = exp(((m * m) * (-0.25d0)))
else
tmp = 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.019) {
tmp = Math.exp(((m * m) * -0.25));
} else {
tmp = Math.exp(-l);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= 0.019: tmp = math.exp(((m * m) * -0.25)) else: tmp = math.exp(-l) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= 0.019) tmp = exp(Float64(Float64(m * m) * -0.25)); else tmp = exp(Float64(-l)); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= 0.019) tmp = exp(((m * m) * -0.25)); else tmp = exp(-l); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, 0.019], N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision], N[Exp[(-l)], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 0.019:\\
\;\;\;\;e^{\left(m \cdot m\right) \cdot -0.25}\\
\mathbf{else}:\\
\;\;\;\;e^{-\ell}\\
\end{array}
\end{array}
if l < 0.0189999999999999995Initial program 79.6%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites97.6%
Taylor expanded in M around 0
Applied rewrites83.2%
Taylor expanded in m around inf
Applied rewrites57.5%
if 0.0189999999999999995 < l Initial program 86.4%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites98.5%
Taylor expanded in M around 0
Applied rewrites98.5%
Taylor expanded in l around inf
Applied rewrites98.5%
(FPCore (K m n M l) :precision binary64 (exp (- l)))
double code(double K, double m, double n, double M, double l) {
return 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 = exp(-l)
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.exp(-l);
}
def code(K, m, n, M, l): return math.exp(-l)
function code(K, m, n, M, l) return exp(Float64(-l)) end
function tmp = code(K, m, n, M, l) tmp = exp(-l); end
code[K_, m_, n_, M_, l_] := N[Exp[(-l)], $MachinePrecision]
\begin{array}{l}
\\
e^{-\ell}
\end{array}
Initial program 81.3%
Taylor expanded in K around 0
lower-*.f64N/A
cos-negN/A
lower-cos.f64N/A
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
Applied rewrites97.8%
Taylor expanded in M around 0
Applied rewrites87.1%
Taylor expanded in l around inf
Applied rewrites35.1%
herbie shell --seed 2024226
(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)))))))