
(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 10 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 (- (* 0.5 (+ n m)) 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 = (0.5 * (n + m)) - M;
return cos(M) * exp((fabs((n - m)) - fma(t_0, t_0, l)));
}
function code(K, m, n, M, l) t_0 = Float64(Float64(0.5 * Float64(n + m)) - 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[(N[(0.5 * N[(n + m), $MachinePrecision]), $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 := 0.5 \cdot \left(n + m\right) - M\\
\cos M \cdot e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)}
\end{array}
\end{array}
Initial program 77.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
Simplified96.4%
Final simplification96.4%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (exp (- (* M M)))))
(if (<= M -1.45e+25)
t_0
(if (<= M 2350.0)
(exp (- (fabs (- n m)) (fma 0.25 (* (+ n m) (+ n m)) l)))
t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp(-(M * M));
double tmp;
if (M <= -1.45e+25) {
tmp = t_0;
} else if (M <= 2350.0) {
tmp = exp((fabs((n - m)) - fma(0.25, ((n + m) * (n + m)), l)));
} else {
tmp = t_0;
}
return tmp;
}
function code(K, m, n, M, l) t_0 = exp(Float64(-Float64(M * M))) tmp = 0.0 if (M <= -1.45e+25) tmp = t_0; elseif (M <= 2350.0) tmp = exp(Float64(abs(Float64(n - m)) - fma(0.25, Float64(Float64(n + m) * Float64(n + m)), l))); else tmp = t_0; end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[(-N[(M * M), $MachinePrecision])], $MachinePrecision]}, If[LessEqual[M, -1.45e+25], t$95$0, If[LessEqual[M, 2350.0], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(N[(n + m), $MachinePrecision] * N[(n + m), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-M \cdot M}\\
\mathbf{if}\;M \leq -1.45 \cdot 10^{+25}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 2350:\\
\;\;\;\;e^{\left|n - m\right| - \mathsf{fma}\left(0.25, \left(n + m\right) \cdot \left(n + m\right), \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -1.44999999999999995e25 or 2350 < M Initial program 79.8%
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
Simplified100.0%
Taylor expanded in M around 0
Simplified97.5%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6497.5
Simplified97.5%
Taylor expanded in M around inf
mul-1-negN/A
unpow2N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-neg.f6497.5
Simplified97.5%
if -1.44999999999999995e25 < M < 2350Initial program 75.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
Simplified93.3%
Taylor expanded in M around 0
associate--r+N/A
exp-diffN/A
sub-negN/A
mul-1-negN/A
exp-diffN/A
lower-exp.f64N/A
mul-1-negN/A
sub-negN/A
associate--r+N/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
Simplified93.3%
Final simplification95.3%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (fma m 0.5 (- M))))
(if (<= n 70.0)
(exp (- (fabs (- n m)) (fma t_0 t_0 l)))
(exp (* n (* n -0.25))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = fma(m, 0.5, -M);
double tmp;
if (n <= 70.0) {
tmp = exp((fabs((n - m)) - fma(t_0, t_0, l)));
} else {
tmp = exp((n * (n * -0.25)));
}
return tmp;
}
function code(K, m, n, M, l) t_0 = fma(m, 0.5, Float64(-M)) tmp = 0.0 if (n <= 70.0) tmp = exp(Float64(abs(Float64(n - m)) - fma(t_0, t_0, l))); else tmp = exp(Float64(n * Float64(n * -0.25))); end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(m * 0.5 + (-M)), $MachinePrecision]}, If[LessEqual[n, 70.0], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(t$95$0 * t$95$0 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(n * N[(n * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(m, 0.5, -M\right)\\
\mathbf{if}\;n \leq 70:\\
\;\;\;\;e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if n < 70Initial program 81.7%
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
Simplified95.5%
Taylor expanded in M around 0
Simplified93.9%
Taylor expanded in n around 0
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
sub-negN/A
*-commutativeN/A
lower-fma.f64N/A
lower-neg.f64N/A
sub-negN/A
*-commutativeN/A
lower-fma.f64N/A
lower-neg.f6480.4
Simplified80.4%
if 70 < n Initial program 67.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
Simplified98.6%
Taylor expanded in M around 0
Simplified98.6%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6498.7
Simplified98.7%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.7
Simplified98.7%
Final simplification85.6%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (- (* 0.5 (+ n m)) 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 = (0.5 * (n + m)) - M;
return exp((fabs((n - m)) - fma(t_0, t_0, l)));
}
function code(K, m, n, M, l) t_0 = Float64(Float64(0.5 * Float64(n + m)) - M) return exp(Float64(abs(Float64(n - m)) - fma(t_0, t_0, l))) end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]}, N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(t$95$0 * t$95$0 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(n + m\right) - M\\
e^{\left|n - m\right| - \mathsf{fma}\left(t\_0, t\_0, \ell\right)}
\end{array}
\end{array}
Initial program 77.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
Simplified96.4%
Taylor expanded in M around 0
Simplified95.2%
Final simplification95.2%
(FPCore (K m n M l)
:precision binary64
(if (<= m -53.0)
(exp (* m (* m -0.25)))
(if (<= m 8.5e-211)
(exp (- (* M M)))
(exp (- (fabs (- n m)) (* 0.25 (* n n)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -53.0) {
tmp = exp((m * (m * -0.25)));
} else if (m <= 8.5e-211) {
tmp = exp(-(M * M));
} 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 <= (-53.0d0)) then
tmp = exp((m * (m * (-0.25d0))))
else if (m <= 8.5d-211) then
tmp = exp(-(m_1 * m_1))
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 <= -53.0) {
tmp = Math.exp((m * (m * -0.25)));
} else if (m <= 8.5e-211) {
tmp = Math.exp(-(M * M));
} 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 <= -53.0: tmp = math.exp((m * (m * -0.25))) elif m <= 8.5e-211: tmp = math.exp(-(M * M)) 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 <= -53.0) tmp = exp(Float64(m * Float64(m * -0.25))); elseif (m <= 8.5e-211) tmp = exp(Float64(-Float64(M * M))); 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 <= -53.0) tmp = exp((m * (m * -0.25))); elseif (m <= 8.5e-211) tmp = exp(-(M * M)); else tmp = exp((abs((n - m)) - (0.25 * (n * n)))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -53.0], N[Exp[N[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, 8.5e-211], N[Exp[(-N[(M * M), $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 -53:\\
\;\;\;\;e^{m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{elif}\;m \leq 8.5 \cdot 10^{-211}:\\
\;\;\;\;e^{-M \cdot M}\\
\mathbf{else}:\\
\;\;\;\;e^{\left|n - m\right| - 0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -53Initial program 75.8%
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
Simplified98.4%
Taylor expanded in M around 0
Simplified98.4%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6496.8
Simplified96.8%
Taylor expanded in m around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
Simplified96.8%
if -53 < m < 8.49999999999999936e-211Initial program 80.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
Simplified94.9%
Taylor expanded in M around 0
Simplified92.7%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6478.9
Simplified78.9%
Taylor expanded in M around inf
mul-1-negN/A
unpow2N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-neg.f6447.0
Simplified47.0%
if 8.49999999999999936e-211 < m Initial program 75.9%
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
Simplified96.5%
Taylor expanded in M around 0
Simplified95.5%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6489.0
Simplified89.0%
Taylor expanded in n around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6450.7
Simplified50.7%
Final simplification60.6%
(FPCore (K m n M l) :precision binary64 (if (<= n 55.0) (exp (- (fabs (- n m)) (fma 0.25 (* m m) l))) (exp (* n (* n -0.25)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 55.0) {
tmp = exp((fabs((n - m)) - fma(0.25, (m * m), l)));
} else {
tmp = exp((n * (n * -0.25)));
}
return tmp;
}
function code(K, m, n, M, l) tmp = 0.0 if (n <= 55.0) tmp = exp(Float64(abs(Float64(n - m)) - fma(0.25, Float64(m * m), l))); else tmp = exp(Float64(n * Float64(n * -0.25))); end return tmp end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 55.0], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(m * m), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(n * N[(n * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 55:\\
\;\;\;\;e^{\left|n - m\right| - \mathsf{fma}\left(0.25, m \cdot m, \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if n < 55Initial program 81.7%
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
Simplified95.5%
Taylor expanded in M around 0
associate--r+N/A
exp-diffN/A
sub-negN/A
mul-1-negN/A
exp-diffN/A
lower-exp.f64N/A
mul-1-negN/A
sub-negN/A
associate--r+N/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
Simplified81.1%
Taylor expanded in n around 0
fabs-subN/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
lower-fma.f64N/A
unpow2N/A
lower-*.f6460.2
Simplified60.2%
if 55 < n Initial program 67.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
Simplified98.6%
Taylor expanded in M around 0
Simplified98.6%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6498.7
Simplified98.7%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6498.7
Simplified98.7%
Final simplification71.1%
(FPCore (K m n M l) :precision binary64 (if (<= m -53.0) (exp (* m (* m -0.25))) (if (<= m 8.5e-211) (exp (- (* M M))) (exp (* n (* n -0.25))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -53.0) {
tmp = exp((m * (m * -0.25)));
} else if (m <= 8.5e-211) {
tmp = exp(-(M * M));
} else {
tmp = exp((n * (n * -0.25)));
}
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 <= (-53.0d0)) then
tmp = exp((m * (m * (-0.25d0))))
else if (m <= 8.5d-211) then
tmp = exp(-(m_1 * m_1))
else
tmp = exp((n * (n * (-0.25d0))))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -53.0) {
tmp = Math.exp((m * (m * -0.25)));
} else if (m <= 8.5e-211) {
tmp = Math.exp(-(M * M));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -53.0: tmp = math.exp((m * (m * -0.25))) elif m <= 8.5e-211: tmp = math.exp(-(M * M)) else: tmp = math.exp((n * (n * -0.25))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -53.0) tmp = exp(Float64(m * Float64(m * -0.25))); elseif (m <= 8.5e-211) tmp = exp(Float64(-Float64(M * M))); else tmp = exp(Float64(n * Float64(n * -0.25))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -53.0) tmp = exp((m * (m * -0.25))); elseif (m <= 8.5e-211) tmp = exp(-(M * M)); else tmp = exp((n * (n * -0.25))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -53.0], N[Exp[N[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, 8.5e-211], N[Exp[(-N[(M * M), $MachinePrecision])], $MachinePrecision], N[Exp[N[(n * N[(n * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -53:\\
\;\;\;\;e^{m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{elif}\;m \leq 8.5 \cdot 10^{-211}:\\
\;\;\;\;e^{-M \cdot M}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if m < -53Initial program 75.8%
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
Simplified98.4%
Taylor expanded in M around 0
Simplified98.4%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6496.8
Simplified96.8%
Taylor expanded in m around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.8
Simplified96.8%
if -53 < m < 8.49999999999999936e-211Initial program 80.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
Simplified94.9%
Taylor expanded in M around 0
Simplified92.7%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6478.9
Simplified78.9%
Taylor expanded in M around inf
mul-1-negN/A
unpow2N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-neg.f6447.0
Simplified47.0%
if 8.49999999999999936e-211 < m Initial program 75.9%
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
Simplified96.5%
Taylor expanded in M around 0
Simplified95.5%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6489.0
Simplified89.0%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6457.5
Simplified57.5%
Final simplification63.3%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (- (* M M))))) (if (<= M -27.5) t_0 (if (<= M 26.5) (exp (* m (* m -0.25))) t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp(-(M * M));
double tmp;
if (M <= -27.5) {
tmp = t_0;
} else if (M <= 26.5) {
tmp = exp((m * (m * -0.25)));
} else {
tmp = t_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) :: t_0
real(8) :: tmp
t_0 = exp(-(m_1 * m_1))
if (m_1 <= (-27.5d0)) then
tmp = t_0
else if (m_1 <= 26.5d0) then
tmp = exp((m * (m * (-0.25d0))))
else
tmp = t_0
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double t_0 = Math.exp(-(M * M));
double tmp;
if (M <= -27.5) {
tmp = t_0;
} else if (M <= 26.5) {
tmp = Math.exp((m * (m * -0.25)));
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.exp(-(M * M)) tmp = 0 if M <= -27.5: tmp = t_0 elif M <= 26.5: tmp = math.exp((m * (m * -0.25))) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = exp(Float64(-Float64(M * M))) tmp = 0.0 if (M <= -27.5) tmp = t_0; elseif (M <= 26.5) tmp = exp(Float64(m * Float64(m * -0.25))); else tmp = t_0; end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = exp(-(M * M)); tmp = 0.0; if (M <= -27.5) tmp = t_0; elseif (M <= 26.5) tmp = exp((m * (m * -0.25))); else tmp = t_0; end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[(-N[(M * M), $MachinePrecision])], $MachinePrecision]}, If[LessEqual[M, -27.5], t$95$0, If[LessEqual[M, 26.5], N[Exp[N[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-M \cdot M}\\
\mathbf{if}\;M \leq -27.5:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 26.5:\\
\;\;\;\;e^{m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -27.5 or 26.5 < M Initial program 79.5%
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
Simplified100.0%
Taylor expanded in M around 0
Simplified97.5%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6497.6
Simplified97.6%
Taylor expanded in M around inf
mul-1-negN/A
unpow2N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-neg.f6497.6
Simplified97.6%
if -27.5 < M < 26.5Initial program 75.8%
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
Simplified93.1%
Taylor expanded in M around 0
Simplified93.1%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6478.0
Simplified78.0%
Taylor expanded in m around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6446.5
Simplified46.5%
Final simplification70.9%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (- (* M M))))) (if (<= M -3.2e-6) t_0 (if (<= M 26.5) (exp (- l)) t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp(-(M * M));
double tmp;
if (M <= -3.2e-6) {
tmp = t_0;
} else if (M <= 26.5) {
tmp = exp(-l);
} else {
tmp = t_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) :: t_0
real(8) :: tmp
t_0 = exp(-(m_1 * m_1))
if (m_1 <= (-3.2d-6)) then
tmp = t_0
else if (m_1 <= 26.5d0) then
tmp = exp(-l)
else
tmp = t_0
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double t_0 = Math.exp(-(M * M));
double tmp;
if (M <= -3.2e-6) {
tmp = t_0;
} else if (M <= 26.5) {
tmp = Math.exp(-l);
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.exp(-(M * M)) tmp = 0 if M <= -3.2e-6: tmp = t_0 elif M <= 26.5: tmp = math.exp(-l) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = exp(Float64(-Float64(M * M))) tmp = 0.0 if (M <= -3.2e-6) tmp = t_0; elseif (M <= 26.5) tmp = exp(Float64(-l)); else tmp = t_0; end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = exp(-(M * M)); tmp = 0.0; if (M <= -3.2e-6) tmp = t_0; elseif (M <= 26.5) tmp = exp(-l); else tmp = t_0; end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[(-N[(M * M), $MachinePrecision])], $MachinePrecision]}, If[LessEqual[M, -3.2e-6], t$95$0, If[LessEqual[M, 26.5], N[Exp[(-l)], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-M \cdot M}\\
\mathbf{if}\;M \leq -3.2 \cdot 10^{-6}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 26.5:\\
\;\;\;\;e^{-\ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -3.1999999999999999e-6 or 26.5 < M Initial program 79.7%
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
Simplified100.0%
Taylor expanded in M around 0
Simplified97.6%
Taylor expanded in l around 0
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
unpow2N/A
lower-*.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f64N/A
sub-negN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-neg.f6497.6
Simplified97.6%
Taylor expanded in M around inf
mul-1-negN/A
unpow2N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-neg.f6496.8
Simplified96.8%
if -3.1999999999999999e-6 < M < 26.5Initial program 75.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
Simplified93.1%
Taylor expanded in M around 0
associate--r+N/A
exp-diffN/A
sub-negN/A
mul-1-negN/A
exp-diffN/A
lower-exp.f64N/A
mul-1-negN/A
sub-negN/A
associate--r+N/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
Simplified93.1%
Taylor expanded in n around 0
fabs-subN/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
lower-fma.f64N/A
unpow2N/A
lower-*.f6462.7
Simplified62.7%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6441.6
Simplified41.6%
Final simplification68.1%
(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 77.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
Simplified96.4%
Taylor expanded in M around 0
associate--r+N/A
exp-diffN/A
sub-negN/A
mul-1-negN/A
exp-diffN/A
lower-exp.f64N/A
mul-1-negN/A
sub-negN/A
associate--r+N/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
Simplified86.1%
Taylor expanded in n around 0
fabs-subN/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
lower-fma.f64N/A
unpow2N/A
lower-*.f6457.3
Simplified57.3%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6430.5
Simplified30.5%
herbie shell --seed 2024219
(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)))))))