
(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 (let* ((t_0 (* 0.5 (+ n m)))) (* (cos M) (exp (+ (- (fabs (- n m)) l) (* (- t_0 M) (- M t_0)))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = 0.5 * (n + m);
return cos(M) * exp(((fabs((n - m)) - l) + ((t_0 - M) * (M - t_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
real(8) :: t_0
t_0 = 0.5d0 * (n + m)
code = cos(m_1) * exp(((abs((n - m)) - l) + ((t_0 - m_1) * (m_1 - t_0))))
end function
public static double code(double K, double m, double n, double M, double l) {
double t_0 = 0.5 * (n + m);
return Math.cos(M) * Math.exp(((Math.abs((n - m)) - l) + ((t_0 - M) * (M - t_0))));
}
def code(K, m, n, M, l): t_0 = 0.5 * (n + m) return math.cos(M) * math.exp(((math.fabs((n - m)) - l) + ((t_0 - M) * (M - t_0))))
function code(K, m, n, M, l) t_0 = Float64(0.5 * Float64(n + m)) return Float64(cos(M) * exp(Float64(Float64(abs(Float64(n - m)) - l) + Float64(Float64(t_0 - M) * Float64(M - t_0))))) end
function tmp = code(K, m, n, M, l) t_0 = 0.5 * (n + m); tmp = cos(M) * exp(((abs((n - m)) - l) + ((t_0 - M) * (M - t_0)))); end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(0.5 * N[(n + m), $MachinePrecision]), $MachinePrecision]}, N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] + N[(N[(t$95$0 - M), $MachinePrecision] * N[(M - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := 0.5 \cdot \left(n + m\right)\\
\cos M \cdot e^{\left(\left|n - m\right| - \ell\right) + \left(t\_0 - M\right) \cdot \left(M - t\_0\right)}
\end{array}
\end{array}
Initial program 72.5%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified96.0%
Final simplification96.0%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (* (cos M) (exp (- 0.0 (* M M))))))
(if (<= M -1.75e+20)
t_0
(if (<= M 1.16e+77)
(exp (+ (- (fabs (- n m)) l) (* (* (+ n m) (+ n m)) -0.25)))
t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = cos(M) * exp((0.0 - (M * M)));
double tmp;
if (M <= -1.75e+20) {
tmp = t_0;
} else if (M <= 1.16e+77) {
tmp = exp(((fabs((n - m)) - l) + (((n + m) * (n + m)) * -0.25)));
} else {
tmp = t_0;
}
return tmp;
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
real(8) :: t_0
real(8) :: tmp
t_0 = cos(m_1) * exp((0.0d0 - (m_1 * m_1)))
if (m_1 <= (-1.75d+20)) then
tmp = t_0
else if (m_1 <= 1.16d+77) then
tmp = exp(((abs((n - m)) - l) + (((n + m) * (n + m)) * (-0.25d0))))
else
tmp = t_0
end if
code = tmp
end function
public static double code(double K, double m, double n, double M, double l) {
double t_0 = Math.cos(M) * Math.exp((0.0 - (M * M)));
double tmp;
if (M <= -1.75e+20) {
tmp = t_0;
} else if (M <= 1.16e+77) {
tmp = Math.exp(((Math.abs((n - m)) - l) + (((n + m) * (n + m)) * -0.25)));
} else {
tmp = t_0;
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.cos(M) * math.exp((0.0 - (M * M))) tmp = 0 if M <= -1.75e+20: tmp = t_0 elif M <= 1.16e+77: tmp = math.exp(((math.fabs((n - m)) - l) + (((n + m) * (n + m)) * -0.25))) else: tmp = t_0 return tmp
function code(K, m, n, M, l) t_0 = Float64(cos(M) * exp(Float64(0.0 - Float64(M * M)))) tmp = 0.0 if (M <= -1.75e+20) tmp = t_0; elseif (M <= 1.16e+77) tmp = exp(Float64(Float64(abs(Float64(n - m)) - l) + Float64(Float64(Float64(n + m) * Float64(n + m)) * -0.25))); else tmp = t_0; end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = cos(M) * exp((0.0 - (M * M))); tmp = 0.0; if (M <= -1.75e+20) tmp = t_0; elseif (M <= 1.16e+77) tmp = exp(((abs((n - m)) - l) + (((n + m) * (n + m)) * -0.25))); 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[(0.0 - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M, -1.75e+20], t$95$0, If[LessEqual[M, 1.16e+77], N[Exp[N[(N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] + N[(N[(N[(n + m), $MachinePrecision] * N[(n + m), $MachinePrecision]), $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos M \cdot e^{0 - M \cdot M}\\
\mathbf{if}\;M \leq -1.75 \cdot 10^{+20}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 1.16 \cdot 10^{+77}:\\
\;\;\;\;e^{\left(\left|n - m\right| - \ell\right) + \left(\left(n + m\right) \cdot \left(n + m\right)\right) \cdot -0.25}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -1.75e20 or 1.1600000000000001e77 < M Initial program 77.3%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified100.0%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6497.3%
Simplified97.3%
if -1.75e20 < M < 1.1600000000000001e77Initial program 68.9%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified93.1%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6493.7%
Simplified93.7%
Final simplification95.3%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (exp (* -0.25 (* m m)))))
(if (<= n -1.2e-189)
(* (cos M) t_0)
(if (<= n 9.8e-77)
(* (cos M) (exp (- 0.0 (* M M))))
(if (<= n 0.0005) t_0 (exp (* -0.25 (* n n))))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = exp((-0.25 * (m * m)));
double tmp;
if (n <= -1.2e-189) {
tmp = cos(M) * t_0;
} else if (n <= 9.8e-77) {
tmp = cos(M) * exp((0.0 - (M * M)));
} else if (n <= 0.0005) {
tmp = t_0;
} 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) :: t_0
real(8) :: tmp
t_0 = exp(((-0.25d0) * (m * m)))
if (n <= (-1.2d-189)) then
tmp = cos(m_1) * t_0
else if (n <= 9.8d-77) then
tmp = cos(m_1) * exp((0.0d0 - (m_1 * m_1)))
else if (n <= 0.0005d0) then
tmp = t_0
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 t_0 = Math.exp((-0.25 * (m * m)));
double tmp;
if (n <= -1.2e-189) {
tmp = Math.cos(M) * t_0;
} else if (n <= 9.8e-77) {
tmp = Math.cos(M) * Math.exp((0.0 - (M * M)));
} else if (n <= 0.0005) {
tmp = t_0;
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): t_0 = math.exp((-0.25 * (m * m))) tmp = 0 if n <= -1.2e-189: tmp = math.cos(M) * t_0 elif n <= 9.8e-77: tmp = math.cos(M) * math.exp((0.0 - (M * M))) elif n <= 0.0005: tmp = t_0 else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) t_0 = exp(Float64(-0.25 * Float64(m * m))) tmp = 0.0 if (n <= -1.2e-189) tmp = Float64(cos(M) * t_0); elseif (n <= 9.8e-77) tmp = Float64(cos(M) * exp(Float64(0.0 - Float64(M * M)))); elseif (n <= 0.0005) tmp = t_0; else tmp = exp(Float64(-0.25 * Float64(n * n))); end return tmp end
function tmp_2 = code(K, m, n, M, l) t_0 = exp((-0.25 * (m * m))); tmp = 0.0; if (n <= -1.2e-189) tmp = cos(M) * t_0; elseif (n <= 9.8e-77) tmp = cos(M) * exp((0.0 - (M * M))); elseif (n <= 0.0005) tmp = t_0; else tmp = exp((-0.25 * (n * n))); 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[n, -1.2e-189], N[(N[Cos[M], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[n, 9.8e-77], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(0.0 - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 0.0005], t$95$0, N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{if}\;n \leq -1.2 \cdot 10^{-189}:\\
\;\;\;\;\cos M \cdot t\_0\\
\mathbf{elif}\;n \leq 9.8 \cdot 10^{-77}:\\
\;\;\;\;\cos M \cdot e^{0 - M \cdot M}\\
\mathbf{elif}\;n \leq 0.0005:\\
\;\;\;\;t\_0\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if n < -1.1999999999999999e-189Initial program 75.2%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified97.1%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6457.1%
Simplified57.1%
if -1.1999999999999999e-189 < n < 9.7999999999999994e-77Initial program 84.9%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified94.1%
Taylor expanded in M around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
unpow2N/A
*-lowering-*.f6463.0%
Simplified63.0%
if 9.7999999999999994e-77 < n < 5.0000000000000001e-4Initial program 66.2%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified90.9%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6490.9%
Simplified90.9%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6479.5%
Simplified79.5%
if 5.0000000000000001e-4 < n Initial program 52.7%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified98.3%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6496.5%
Simplified96.5%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6496.5%
Simplified96.5%
(FPCore (K m n M l)
:precision binary64
(if (<= m -54.0)
(exp (* -0.25 (* m m)))
(if (<= m -1e-87)
(* (cos M) (exp (- 0.0 l)))
(* (cos M) (exp (* -0.25 (* n n)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -54.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -1e-87) {
tmp = cos(M) * exp((0.0 - l));
} 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 <= (-54.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else if (m <= (-1d-87)) then
tmp = cos(m_1) * exp((0.0d0 - l))
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 <= -54.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else if (m <= -1e-87) {
tmp = Math.cos(M) * Math.exp((0.0 - l));
} else {
tmp = Math.cos(M) * Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -54.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -1e-87: tmp = math.cos(M) * math.exp((0.0 - l)) 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 <= -54.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -1e-87) tmp = Float64(cos(M) * exp(Float64(0.0 - l))); 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 <= -54.0) tmp = exp((-0.25 * (m * m))); elseif (m <= -1e-87) tmp = cos(M) * exp((0.0 - l)); else tmp = cos(M) * exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -54.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -1e-87], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(0.0 - l), $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 -54:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -1 \cdot 10^{-87}:\\
\;\;\;\;\cos M \cdot e^{0 - \ell}\\
\mathbf{else}:\\
\;\;\;\;\cos M \cdot e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -54Initial program 70.8%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.6%
Simplified98.6%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.3%
Simplified97.3%
if -54 < m < -1.00000000000000002e-87Initial program 86.7%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified89.0%
Taylor expanded in l around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f6456.5%
Simplified56.5%
if -1.00000000000000002e-87 < m Initial program 72.0%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified95.6%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.6%
Simplified52.6%
(FPCore (K m n M l) :precision binary64 (if (<= m -56.0) (exp (* -0.25 (* m m))) (exp (+ (- (fabs (- n m)) l) (* -0.25 (* n n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -56.0) {
tmp = exp((-0.25 * (m * m)));
} else {
tmp = exp(((fabs((n - m)) - 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 <= (-56.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else
tmp = exp(((abs((n - m)) - 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 <= -56.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else {
tmp = Math.exp(((Math.abs((n - m)) - l) + (-0.25 * (n * n))));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -56.0: tmp = math.exp((-0.25 * (m * m))) else: tmp = math.exp(((math.fabs((n - m)) - l) + (-0.25 * (n * n)))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -56.0) tmp = exp(Float64(-0.25 * Float64(m * m))); else tmp = exp(Float64(Float64(abs(Float64(n - m)) - 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 <= -56.0) tmp = exp((-0.25 * (m * m))); else tmp = exp(((abs((n - m)) - l) + (-0.25 * (n * n)))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -56.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[N[(N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] + N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -56:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{\left(\left|n - m\right| - \ell\right) + -0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -56Initial program 70.8%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.6%
Simplified98.6%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.3%
Simplified97.3%
if -56 < m Initial program 73.2%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified95.0%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6484.4%
Simplified84.4%
Taylor expanded in n around inf
unpow2N/A
*-lowering-*.f6463.0%
Simplified63.0%
Final simplification72.6%
(FPCore (K m n M l) :precision binary64 (if (<= m -54.0) (exp (* -0.25 (* m m))) (if (<= m -1.75e-87) (* (cos M) (exp (- 0.0 l))) (exp (* -0.25 (* n n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -54.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -1.75e-87) {
tmp = cos(M) * exp((0.0 - l));
} 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 <= (-54.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else if (m <= (-1.75d-87)) then
tmp = cos(m_1) * exp((0.0d0 - l))
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 <= -54.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else if (m <= -1.75e-87) {
tmp = Math.cos(M) * Math.exp((0.0 - l));
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -54.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -1.75e-87: tmp = math.cos(M) * math.exp((0.0 - l)) else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -54.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -1.75e-87) tmp = Float64(cos(M) * exp(Float64(0.0 - l))); 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 <= -54.0) tmp = exp((-0.25 * (m * m))); elseif (m <= -1.75e-87) tmp = cos(M) * exp((0.0 - l)); else tmp = exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -54.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -1.75e-87], N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(0.0 - l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -54:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -1.75 \cdot 10^{-87}:\\
\;\;\;\;\cos M \cdot e^{0 - \ell}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -54Initial program 70.8%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.6%
Simplified98.6%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.3%
Simplified97.3%
if -54 < m < -1.75000000000000006e-87Initial program 86.7%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified89.0%
Taylor expanded in l around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f6456.5%
Simplified56.5%
if -1.75000000000000006e-87 < m Initial program 72.0%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified95.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6484.6%
Simplified84.6%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.6%
Simplified52.6%
(FPCore (K m n M l) :precision binary64 (if (<= m -54.0) (exp (* -0.25 (* m m))) (if (<= m -1.8e-85) (exp (- (fabs (- n m)) l)) (exp (* -0.25 (* n n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -54.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -1.8e-85) {
tmp = exp((fabs((n - m)) - l));
} 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 <= (-54.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else if (m <= (-1.8d-85)) then
tmp = exp((abs((n - m)) - l))
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 <= -54.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else if (m <= -1.8e-85) {
tmp = Math.exp((Math.abs((n - m)) - l));
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -54.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -1.8e-85: tmp = math.exp((math.fabs((n - m)) - l)) else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -54.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -1.8e-85) tmp = exp(Float64(abs(Float64(n - m)) - l)); 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 <= -54.0) tmp = exp((-0.25 * (m * m))); elseif (m <= -1.8e-85) tmp = exp((abs((n - m)) - l)); else tmp = exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -54.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -1.8e-85], N[Exp[N[(N[Abs[N[(n - m), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]], $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -54:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -1.8 \cdot 10^{-85}:\\
\;\;\;\;e^{\left|n - m\right| - \ell}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -54Initial program 70.8%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified98.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6498.6%
Simplified98.6%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.3%
Simplified97.3%
if -54 < m < -1.7999999999999999e-85Initial program 85.7%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified88.2%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6488.2%
Simplified88.2%
Taylor expanded in n around inf
unpow2N/A
*-lowering-*.f6488.2%
Simplified88.2%
Taylor expanded in n around 0
exp-lowering-exp.f64N/A
--lowering--.f64N/A
fabs-lowering-fabs.f64N/A
--lowering--.f6453.0%
Simplified53.0%
if -1.7999999999999999e-85 < m Initial program 72.1%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified95.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6484.1%
Simplified84.1%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6452.3%
Simplified52.3%
Final simplification65.0%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (* -0.25 (* m m))))) (if (<= m -54.0) t_0 (if (<= m 54.0) (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 <= -54.0) {
tmp = t_0;
} else if (m <= 54.0) {
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 <= (-54.0d0)) then
tmp = t_0
else if (m <= 54.0d0) 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 <= -54.0) {
tmp = t_0;
} else if (m <= 54.0) {
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 <= -54.0: tmp = t_0 elif m <= 54.0: 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 <= -54.0) tmp = t_0; elseif (m <= 54.0) 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 <= -54.0) tmp = t_0; elseif (m <= 54.0) 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, -54.0], t$95$0, If[LessEqual[m, 54.0], 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 -54:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 54:\\
\;\;\;\;e^{0 - \ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -54 or 54 < m Initial program 67.7%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified99.2%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6499.2%
Simplified99.2%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6497.0%
Simplified97.0%
if -54 < m < 54Initial program 77.8%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified92.6%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6476.7%
Simplified76.7%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6446.3%
Simplified46.3%
(FPCore (K m n M l) :precision binary64 (if (<= m -0.0031) (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 <= -0.0031) {
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 <= (-0.0031d0)) 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 <= -0.0031) {
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 <= -0.0031: 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 <= -0.0031) 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 <= -0.0031) 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, -0.0031], 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 -0.0031:\\
\;\;\;\;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 < -0.00309999999999999989Initial program 70.3%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified97.5%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6497.5%
Simplified97.5%
Taylor expanded in m around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6494.9%
Simplified94.9%
if -0.00309999999999999989 < m Initial program 73.4%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified95.4%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6484.7%
Simplified84.7%
Taylor expanded in n around inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6453.4%
Simplified53.4%
(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 72.5%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified96.0%
Taylor expanded in M around 0
exp-lowering-exp.f64N/A
associate--r+N/A
cancel-sign-sub-invN/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--.f64N/A
distribute-lft-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6488.4%
Simplified88.4%
Taylor expanded in l around inf
neg-mul-1N/A
neg-sub0N/A
--lowering--.f6437.0%
Simplified37.0%
(FPCore (K m n M l) :precision binary64 (cos M))
double code(double K, double m, double n, double M, double l) {
return cos(M);
}
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)
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M);
}
def code(K, m, n, M, l): return math.cos(M)
function code(K, m, n, M, l) return cos(M) end
function tmp = code(K, m, n, M, l) tmp = cos(M); end
code[K_, m_, n_, M_, l_] := N[Cos[M], $MachinePrecision]
\begin{array}{l}
\\
\cos M
\end{array}
Initial program 72.5%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified96.0%
Taylor expanded in l around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f6437.7%
Simplified37.7%
Taylor expanded in l around 0
cos-lowering-cos.f648.3%
Simplified8.3%
(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 72.5%
Taylor expanded in K around 0
*-lowering-*.f64N/A
cos-negN/A
cos-lowering-cos.f64N/A
exp-lowering-exp.f64N/A
associate--r+N/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--.f64N/A
unpow2N/A
*-lowering-*.f64N/A
Simplified96.0%
Taylor expanded in l around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f6437.7%
Simplified37.7%
Taylor expanded in l around 0
cos-lowering-cos.f648.3%
Simplified8.3%
Taylor expanded in M around 0
Simplified8.2%
herbie shell --seed 2024191
(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)))))))