
(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 (- (- (fabs (- m n)) l) (pow (- (/ (+ m n) 2.0) M) 2.0)))))
double code(double K, double m, double n, double M, double l) {
return cos(M) * exp(((fabs((m - n)) - l) - pow((((m + n) / 2.0) - 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(((abs((m - n)) - l) - ((((m + n) / 2.0d0) - 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(((Math.abs((m - n)) - l) - Math.pow((((m + n) / 2.0) - M), 2.0)));
}
def code(K, m, n, M, l): return math.cos(M) * math.exp(((math.fabs((m - n)) - l) - math.pow((((m + n) / 2.0) - M), 2.0)))
function code(K, m, n, M, l) return Float64(cos(M) * exp(Float64(Float64(abs(Float64(m - n)) - l) - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) * exp(((abs((m - n)) - l) - ((((m + n) / 2.0) - M) ^ 2.0))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos M \cdot e^{\left(\left|m - n\right| - \ell\right) - {\left(\frac{m + n}{2} - M\right)}^{2}}
\end{array}
Initial program 75.9%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.1
Simplified98.1%
Final simplification98.1%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (cos (- (/ (* K (+ m n)) 2.0) M)))
(t_1 (fabs (- m n)))
(t_2 (- t_1 l)))
(if (<= (* (exp (- t_2 (pow (- (/ (+ m n) 2.0) M) 2.0))) t_0) 0.0)
(*
t_0
(exp
(+
(*
n
(*
n
(-
(/
(fma (- (fma 0.5 m 0.0) M) (/ (fma m -0.5 M) n) (fma m -0.5 M))
n)
0.25)))
t_2)))
(exp (- t_1 (fma 0.25 (* (+ m n) (+ m n)) l))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = cos((((K * (m + n)) / 2.0) - M));
double t_1 = fabs((m - n));
double t_2 = t_1 - l;
double tmp;
if ((exp((t_2 - pow((((m + n) / 2.0) - M), 2.0))) * t_0) <= 0.0) {
tmp = t_0 * exp(((n * (n * ((fma((fma(0.5, m, 0.0) - M), (fma(m, -0.5, M) / n), fma(m, -0.5, M)) / n) - 0.25))) + t_2));
} else {
tmp = exp((t_1 - fma(0.25, ((m + n) * (m + n)), l)));
}
return tmp;
}
function code(K, m, n, M, l) t_0 = cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) t_1 = abs(Float64(m - n)) t_2 = Float64(t_1 - l) tmp = 0.0 if (Float64(exp(Float64(t_2 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * t_0) <= 0.0) tmp = Float64(t_0 * exp(Float64(Float64(n * Float64(n * Float64(Float64(fma(Float64(fma(0.5, m, 0.0) - M), Float64(fma(m, -0.5, M) / n), fma(m, -0.5, M)) / n) - 0.25))) + t_2))); else tmp = exp(Float64(t_1 - fma(0.25, Float64(Float64(m + n) * Float64(m + n)), l))); end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - l), $MachinePrecision]}, If[LessEqual[N[(N[Exp[N[(t$95$2 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], 0.0], N[(t$95$0 * N[Exp[N[(N[(n * N[(n * N[(N[(N[(N[(N[(0.5 * m + 0.0), $MachinePrecision] - M), $MachinePrecision] * N[(N[(m * -0.5 + M), $MachinePrecision] / n), $MachinePrecision] + N[(m * -0.5 + M), $MachinePrecision]), $MachinePrecision] / n), $MachinePrecision] - 0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(t$95$1 - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_1 := \left|m - n\right|\\
t_2 := t\_1 - \ell\\
\mathbf{if}\;e^{t\_2 - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot t\_0 \leq 0:\\
\;\;\;\;t\_0 \cdot e^{n \cdot \left(n \cdot \left(\frac{\mathsf{fma}\left(\mathsf{fma}\left(0.5, m, 0\right) - M, \frac{\mathsf{fma}\left(m, -0.5, M\right)}{n}, \mathsf{fma}\left(m, -0.5, M\right)\right)}{n} - 0.25\right)\right) + t\_2}\\
\mathbf{else}:\\
\;\;\;\;e^{t\_1 - \mathsf{fma}\left(0.25, \left(m + n\right) \cdot \left(m + n\right), \ell\right)}\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.0Initial program 98.9%
Taylor expanded in n around -inf
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
Simplified98.4%
if -0.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 28.8%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6497.8
Simplified97.8%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6496.7
Simplified96.7%
Final simplification97.8%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (exp (- 0.0 (* M M)))))
(if (<= M -2450.0)
t_0
(if (<= M 20.0)
(exp (- (fabs (- m n)) (fma 0.25 (* (+ m n) (+ m n)) l)))
t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp((0.0 - (M * M)));
double tmp;
if (M <= -2450.0) {
tmp = t_0;
} else if (M <= 20.0) {
tmp = exp((fabs((m - n)) - fma(0.25, ((m + n) * (m + n)), l)));
} else {
tmp = t_0;
}
return tmp;
}
function code(K, m, n, M, l) t_0 = exp(Float64(0.0 - Float64(M * M))) tmp = 0.0 if (M <= -2450.0) tmp = t_0; elseif (M <= 20.0) tmp = exp(Float64(abs(Float64(m - n)) - fma(0.25, Float64(Float64(m + n) * Float64(m + n)), l))); else tmp = t_0; end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[N[(0.0 - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[M, -2450.0], t$95$0, If[LessEqual[M, 20.0], N[Exp[N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{0 - M \cdot M}\\
\mathbf{if}\;M \leq -2450:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 20:\\
\;\;\;\;e^{\left|m - n\right| - \mathsf{fma}\left(0.25, \left(m + n\right) \cdot \left(m + n\right), \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -2450 or 20 < M Initial program 73.5%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f64100.0
Simplified100.0%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6497.4
Simplified97.4%
Taylor expanded in M around 0
Simplified97.4%
if -2450 < M < 20Initial program 77.9%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6496.6
Simplified96.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6496.6
Simplified96.6%
Final simplification97.0%
(FPCore (K m n M l)
:precision binary64
(if (<= m -70.0)
(exp (* (* m m) -0.25))
(if (<= m 2e-302)
(exp (- 0.0 (* M M)))
(exp (- (fabs (- m n)) (* 0.25 (* n n)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -70.0) {
tmp = exp(((m * m) * -0.25));
} else if (m <= 2e-302) {
tmp = exp((0.0 - (M * M)));
} else {
tmp = exp((fabs((m - n)) - (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 <= (-70.0d0)) then
tmp = exp(((m * m) * (-0.25d0)))
else if (m <= 2d-302) then
tmp = exp((0.0d0 - (m_1 * m_1)))
else
tmp = exp((abs((m - n)) - (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 <= -70.0) {
tmp = Math.exp(((m * m) * -0.25));
} else if (m <= 2e-302) {
tmp = Math.exp((0.0 - (M * M)));
} else {
tmp = Math.exp((Math.abs((m - n)) - (0.25 * (n * n))));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -70.0: tmp = math.exp(((m * m) * -0.25)) elif m <= 2e-302: tmp = math.exp((0.0 - (M * M))) else: tmp = math.exp((math.fabs((m - n)) - (0.25 * (n * n)))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -70.0) tmp = exp(Float64(Float64(m * m) * -0.25)); elseif (m <= 2e-302) tmp = exp(Float64(0.0 - Float64(M * M))); else tmp = exp(Float64(abs(Float64(m - n)) - Float64(0.25 * Float64(n * n)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (m <= -70.0) tmp = exp(((m * m) * -0.25)); elseif (m <= 2e-302) tmp = exp((0.0 - (M * M))); else tmp = exp((abs((m - n)) - (0.25 * (n * n)))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -70.0], N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, 2e-302], N[Exp[N[(0.0 - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -70:\\
\;\;\;\;e^{\left(m \cdot m\right) \cdot -0.25}\\
\mathbf{elif}\;m \leq 2 \cdot 10^{-302}:\\
\;\;\;\;e^{0 - M \cdot M}\\
\mathbf{else}:\\
\;\;\;\;e^{\left|m - n\right| - 0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -70Initial program 61.8%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.2
Simplified98.2%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6494.6
Simplified94.6%
Taylor expanded in m around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6498.2
Simplified98.2%
if -70 < m < 1.9999999999999999e-302Initial program 84.7%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6497.1
Simplified97.1%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6460.5
Simplified60.5%
Taylor expanded in M around 0
Simplified60.5%
if 1.9999999999999999e-302 < m Initial program 77.5%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.6
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6488.6
Simplified88.6%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6448.6
Simplified48.6%
Final simplification62.2%
(FPCore (K m n M l) :precision binary64 (if (<= m -70.0) (exp (* (* m m) -0.25)) (if (<= m 4e-302) (exp (- 0.0 (* M M))) (exp (* n (* n -0.25))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -70.0) {
tmp = exp(((m * m) * -0.25));
} else if (m <= 4e-302) {
tmp = exp((0.0 - (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 <= (-70.0d0)) then
tmp = exp(((m * m) * (-0.25d0)))
else if (m <= 4d-302) then
tmp = exp((0.0d0 - (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 <= -70.0) {
tmp = Math.exp(((m * m) * -0.25));
} else if (m <= 4e-302) {
tmp = Math.exp((0.0 - (M * M)));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -70.0: tmp = math.exp(((m * m) * -0.25)) elif m <= 4e-302: tmp = math.exp((0.0 - (M * M))) else: tmp = math.exp((n * (n * -0.25))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -70.0) tmp = exp(Float64(Float64(m * m) * -0.25)); elseif (m <= 4e-302) tmp = exp(Float64(0.0 - 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 <= -70.0) tmp = exp(((m * m) * -0.25)); elseif (m <= 4e-302) tmp = exp((0.0 - (M * M))); else tmp = exp((n * (n * -0.25))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -70.0], N[Exp[N[(N[(m * m), $MachinePrecision] * -0.25), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, 4e-302], N[Exp[N[(0.0 - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(n * N[(n * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -70:\\
\;\;\;\;e^{\left(m \cdot m\right) \cdot -0.25}\\
\mathbf{elif}\;m \leq 4 \cdot 10^{-302}:\\
\;\;\;\;e^{0 - M \cdot M}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if m < -70Initial program 61.8%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.2
Simplified98.2%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6494.6
Simplified94.6%
Taylor expanded in m around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6498.2
Simplified98.2%
if -70 < m < 3.9999999999999999e-302Initial program 84.7%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6497.1
Simplified97.1%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6460.5
Simplified60.5%
Taylor expanded in M around 0
Simplified60.5%
if 3.9999999999999999e-302 < m Initial program 77.5%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.6
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6488.6
Simplified88.6%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6455.7
Simplified55.7%
Final simplification66.0%
(FPCore (K m n M l) :precision binary64 (if (<= l -6.1e+32) (exp l) (if (<= l 7e-17) (exp (* n (* n -0.25))) (exp (- 0.0 l)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= -6.1e+32) {
tmp = exp(l);
} else if (l <= 7e-17) {
tmp = exp((n * (n * -0.25)));
} else {
tmp = exp((0.0 - 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 <= (-6.1d+32)) then
tmp = exp(l)
else if (l <= 7d-17) then
tmp = exp((n * (n * (-0.25d0))))
else
tmp = exp((0.0d0 - 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 <= -6.1e+32) {
tmp = Math.exp(l);
} else if (l <= 7e-17) {
tmp = Math.exp((n * (n * -0.25)));
} else {
tmp = Math.exp((0.0 - l));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= -6.1e+32: tmp = math.exp(l) elif l <= 7e-17: tmp = math.exp((n * (n * -0.25))) else: tmp = math.exp((0.0 - l)) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= -6.1e+32) tmp = exp(l); elseif (l <= 7e-17) tmp = exp(Float64(n * Float64(n * -0.25))); else tmp = exp(Float64(0.0 - l)); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= -6.1e+32) tmp = exp(l); elseif (l <= 7e-17) tmp = exp((n * (n * -0.25))); else tmp = exp((0.0 - l)); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, -6.1e+32], N[Exp[l], $MachinePrecision], If[LessEqual[l, 7e-17], N[Exp[N[(n * N[(n * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(0.0 - l), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq -6.1 \cdot 10^{+32}:\\
\;\;\;\;e^{\ell}\\
\mathbf{elif}\;\ell \leq 7 \cdot 10^{-17}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{0 - \ell}\\
\end{array}
\end{array}
if l < -6.10000000000000027e32Initial program 73.3%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6495.0
Simplified95.0%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6478.5
Simplified78.5%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6414.6
Simplified14.6%
flip3--N/A
div-invN/A
metadata-evalN/A
sub0-negN/A
sqr-powN/A
pow-prod-downN/A
sqr-negN/A
sub0-negN/A
sub0-negN/A
pow-prod-downN/A
sqr-powN/A
sub0-negN/A
cube-negN/A
sub0-negN/A
metadata-evalN/A
distribute-lft-neg-inN/A
div-invN/A
flip3--N/A
sub0-negN/A
Applied egg-rr78.7%
if -6.10000000000000027e32 < l < 7.0000000000000003e-17Initial program 78.6%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.6
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6485.8
Simplified85.8%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6460.5
Simplified60.5%
if 7.0000000000000003e-17 < l Initial program 73.1%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0
Simplified100.0%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6496.2
Simplified96.2%
sub0-negN/A
neg-lowering-neg.f6496.2
Applied egg-rr96.2%
Final simplification74.1%
(FPCore (K m n M l) :precision binary64 (if (<= m -55.0) (exp (* (* m m) -0.25)) (exp (* n (* n -0.25)))))
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((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 <= (-55.0d0)) then
tmp = exp(((m * m) * (-0.25d0)))
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 <= -55.0) {
tmp = Math.exp(((m * m) * -0.25));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
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((n * (n * -0.25))) 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(n * Float64(n * -0.25))); 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((n * (n * -0.25))); 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 * N[(n * -0.25), $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^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if m < -55Initial program 62.5%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.2
Simplified98.2%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6494.7
Simplified94.7%
Taylor expanded in m around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6498.2
Simplified98.2%
if -55 < m Initial program 79.7%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.1
Simplified98.1%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6485.9
Simplified85.9%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6457.5
Simplified57.5%
(FPCore (K m n M l) :precision binary64 (if (<= l 1e-16) (exp l) (exp (- 0.0 l))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (l <= 1e-16) {
tmp = exp(l);
} else {
tmp = exp((0.0 - 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 <= 1d-16) then
tmp = exp(l)
else
tmp = exp((0.0d0 - 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 <= 1e-16) {
tmp = Math.exp(l);
} else {
tmp = Math.exp((0.0 - l));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if l <= 1e-16: tmp = math.exp(l) else: tmp = math.exp((0.0 - l)) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (l <= 1e-16) tmp = exp(l); else tmp = exp(Float64(0.0 - l)); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (l <= 1e-16) tmp = exp(l); else tmp = exp((0.0 - l)); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[l, 1e-16], N[Exp[l], $MachinePrecision], N[Exp[N[(0.0 - l), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 10^{-16}:\\
\;\;\;\;e^{\ell}\\
\mathbf{else}:\\
\;\;\;\;e^{0 - \ell}\\
\end{array}
\end{array}
if l < 9.9999999999999998e-17Initial program 77.0%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6497.5
Simplified97.5%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6483.6
Simplified83.6%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6414.7
Simplified14.7%
flip3--N/A
div-invN/A
metadata-evalN/A
sub0-negN/A
sqr-powN/A
pow-prod-downN/A
sqr-negN/A
sub0-negN/A
sub0-negN/A
pow-prod-downN/A
sqr-powN/A
sub0-negN/A
cube-negN/A
sub0-negN/A
metadata-evalN/A
distribute-lft-neg-inN/A
div-invN/A
flip3--N/A
sub0-negN/A
Applied egg-rr36.5%
if 9.9999999999999998e-17 < l Initial program 72.7%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64100.0
Simplified100.0%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6497.1
Simplified97.1%
sub0-negN/A
neg-lowering-neg.f6497.1
Applied egg-rr97.1%
Final simplification52.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(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 75.9%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.1
Simplified98.1%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6487.8
Simplified87.8%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6436.0
Simplified36.0%
flip3--N/A
div-invN/A
metadata-evalN/A
sub0-negN/A
sqr-powN/A
pow-prod-downN/A
sqr-negN/A
sub0-negN/A
sub0-negN/A
pow-prod-downN/A
sqr-powN/A
sub0-negN/A
cube-negN/A
sub0-negN/A
metadata-evalN/A
distribute-lft-neg-inN/A
div-invN/A
flip3--N/A
sub0-negN/A
Applied egg-rr27.8%
(FPCore (K m n M l) :precision binary64 (fma l (fma l (fma l -0.16666666666666666 0.5) -1.0) 1.0))
double code(double K, double m, double n, double M, double l) {
return fma(l, fma(l, fma(l, -0.16666666666666666, 0.5), -1.0), 1.0);
}
function code(K, m, n, M, l) return fma(l, fma(l, fma(l, -0.16666666666666666, 0.5), -1.0), 1.0) end
code[K_, m_, n_, M_, l_] := N[(l * N[(l * N[(l * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, -0.16666666666666666, 0.5\right), -1\right), 1\right)
\end{array}
Initial program 75.9%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.1
Simplified98.1%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6487.8
Simplified87.8%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6436.0
Simplified36.0%
Taylor expanded in l around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6411.1
Simplified11.1%
(FPCore (K m n M l) :precision binary64 (fma l (fma l 0.5 -1.0) 1.0))
double code(double K, double m, double n, double M, double l) {
return fma(l, fma(l, 0.5, -1.0), 1.0);
}
function code(K, m, n, M, l) return fma(l, fma(l, 0.5, -1.0), 1.0) end
code[K_, m_, n_, M_, l_] := N[(l * N[(l * 0.5 + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, 0.5, -1\right), 1\right)
\end{array}
Initial program 75.9%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.1
Simplified98.1%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6487.8
Simplified87.8%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6436.0
Simplified36.0%
Taylor expanded in l around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
accelerator-lowering-fma.f6410.8
Simplified10.8%
(FPCore (K m n M l) :precision binary64 1.0)
double code(double K, double m, double n, double M, double l) {
return 1.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 = 1.0d0
end function
public static double code(double K, double m, double n, double M, double l) {
return 1.0;
}
def code(K, m, n, M, l): return 1.0
function code(K, m, n, M, l) return 1.0 end
function tmp = code(K, m, n, M, l) tmp = 1.0; end
code[K_, m_, n_, M_, l_] := 1.0
\begin{array}{l}
\\
1
\end{array}
Initial program 75.9%
Taylor expanded in K around 0
cos-negN/A
cos-lowering-cos.f6498.1
Simplified98.1%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6450.9
Simplified50.9%
Taylor expanded in M around 0
Simplified8.9%
herbie shell --seed 2024199
(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)))))))