
(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 11 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 (exp (+ (fabs (- n m)) (- (* (+ M (* -0.5 (+ n m))) (- (* 0.5 (+ n m)) M)) l))))
double code(double K, double m, double n, double M, double l) {
return exp((fabs((n - m)) + (((M + (-0.5 * (n + m))) * ((0.5 * (n + m)) - M)) - l)));
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = exp((abs((n - m)) + (((m_1 + ((-0.5d0) * (n + m))) * ((0.5d0 * (n + m)) - m_1)) - l)))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.exp((Math.abs((n - m)) + (((M + (-0.5 * (n + m))) * ((0.5 * (n + m)) - M)) - l)));
}
def code(K, m, n, M, l): return math.exp((math.fabs((n - m)) + (((M + (-0.5 * (n + m))) * ((0.5 * (n + m)) - M)) - l)))
function code(K, m, n, M, l) return exp(Float64(abs(Float64(n - m)) + Float64(Float64(Float64(M + Float64(-0.5 * Float64(n + m))) * Float64(Float64(0.5 * Float64(n + m)) - M)) - l))) end
function tmp = code(K, m, n, M, l) tmp = exp((abs((n - m)) + (((M + (-0.5 * (n + m))) * ((0.5 * (n + m)) - M)) - l))); end
code[K_, m_, n_, M_, l_] := N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] + N[(N[(N[(M + N[(-0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]), $MachinePrecision] - l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
e^{\left|n - m\right| + \left(\left(M + -0.5 \cdot \left(n + m\right)\right) \cdot \left(0.5 \cdot \left(n + m\right) - M\right) - \ell\right)}
\end{array}
Initial program 77.5%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified77.5%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified97.3%
Taylor expanded in M around 0
Simplified97.7%
Final simplification97.7%
(FPCore (K m n M l)
:precision binary64
(if (<= M -2.7e+32)
(/ 1.0 (exp (* M M)))
(if (<= M 27.0)
(exp (+ (fabs (- n m)) (- (* -0.25 (* (+ n m) (+ n m))) l)))
(exp (* (* M M) (+ -1.0 (/ m M)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (M <= -2.7e+32) {
tmp = 1.0 / exp((M * M));
} else if (M <= 27.0) {
tmp = exp((fabs((n - m)) + ((-0.25 * ((n + m) * (n + m))) - l)));
} else {
tmp = exp(((M * M) * (-1.0 + (m / M))));
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (m_1 <= (-2.7d+32)) then
tmp = 1.0d0 / exp((m_1 * m_1))
else if (m_1 <= 27.0d0) then
tmp = exp((abs((n - m)) + (((-0.25d0) * ((n + m) * (n + m))) - l)))
else
tmp = exp(((m_1 * m_1) * ((-1.0d0) + (m / m_1))))
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (M <= -2.7e+32) {
tmp = 1.0 / Math.exp((M * M));
} else if (M <= 27.0) {
tmp = Math.exp((Math.abs((n - m)) + ((-0.25 * ((n + m) * (n + m))) - l)));
} else {
tmp = Math.exp(((M * M) * (-1.0 + (m / M))));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if M <= -2.7e+32: tmp = 1.0 / math.exp((M * M)) elif M <= 27.0: tmp = math.exp((math.fabs((n - m)) + ((-0.25 * ((n + m) * (n + m))) - l))) else: tmp = math.exp(((M * M) * (-1.0 + (m / M)))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (M <= -2.7e+32) tmp = Float64(1.0 / exp(Float64(M * M))); elseif (M <= 27.0) tmp = exp(Float64(abs(Float64(n - m)) + Float64(Float64(-0.25 * Float64(Float64(n + m) * Float64(n + m))) - l))); else tmp = exp(Float64(Float64(M * M) * Float64(-1.0 + Float64(m / M)))); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (M <= -2.7e+32) tmp = 1.0 / exp((M * M)); elseif (M <= 27.0) tmp = exp((abs((n - m)) + ((-0.25 * ((n + m) * (n + m))) - l))); else tmp = exp(((M * M) * (-1.0 + (m / M)))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[M, -2.7e+32], N[(1.0 / N[Exp[N[(M * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[M, 27.0], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] + N[(N[(-0.25 * N[(N[(n + m), $MachinePrecision] * N[(n + m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(N[(M * M), $MachinePrecision] * N[(-1.0 + N[(m / M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;M \leq -2.7 \cdot 10^{+32}:\\
\;\;\;\;\frac{1}{e^{M \cdot M}}\\
\mathbf{elif}\;M \leq 27:\\
\;\;\;\;e^{\left|n - m\right| + \left(-0.25 \cdot \left(\left(n + m\right) \cdot \left(n + m\right)\right) - \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{\left(M \cdot M\right) \cdot \left(-1 + \frac{m}{M}\right)}\\
\end{array}
\end{array}
if M < -2.70000000000000013e32Initial program 86.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified86.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f64100.0%
Simplified100.0%
*-rgt-identityN/A
exp-diffN/A
1-expN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f64100.0%
Applied egg-rr100.0%
if -2.70000000000000013e32 < M < 27Initial program 74.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified74.6%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified95.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--l+N/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
--lowering--.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6495.5%
Simplified95.5%
if 27 < M Initial program 77.1%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified77.1%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified98.6%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in n around 0
associate--l+N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-negN/A
associate--l+N/A
exp-lowering-exp.f64N/A
associate--l+N/A
fabs-negN/A
mul-1-negN/A
sub-negN/A
fabs-subN/A
+-lowering-+.f64N/A
Simplified91.6%
Taylor expanded in M around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f6483.1%
Simplified83.1%
Final simplification93.0%
(FPCore (K m n M l) :precision binary64 (if (<= n 15500000000000.0) (exp (+ (fabs (- n m)) (- (* (+ M (* m -0.5)) (- (* m 0.5) M)) l))) (exp (* n (* n -0.25)))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 15500000000000.0) {
tmp = exp((fabs((n - m)) + (((M + (m * -0.5)) * ((m * 0.5) - M)) - l)));
} 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 (n <= 15500000000000.0d0) then
tmp = exp((abs((n - m)) + (((m_1 + (m * (-0.5d0))) * ((m * 0.5d0) - m_1)) - l)))
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 (n <= 15500000000000.0) {
tmp = Math.exp((Math.abs((n - m)) + (((M + (m * -0.5)) * ((m * 0.5) - M)) - l)));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if n <= 15500000000000.0: tmp = math.exp((math.fabs((n - m)) + (((M + (m * -0.5)) * ((m * 0.5) - M)) - l))) else: tmp = math.exp((n * (n * -0.25))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (n <= 15500000000000.0) tmp = exp(Float64(abs(Float64(n - m)) + Float64(Float64(Float64(M + Float64(m * -0.5)) * Float64(Float64(m * 0.5) - M)) - l))); 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 (n <= 15500000000000.0) tmp = exp((abs((n - m)) + (((M + (m * -0.5)) * ((m * 0.5) - M)) - l))); else tmp = exp((n * (n * -0.25))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 15500000000000.0], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] + N[(N[(N[(M + N[(m * -0.5), $MachinePrecision]), $MachinePrecision] * N[(N[(m * 0.5), $MachinePrecision] - M), $MachinePrecision]), $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 15500000000000:\\
\;\;\;\;e^{\left|n - m\right| + \left(\left(M + m \cdot -0.5\right) \cdot \left(m \cdot 0.5 - M\right) - \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if n < 1.55e13Initial program 77.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified77.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified96.6%
Taylor expanded in M around 0
Simplified97.1%
Taylor expanded in n around 0
associate--l+N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-negN/A
associate--l+N/A
exp-lowering-exp.f64N/A
associate--l+N/A
fabs-negN/A
mul-1-negN/A
sub-negN/A
fabs-subN/A
+-lowering-+.f64N/A
Simplified87.2%
if 1.55e13 < n Initial program 79.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified79.2%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64100.0%
Simplified100.0%
Final simplification89.8%
(FPCore (K m n M l) :precision binary64 (if (<= n 0.0007) (exp (+ (fabs (- n m)) (- (* m (+ M (* m -0.25))) l))) (* (exp (* -0.25 (* n n))) (cos M))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 0.0007) {
tmp = exp((fabs((n - m)) + ((m * (M + (m * -0.25))) - l)));
} else {
tmp = exp((-0.25 * (n * n))) * cos(M);
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: tmp
if (n <= 0.0007d0) then
tmp = exp((abs((n - m)) + ((m * (m_1 + (m * (-0.25d0)))) - l)))
else
tmp = exp(((-0.25d0) * (n * n))) * cos(m_1)
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 0.0007) {
tmp = Math.exp((Math.abs((n - m)) + ((m * (M + (m * -0.25))) - l)));
} else {
tmp = Math.exp((-0.25 * (n * n))) * Math.cos(M);
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if n <= 0.0007: tmp = math.exp((math.fabs((n - m)) + ((m * (M + (m * -0.25))) - l))) else: tmp = math.exp((-0.25 * (n * n))) * math.cos(M) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (n <= 0.0007) tmp = exp(Float64(abs(Float64(n - m)) + Float64(Float64(m * Float64(M + Float64(m * -0.25))) - l))); else tmp = Float64(exp(Float64(-0.25 * Float64(n * n))) * cos(M)); end return tmp end
function tmp_2 = code(K, m, n, M, l) tmp = 0.0; if (n <= 0.0007) tmp = exp((abs((n - m)) + ((m * (M + (m * -0.25))) - l))); else tmp = exp((-0.25 * (n * n))) * cos(M); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 0.0007], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] + N[(N[(m * N[(M + N[(m * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Cos[M], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;n \leq 0.0007:\\
\;\;\;\;e^{\left|n - m\right| + \left(m \cdot \left(M + m \cdot -0.25\right) - \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)} \cdot \cos M\\
\end{array}
\end{array}
if n < 6.99999999999999993e-4Initial program 76.8%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified76.8%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified96.5%
Taylor expanded in M around 0
Simplified97.0%
Taylor expanded in n around 0
associate--l+N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-negN/A
associate--l+N/A
exp-lowering-exp.f64N/A
associate--l+N/A
fabs-negN/A
mul-1-negN/A
sub-negN/A
fabs-subN/A
+-lowering-+.f64N/A
Simplified87.0%
Taylor expanded in M around 0
associate--l+N/A
+-commutativeN/A
unpow2N/A
associate-*r*N/A
distribute-rgt-inN/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
--lowering--.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6467.0%
Simplified67.0%
if 6.99999999999999993e-4 < n Initial program 80.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified80.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6496.4%
Simplified96.4%
(FPCore (K m n M l) :precision binary64 (if (<= n 1e-142) (exp (+ (fabs (- n m)) (* m (* m -0.25)))) (if (<= n 13000000000000.0) (/ 1.0 (exp (* M M))) (exp (* n (* n -0.25))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 1e-142) {
tmp = exp((fabs((n - m)) + (m * (m * -0.25))));
} else if (n <= 13000000000000.0) {
tmp = 1.0 / 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 (n <= 1d-142) then
tmp = exp((abs((n - m)) + (m * (m * (-0.25d0)))))
else if (n <= 13000000000000.0d0) then
tmp = 1.0d0 / 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 (n <= 1e-142) {
tmp = Math.exp((Math.abs((n - m)) + (m * (m * -0.25))));
} else if (n <= 13000000000000.0) {
tmp = 1.0 / Math.exp((M * M));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if n <= 1e-142: tmp = math.exp((math.fabs((n - m)) + (m * (m * -0.25)))) elif n <= 13000000000000.0: tmp = 1.0 / 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 (n <= 1e-142) tmp = exp(Float64(abs(Float64(n - m)) + Float64(m * Float64(m * -0.25)))); elseif (n <= 13000000000000.0) tmp = Float64(1.0 / exp(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 (n <= 1e-142) tmp = exp((abs((n - m)) + (m * (m * -0.25)))); elseif (n <= 13000000000000.0) tmp = 1.0 / exp((M * M)); else tmp = exp((n * (n * -0.25))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 1e-142], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] + N[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 13000000000000.0], N[(1.0 / N[Exp[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}\;n \leq 10^{-142}:\\
\;\;\;\;e^{\left|n - m\right| + m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{elif}\;n \leq 13000000000000:\\
\;\;\;\;\frac{1}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if n < 1e-142Initial program 76.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified76.9%
Taylor expanded in n around 0
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
sub-negN/A
mul-1-negN/A
+-commutativeN/A
exp-lowering-exp.f64N/A
Simplified73.6%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6443.9%
Simplified43.9%
Taylor expanded in M around 0
cos-lowering-cos.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6443.9%
Simplified43.9%
Taylor expanded in K around 0
exp-sumN/A
fabs-subN/A
prod-expN/A
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
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6455.0%
Simplified55.0%
if 1e-142 < n < 1.3e13Initial program 78.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified78.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified91.7%
Taylor expanded in M around 0
Simplified91.7%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6458.3%
Simplified58.3%
*-rgt-identityN/A
exp-diffN/A
1-expN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6458.3%
Applied egg-rr58.3%
if 1.3e13 < n Initial program 79.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified79.2%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64100.0%
Simplified100.0%
Final simplification64.7%
(FPCore (K m n M l) :precision binary64 (if (<= n 1e-142) (* (cos M) (exp (* -0.25 (* m m)))) (if (<= n 13000000000000.0) (/ 1.0 (exp (* M M))) (exp (* n (* n -0.25))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 1e-142) {
tmp = cos(M) * exp((-0.25 * (m * m)));
} else if (n <= 13000000000000.0) {
tmp = 1.0 / 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 (n <= 1d-142) then
tmp = cos(m_1) * exp(((-0.25d0) * (m * m)))
else if (n <= 13000000000000.0d0) then
tmp = 1.0d0 / 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 (n <= 1e-142) {
tmp = Math.cos(M) * Math.exp((-0.25 * (m * m)));
} else if (n <= 13000000000000.0) {
tmp = 1.0 / Math.exp((M * M));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if n <= 1e-142: tmp = math.cos(M) * math.exp((-0.25 * (m * m))) elif n <= 13000000000000.0: tmp = 1.0 / 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 (n <= 1e-142) tmp = Float64(cos(M) * exp(Float64(-0.25 * Float64(m * m)))); elseif (n <= 13000000000000.0) tmp = Float64(1.0 / exp(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 (n <= 1e-142) tmp = cos(M) * exp((-0.25 * (m * m))); elseif (n <= 13000000000000.0) tmp = 1.0 / exp((M * M)); else tmp = exp((n * (n * -0.25))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 1e-142], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 13000000000000.0], N[(1.0 / N[Exp[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}\;n \leq 10^{-142}:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;n \leq 13000000000000:\\
\;\;\;\;\frac{1}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if n < 1e-142Initial program 76.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified76.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified97.4%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6461.9%
Simplified61.9%
if 1e-142 < n < 1.3e13Initial program 78.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified78.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified91.7%
Taylor expanded in M around 0
Simplified91.7%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6458.3%
Simplified58.3%
*-rgt-identityN/A
exp-diffN/A
1-expN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6458.3%
Applied egg-rr58.3%
if 1.3e13 < n Initial program 79.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified79.2%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64100.0%
Simplified100.0%
Final simplification69.4%
(FPCore (K m n M l) :precision binary64 (if (<= n 1.5e-143) (exp (* m (* m -0.25))) (if (<= n 13000000000000.0) (/ 1.0 (exp (* M M))) (exp (* n (* n -0.25))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (n <= 1.5e-143) {
tmp = exp((m * (m * -0.25)));
} else if (n <= 13000000000000.0) {
tmp = 1.0 / 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 (n <= 1.5d-143) then
tmp = exp((m * (m * (-0.25d0))))
else if (n <= 13000000000000.0d0) then
tmp = 1.0d0 / 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 (n <= 1.5e-143) {
tmp = Math.exp((m * (m * -0.25)));
} else if (n <= 13000000000000.0) {
tmp = 1.0 / Math.exp((M * M));
} else {
tmp = Math.exp((n * (n * -0.25)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if n <= 1.5e-143: tmp = math.exp((m * (m * -0.25))) elif n <= 13000000000000.0: tmp = 1.0 / 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 (n <= 1.5e-143) tmp = exp(Float64(m * Float64(m * -0.25))); elseif (n <= 13000000000000.0) tmp = Float64(1.0 / exp(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 (n <= 1.5e-143) tmp = exp((m * (m * -0.25))); elseif (n <= 13000000000000.0) tmp = 1.0 / exp((M * M)); else tmp = exp((n * (n * -0.25))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[n, 1.5e-143], N[Exp[N[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 13000000000000.0], N[(1.0 / N[Exp[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}\;n \leq 1.5 \cdot 10^{-143}:\\
\;\;\;\;e^{m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{elif}\;n \leq 13000000000000:\\
\;\;\;\;\frac{1}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;e^{n \cdot \left(n \cdot -0.25\right)}\\
\end{array}
\end{array}
if n < 1.49999999999999993e-143Initial program 76.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified76.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified97.4%
Taylor expanded in M around 0
Simplified97.9%
Taylor expanded in n around 0
associate--l+N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-negN/A
associate--l+N/A
exp-lowering-exp.f64N/A
associate--l+N/A
fabs-negN/A
mul-1-negN/A
sub-negN/A
fabs-subN/A
+-lowering-+.f64N/A
Simplified86.4%
Taylor expanded in m around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6461.9%
Simplified61.9%
if 1.49999999999999993e-143 < n < 1.3e13Initial program 78.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified78.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified91.7%
Taylor expanded in M around 0
Simplified91.7%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6458.3%
Simplified58.3%
*-rgt-identityN/A
exp-diffN/A
1-expN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6458.3%
Applied egg-rr58.3%
if 1.3e13 < n Initial program 79.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified79.2%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64100.0%
Simplified100.0%
Final simplification69.4%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (* m (* m -0.25))))) (if (<= m -54.0) t_0 (if (<= m 2e-28) (/ 1.0 (exp (* M M))) t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp((m * (m * -0.25)));
double tmp;
if (m <= -54.0) {
tmp = t_0;
} else if (m <= 2e-28) {
tmp = 1.0 / exp((M * M));
} 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 * (m * (-0.25d0))))
if (m <= (-54.0d0)) then
tmp = t_0
else if (m <= 2d-28) then
tmp = 1.0d0 / exp((m_1 * m_1))
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 * -0.25)));
double tmp;
if (m <= -54.0) {
tmp = t_0;
} else if (m <= 2e-28) {
tmp = 1.0 / Math.exp((M * M));
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.exp((m * (m * -0.25))) tmp = 0 if m <= -54.0: tmp = t_0 elif m <= 2e-28: tmp = 1.0 / math.exp((M * M)) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = exp(Float64(m * Float64(m * -0.25))) tmp = 0.0 if (m <= -54.0) tmp = t_0; elseif (m <= 2e-28) tmp = Float64(1.0 / exp(Float64(M * M))); else tmp = t_0; end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = exp((m * (m * -0.25))); tmp = 0.0; if (m <= -54.0) tmp = t_0; elseif (m <= 2e-28) tmp = 1.0 / exp((M * M)); else tmp = t_0; end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[N[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[m, -54.0], t$95$0, If[LessEqual[m, 2e-28], N[(1.0 / N[Exp[N[(M * M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{if}\;m \leq -54:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 2 \cdot 10^{-28}:\\
\;\;\;\;\frac{1}{e^{M \cdot M}}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -54 or 1.99999999999999994e-28 < m Initial program 75.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified75.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified99.3%
Taylor expanded in M around 0
Simplified100.0%
Taylor expanded in n around 0
associate--l+N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-negN/A
associate--l+N/A
exp-lowering-exp.f64N/A
associate--l+N/A
fabs-negN/A
mul-1-negN/A
sub-negN/A
fabs-subN/A
+-lowering-+.f64N/A
Simplified89.1%
Taylor expanded in m around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6493.3%
Simplified93.3%
if -54 < m < 1.99999999999999994e-28Initial program 79.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified79.6%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified94.6%
Taylor expanded in M around 0
Simplified94.6%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6461.7%
Simplified61.7%
*-rgt-identityN/A
exp-diffN/A
1-expN/A
/-lowering-/.f64N/A
exp-lowering-exp.f64N/A
*-lowering-*.f6461.7%
Applied egg-rr61.7%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (* m (* m -0.25))))) (if (<= m -4e-7) t_0 (if (<= m 1.1e-26) (exp (- 0.0 l)) t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp((m * (m * -0.25)));
double tmp;
if (m <= -4e-7) {
tmp = t_0;
} else if (m <= 1.1e-26) {
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((m * (m * (-0.25d0))))
if (m <= (-4d-7)) then
tmp = t_0
else if (m <= 1.1d-26) 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((m * (m * -0.25)));
double tmp;
if (m <= -4e-7) {
tmp = t_0;
} else if (m <= 1.1e-26) {
tmp = Math.exp((0.0 - l));
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.exp((m * (m * -0.25))) tmp = 0 if m <= -4e-7: tmp = t_0 elif m <= 1.1e-26: tmp = math.exp((0.0 - l)) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = exp(Float64(m * Float64(m * -0.25))) tmp = 0.0 if (m <= -4e-7) tmp = t_0; elseif (m <= 1.1e-26) 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((m * (m * -0.25))); tmp = 0.0; if (m <= -4e-7) tmp = t_0; elseif (m <= 1.1e-26) 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[(m * N[(m * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[m, -4e-7], t$95$0, If[LessEqual[m, 1.1e-26], N[Exp[N[(0.0 - l), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{m \cdot \left(m \cdot -0.25\right)}\\
\mathbf{if}\;m \leq -4 \cdot 10^{-7}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 1.1 \cdot 10^{-26}:\\
\;\;\;\;e^{0 - \ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -3.9999999999999998e-7 or 1.1e-26 < m Initial program 75.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified75.6%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified98.8%
Taylor expanded in M around 0
Simplified99.5%
Taylor expanded in n around 0
associate--l+N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
fabs-negN/A
associate--l+N/A
exp-lowering-exp.f64N/A
associate--l+N/A
fabs-negN/A
mul-1-negN/A
sub-negN/A
fabs-subN/A
+-lowering-+.f64N/A
Simplified89.4%
Taylor expanded in m around inf
unpow2N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6492.8%
Simplified92.8%
if -3.9999999999999998e-7 < m < 1.1e-26Initial program 80.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified80.0%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified95.3%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6439.9%
Simplified39.9%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
neg-sub0N/A
--lowering--.f6439.9%
Simplified39.9%
(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.5%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified77.5%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f64N/A
Simplified97.3%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6434.3%
Simplified34.3%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
neg-sub0N/A
--lowering--.f6434.7%
Simplified34.7%
(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.5%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
neg-sub0N/A
associate-+l-N/A
sub0-negN/A
cos-negN/A
cos-lowering-cos.f64N/A
sub-negN/A
+-lowering-+.f64N/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
metadata-evalN/A
exp-lowering-exp.f64N/A
Simplified77.5%
Taylor expanded in M around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
associate--l+N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f6440.3%
Simplified40.3%
Taylor expanded in M around 0
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f646.5%
Simplified6.5%
Taylor expanded in K around 0
Simplified7.0%
herbie shell --seed 2024162
(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)))))))