\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)}e^{\left|m - n\right| - \left({\left(\frac{m + n}{2} - M\right)}^{2} + \ell\right)}(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)))))))
(FPCore (K m n M l) :precision binary64 (exp (- (fabs (- m n)) (+ (pow (- (/ (+ m n) 2.0) M) 2.0) l))))
double code(double K, double m, double n, double M, double l) {
return ((double) (((double) cos(((double) ((((double) (K * ((double) (m + n)))) / 2.0) - M)))) * ((double) exp(((double) (((double) -(((double) pow(((double) ((((double) (m + n)) / 2.0) - M)), 2.0)))) - ((double) (l - ((double) fabs(((double) (m - n))))))))))));
}
double code(double K, double m, double n, double M, double l) {
return ((double) exp(((double) (((double) fabs(((double) (m - n)))) - ((double) (((double) pow(((double) ((((double) (m + n)) / 2.0) - M)), 2.0)) + l))))));
}



Bits error versus K



Bits error versus m



Bits error versus n



Bits error versus M



Bits error versus l
Results
Initial program 15.1
Simplified15.1
Taylor expanded around 0 1.3
Final simplification1.3
herbie shell --seed 2020198
(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)))))))