
(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 (- (/ (+ m n) 2.0) M))) (/ (cos M) (exp (+ (* t_0 t_0) (- l (fabs (- m n))))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = ((m + n) / 2.0) - M;
return cos(M) / exp(((t_0 * t_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
real(8) :: t_0
t_0 = ((m + n) / 2.0d0) - m_1
code = cos(m_1) / exp(((t_0 * t_0) + (l - abs((m - n)))))
end function
public static double code(double K, double m, double n, double M, double l) {
double t_0 = ((m + n) / 2.0) - M;
return Math.cos(M) / Math.exp(((t_0 * t_0) + (l - Math.abs((m - n)))));
}
def code(K, m, n, M, l): t_0 = ((m + n) / 2.0) - M return math.cos(M) / math.exp(((t_0 * t_0) + (l - math.fabs((m - n)))))
function code(K, m, n, M, l) t_0 = Float64(Float64(Float64(m + n) / 2.0) - M) return Float64(cos(M) / exp(Float64(Float64(t_0 * t_0) + Float64(l - abs(Float64(m - n)))))) end
function tmp = code(K, m, n, M, l) t_0 = ((m + n) / 2.0) - M; tmp = cos(M) / exp(((t_0 * t_0) + (l - abs((m - n))))); end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]}, N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(N[(t$95$0 * t$95$0), $MachinePrecision] + N[(l - N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{m + n}{2} - M\\
\frac{\cos M}{e^{t\_0 \cdot t\_0 + \left(\ell - \left|m - n\right|\right)}}
\end{array}
\end{array}
Initial program 77.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified77.2%
Taylor expanded in K around 0
cos-lowering-cos.f6496.3%
Simplified96.3%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (/ (cos M) (exp (* M M)))))
(if (<= M -2.2e+67)
t_0
(if (<= M 27.0)
(exp (- (- (fabs (- m n)) (* 0.25 (* (+ m n) (+ m n)))) l))
t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = cos(M) / exp((M * M));
double tmp;
if (M <= -2.2e+67) {
tmp = t_0;
} else if (M <= 27.0) {
tmp = exp(((fabs((m - n)) - (0.25 * ((m + n) * (m + n)))) - 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 = cos(m_1) / exp((m_1 * m_1))
if (m_1 <= (-2.2d+67)) then
tmp = t_0
else if (m_1 <= 27.0d0) then
tmp = exp(((abs((m - n)) - (0.25d0 * ((m + n) * (m + n)))) - 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.cos(M) / Math.exp((M * M));
double tmp;
if (M <= -2.2e+67) {
tmp = t_0;
} else if (M <= 27.0) {
tmp = Math.exp(((Math.abs((m - n)) - (0.25 * ((m + n) * (m + n)))) - l));
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.cos(M) / math.exp((M * M)) tmp = 0 if M <= -2.2e+67: tmp = t_0 elif M <= 27.0: tmp = math.exp(((math.fabs((m - n)) - (0.25 * ((m + n) * (m + n)))) - l)) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = Float64(cos(M) / exp(Float64(M * M))) tmp = 0.0 if (M <= -2.2e+67) tmp = t_0; elseif (M <= 27.0) tmp = exp(Float64(Float64(abs(Float64(m - n)) - Float64(0.25 * Float64(Float64(m + n) * Float64(m + n)))) - l)); else tmp = t_0; end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = cos(M) / exp((M * M)); tmp = 0.0; if (M <= -2.2e+67) tmp = t_0; elseif (M <= 27.0) tmp = exp(((abs((m - n)) - (0.25 * ((m + n) * (m + n)))) - l)); else tmp = t_0; end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(M * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M, -2.2e+67], t$95$0, If[LessEqual[M, 27.0], N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - l), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \frac{\cos M}{e^{M \cdot M}}\\
\mathbf{if}\;M \leq -2.2 \cdot 10^{+67}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 27:\\
\;\;\;\;e^{\left(\left|m - n\right| - 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)\right) - \ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -2.2e67 or 27 < M Initial program 81.3%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified81.3%
Taylor expanded in K around 0
cos-lowering-cos.f6499.2%
Simplified99.2%
Taylor expanded in M around inf
unpow2N/A
*-lowering-*.f6496.9%
Simplified96.9%
if -2.2e67 < M < 27Initial program 73.1%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified73.1%
Taylor expanded in K around 0
cos-lowering-cos.f6493.4%
Simplified93.4%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6493.4%
Simplified93.4%
Final simplification95.2%
(FPCore (K m n M l)
:precision binary64
(if (<= m -55.0)
(exp (* -0.25 (* m m)))
(if (<= m -2e-103)
(/ (cos M) (exp (* M M)))
(exp (- (- (fabs (- m n)) l) (* 0.25 (* n n)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -55.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -2e-103) {
tmp = cos(M) / exp((M * M));
} else {
tmp = exp(((fabs((m - n)) - l) - (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(((-0.25d0) * (m * m)))
else if (m <= (-2d-103)) then
tmp = cos(m_1) / exp((m_1 * m_1))
else
tmp = exp(((abs((m - n)) - l) - (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((-0.25 * (m * m)));
} else if (m <= -2e-103) {
tmp = Math.cos(M) / Math.exp((M * M));
} else {
tmp = Math.exp(((Math.abs((m - n)) - l) - (0.25 * (n * n))));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -55.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -2e-103: tmp = math.cos(M) / math.exp((M * M)) else: tmp = math.exp(((math.fabs((m - n)) - l) - (0.25 * (n * n)))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -55.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -2e-103) tmp = Float64(cos(M) / exp(Float64(M * M))); else tmp = exp(Float64(Float64(abs(Float64(m - n)) - l) - 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((-0.25 * (m * m))); elseif (m <= -2e-103) tmp = cos(M) / exp((M * M)); else tmp = exp(((abs((m - n)) - l) - (0.25 * (n * n)))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -2e-103], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(M * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] - N[(0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -55:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -2 \cdot 10^{-103}:\\
\;\;\;\;\frac{\cos M}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;e^{\left(\left|m - n\right| - \ell\right) - 0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -55Initial program 74.4%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified74.4%
Taylor expanded in K around 0
cos-lowering-cos.f64100.0%
Simplified100.0%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6498.7%
Simplified98.7%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.5%
Simplified97.5%
if -55 < m < -1.99999999999999992e-103Initial program 90.5%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified90.5%
Taylor expanded in K around 0
cos-lowering-cos.f6495.2%
Simplified95.2%
Taylor expanded in M around inf
unpow2N/A
*-lowering-*.f6476.8%
Simplified76.8%
if -1.99999999999999992e-103 < m Initial program 76.8%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified76.8%
Taylor expanded in K around 0
cos-lowering-cos.f6494.6%
Simplified94.6%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6479.1%
Simplified79.1%
Taylor expanded in m around 0
associate--r+N/A
--lowering--.f64N/A
--lowering--.f64N/A
sub-negN/A
mul-1-negN/A
fabs-lowering-fabs.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6462.8%
Simplified62.8%
Final simplification74.5%
(FPCore (K m n M l)
:precision binary64
(if (<= m -55.0)
(exp (* -0.25 (* m m)))
(if (<= m -1.5e-224)
(/ (cos M) (exp (* M M)))
(/ (cos M) (exp (* 0.25 (* n n)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -55.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -1.5e-224) {
tmp = cos(M) / exp((M * M));
} else {
tmp = cos(M) / 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 (m <= (-55.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else if (m <= (-1.5d-224)) then
tmp = cos(m_1) / exp((m_1 * m_1))
else
tmp = cos(m_1) / 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 (m <= -55.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else if (m <= -1.5e-224) {
tmp = Math.cos(M) / Math.exp((M * M));
} else {
tmp = Math.cos(M) / Math.exp((0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -55.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -1.5e-224: tmp = math.cos(M) / math.exp((M * M)) else: tmp = math.cos(M) / math.exp((0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -55.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -1.5e-224) tmp = Float64(cos(M) / exp(Float64(M * M))); else tmp = Float64(cos(M) / exp(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((-0.25 * (m * m))); elseif (m <= -1.5e-224) tmp = cos(M) / exp((M * M)); else tmp = cos(M) / exp((0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -1.5e-224], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(M * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -55:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -1.5 \cdot 10^{-224}:\\
\;\;\;\;\frac{\cos M}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos M}{e^{0.25 \cdot \left(n \cdot n\right)}}\\
\end{array}
\end{array}
if m < -55Initial program 74.4%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified74.4%
Taylor expanded in K around 0
cos-lowering-cos.f64100.0%
Simplified100.0%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6498.7%
Simplified98.7%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.5%
Simplified97.5%
if -55 < m < -1.49999999999999991e-224Initial program 84.1%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified84.1%
Taylor expanded in K around 0
cos-lowering-cos.f6492.3%
Simplified92.3%
Taylor expanded in M around inf
unpow2N/A
*-lowering-*.f6465.2%
Simplified65.2%
if -1.49999999999999991e-224 < m Initial program 76.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified76.2%
Taylor expanded in K around 0
cos-lowering-cos.f6495.6%
Simplified95.6%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6451.8%
Simplified51.8%
(FPCore (K m n M l) :precision binary64 (if (<= m -55.0) (exp (* -0.25 (* m m))) (if (<= m -1.25e-224) (/ (cos M) (exp (* M M))) (exp (* -0.25 (* n n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -55.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -1.25e-224) {
tmp = cos(M) / exp((M * M));
} 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 (m <= (-55.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else if (m <= (-1.25d-224)) then
tmp = cos(m_1) / exp((m_1 * m_1))
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 (m <= -55.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else if (m <= -1.25e-224) {
tmp = Math.cos(M) / Math.exp((M * M));
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -55.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -1.25e-224: tmp = math.cos(M) / math.exp((M * M)) else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -55.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -1.25e-224) tmp = Float64(cos(M) / exp(Float64(M * M))); 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 (m <= -55.0) tmp = exp((-0.25 * (m * m))); elseif (m <= -1.25e-224) tmp = cos(M) / exp((M * M)); else tmp = exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -55.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -1.25e-224], N[(N[Cos[M], $MachinePrecision] / N[Exp[N[(M * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -55:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -1.25 \cdot 10^{-224}:\\
\;\;\;\;\frac{\cos M}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -55Initial program 74.4%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified74.4%
Taylor expanded in K around 0
cos-lowering-cos.f64100.0%
Simplified100.0%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6498.7%
Simplified98.7%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.5%
Simplified97.5%
if -55 < m < -1.25e-224Initial program 84.1%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified84.1%
Taylor expanded in K around 0
cos-lowering-cos.f6492.3%
Simplified92.3%
Taylor expanded in M around inf
unpow2N/A
*-lowering-*.f6465.2%
Simplified65.2%
if -1.25e-224 < m Initial program 76.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified76.2%
Taylor expanded in K around 0
cos-lowering-cos.f6495.6%
Simplified95.6%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6480.4%
Simplified80.4%
Taylor expanded in n around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6451.8%
Simplified51.8%
Final simplification68.3%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (* -0.25 (* m m))))) (if (<= m -4.3e-6) t_0 (if (<= m 0.00066) (exp (- 0.0 l)) t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp((-0.25 * (m * m)));
double tmp;
if (m <= -4.3e-6) {
tmp = t_0;
} else if (m <= 0.00066) {
tmp = exp((0.0 - 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(((-0.25d0) * (m * m)))
if (m <= (-4.3d-6)) then
tmp = t_0
else if (m <= 0.00066d0) then
tmp = exp((0.0d0 - 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((-0.25 * (m * m)));
double tmp;
if (m <= -4.3e-6) {
tmp = t_0;
} else if (m <= 0.00066) {
tmp = Math.exp((0.0 - l));
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.exp((-0.25 * (m * m))) tmp = 0 if m <= -4.3e-6: tmp = t_0 elif m <= 0.00066: tmp = math.exp((0.0 - l)) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = exp(Float64(-0.25 * Float64(m * m))) tmp = 0.0 if (m <= -4.3e-6) tmp = t_0; elseif (m <= 0.00066) tmp = exp(Float64(0.0 - l)); else tmp = t_0; end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = exp((-0.25 * (m * m))); tmp = 0.0; if (m <= -4.3e-6) tmp = t_0; elseif (m <= 0.00066) tmp = exp((0.0 - l)); else tmp = t_0; end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[m, -4.3e-6], t$95$0, If[LessEqual[m, 0.00066], N[Exp[N[(0.0 - l), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{if}\;m \leq -4.3 \cdot 10^{-6}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 0.00066:\\
\;\;\;\;e^{0 - \ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -4.30000000000000033e-6 or 6.6e-4 < m Initial program 73.5%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified73.5%
Taylor expanded in K around 0
cos-lowering-cos.f6498.5%
Simplified98.5%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6496.3%
Simplified96.3%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6495.7%
Simplified95.7%
if -4.30000000000000033e-6 < m < 6.6e-4Initial program 81.3%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified81.3%
Taylor expanded in K around 0
cos-lowering-cos.f6493.9%
Simplified93.9%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6469.7%
Simplified69.7%
Taylor expanded in l around inf
Simplified38.9%
Final simplification68.8%
(FPCore (K m n M l) :precision binary64 (if (<= m -2.05e-6) (exp (* -0.25 (* m m))) (exp (* -0.25 (* n n)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -2.05e-6) {
tmp = exp((-0.25 * (m * m)));
} 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 (m <= (-2.05d-6)) then
tmp = exp(((-0.25d0) * (m * m)))
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 (m <= -2.05e-6) {
tmp = Math.exp((-0.25 * (m * m)));
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -2.05e-6: tmp = math.exp((-0.25 * (m * m))) else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -2.05e-6) tmp = exp(Float64(-0.25 * Float64(m * m))); 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 (m <= -2.05e-6) tmp = exp((-0.25 * (m * m))); else tmp = exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -2.05e-6], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -2.05 \cdot 10^{-6}:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -2.0499999999999999e-6Initial program 75.0%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified75.0%
Taylor expanded in K around 0
cos-lowering-cos.f64100.0%
Simplified100.0%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6497.5%
Simplified97.5%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6495.1%
Simplified95.1%
if -2.0499999999999999e-6 < m Initial program 78.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified78.2%
Taylor expanded in K around 0
cos-lowering-cos.f6494.6%
Simplified94.6%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6477.5%
Simplified77.5%
Taylor expanded in n around inf
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.7%
Simplified50.7%
Final simplification64.6%
(FPCore (K m n M l) :precision binary64 (exp (- 0.0 l)))
double code(double K, double m, double n, double M, double l) {
return exp((0.0 - 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((0.0d0 - l))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.exp((0.0 - l));
}
def code(K, m, n, M, l): return math.exp((0.0 - l))
function code(K, m, n, M, l) return exp(Float64(0.0 - l)) end
function tmp = code(K, m, n, M, l) tmp = exp((0.0 - l)); end
code[K_, m_, n_, M_, l_] := N[Exp[N[(0.0 - l), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
e^{0 - \ell}
\end{array}
Initial program 77.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified77.2%
Taylor expanded in K around 0
cos-lowering-cos.f6496.3%
Simplified96.3%
Taylor expanded in M around 0
rec-expN/A
mul-1-negN/A
exp-lowering-exp.f64N/A
mul-1-negN/A
neg-lowering-neg.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.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--.f6483.8%
Simplified83.8%
Taylor expanded in l around inf
Simplified34.3%
Final simplification34.3%
(FPCore (K m n M l)
:precision binary64
(+
1.0
(*
(* M M)
(+
(* (* M M) (+ 0.041666666666666664 (* (* M M) -0.001388888888888889)))
-0.5))))
double code(double K, double m, double n, double M, double l) {
return 1.0 + ((M * M) * (((M * M) * (0.041666666666666664 + ((M * M) * -0.001388888888888889))) + -0.5));
}
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 + ((m_1 * m_1) * (((m_1 * m_1) * (0.041666666666666664d0 + ((m_1 * m_1) * (-0.001388888888888889d0)))) + (-0.5d0)))
end function
public static double code(double K, double m, double n, double M, double l) {
return 1.0 + ((M * M) * (((M * M) * (0.041666666666666664 + ((M * M) * -0.001388888888888889))) + -0.5));
}
def code(K, m, n, M, l): return 1.0 + ((M * M) * (((M * M) * (0.041666666666666664 + ((M * M) * -0.001388888888888889))) + -0.5))
function code(K, m, n, M, l) return Float64(1.0 + Float64(Float64(M * M) * Float64(Float64(Float64(M * M) * Float64(0.041666666666666664 + Float64(Float64(M * M) * -0.001388888888888889))) + -0.5))) end
function tmp = code(K, m, n, M, l) tmp = 1.0 + ((M * M) * (((M * M) * (0.041666666666666664 + ((M * M) * -0.001388888888888889))) + -0.5)); end
code[K_, m_, n_, M_, l_] := N[(1.0 + N[(N[(M * M), $MachinePrecision] * N[(N[(N[(M * M), $MachinePrecision] * N[(0.041666666666666664 + N[(N[(M * M), $MachinePrecision] * -0.001388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
1 + \left(M \cdot M\right) \cdot \left(\left(M \cdot M\right) \cdot \left(0.041666666666666664 + \left(M \cdot M\right) \cdot -0.001388888888888889\right) + -0.5\right)
\end{array}
Initial program 77.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified77.2%
Taylor expanded in K around 0
cos-lowering-cos.f6496.3%
Simplified96.3%
Taylor expanded in l around inf
Simplified35.4%
Taylor expanded in l around 0
cos-lowering-cos.f644.8%
Simplified4.8%
Taylor expanded in M around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f645.2%
Simplified5.2%
(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 77.2%
neg-sub0N/A
associate--l-N/A
exp-diffN/A
associate-*r/N/A
exp-0N/A
*-rgt-identityN/A
/-lowering-/.f64N/A
Simplified77.2%
Taylor expanded in K around 0
cos-lowering-cos.f6496.3%
Simplified96.3%
Taylor expanded in l around inf
Simplified35.4%
Taylor expanded in l around 0
cos-lowering-cos.f644.8%
Simplified4.8%
Taylor expanded in M around 0
Simplified4.8%
herbie shell --seed 2024164
(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)))))))