
(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}
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (- (fabs (- m n)) l))
(t_1 (exp (- t_0 (pow (- (/ (+ m n) 2.0) M) 2.0))))
(t_2 (* t_1 (cos (- (/ (* K (+ m n)) 2.0) M))))
(t_3
(*
(exp
(-
t_0
(*
M
(fma
M
(/ (+ n (fma -0.25 (/ (* (+ m n) (+ m n)) M) m)) (- M))
M))))
1.0)))
(if (<= t_2 -0.2)
(* (cos (- (/ K (fma (/ m (* n n)) -2.0 (/ 2.0 n))) M)) (exp (- l)))
(if (<= t_2 0.9705712466018273)
t_3
(if (<= t_2 INFINITY) (* t_1 (fma 0.5 (* K (* M (+ m n))) 1.0)) t_3)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((m - n)) - l;
double t_1 = exp((t_0 - pow((((m + n) / 2.0) - M), 2.0)));
double t_2 = t_1 * cos((((K * (m + n)) / 2.0) - M));
double t_3 = exp((t_0 - (M * fma(M, ((n + fma(-0.25, (((m + n) * (m + n)) / M), m)) / -M), M)))) * 1.0;
double tmp;
if (t_2 <= -0.2) {
tmp = cos(((K / fma((m / (n * n)), -2.0, (2.0 / n))) - M)) * exp(-l);
} else if (t_2 <= 0.9705712466018273) {
tmp = t_3;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_1 * fma(0.5, (K * (M * (m + n))), 1.0);
} else {
tmp = t_3;
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(abs(Float64(m - n)) - l) t_1 = exp(Float64(t_0 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) t_2 = Float64(t_1 * cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M))) t_3 = Float64(exp(Float64(t_0 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(Float64(Float64(m + n) * Float64(m + n)) / M), m)) / Float64(-M)), M)))) * 1.0) tmp = 0.0 if (t_2 <= -0.2) tmp = Float64(cos(Float64(Float64(K / fma(Float64(m / Float64(n * n)), -2.0, Float64(2.0 / n))) - M)) * exp(Float64(-l))); elseif (t_2 <= 0.9705712466018273) tmp = t_3; elseif (t_2 <= Inf) tmp = Float64(t_1 * fma(0.5, Float64(K * Float64(M * Float64(m + n))), 1.0)); else tmp = t_3; end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]}, Block[{t$95$1 = N[Exp[N[(t$95$0 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Exp[N[(t$95$0 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]}, If[LessEqual[t$95$2, -0.2], N[(N[Cos[N[(N[(K / N[(N[(m / N[(n * n), $MachinePrecision]), $MachinePrecision] * -2.0 + N[(2.0 / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.9705712466018273], t$95$3, If[LessEqual[t$95$2, Infinity], N[(t$95$1 * N[(0.5 * N[(K * N[(M * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], t$95$3]]]]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := \left|m - n\right| - \ell\\
t_1 := e^{t\_0 - {\left(\frac{m + n}{2} - M\right)}^{2}}\\
t_2 := t\_1 \cdot \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := e^{t\_0 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{\left(m + n\right) \cdot \left(m + n\right)}{M}, m\right)}{-M}, M\right)} \cdot 1\\
\mathbf{if}\;t\_2 \leq -0.2:\\
\;\;\;\;\cos \left(\frac{K}{\mathsf{fma}\left(\frac{m}{n \cdot n}, -2, \frac{2}{n}\right)} - M\right) \cdot e^{-\ell}\\
\mathbf{elif}\;t\_2 \leq 0.9705712466018273:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_1 \cdot \mathsf{fma}\left(0.5, K \cdot \left(M \cdot \left(m + n\right)\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.20000000000000001Initial program 39.0%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6439.0
Applied rewrites39.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6443.4
lift-+.f64N/A
+-commutativeN/A
lift-+.f6443.4
Applied rewrites43.4%
Taylor expanded in m around 0
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f6440.9
Applied rewrites40.9%
if -0.20000000000000001 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < 0.97057124660182725 or +inf.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 76.2%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites76.2%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6498.0
Applied rewrites98.0%
Taylor expanded in M around 0
Applied rewrites98.0%
if 0.97057124660182725 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < +inf.0Initial program 89.7%
Taylor expanded in K around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
Applied rewrites96.6%
Taylor expanded in M around 0
Applied rewrites96.6%
Final simplification95.3%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (exp (- l)))
(t_1 (- (fabs (- m n)) l))
(t_2
(*
(exp (- t_1 (pow (- (/ (+ m n) 2.0) M) 2.0)))
(cos (- (/ (* K (+ m n)) 2.0) M))))
(t_3
(*
(exp
(-
t_1
(*
M
(fma
M
(/ (+ n (fma -0.25 (/ (* (+ m n) (+ m n)) M) m)) (- M))
M))))
1.0)))
(if (<= t_2 -0.2)
(* (cos (- (/ K (fma (/ m (* n n)) -2.0 (/ 2.0 n))) M)) t_0)
(if (<= t_2 0.0)
t_3
(if (<= t_2 INFINITY) (* t_0 (cos (- (/ K (/ 2.0 m)) M))) t_3)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = exp(-l);
double t_1 = fabs((m - n)) - l;
double t_2 = exp((t_1 - pow((((m + n) / 2.0) - M), 2.0))) * cos((((K * (m + n)) / 2.0) - M));
double t_3 = exp((t_1 - (M * fma(M, ((n + fma(-0.25, (((m + n) * (m + n)) / M), m)) / -M), M)))) * 1.0;
double tmp;
if (t_2 <= -0.2) {
tmp = cos(((K / fma((m / (n * n)), -2.0, (2.0 / n))) - M)) * t_0;
} else if (t_2 <= 0.0) {
tmp = t_3;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_0 * cos(((K / (2.0 / m)) - M));
} else {
tmp = t_3;
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = exp(Float64(-l)) t_1 = Float64(abs(Float64(m - n)) - l) t_2 = Float64(exp(Float64(t_1 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M))) t_3 = Float64(exp(Float64(t_1 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(Float64(Float64(m + n) * Float64(m + n)) / M), m)) / Float64(-M)), M)))) * 1.0) tmp = 0.0 if (t_2 <= -0.2) tmp = Float64(cos(Float64(Float64(K / fma(Float64(m / Float64(n * n)), -2.0, Float64(2.0 / n))) - M)) * t_0); elseif (t_2 <= 0.0) tmp = t_3; elseif (t_2 <= Inf) tmp = Float64(t_0 * cos(Float64(Float64(K / Float64(2.0 / m)) - M))); else tmp = t_3; end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Exp[(-l)], $MachinePrecision]}, Block[{t$95$1 = N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]}, Block[{t$95$2 = N[(N[Exp[N[(t$95$1 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Exp[N[(t$95$1 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]}, If[LessEqual[t$95$2, -0.2], N[(N[Cos[N[(N[(K / N[(N[(m / N[(n * n), $MachinePrecision]), $MachinePrecision] * -2.0 + N[(2.0 / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, 0.0], t$95$3, If[LessEqual[t$95$2, Infinity], N[(t$95$0 * N[Cos[N[(N[(K / N[(2.0 / m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$3]]]]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := e^{-\ell}\\
t_1 := \left|m - n\right| - \ell\\
t_2 := e^{t\_1 - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := e^{t\_1 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{\left(m + n\right) \cdot \left(m + n\right)}{M}, m\right)}{-M}, M\right)} \cdot 1\\
\mathbf{if}\;t\_2 \leq -0.2:\\
\;\;\;\;\cos \left(\frac{K}{\mathsf{fma}\left(\frac{m}{n \cdot n}, -2, \frac{2}{n}\right)} - M\right) \cdot t\_0\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_0 \cdot \cos \left(\frac{K}{\frac{2}{m}} - M\right)\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.20000000000000001Initial program 39.0%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6439.0
Applied rewrites39.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6443.4
lift-+.f64N/A
+-commutativeN/A
lift-+.f6443.4
Applied rewrites43.4%
Taylor expanded in m around 0
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
associate-*r/N/A
metadata-evalN/A
lower-/.f6440.9
Applied rewrites40.9%
if -0.20000000000000001 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.0 or +inf.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 77.7%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites77.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites100.0%
if -0.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < +inf.0Initial program 78.2%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6478.2
Applied rewrites78.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6481.1
lift-+.f64N/A
+-commutativeN/A
lift-+.f6481.1
Applied rewrites81.1%
Taylor expanded in m around inf
lower-/.f6480.1
Applied rewrites80.1%
Final simplification94.8%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (- (fabs (- m n)) l))
(t_1
(*
(exp
(-
t_0
(*
M
(fma
M
(/ (+ n (fma -0.25 (/ (* (+ m n) (+ m n)) M) m)) (- M))
M))))
1.0))
(t_2
(*
(exp (- t_0 (pow (- (/ (+ m n) 2.0) M) 2.0)))
(cos (- (/ (* K (+ m n)) 2.0) M))))
(t_3 (exp (- l))))
(if (<= t_2 -0.2)
(* t_3 (fma (* M M) -0.5 1.0))
(if (<= t_2 0.0)
t_1
(if (<= t_2 INFINITY) (* t_3 (cos (- (/ K (/ 2.0 m)) M))) t_1)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((m - n)) - l;
double t_1 = exp((t_0 - (M * fma(M, ((n + fma(-0.25, (((m + n) * (m + n)) / M), m)) / -M), M)))) * 1.0;
double t_2 = exp((t_0 - pow((((m + n) / 2.0) - M), 2.0))) * cos((((K * (m + n)) / 2.0) - M));
double t_3 = exp(-l);
double tmp;
if (t_2 <= -0.2) {
tmp = t_3 * fma((M * M), -0.5, 1.0);
} else if (t_2 <= 0.0) {
tmp = t_1;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_3 * cos(((K / (2.0 / m)) - M));
} else {
tmp = t_1;
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(abs(Float64(m - n)) - l) t_1 = Float64(exp(Float64(t_0 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(Float64(Float64(m + n) * Float64(m + n)) / M), m)) / Float64(-M)), M)))) * 1.0) t_2 = Float64(exp(Float64(t_0 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M))) t_3 = exp(Float64(-l)) tmp = 0.0 if (t_2 <= -0.2) tmp = Float64(t_3 * fma(Float64(M * M), -0.5, 1.0)); elseif (t_2 <= 0.0) tmp = t_1; elseif (t_2 <= Inf) tmp = Float64(t_3 * cos(Float64(Float64(K / Float64(2.0 / m)) - M))); else tmp = t_1; end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[N[(t$95$0 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[Exp[N[(t$95$0 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Exp[(-l)], $MachinePrecision]}, If[LessEqual[t$95$2, -0.2], N[(t$95$3 * N[(N[(M * M), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], t$95$1, If[LessEqual[t$95$2, Infinity], N[(t$95$3 * N[Cos[N[(N[(K / N[(2.0 / m), $MachinePrecision]), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := \left|m - n\right| - \ell\\
t_1 := e^{t\_0 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{\left(m + n\right) \cdot \left(m + n\right)}{M}, m\right)}{-M}, M\right)} \cdot 1\\
t_2 := e^{t\_0 - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := e^{-\ell}\\
\mathbf{if}\;t\_2 \leq -0.2:\\
\;\;\;\;t\_3 \cdot \mathsf{fma}\left(M \cdot M, -0.5, 1\right)\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3 \cdot \cos \left(\frac{K}{\frac{2}{m}} - M\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.20000000000000001Initial program 39.0%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6469.8
Applied rewrites69.8%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6469.8
Applied rewrites69.8%
Taylor expanded in M around 0
Applied rewrites69.8%
if -0.20000000000000001 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.0 or +inf.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 77.7%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites77.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites100.0%
if -0.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < +inf.0Initial program 78.2%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6478.2
Applied rewrites78.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6481.1
lift-+.f64N/A
+-commutativeN/A
lift-+.f6481.1
Applied rewrites81.1%
Taylor expanded in m around inf
lower-/.f6480.1
Applied rewrites80.1%
Final simplification96.1%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (- (fabs (- m n)) l))
(t_1
(*
(exp
(-
t_0
(*
M
(fma
M
(/ (+ n (fma -0.25 (/ (* (+ m n) (+ m n)) M) m)) (- M))
M))))
1.0))
(t_2
(*
(exp (- t_0 (pow (- (/ (+ m n) 2.0) M) 2.0)))
(cos (- (/ (* K (+ m n)) 2.0) M))))
(t_3 (exp (- l))))
(if (<= t_2 -0.2)
(* t_3 (fma (* M M) -0.5 1.0))
(if (<= t_2 0.0) t_1 (if (<= t_2 INFINITY) (* (cos M) t_3) t_1)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((m - n)) - l;
double t_1 = exp((t_0 - (M * fma(M, ((n + fma(-0.25, (((m + n) * (m + n)) / M), m)) / -M), M)))) * 1.0;
double t_2 = exp((t_0 - pow((((m + n) / 2.0) - M), 2.0))) * cos((((K * (m + n)) / 2.0) - M));
double t_3 = exp(-l);
double tmp;
if (t_2 <= -0.2) {
tmp = t_3 * fma((M * M), -0.5, 1.0);
} else if (t_2 <= 0.0) {
tmp = t_1;
} else if (t_2 <= ((double) INFINITY)) {
tmp = cos(M) * t_3;
} else {
tmp = t_1;
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(abs(Float64(m - n)) - l) t_1 = Float64(exp(Float64(t_0 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(Float64(Float64(m + n) * Float64(m + n)) / M), m)) / Float64(-M)), M)))) * 1.0) t_2 = Float64(exp(Float64(t_0 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M))) t_3 = exp(Float64(-l)) tmp = 0.0 if (t_2 <= -0.2) tmp = Float64(t_3 * fma(Float64(M * M), -0.5, 1.0)); elseif (t_2 <= 0.0) tmp = t_1; elseif (t_2 <= Inf) tmp = Float64(cos(M) * t_3); else tmp = t_1; end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[N[(t$95$0 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[Exp[N[(t$95$0 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Exp[(-l)], $MachinePrecision]}, If[LessEqual[t$95$2, -0.2], N[(t$95$3 * N[(N[(M * M), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 0.0], t$95$1, If[LessEqual[t$95$2, Infinity], N[(N[Cos[M], $MachinePrecision] * t$95$3), $MachinePrecision], t$95$1]]]]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := \left|m - n\right| - \ell\\
t_1 := e^{t\_0 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{\left(m + n\right) \cdot \left(m + n\right)}{M}, m\right)}{-M}, M\right)} \cdot 1\\
t_2 := e^{t\_0 - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := e^{-\ell}\\
\mathbf{if}\;t\_2 \leq -0.2:\\
\;\;\;\;t\_3 \cdot \mathsf{fma}\left(M \cdot M, -0.5, 1\right)\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\cos M \cdot t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.20000000000000001Initial program 39.0%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6469.8
Applied rewrites69.8%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6469.8
Applied rewrites69.8%
Taylor expanded in M around 0
Applied rewrites69.8%
if -0.20000000000000001 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.0 or +inf.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 77.7%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites77.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites100.0%
if -0.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < +inf.0Initial program 78.2%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6481.1
Applied rewrites81.1%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6481.1
Applied rewrites81.1%
Final simplification96.2%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (- (fabs (- m n)) l))
(t_1
(*
(exp
(-
t_0
(*
M
(fma
M
(/ (+ n (fma -0.25 (/ (* (+ m n) (+ m n)) M) m)) (- M))
M))))
1.0))
(t_2
(*
(exp (- t_0 (pow (- (/ (+ m n) 2.0) M) 2.0)))
(cos (- (/ (* K (+ m n)) 2.0) M))))
(t_3 (* (exp (- l)) (fma (* M M) -0.5 1.0))))
(if (<= t_2 -0.5)
t_3
(if (<= t_2 0.8) t_1 (if (<= t_2 INFINITY) t_3 t_1)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((m - n)) - l;
double t_1 = exp((t_0 - (M * fma(M, ((n + fma(-0.25, (((m + n) * (m + n)) / M), m)) / -M), M)))) * 1.0;
double t_2 = exp((t_0 - pow((((m + n) / 2.0) - M), 2.0))) * cos((((K * (m + n)) / 2.0) - M));
double t_3 = exp(-l) * fma((M * M), -0.5, 1.0);
double tmp;
if (t_2 <= -0.5) {
tmp = t_3;
} else if (t_2 <= 0.8) {
tmp = t_1;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_3;
} else {
tmp = t_1;
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(abs(Float64(m - n)) - l) t_1 = Float64(exp(Float64(t_0 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(Float64(Float64(m + n) * Float64(m + n)) / M), m)) / Float64(-M)), M)))) * 1.0) t_2 = Float64(exp(Float64(t_0 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M))) t_3 = Float64(exp(Float64(-l)) * fma(Float64(M * M), -0.5, 1.0)) tmp = 0.0 if (t_2 <= -0.5) tmp = t_3; elseif (t_2 <= 0.8) tmp = t_1; elseif (t_2 <= Inf) tmp = t_3; else tmp = t_1; end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[N[(t$95$0 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[Exp[N[(t$95$0 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Exp[(-l)], $MachinePrecision] * N[(N[(M * M), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.5], t$95$3, If[LessEqual[t$95$2, 0.8], t$95$1, If[LessEqual[t$95$2, Infinity], t$95$3, t$95$1]]]]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := \left|m - n\right| - \ell\\
t_1 := e^{t\_0 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{\left(m + n\right) \cdot \left(m + n\right)}{M}, m\right)}{-M}, M\right)} \cdot 1\\
t_2 := e^{t\_0 - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := e^{-\ell} \cdot \mathsf{fma}\left(M \cdot M, -0.5, 1\right)\\
\mathbf{if}\;t\_2 \leq -0.5:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq 0.8:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < -0.5 or 0.80000000000000004 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < +inf.0Initial program 71.3%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6481.2
Applied rewrites81.2%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6481.2
Applied rewrites81.2%
Taylor expanded in M around 0
Applied rewrites81.2%
if -0.5 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < 0.80000000000000004 or +inf.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 77.1%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites77.1%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6499.2
Applied rewrites99.2%
Taylor expanded in M around 0
Applied rewrites99.2%
Final simplification96.2%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (- (fabs (- m n)) l))
(t_1 (exp (- t_0 (pow (- (/ (+ m n) 2.0) M) 2.0))))
(t_2 (* t_1 (cos (- (/ (* K (+ m n)) 2.0) M))))
(t_3
(exp
(-
t_0
(*
M
(fma
M
(/ (+ n (fma -0.25 (/ (* (+ m n) (+ m n)) M) m)) (- M))
M))))))
(if (<= t_2 0.9705712466018273)
(* (cos M) t_3)
(if (<= t_2 INFINITY)
(* t_1 (fma 0.5 (* K (* M (+ m n))) 1.0))
(* t_3 1.0)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((m - n)) - l;
double t_1 = exp((t_0 - pow((((m + n) / 2.0) - M), 2.0)));
double t_2 = t_1 * cos((((K * (m + n)) / 2.0) - M));
double t_3 = exp((t_0 - (M * fma(M, ((n + fma(-0.25, (((m + n) * (m + n)) / M), m)) / -M), M))));
double tmp;
if (t_2 <= 0.9705712466018273) {
tmp = cos(M) * t_3;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_1 * fma(0.5, (K * (M * (m + n))), 1.0);
} else {
tmp = t_3 * 1.0;
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(abs(Float64(m - n)) - l) t_1 = exp(Float64(t_0 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) t_2 = Float64(t_1 * cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M))) t_3 = exp(Float64(t_0 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(Float64(Float64(m + n) * Float64(m + n)) / M), m)) / Float64(-M)), M)))) tmp = 0.0 if (t_2 <= 0.9705712466018273) tmp = Float64(cos(M) * t_3); elseif (t_2 <= Inf) tmp = Float64(t_1 * fma(0.5, Float64(K * Float64(M * Float64(m + n))), 1.0)); else tmp = Float64(t_3 * 1.0); end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision]}, Block[{t$95$1 = N[Exp[N[(t$95$0 - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Exp[N[(t$95$0 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 0.9705712466018273], N[(N[Cos[M], $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(t$95$1 * N[(0.5 * N[(K * N[(M * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(t$95$3 * 1.0), $MachinePrecision]]]]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := \left|m - n\right| - \ell\\
t_1 := e^{t\_0 - {\left(\frac{m + n}{2} - M\right)}^{2}}\\
t_2 := t\_1 \cdot \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := e^{t\_0 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{\left(m + n\right) \cdot \left(m + n\right)}{M}, m\right)}{-M}, M\right)}\\
\mathbf{if}\;t\_2 \leq 0.9705712466018273:\\
\;\;\;\;\cos M \cdot t\_3\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_1 \cdot \mathsf{fma}\left(0.5, K \cdot \left(M \cdot \left(m + n\right)\right), 1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_3 \cdot 1\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < 0.97057124660182725Initial program 93.8%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites93.8%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6495.1
Applied rewrites95.1%
if 0.97057124660182725 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < +inf.0Initial program 89.7%
Taylor expanded in K around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
Applied rewrites96.6%
Taylor expanded in M around 0
Applied rewrites96.6%
if +inf.0 < (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) Initial program 0.0%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites0.0%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites100.0%
Final simplification96.1%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. (FPCore (K m n M l) :precision binary64 (* (cos M) (exp (- (- (fabs (- m n)) l) (pow (- (/ (+ m n) 2.0) M) 2.0)))))
assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
return cos(M) * exp(((fabs((m - n)) - l) - pow((((m + n) / 2.0) - M), 2.0)));
}
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos(m_1) * exp(((abs((m - n)) - l) - ((((m + n) / 2.0d0) - m_1) ** 2.0d0)))
end function
assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) * Math.exp(((Math.abs((m - n)) - l) - Math.pow((((m + n) / 2.0) - M), 2.0)));
}
[K, m, n, M, l] = sort([K, m, n, M, l]) def code(K, m, n, M, l): return math.cos(M) * math.exp(((math.fabs((m - n)) - l) - math.pow((((m + n) / 2.0) - M), 2.0)))
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) return Float64(cos(M) * exp(Float64(Float64(abs(Float64(m - n)) - l) - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)))) end
K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp = code(K, m, n, M, l)
tmp = cos(M) * exp(((abs((m - n)) - l) - ((((m + n) / 2.0) - M) ^ 2.0)));
end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\cos M \cdot e^{\left(\left|m - n\right| - \ell\right) - {\left(\frac{m + n}{2} - M\right)}^{2}}
\end{array}
Initial program 76.1%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6496.2
Applied rewrites96.2%
Final simplification96.2%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(if (<= m -50000000000000.0)
(* 1.0 (exp (* -0.25 (* m m))))
(*
1.0
(exp
(-
(- (fabs (- m n)) l)
(* M (fma M (/ (/ (* -0.25 (* n n)) M) (- M)) M)))))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -50000000000000.0) {
tmp = 1.0 * exp((-0.25 * (m * m)));
} else {
tmp = 1.0 * exp(((fabs((m - n)) - l) - (M * fma(M, (((-0.25 * (n * n)) / M) / -M), M))));
}
return tmp;
}
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) tmp = 0.0 if (m <= -50000000000000.0) tmp = Float64(1.0 * exp(Float64(-0.25 * Float64(m * m)))); else tmp = Float64(1.0 * exp(Float64(Float64(abs(Float64(m - n)) - l) - Float64(M * fma(M, Float64(Float64(Float64(-0.25 * Float64(n * n)) / M) / Float64(-M)), M))))); end return tmp end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. code[K_, m_, n_, M_, l_] := If[LessEqual[m, -50000000000000.0], N[(1.0 * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 * N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] - N[(M * N[(M * N[(N[(N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
\mathbf{if}\;m \leq -50000000000000:\\
\;\;\;\;1 \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{else}:\\
\;\;\;\;1 \cdot e^{\left(\left|m - n\right| - \ell\right) - M \cdot \mathsf{fma}\left(M, \frac{\frac{-0.25 \cdot \left(n \cdot n\right)}{M}}{-M}, M\right)}\\
\end{array}
\end{array}
if m < -5e13Initial program 65.6%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites65.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites98.4%
Taylor expanded in m around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6498.5
Applied rewrites98.5%
if -5e13 < m Initial program 79.6%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites75.0%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6489.7
Applied rewrites89.7%
Taylor expanded in M around 0
Applied rewrites87.6%
Taylor expanded in n around inf
Applied rewrites82.0%
Final simplification86.1%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(if (<= m -54.0)
(* 1.0 (exp (* -0.25 (* m m))))
(if (<= m -1.65e-37)
(* 1.0 (exp (- l)))
(if (<= m -1.22e-296)
(* 1.0 (exp (* M (- M))))
(* 1.0 (exp (* -0.25 (* n n))))))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -54.0) {
tmp = 1.0 * exp((-0.25 * (m * m)));
} else if (m <= -1.65e-37) {
tmp = 1.0 * exp(-l);
} else if (m <= -1.22e-296) {
tmp = 1.0 * exp((M * -M));
} else {
tmp = 1.0 * exp((-0.25 * (n * n)));
}
return tmp;
}
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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 = 1.0d0 * exp(((-0.25d0) * (m * m)))
else if (m <= (-1.65d-37)) then
tmp = 1.0d0 * exp(-l)
else if (m <= (-1.22d-296)) then
tmp = 1.0d0 * exp((m_1 * -m_1))
else
tmp = 1.0d0 * exp(((-0.25d0) * (n * n)))
end if
code = tmp
end function
assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -54.0) {
tmp = 1.0 * Math.exp((-0.25 * (m * m)));
} else if (m <= -1.65e-37) {
tmp = 1.0 * Math.exp(-l);
} else if (m <= -1.22e-296) {
tmp = 1.0 * Math.exp((M * -M));
} else {
tmp = 1.0 * Math.exp((-0.25 * (n * n)));
}
return tmp;
}
[K, m, n, M, l] = sort([K, m, n, M, l]) def code(K, m, n, M, l): tmp = 0 if m <= -54.0: tmp = 1.0 * math.exp((-0.25 * (m * m))) elif m <= -1.65e-37: tmp = 1.0 * math.exp(-l) elif m <= -1.22e-296: tmp = 1.0 * math.exp((M * -M)) else: tmp = 1.0 * math.exp((-0.25 * (n * n))) return tmp
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) tmp = 0.0 if (m <= -54.0) tmp = Float64(1.0 * exp(Float64(-0.25 * Float64(m * m)))); elseif (m <= -1.65e-37) tmp = Float64(1.0 * exp(Float64(-l))); elseif (m <= -1.22e-296) tmp = Float64(1.0 * exp(Float64(M * Float64(-M)))); else tmp = Float64(1.0 * exp(Float64(-0.25 * Float64(n * n)))); end return tmp end
K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp_2 = code(K, m, n, M, l)
tmp = 0.0;
if (m <= -54.0)
tmp = 1.0 * exp((-0.25 * (m * m)));
elseif (m <= -1.65e-37)
tmp = 1.0 * exp(-l);
elseif (m <= -1.22e-296)
tmp = 1.0 * exp((M * -M));
else
tmp = 1.0 * exp((-0.25 * (n * n)));
end
tmp_2 = tmp;
end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. code[K_, m_, n_, M_, l_] := If[LessEqual[m, -54.0], N[(1.0 * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, -1.65e-37], N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, -1.22e-296], N[(1.0 * N[Exp[N[(M * (-M)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(1.0 * N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
\mathbf{if}\;m \leq -54:\\
\;\;\;\;1 \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -1.65 \cdot 10^{-37}:\\
\;\;\;\;1 \cdot e^{-\ell}\\
\mathbf{elif}\;m \leq -1.22 \cdot 10^{-296}:\\
\;\;\;\;1 \cdot e^{M \cdot \left(-M\right)}\\
\mathbf{else}:\\
\;\;\;\;1 \cdot e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -54Initial program 66.2%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites66.2%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in M around 0
Applied rewrites98.5%
Taylor expanded in m around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6498.5
Applied rewrites98.5%
if -54 < m < -1.64999999999999991e-37Initial program 81.8%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6464.8
Applied rewrites64.8%
Taylor expanded in M around 0
Applied rewrites64.8%
if -1.64999999999999991e-37 < m < -1.22e-296Initial program 82.9%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites77.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6485.1
Applied rewrites85.1%
Taylor expanded in M around 0
Applied rewrites83.3%
Taylor expanded in M around inf
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6456.0
Applied rewrites56.0%
if -1.22e-296 < m Initial program 77.8%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites73.8%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6491.6
Applied rewrites91.6%
Taylor expanded in M around 0
Applied rewrites89.2%
Taylor expanded in n around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6452.5
Applied rewrites52.5%
Final simplification65.5%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (* 1.0 (exp (* -0.25 (* m m))))))
(if (<= m -54.0)
t_0
(if (<= m -1.65e-37)
(* 1.0 (exp (- l)))
(if (<= m 62000.0) (* 1.0 (exp (* M (- M)))) t_0)))))assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = 1.0 * exp((-0.25 * (m * m)));
double tmp;
if (m <= -54.0) {
tmp = t_0;
} else if (m <= -1.65e-37) {
tmp = 1.0 * exp(-l);
} else if (m <= 62000.0) {
tmp = 1.0 * exp((M * -M));
} else {
tmp = t_0;
}
return tmp;
}
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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 = 1.0d0 * exp(((-0.25d0) * (m * m)))
if (m <= (-54.0d0)) then
tmp = t_0
else if (m <= (-1.65d-37)) then
tmp = 1.0d0 * exp(-l)
else if (m <= 62000.0d0) then
tmp = 1.0d0 * exp((m_1 * -m_1))
else
tmp = t_0
end if
code = tmp
end function
assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
double t_0 = 1.0 * Math.exp((-0.25 * (m * m)));
double tmp;
if (m <= -54.0) {
tmp = t_0;
} else if (m <= -1.65e-37) {
tmp = 1.0 * Math.exp(-l);
} else if (m <= 62000.0) {
tmp = 1.0 * Math.exp((M * -M));
} else {
tmp = t_0;
}
return tmp;
}
[K, m, n, M, l] = sort([K, m, n, M, l]) def code(K, m, n, M, l): t_0 = 1.0 * math.exp((-0.25 * (m * m))) tmp = 0 if m <= -54.0: tmp = t_0 elif m <= -1.65e-37: tmp = 1.0 * math.exp(-l) elif m <= 62000.0: tmp = 1.0 * math.exp((M * -M)) else: tmp = t_0 return tmp
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(1.0 * exp(Float64(-0.25 * Float64(m * m)))) tmp = 0.0 if (m <= -54.0) tmp = t_0; elseif (m <= -1.65e-37) tmp = Float64(1.0 * exp(Float64(-l))); elseif (m <= 62000.0) tmp = Float64(1.0 * exp(Float64(M * Float64(-M)))); else tmp = t_0; end return tmp end
K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp_2 = code(K, m, n, M, l)
t_0 = 1.0 * exp((-0.25 * (m * m)));
tmp = 0.0;
if (m <= -54.0)
tmp = t_0;
elseif (m <= -1.65e-37)
tmp = 1.0 * exp(-l);
elseif (m <= 62000.0)
tmp = 1.0 * exp((M * -M));
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(1.0 * N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[m, -54.0], t$95$0, If[LessEqual[m, -1.65e-37], N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], If[LessEqual[m, 62000.0], N[(1.0 * N[Exp[N[(M * (-M)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := 1 \cdot e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{if}\;m \leq -54:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq -1.65 \cdot 10^{-37}:\\
\;\;\;\;1 \cdot e^{-\ell}\\
\mathbf{elif}\;m \leq 62000:\\
\;\;\;\;1 \cdot e^{M \cdot \left(-M\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -54 or 62000 < m Initial program 73.8%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites72.2%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6498.4
Applied rewrites98.4%
Taylor expanded in M around 0
Applied rewrites96.7%
Taylor expanded in m around inf
lower-*.f64N/A
unpow2N/A
lower-*.f6496.0
Applied rewrites96.0%
if -54 < m < -1.64999999999999991e-37Initial program 81.8%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Applied rewrites100.0%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6464.8
Applied rewrites64.8%
Taylor expanded in M around 0
Applied rewrites64.8%
if -1.64999999999999991e-37 < m < 62000Initial program 78.0%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites73.2%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6486.4
Applied rewrites86.4%
Taylor expanded in M around 0
Applied rewrites83.9%
Taylor expanded in M around inf
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6453.5
Applied rewrites53.5%
Final simplification74.2%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. (FPCore (K m n M l) :precision binary64 (let* ((t_0 (* 1.0 (exp (* M (- M)))))) (if (<= M -51.0) t_0 (if (<= M 2e-16) (* 1.0 (exp (- l))) t_0))))
assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
double t_0 = 1.0 * exp((M * -M));
double tmp;
if (M <= -51.0) {
tmp = t_0;
} else if (M <= 2e-16) {
tmp = 1.0 * exp(-l);
} else {
tmp = t_0;
}
return tmp;
}
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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 = 1.0d0 * exp((m_1 * -m_1))
if (m_1 <= (-51.0d0)) then
tmp = t_0
else if (m_1 <= 2d-16) then
tmp = 1.0d0 * exp(-l)
else
tmp = t_0
end if
code = tmp
end function
assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
double t_0 = 1.0 * Math.exp((M * -M));
double tmp;
if (M <= -51.0) {
tmp = t_0;
} else if (M <= 2e-16) {
tmp = 1.0 * Math.exp(-l);
} else {
tmp = t_0;
}
return tmp;
}
[K, m, n, M, l] = sort([K, m, n, M, l]) def code(K, m, n, M, l): t_0 = 1.0 * math.exp((M * -M)) tmp = 0 if M <= -51.0: tmp = t_0 elif M <= 2e-16: tmp = 1.0 * math.exp(-l) else: tmp = t_0 return tmp
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) t_0 = Float64(1.0 * exp(Float64(M * Float64(-M)))) tmp = 0.0 if (M <= -51.0) tmp = t_0; elseif (M <= 2e-16) tmp = Float64(1.0 * exp(Float64(-l))); else tmp = t_0; end return tmp end
K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp_2 = code(K, m, n, M, l)
t_0 = 1.0 * exp((M * -M));
tmp = 0.0;
if (M <= -51.0)
tmp = t_0;
elseif (M <= 2e-16)
tmp = 1.0 * exp(-l);
else
tmp = t_0;
end
tmp_2 = tmp;
end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(1.0 * N[Exp[N[(M * (-M)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M, -51.0], t$95$0, If[LessEqual[M, 2e-16], N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision], t$95$0]]]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
\begin{array}{l}
t_0 := 1 \cdot e^{M \cdot \left(-M\right)}\\
\mathbf{if}\;M \leq -51:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 2 \cdot 10^{-16}:\\
\;\;\;\;1 \cdot e^{-\ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -51 or 2e-16 < M Initial program 83.0%
Taylor expanded in M around -inf
unpow2N/A
associate-*l*N/A
lower-*.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-rgt-identityN/A
lower-fma.f64N/A
Applied rewrites83.0%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6499.2
Applied rewrites99.2%
Taylor expanded in M around 0
Applied rewrites95.1%
Taylor expanded in M around inf
mul-1-negN/A
lower-neg.f64N/A
unpow2N/A
lower-*.f6493.6
Applied rewrites93.6%
if -51 < M < 2e-16Initial program 69.9%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6493.5
Applied rewrites93.5%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6443.3
Applied rewrites43.3%
Taylor expanded in M around 0
Applied rewrites43.3%
Final simplification67.3%
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. (FPCore (K m n M l) :precision binary64 (* 1.0 (exp (- l))))
assert(K < m && m < n && n < M && M < l);
double code(double K, double m, double n, double M, double l) {
return 1.0 * exp(-l);
}
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function.
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 * exp(-l)
end function
assert K < m && m < n && n < M && M < l;
public static double code(double K, double m, double n, double M, double l) {
return 1.0 * Math.exp(-l);
}
[K, m, n, M, l] = sort([K, m, n, M, l]) def code(K, m, n, M, l): return 1.0 * math.exp(-l)
K, m, n, M, l = sort([K, m, n, M, l]) function code(K, m, n, M, l) return Float64(1.0 * exp(Float64(-l))) end
K, m, n, M, l = num2cell(sort([K, m, n, M, l])){:}
function tmp = code(K, m, n, M, l)
tmp = 1.0 * exp(-l);
end
NOTE: K, m, n, M, and l should be sorted in increasing order before calling this function. code[K_, m_, n_, M_, l_] := N[(1.0 * N[Exp[(-l)], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[K, m, n, M, l] = \mathsf{sort}([K, m, n, M, l])\\
\\
1 \cdot e^{-\ell}
\end{array}
Initial program 76.1%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6496.2
Applied rewrites96.2%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6438.4
Applied rewrites38.4%
Taylor expanded in M around 0
Applied rewrites36.5%
herbie shell --seed 2024223
(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)))))))