
(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 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (K m n M l) :precision binary64 (* (cos (- (/ (* K (+ m n)) 2.0) M)) (exp (- (- (pow (- (/ (+ m n) 2.0) M) 2.0)) (- l (fabs (- m n)))))))
double code(double K, double m, double n, double M, double l) {
return cos((((K * (m + n)) / 2.0) - M)) * exp((-pow((((m + n) / 2.0) - M), 2.0) - (l - fabs((m - n)))));
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos((((k * (m + n)) / 2.0d0) - m_1)) * exp((-((((m + n) / 2.0d0) - m_1) ** 2.0d0) - (l - abs((m - n)))))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos((((K * (m + n)) / 2.0) - M)) * Math.exp((-Math.pow((((m + n) / 2.0) - M), 2.0) - (l - Math.abs((m - n)))));
}
def code(K, m, n, M, l): return math.cos((((K * (m + n)) / 2.0) - M)) * math.exp((-math.pow((((m + n) / 2.0) - M), 2.0) - (l - math.fabs((m - n)))))
function code(K, m, n, M, l) return Float64(cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) * exp(Float64(Float64(-(Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)) - Float64(l - abs(Float64(m - n)))))) end
function tmp = code(K, m, n, M, l) tmp = cos((((K * (m + n)) / 2.0) - M)) * exp((-((((m + n) / 2.0) - M) ^ 2.0) - (l - abs((m - n))))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision] * N[Exp[N[((-N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]) - N[(l - N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)}
\end{array}
(FPCore (K m n M l) :precision binary64 (* (cos M) (exp (- (- (fabs (- m n)) l) (pow (- (/ (+ m n) 2.0) M) 2.0)))))
double code(double K, double m, double n, double M, double l) {
return cos(M) * exp(((fabs((m - n)) - l) - pow((((m + n) / 2.0) - M), 2.0)));
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = cos(m_1) * exp(((abs((m - n)) - l) - ((((m + n) / 2.0d0) - m_1) ** 2.0d0)))
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.cos(M) * Math.exp(((Math.abs((m - n)) - l) - Math.pow((((m + n) / 2.0) - M), 2.0)));
}
def code(K, m, n, M, l): return math.cos(M) * math.exp(((math.fabs((m - n)) - l) - math.pow((((m + n) / 2.0) - M), 2.0)))
function code(K, m, n, M, l) return Float64(cos(M) * exp(Float64(Float64(abs(Float64(m - n)) - l) - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0)))) end
function tmp = code(K, m, n, M, l) tmp = cos(M) * exp(((abs((m - n)) - l) - ((((m + n) / 2.0) - M) ^ 2.0))); end
code[K_, m_, n_, M_, l_] := N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\cos M \cdot e^{\left(\left|m - n\right| - \ell\right) - {\left(\frac{m + n}{2} - M\right)}^{2}}
\end{array}
Initial program 80.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6497.1
Simplified97.1%
Final simplification97.1%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (fabs (- m n)))
(t_1 (- t_0 l))
(t_2 (cos (- (/ (* K (+ m n)) 2.0) M)))
(t_3 (* (+ m n) (+ m n))))
(if (<= (* (exp (- t_1 (pow (- (/ (+ m n) 2.0) M) 2.0))) t_2) 0.6)
(*
t_2
(exp (- t_1 (* M (fma M (/ (+ n (fma -0.25 (/ t_3 M) m)) (- M)) M)))))
(exp (- t_0 (fma 0.25 t_3 l))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = fabs((m - n));
double t_1 = t_0 - l;
double t_2 = cos((((K * (m + n)) / 2.0) - M));
double t_3 = (m + n) * (m + n);
double tmp;
if ((exp((t_1 - pow((((m + n) / 2.0) - M), 2.0))) * t_2) <= 0.6) {
tmp = t_2 * exp((t_1 - (M * fma(M, ((n + fma(-0.25, (t_3 / M), m)) / -M), M))));
} else {
tmp = exp((t_0 - fma(0.25, t_3, l)));
}
return tmp;
}
function code(K, m, n, M, l) t_0 = abs(Float64(m - n)) t_1 = Float64(t_0 - l) t_2 = cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) t_3 = Float64(Float64(m + n) * Float64(m + n)) tmp = 0.0 if (Float64(exp(Float64(t_1 - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * t_2) <= 0.6) tmp = Float64(t_2 * exp(Float64(t_1 - Float64(M * fma(M, Float64(Float64(n + fma(-0.25, Float64(t_3 / M), m)) / Float64(-M)), M))))); else tmp = exp(Float64(t_0 - fma(0.25, t_3, l))); end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - l), $MachinePrecision]}, Block[{t$95$2 = N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[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] * t$95$2), $MachinePrecision], 0.6], N[(t$95$2 * N[Exp[N[(t$95$1 - N[(M * N[(M * N[(N[(n + N[(-0.25 * N[(t$95$3 / M), $MachinePrecision] + m), $MachinePrecision]), $MachinePrecision] / (-M)), $MachinePrecision] + M), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(t$95$0 - N[(0.25 * t$95$3 + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left|m - n\right|\\
t_1 := t\_0 - \ell\\
t_2 := \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_3 := \left(m + n\right) \cdot \left(m + n\right)\\
\mathbf{if}\;e^{t\_1 - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot t\_2 \leq 0.6:\\
\;\;\;\;t\_2 \cdot e^{t\_1 - M \cdot \mathsf{fma}\left(M, \frac{n + \mathsf{fma}\left(-0.25, \frac{t\_3}{M}, m\right)}{-M}, M\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{t\_0 - \mathsf{fma}\left(0.25, t\_3, \ell\right)}\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < 0.599999999999999978Initial program 97.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
Simplified97.9%
if 0.599999999999999978 < (*.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 30.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6497.3
Simplified97.3%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6494.3
Simplified94.3%
Final simplification97.0%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (cos (- (/ (* K (+ m n)) 2.0) M))) (t_1 (fabs (- m n))))
(if (<= (* (exp (- (- t_1 l) (pow (- (/ (+ m n) 2.0) M) 2.0))) t_0) 0.6)
(*
t_0
(exp
(*
M
(fma
M
(/ (+ (+ m n) (/ (- t_1 (fma (+ m n) (* (+ m n) 0.25) l)) M)) M)
(- M)))))
(exp (- t_1 (fma 0.25 (* (+ m n) (+ m n)) l))))))
double code(double K, double m, double n, double M, double l) {
double t_0 = cos((((K * (m + n)) / 2.0) - M));
double t_1 = fabs((m - n));
double tmp;
if ((exp(((t_1 - l) - pow((((m + n) / 2.0) - M), 2.0))) * t_0) <= 0.6) {
tmp = t_0 * exp((M * fma(M, (((m + n) + ((t_1 - fma((m + n), ((m + n) * 0.25), l)) / M)) / M), -M)));
} else {
tmp = exp((t_1 - fma(0.25, ((m + n) * (m + n)), l)));
}
return tmp;
}
function code(K, m, n, M, l) t_0 = cos(Float64(Float64(Float64(K * Float64(m + n)) / 2.0) - M)) t_1 = abs(Float64(m - n)) tmp = 0.0 if (Float64(exp(Float64(Float64(t_1 - l) - (Float64(Float64(Float64(m + n) / 2.0) - M) ^ 2.0))) * t_0) <= 0.6) tmp = Float64(t_0 * exp(Float64(M * fma(M, Float64(Float64(Float64(m + n) + Float64(Float64(t_1 - fma(Float64(m + n), Float64(Float64(m + n) * 0.25), l)) / M)) / M), Float64(-M))))); else tmp = exp(Float64(t_1 - fma(0.25, Float64(Float64(m + n) * Float64(m + n)), l))); end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[Cos[N[(N[(N[(K * N[(m + n), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[Exp[N[(N[(t$95$1 - l), $MachinePrecision] - N[Power[N[(N[(N[(m + n), $MachinePrecision] / 2.0), $MachinePrecision] - M), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision], 0.6], N[(t$95$0 * N[Exp[N[(M * N[(M * N[(N[(N[(m + n), $MachinePrecision] + N[(N[(t$95$1 - N[(N[(m + n), $MachinePrecision] * N[(N[(m + n), $MachinePrecision] * 0.25), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision]), $MachinePrecision] / M), $MachinePrecision] + (-M)), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Exp[N[(t$95$1 - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right)\\
t_1 := \left|m - n\right|\\
\mathbf{if}\;e^{\left(t\_1 - \ell\right) - {\left(\frac{m + n}{2} - M\right)}^{2}} \cdot t\_0 \leq 0.6:\\
\;\;\;\;t\_0 \cdot e^{M \cdot \mathsf{fma}\left(M, \frac{\left(m + n\right) + \frac{t\_1 - \mathsf{fma}\left(m + n, \left(m + n\right) \cdot 0.25, \ell\right)}{M}}{M}, -M\right)}\\
\mathbf{else}:\\
\;\;\;\;e^{t\_1 - \mathsf{fma}\left(0.25, \left(m + n\right) \cdot \left(m + n\right), \ell\right)}\\
\end{array}
\end{array}
if (*.f64 (cos.f64 (-.f64 (/.f64 (*.f64 K (+.f64 m n)) #s(literal 2 binary64)) M)) (exp.f64 (-.f64 (neg.f64 (pow.f64 (-.f64 (/.f64 (+.f64 m n) #s(literal 2 binary64)) M) #s(literal 2 binary64))) (-.f64 l (fabs.f64 (-.f64 m n)))))) < 0.599999999999999978Initial program 97.9%
Taylor expanded in M around -inf
Simplified97.9%
if 0.599999999999999978 < (*.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 30.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6497.3
Simplified97.3%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6494.3
Simplified94.3%
Final simplification97.0%
(FPCore (K m n M l)
:precision binary64
(let* ((t_0 (* (cos M) (exp (* M (- M))))))
(if (<= M -5.15e+64)
t_0
(if (<= M 27.0)
(exp (- (fabs (- m n)) (fma 0.25 (* (+ m n) (+ m n)) l)))
t_0))))
double code(double K, double m, double n, double M, double l) {
double t_0 = cos(M) * exp((M * -M));
double tmp;
if (M <= -5.15e+64) {
tmp = t_0;
} else if (M <= 27.0) {
tmp = exp((fabs((m - n)) - fma(0.25, ((m + n) * (m + n)), l)));
} else {
tmp = t_0;
}
return tmp;
}
function code(K, m, n, M, l) t_0 = Float64(cos(M) * exp(Float64(M * Float64(-M)))) tmp = 0.0 if (M <= -5.15e+64) tmp = t_0; elseif (M <= 27.0) tmp = exp(Float64(abs(Float64(m - n)) - fma(0.25, Float64(Float64(m + n) * Float64(m + n)), l))); else tmp = t_0; end return tmp end
code[K_, m_, n_, M_, l_] := Block[{t$95$0 = N[(N[Cos[M], $MachinePrecision] * N[Exp[N[(M * (-M)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[M, -5.15e+64], t$95$0, If[LessEqual[M, 27.0], N[Exp[N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], t$95$0]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \cos M \cdot e^{M \cdot \left(-M\right)}\\
\mathbf{if}\;M \leq -5.15 \cdot 10^{+64}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;M \leq 27:\\
\;\;\;\;e^{\left|m - n\right| - \mathsf{fma}\left(0.25, \left(m + n\right) \cdot \left(m + n\right), \ell\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if M < -5.15000000000000009e64 or 27 < M Initial program 79.7%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Simplified100.0%
Taylor expanded in M around inf
mul-1-negN/A
unpow2N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-neg.f6498.5
Simplified98.5%
if -5.15000000000000009e64 < M < 27Initial program 81.5%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6493.9
Simplified93.9%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6491.5
Simplified91.5%
Final simplification95.1%
(FPCore (K m n M l) :precision binary64 (if (<= m -53.0) (exp (* -0.25 (* m m))) (if (<= m -6.6e-189) (exp (- l)) (exp (fma -0.25 (* n n) (fabs (- m n)))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -53.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -6.6e-189) {
tmp = exp(-l);
} else {
tmp = exp(fma(-0.25, (n * n), fabs((m - n))));
}
return tmp;
}
function code(K, m, n, M, l) tmp = 0.0 if (m <= -53.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -6.6e-189) tmp = exp(Float64(-l)); else tmp = exp(fma(-0.25, Float64(n * n), abs(Float64(m - n)))); end return tmp end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -53.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -6.6e-189], N[Exp[(-l)], $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision] + N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -53:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -6.6 \cdot 10^{-189}:\\
\;\;\;\;e^{-\ell}\\
\mathbf{else}:\\
\;\;\;\;e^{\mathsf{fma}\left(-0.25, n \cdot n, \left|m - n\right|\right)}\\
\end{array}
\end{array}
if m < -53Initial program 76.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Simplified100.0%
Taylor expanded in m around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64100.0
Simplified100.0%
if -53 < m < -6.6000000000000002e-189Initial program 88.9%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6483.8
Simplified83.8%
Taylor expanded in l around inf
neg-mul-1N/A
lower-neg.f6451.4
Simplified51.4%
if -6.6000000000000002e-189 < m Initial program 80.3%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6495.2
Simplified95.2%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6482.0
Simplified82.0%
Taylor expanded in n around inf
unpow2N/A
lower-*.f6463.7
Simplified63.7%
Taylor expanded in l around 0
lower-exp.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-fabs.f64N/A
lower--.f6444.9
Simplified44.9%
Final simplification59.6%
(FPCore (K m n M l) :precision binary64 (if (<= m -56.0) (exp (* -0.25 (* m m))) (exp (- (fabs (- m n)) (fma 0.25 (* n n) l)))))
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((m - n)) - fma(0.25, (n * n), l)));
}
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(abs(Float64(m - n)) - fma(0.25, Float64(n * n), l))); end return 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[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(n * n), $MachinePrecision] + l), $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|m - n\right| - \mathsf{fma}\left(0.25, n \cdot n, \ell\right)}\\
\end{array}
\end{array}
if m < -56Initial program 76.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Simplified100.0%
Taylor expanded in m around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64100.0
Simplified100.0%
if -56 < m Initial program 81.9%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6496.1
Simplified96.1%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6482.3
Simplified82.3%
Taylor expanded in n around inf
unpow2N/A
lower-*.f6467.5
Simplified67.5%
Final simplification75.6%
(FPCore (K m n M l) :precision binary64 (exp (- (fabs (- m n)) (fma 0.25 (* (+ m n) (+ m n)) l))))
double code(double K, double m, double n, double M, double l) {
return exp((fabs((m - n)) - fma(0.25, ((m + n) * (m + n)), l)));
}
function code(K, m, n, M, l) return exp(Float64(abs(Float64(m - n)) - fma(0.25, Float64(Float64(m + n) * Float64(m + n)), l))) end
code[K_, m_, n_, M_, l_] := N[Exp[N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision] + l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
e^{\left|m - n\right| - \mathsf{fma}\left(0.25, \left(m + n\right) \cdot \left(m + n\right), \ell\right)}
\end{array}
Initial program 80.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6497.1
Simplified97.1%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6486.8
Simplified86.8%
Final simplification86.8%
(FPCore (K m n M l) :precision binary64 (if (<= m -53.0) (exp (* -0.25 (* m m))) (if (<= m -6.6e-189) (exp (- l)) (exp (* -0.25 (* n n))))))
double code(double K, double m, double n, double M, double l) {
double tmp;
if (m <= -53.0) {
tmp = exp((-0.25 * (m * m)));
} else if (m <= -6.6e-189) {
tmp = exp(-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 <= (-53.0d0)) then
tmp = exp(((-0.25d0) * (m * m)))
else if (m <= (-6.6d-189)) then
tmp = exp(-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 <= -53.0) {
tmp = Math.exp((-0.25 * (m * m)));
} else if (m <= -6.6e-189) {
tmp = Math.exp(-l);
} else {
tmp = Math.exp((-0.25 * (n * n)));
}
return tmp;
}
def code(K, m, n, M, l): tmp = 0 if m <= -53.0: tmp = math.exp((-0.25 * (m * m))) elif m <= -6.6e-189: tmp = math.exp(-l) else: tmp = math.exp((-0.25 * (n * n))) return tmp
function code(K, m, n, M, l) tmp = 0.0 if (m <= -53.0) tmp = exp(Float64(-0.25 * Float64(m * m))); elseif (m <= -6.6e-189) tmp = exp(Float64(-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 <= -53.0) tmp = exp((-0.25 * (m * m))); elseif (m <= -6.6e-189) tmp = exp(-l); else tmp = exp((-0.25 * (n * n))); end tmp_2 = tmp; end
code[K_, m_, n_, M_, l_] := If[LessEqual[m, -53.0], N[Exp[N[(-0.25 * N[(m * m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[m, -6.6e-189], N[Exp[(-l)], $MachinePrecision], N[Exp[N[(-0.25 * N[(n * n), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;m \leq -53:\\
\;\;\;\;e^{-0.25 \cdot \left(m \cdot m\right)}\\
\mathbf{elif}\;m \leq -6.6 \cdot 10^{-189}:\\
\;\;\;\;e^{-\ell}\\
\mathbf{else}:\\
\;\;\;\;e^{-0.25 \cdot \left(n \cdot n\right)}\\
\end{array}
\end{array}
if m < -53Initial program 76.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64100.0
Simplified100.0%
Taylor expanded in m around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f64100.0
Simplified100.0%
if -53 < m < -6.6000000000000002e-189Initial program 88.9%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f64100.0
Simplified100.0%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6483.8
Simplified83.8%
Taylor expanded in l around inf
neg-mul-1N/A
lower-neg.f6451.4
Simplified51.4%
if -6.6000000000000002e-189 < m Initial program 80.3%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6495.2
Simplified95.2%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6482.0
Simplified82.0%
Taylor expanded in n around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6449.0
Simplified49.0%
Final simplification62.1%
(FPCore (K m n M l) :precision binary64 (let* ((t_0 (exp (* -0.25 (* m m))))) (if (<= m -53.0) t_0 (if (<= m 54.0) (exp (- 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 <= -53.0) {
tmp = t_0;
} else if (m <= 54.0) {
tmp = exp(-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 <= (-53.0d0)) then
tmp = t_0
else if (m <= 54.0d0) then
tmp = exp(-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 <= -53.0) {
tmp = t_0;
} else if (m <= 54.0) {
tmp = Math.exp(-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 <= -53.0: tmp = t_0 elif m <= 54.0: tmp = math.exp(-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 <= -53.0) tmp = t_0; elseif (m <= 54.0) tmp = exp(Float64(-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 <= -53.0) tmp = t_0; elseif (m <= 54.0) tmp = exp(-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, -53.0], t$95$0, If[LessEqual[m, 54.0], N[Exp[(-l)], $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 -53:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;m \leq 54:\\
\;\;\;\;e^{-\ell}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if m < -53 or 54 < m Initial program 75.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6499.2
Simplified99.2%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6497.7
Simplified97.7%
Taylor expanded in m around inf
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6498.4
Simplified98.4%
if -53 < m < 54Initial program 85.5%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6494.9
Simplified94.9%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6476.0
Simplified76.0%
Taylor expanded in l around inf
neg-mul-1N/A
lower-neg.f6443.7
Simplified43.7%
Final simplification70.8%
(FPCore (K m n M l) :precision binary64 (exp (- l)))
double code(double K, double m, double n, double M, double l) {
return exp(-l);
}
real(8) function code(k, m, n, m_1, l)
real(8), intent (in) :: k
real(8), intent (in) :: m
real(8), intent (in) :: n
real(8), intent (in) :: m_1
real(8), intent (in) :: l
code = exp(-l)
end function
public static double code(double K, double m, double n, double M, double l) {
return Math.exp(-l);
}
def code(K, m, n, M, l): return math.exp(-l)
function code(K, m, n, M, l) return exp(Float64(-l)) end
function tmp = code(K, m, n, M, l) tmp = exp(-l); end
code[K_, m_, n_, M_, l_] := N[Exp[(-l)], $MachinePrecision]
\begin{array}{l}
\\
e^{-\ell}
\end{array}
Initial program 80.6%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f6497.1
Simplified97.1%
Taylor expanded in M around 0
lower-exp.f64N/A
lower--.f64N/A
fabs-subN/A
sub-negN/A
mul-1-negN/A
lower-fabs.f64N/A
mul-1-negN/A
sub-negN/A
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6486.8
Simplified86.8%
Taylor expanded in l around inf
neg-mul-1N/A
lower-neg.f6436.2
Simplified36.2%
(FPCore (K m n M l) :precision binary64 (* (fma (* K K) (* (* m m) -0.125) 1.0) (fma l (fma l (fma l -0.16666666666666666 0.5) -1.0) 1.0)))
double code(double K, double m, double n, double M, double l) {
return fma((K * K), ((m * m) * -0.125), 1.0) * fma(l, fma(l, fma(l, -0.16666666666666666, 0.5), -1.0), 1.0);
}
function code(K, m, n, M, l) return Float64(fma(Float64(K * K), Float64(Float64(m * m) * -0.125), 1.0) * fma(l, fma(l, fma(l, -0.16666666666666666, 0.5), -1.0), 1.0)) end
code[K_, m_, n_, M_, l_] := N[(N[(N[(K * K), $MachinePrecision] * N[(N[(m * m), $MachinePrecision] * -0.125), $MachinePrecision] + 1.0), $MachinePrecision] * N[(l * N[(l * N[(l * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(K \cdot K, \left(m \cdot m\right) \cdot -0.125, 1\right) \cdot \mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, -0.16666666666666666, 0.5\right), -1\right), 1\right)
\end{array}
Initial program 80.6%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6434.2
Simplified34.2%
Taylor expanded in m around inf
lower-*.f64N/A
*-commutativeN/A
lower-*.f6436.3
Simplified36.3%
Taylor expanded in l around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6410.1
Simplified10.1%
Taylor expanded in m around 0
associate-*r*N/A
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f648.9
Simplified8.9%
Final simplification8.9%
(FPCore (K m n M l) :precision binary64 (fma l (fma l (fma l -0.16666666666666666 0.5) -1.0) 1.0))
double code(double K, double m, double n, double M, double l) {
return fma(l, fma(l, fma(l, -0.16666666666666666, 0.5), -1.0), 1.0);
}
function code(K, m, n, M, l) return fma(l, fma(l, fma(l, -0.16666666666666666, 0.5), -1.0), 1.0) end
code[K_, m_, n_, M_, l_] := N[(l * N[(l * N[(l * -0.16666666666666666 + 0.5), $MachinePrecision] + -1.0), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, \mathsf{fma}\left(\ell, -0.16666666666666666, 0.5\right), -1\right), 1\right)
\end{array}
Initial program 80.6%
Taylor expanded in l around inf
mul-1-negN/A
lower-neg.f6434.2
Simplified34.2%
Taylor expanded in m around inf
lower-*.f64N/A
*-commutativeN/A
lower-*.f6436.3
Simplified36.3%
Taylor expanded in l around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f6410.1
Simplified10.1%
Taylor expanded in m around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f649.3
Simplified9.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 80.6%
Taylor expanded in n around inf
*-commutativeN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6442.3
Simplified42.3%
Taylor expanded in n around 0
lower-cos.f64N/A
sub-negN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-neg.f645.8
Simplified5.8%
Taylor expanded in K around 0
cos-negN/A
lower-cos.f645.8
Simplified5.8%
Taylor expanded in M around 0
Simplified5.8%
herbie shell --seed 2024210
(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)))))))