Maksimov and Kolovsky, Equation (32)

Percentage Accurate: 76.8% → 96.9%

Time: 14.8s

Alternatives: 7

Speedup: 3.6×

Specification

Math

\[\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

(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)))))))

C

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)))));
}

Fortran

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

Java

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)))));
}

Python

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)))))

Julia

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

MATLAB

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

Wolfram

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]

Initial Program: 76.8% accurate, 1.0× speedup

Math

\[\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

(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)))))))

C

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)))));
}

Fortran

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

Java

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)))));
}

Python

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)))))

Julia

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

MATLAB

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

Wolfram

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]

Alternative 1: 96.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos M \cdot e^{\left(\left|m - n\right| - \ell\right) - {\left(\frac{m + n}{2} - M\right)}^{2}} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (* (cos M) (exp (- (- (fabs (- m n)) l) (pow (- (/ (+ m n) 2.0) M) 2.0)))))

C

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)));
}

Fortran

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

Java

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)));
}

Python

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)))

Julia

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

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = cos(M) * exp(((abs((m - n)) - l) - ((((m + n) / 2.0) - M) ^ 2.0)));
end

Wolfram

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]

Derivation

1. Initial program 77.4%

   \[\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)} \]
2. Add Preprocessing

3. Taylor expanded in K around 0 96.5%

   \[\leadsto \color{blue}{\cos \left(-M\right)} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
4. Step-by-step derivation

   1. cos-neg 96.5%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

5. Simplified 96.5%

   \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

6. Final simplification 96.5%

   \[\leadsto \cos M \cdot e^{\left(\left|m - n\right| - \ell\right) - {\left(\frac{m + n}{2} - M\right)}^{2}} \]
7. Add Preprocessing

Alternative 2: 95.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;M \leq -2400 \lor \neg \left(M \leq 1.9 \cdot 10^{+51}\right):\\ \;\;\;\;\cos M \cdot e^{-{M}^{2}}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(\left|m - n\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (or (<= M -2400.0) (not (<= M 1.9e+51)))
   (* (cos M) (exp (- (pow M 2.0))))
   (exp (- (- (fabs (- m n)) l) (* 0.25 (pow (+ m n) 2.0))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((M <= -2400.0) || !(M <= 1.9e+51)) {
		tmp = cos(M) * exp(-pow(M, 2.0));
	} else {
		tmp = exp(((fabs((m - n)) - l) - (0.25 * pow((m + n), 2.0))));
	}
	return tmp;
}

Fortran

real(8) function code(k, m, n, m_1, l)
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((m_1 <= (-2400.0d0)) .or. (.not. (m_1 <= 1.9d+51))) then
        tmp = cos(m_1) * exp(-(m_1 ** 2.0d0))
    else
        tmp = exp(((abs((m - n)) - l) - (0.25d0 * ((m + n) ** 2.0d0))))
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((M <= -2400.0) || !(M <= 1.9e+51)) {
		tmp = Math.cos(M) * Math.exp(-Math.pow(M, 2.0));
	} else {
		tmp = Math.exp(((Math.abs((m - n)) - l) - (0.25 * Math.pow((m + n), 2.0))));
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if (M <= -2400.0) or not (M <= 1.9e+51):
		tmp = math.cos(M) * math.exp(-math.pow(M, 2.0))
	else:
		tmp = math.exp(((math.fabs((m - n)) - l) - (0.25 * math.pow((m + n), 2.0))))
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if ((M <= -2400.0) || !(M <= 1.9e+51))
		tmp = Float64(cos(M) * exp(Float64(-(M ^ 2.0))));
	else
		tmp = exp(Float64(Float64(abs(Float64(m - n)) - l) - Float64(0.25 * (Float64(m + n) ^ 2.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if ((M <= -2400.0) || ~((M <= 1.9e+51)))
		tmp = cos(M) * exp(-(M ^ 2.0));
	else
		tmp = exp(((abs((m - n)) - l) - (0.25 * ((m + n) ^ 2.0))));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[Or[LessEqual[M, -2400.0], N[Not[LessEqual[M, 1.9e+51]], $MachinePrecision]], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[Exp[N[(N[(N[Abs[N[(m - n), $MachinePrecision]], $MachinePrecision] - l), $MachinePrecision] - N[(0.25 * N[Power[N[(m + n), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if M < -2400 or 1.8999999999999999e51 < M

   1. Initial program 78.6%

      \[\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)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0 100.0%

      \[\leadsto \color{blue}{\cos \left(-M\right)} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   4. Step-by-step derivation

      1. cos-neg 100.0%

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Taylor expanded in M around inf 97.5%

      \[\leadsto \cos M \cdot e^{\color{blue}{-1 \cdot {M}^{2}}} \]
   7. Step-by-step derivation

      1. mul-1-neg 97.5%

         \[\leadsto \cos M \cdot e^{\color{blue}{-{M}^{2}}} \]

   8. Simplified 97.5%

      \[\leadsto \cos M \cdot e^{\color{blue}{-{M}^{2}}} \]

   if -2400 < M < 1.8999999999999999e51

   1. Initial program 76.3%

      \[\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)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0 93.5%

      \[\leadsto \color{blue}{\cos \left(-M\right)} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   4. Step-by-step derivation

      1. cos-neg 93.5%

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   5. Simplified 93.5%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Taylor expanded in M around 0 93.4%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)}} \]
   7. Step-by-step derivation

      1. fabs-sub 93.4%

         \[\leadsto e^{\color{blue}{\left|n - m\right|} - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)} \]

      2. associate--r+ 93.4%

         \[\leadsto e^{\color{blue}{\left(\left|n - m\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}} \]

   8. Simplified 93.4%

      \[\leadsto \color{blue}{e^{\left(\left|n - m\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;M \leq -2400 \lor \neg \left(M \leq 1.9 \cdot 10^{+51}\right):\\ \;\;\;\;\cos M \cdot e^{-{M}^{2}}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(\left|m - n\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 88.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;M \leq -1750 \lor \neg \left(M \leq 27\right):\\ \;\;\;\;\cos M \cdot e^{-{M}^{2}}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n - m\right) - 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (or (<= M -1750.0) (not (<= M 27.0)))
   (* (cos M) (exp (- (pow M 2.0))))
   (exp (- (- n m) (* 0.25 (* (+ m n) (+ m n)))))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((M <= -1750.0) || !(M <= 27.0)) {
		tmp = cos(M) * exp(-pow(M, 2.0));
	} else {
		tmp = exp(((n - m) - (0.25 * ((m + n) * (m + n)))));
	}
	return tmp;
}

Fortran

real(8) function code(k, m, n, m_1, l)
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((m_1 <= (-1750.0d0)) .or. (.not. (m_1 <= 27.0d0))) then
        tmp = cos(m_1) * exp(-(m_1 ** 2.0d0))
    else
        tmp = exp(((n - m) - (0.25d0 * ((m + n) * (m + n)))))
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if ((M <= -1750.0) || !(M <= 27.0)) {
		tmp = Math.cos(M) * Math.exp(-Math.pow(M, 2.0));
	} else {
		tmp = Math.exp(((n - m) - (0.25 * ((m + n) * (m + n)))));
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if (M <= -1750.0) or not (M <= 27.0):
		tmp = math.cos(M) * math.exp(-math.pow(M, 2.0))
	else:
		tmp = math.exp(((n - m) - (0.25 * ((m + n) * (m + n)))))
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if ((M <= -1750.0) || !(M <= 27.0))
		tmp = Float64(cos(M) * exp(Float64(-(M ^ 2.0))));
	else
		tmp = exp(Float64(Float64(n - m) - Float64(0.25 * Float64(Float64(m + n) * Float64(m + n)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if ((M <= -1750.0) || ~((M <= 27.0)))
		tmp = cos(M) * exp(-(M ^ 2.0));
	else
		tmp = exp(((n - m) - (0.25 * ((m + n) * (m + n)))));
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[Or[LessEqual[M, -1750.0], N[Not[LessEqual[M, 27.0]], $MachinePrecision]], N[(N[Cos[M], $MachinePrecision] * N[Exp[(-N[Power[M, 2.0], $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[Exp[N[(N[(n - m), $MachinePrecision] - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if M < -1750 or 27 < M

   1. Initial program 79.7%

      \[\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)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0 100.0%

      \[\leadsto \color{blue}{\cos \left(-M\right)} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   4. Step-by-step derivation

      1. cos-neg 100.0%

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Taylor expanded in M around inf 96.8%

      \[\leadsto \cos M \cdot e^{\color{blue}{-1 \cdot {M}^{2}}} \]
   7. Step-by-step derivation

      1. mul-1-neg 96.8%

         \[\leadsto \cos M \cdot e^{\color{blue}{-{M}^{2}}} \]

   8. Simplified 96.8%

      \[\leadsto \cos M \cdot e^{\color{blue}{-{M}^{2}}} \]

   if -1750 < M < 27

   1. Initial program 75.2%

      \[\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)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0 93.2%

      \[\leadsto \color{blue}{\cos \left(-M\right)} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   4. Step-by-step derivation

      1. cos-neg 93.2%

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   5. Simplified 93.2%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Taylor expanded in M around 0 93.1%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)}} \]
   7. Step-by-step derivation

      1. fabs-sub 93.1%

         \[\leadsto e^{\color{blue}{\left|n - m\right|} - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)} \]

      2. associate--r+ 93.1%

         \[\leadsto e^{\color{blue}{\left(\left|n - m\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}} \]

   8. Simplified 93.1%

      \[\leadsto \color{blue}{e^{\left(\left|n - m\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}} \]

   9. Taylor expanded in l around 0 78.7%

      \[\leadsto e^{\color{blue}{\left|n - m\right|} - 0.25 \cdot {\left(m + n\right)}^{2}} \]
   10. Step-by-step derivation

       1. rem-square-sqrt 44.6%

          \[\leadsto e^{\left|\color{blue}{\sqrt{n - m} \cdot \sqrt{n - m}}\right| - 0.25 \cdot {\left(m + n\right)}^{2}} \]

       2. fabs-sqr 44.6%

          \[\leadsto e^{\color{blue}{\sqrt{n - m} \cdot \sqrt{n - m}} - 0.25 \cdot {\left(m + n\right)}^{2}} \]

       3. rem-square-sqrt 78.6%

          \[\leadsto e^{\color{blue}{\left(n - m\right)} - 0.25 \cdot {\left(m + n\right)}^{2}} \]

   11. Simplified 78.6%

       \[\leadsto e^{\color{blue}{\left(n - m\right)} - 0.25 \cdot {\left(m + n\right)}^{2}} \]
   12. Step-by-step derivation

       1. unpow2 78.6%

          \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \color{blue}{\left(\left(m + n\right) \cdot \left(m + n\right)\right)}} \]

       2. +-commutative 78.6%

          \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \left(\color{blue}{\left(n + m\right)} \cdot \left(m + n\right)\right)} \]

       3. +-commutative 78.6%

          \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \left(\left(n + m\right) \cdot \color{blue}{\left(n + m\right)}\right)} \]

   13. Applied egg-rr 78.6%

       \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \color{blue}{\left(\left(n + m\right) \cdot \left(n + m\right)\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;M \leq -1750 \lor \neg \left(M \leq 27\right):\\ \;\;\;\;\cos M \cdot e^{-{M}^{2}}\\ \mathbf{else}:\\ \;\;\;\;e^{\left(n - m\right) - 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.4% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\ell \leq 750:\\ \;\;\;\;e^{\left(n - m\right) - 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;e^{-\ell}\\ \end{array} \end{array} \]

FPCore

(FPCore (K m n M l)
 :precision binary64
 (if (<= l 750.0) (exp (- (- n m) (* 0.25 (* (+ m n) (+ m n))))) (exp (- l))))

C

double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (l <= 750.0) {
		tmp = exp(((n - m) - (0.25 * ((m + n) * (m + n)))));
	} else {
		tmp = exp(-l);
	}
	return tmp;
}

Fortran

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 (l <= 750.0d0) then
        tmp = exp(((n - m) - (0.25d0 * ((m + n) * (m + n)))))
    else
        tmp = exp(-l)
    end if
    code = tmp
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	double tmp;
	if (l <= 750.0) {
		tmp = Math.exp(((n - m) - (0.25 * ((m + n) * (m + n)))));
	} else {
		tmp = Math.exp(-l);
	}
	return tmp;
}

Python

def code(K, m, n, M, l):
	tmp = 0
	if l <= 750.0:
		tmp = math.exp(((n - m) - (0.25 * ((m + n) * (m + n)))))
	else:
		tmp = math.exp(-l)
	return tmp

Julia

function code(K, m, n, M, l)
	tmp = 0.0
	if (l <= 750.0)
		tmp = exp(Float64(Float64(n - m) - Float64(0.25 * Float64(Float64(m + n) * Float64(m + n)))));
	else
		tmp = exp(Float64(-l));
	end
	return tmp
end

MATLAB

function tmp_2 = code(K, m, n, M, l)
	tmp = 0.0;
	if (l <= 750.0)
		tmp = exp(((n - m) - (0.25 * ((m + n) * (m + n)))));
	else
		tmp = exp(-l);
	end
	tmp_2 = tmp;
end

Wolfram

code[K_, m_, n_, M_, l_] := If[LessEqual[l, 750.0], N[Exp[N[(N[(n - m), $MachinePrecision] - N[(0.25 * N[(N[(m + n), $MachinePrecision] * N[(m + n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Exp[(-l)], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if l < 750

   1. Initial program 76.4%

      \[\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)} \]
   2. Add Preprocessing

   3. Taylor expanded in K around 0 95.5%

      \[\leadsto \color{blue}{\cos \left(-M\right)} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   4. Step-by-step derivation

      1. cos-neg 95.5%

         \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   5. Simplified 95.5%

      \[\leadsto \color{blue}{\cos M} \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Taylor expanded in M around 0 84.6%

      \[\leadsto \color{blue}{e^{\left|m - n\right| - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)}} \]
   7. Step-by-step derivation

      1. fabs-sub 84.6%

         \[\leadsto e^{\color{blue}{\left|n - m\right|} - \left(\ell + 0.25 \cdot {\left(m + n\right)}^{2}\right)} \]

      2. associate--r+ 84.6%

         \[\leadsto e^{\color{blue}{\left(\left|n - m\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}} \]

   8. Simplified 84.6%

      \[\leadsto \color{blue}{e^{\left(\left|n - m\right| - \ell\right) - 0.25 \cdot {\left(m + n\right)}^{2}}} \]

   9. Taylor expanded in l around 0 79.4%

      \[\leadsto e^{\color{blue}{\left|n - m\right|} - 0.25 \cdot {\left(m + n\right)}^{2}} \]
   10. Step-by-step derivation

       1. rem-square-sqrt 43.0%

          \[\leadsto e^{\left|\color{blue}{\sqrt{n - m} \cdot \sqrt{n - m}}\right| - 0.25 \cdot {\left(m + n\right)}^{2}} \]

       2. fabs-sqr 43.0%

          \[\leadsto e^{\color{blue}{\sqrt{n - m} \cdot \sqrt{n - m}} - 0.25 \cdot {\left(m + n\right)}^{2}} \]

       3. rem-square-sqrt 79.3%

          \[\leadsto e^{\color{blue}{\left(n - m\right)} - 0.25 \cdot {\left(m + n\right)}^{2}} \]

   11. Simplified 79.3%

       \[\leadsto e^{\color{blue}{\left(n - m\right)} - 0.25 \cdot {\left(m + n\right)}^{2}} \]
   12. Step-by-step derivation

       1. unpow2 79.3%

          \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \color{blue}{\left(\left(m + n\right) \cdot \left(m + n\right)\right)}} \]

       2. +-commutative 79.3%

          \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \left(\color{blue}{\left(n + m\right)} \cdot \left(m + n\right)\right)} \]

       3. +-commutative 79.3%

          \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \left(\left(n + m\right) \cdot \color{blue}{\left(n + m\right)}\right)} \]

   13. Applied egg-rr 79.3%

       \[\leadsto e^{\left(n - m\right) - 0.25 \cdot \color{blue}{\left(\left(n + m\right) \cdot \left(n + m\right)\right)}} \]

   if 750 < l

   1. Initial program 80.7%

      \[\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)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. clear-num 80.7%

         \[\leadsto \cos \left(\color{blue}{\frac{1}{\frac{2}{K \cdot \left(m + n\right)}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

      2. inv-pow 80.7%

         \[\leadsto \cos \left(\color{blue}{{\left(\frac{2}{K \cdot \left(m + n\right)}\right)}^{-1}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

      3. *-commutative 80.7%

         \[\leadsto \cos \left({\left(\frac{2}{\color{blue}{\left(m + n\right) \cdot K}}\right)}^{-1} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   4. Applied egg-rr 80.7%

      \[\leadsto \cos \left(\color{blue}{{\left(\frac{2}{\left(m + n\right) \cdot K}\right)}^{-1}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
   5. Step-by-step derivation

      1. unpow-1 80.7%

         \[\leadsto \cos \left(\color{blue}{\frac{1}{\frac{2}{\left(m + n\right) \cdot K}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

      2. associate-/r* 80.7%

         \[\leadsto \cos \left(\frac{1}{\color{blue}{\frac{\frac{2}{m + n}}{K}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   6. Simplified 80.7%

      \[\leadsto \cos \left(\color{blue}{\frac{1}{\frac{\frac{2}{m + n}}{K}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   7. Taylor expanded in l around inf 80.7%

      \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
   8. Step-by-step derivation

      1. mul-1-neg 80.7%

         \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   9. Simplified 80.7%

      \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-\ell}} \]

   10. Taylor expanded in K around 0 100.0%

       \[\leadsto \color{blue}{\cos \left(-M\right) \cdot e^{-\ell}} \]
   11. Step-by-step derivation

       1. cos-neg 100.0%

          \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

       2. *-commutative 100.0%

          \[\leadsto \color{blue}{e^{-\ell} \cdot \cos M} \]

   12. Simplified 100.0%

       \[\leadsto \color{blue}{e^{-\ell} \cdot \cos M} \]

   13. Taylor expanded in M around 0 100.0%

       \[\leadsto \color{blue}{e^{-\ell}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \leq 750:\\ \;\;\;\;e^{\left(n - m\right) - 0.25 \cdot \left(\left(m + n\right) \cdot \left(m + n\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;e^{-\ell}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 35.3% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ e^{-\ell} \end{array} \]

FPCore

(FPCore (K m n M l) :precision binary64 (exp (- l)))

C

double code(double K, double m, double n, double M, double l) {
	return exp(-l);
}

Fortran

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

Java

public static double code(double K, double m, double n, double M, double l) {
	return Math.exp(-l);
}

Python

def code(K, m, n, M, l):
	return math.exp(-l)

Julia

function code(K, m, n, M, l)
	return exp(Float64(-l))
end

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = exp(-l);
end

Wolfram

code[K_, m_, n_, M_, l_] := N[Exp[(-l)], $MachinePrecision]

Derivation

1. Initial program 77.4%

   \[\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)} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. clear-num 77.4%

      \[\leadsto \cos \left(\color{blue}{\frac{1}{\frac{2}{K \cdot \left(m + n\right)}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   2. inv-pow 77.4%

      \[\leadsto \cos \left(\color{blue}{{\left(\frac{2}{K \cdot \left(m + n\right)}\right)}^{-1}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   3. *-commutative 77.4%

      \[\leadsto \cos \left({\left(\frac{2}{\color{blue}{\left(m + n\right) \cdot K}}\right)}^{-1} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

4. Applied egg-rr 77.4%

   \[\leadsto \cos \left(\color{blue}{{\left(\frac{2}{\left(m + n\right) \cdot K}\right)}^{-1}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]
5. Step-by-step derivation

   1. unpow-1 77.4%

      \[\leadsto \cos \left(\color{blue}{\frac{1}{\frac{2}{\left(m + n\right) \cdot K}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

   2. associate-/r* 77.4%

      \[\leadsto \cos \left(\frac{1}{\color{blue}{\frac{\frac{2}{m + n}}{K}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

6. Simplified 77.4%

   \[\leadsto \cos \left(\color{blue}{\frac{1}{\frac{\frac{2}{m + n}}{K}}} - M\right) \cdot e^{\left(-{\left(\frac{m + n}{2} - M\right)}^{2}\right) - \left(\ell - \left|m - n\right|\right)} \]

7. Taylor expanded in l around inf 29.3%

   \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
8. Step-by-step derivation

   1. mul-1-neg 29.3%

      \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-\ell}} \]

9. Simplified 29.3%

   \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-\ell}} \]

10. Taylor expanded in K around 0 33.6%

    \[\leadsto \color{blue}{\cos \left(-M\right) \cdot e^{-\ell}} \]
11. Step-by-step derivation

    1. cos-neg 33.6%

       \[\leadsto \color{blue}{\cos M} \cdot e^{-\ell} \]

    2. *-commutative 33.6%

       \[\leadsto \color{blue}{e^{-\ell} \cdot \cos M} \]

12. Simplified 33.6%

    \[\leadsto \color{blue}{e^{-\ell} \cdot \cos M} \]

13. Taylor expanded in M around 0 32.8%

    \[\leadsto \color{blue}{e^{-\ell}} \]
14. Add Preprocessing

Alternative 6: 7.1% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ \cos M \end{array} \]

FPCore

(FPCore (K m n M l) :precision binary64 (cos M))

C

double code(double K, double m, double n, double M, double l) {
	return cos(M);
}

Fortran

real(8) function code(k, m, n, m_1, l)
    real(8), intent (in) :: k
    real(8), intent (in) :: m
    real(8), intent (in) :: n
    real(8), intent (in) :: m_1
    real(8), intent (in) :: l
    code = cos(m_1)
end function

Java

public static double code(double K, double m, double n, double M, double l) {
	return Math.cos(M);
}

Python

def code(K, m, n, M, l):
	return math.cos(M)

Julia

function code(K, m, n, M, l)
	return cos(M)
end

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = cos(M);
end

Wolfram

code[K_, m_, n_, M_, l_] := N[Cos[M], $MachinePrecision]

Derivation

1. Initial program 77.4%

   \[\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)} \]
2. Add Preprocessing

3. Taylor expanded in l around inf 29.3%

   \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
4. Step-by-step derivation

   1. mul-1-neg 29.3%

      \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-\ell}} \]

5. Simplified 29.3%

   \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

6. Taylor expanded in l around 0 6.2%

   \[\leadsto \color{blue}{\cos \left(0.5 \cdot \left(K \cdot \left(m + n\right)\right) - M\right)} \]
7. Step-by-step derivation

   1. *-commutative 6.2%

      \[\leadsto \cos \left(0.5 \cdot \color{blue}{\left(\left(m + n\right) \cdot K\right)} - M\right) \]

   2. associate-*r* 6.2%

      \[\leadsto \cos \left(\color{blue}{\left(0.5 \cdot \left(m + n\right)\right) \cdot K} - M\right) \]

   3. *-commutative 6.2%

      \[\leadsto \cos \left(\color{blue}{\left(\left(m + n\right) \cdot 0.5\right)} \cdot K - M\right) \]

   4. associate-*l* 6.2%

      \[\leadsto \cos \left(\color{blue}{\left(m + n\right) \cdot \left(0.5 \cdot K\right)} - M\right) \]

8. Simplified 6.2%

   \[\leadsto \color{blue}{\cos \left(\left(m + n\right) \cdot \left(0.5 \cdot K\right) - M\right)} \]

9. Taylor expanded in K around 0 6.4%

   \[\leadsto \color{blue}{\cos \left(-M\right)} \]
10. Step-by-step derivation

    1. cos-neg 6.4%

       \[\leadsto \color{blue}{\cos M} \]

11. Simplified 6.4%

    \[\leadsto \color{blue}{\cos M} \]
12. Add Preprocessing

Alternative 7: 7.1% accurate, 425.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (K m n M l) :precision binary64 1.0)

C

double code(double K, double m, double n, double M, double l) {
	return 1.0;
}

Fortran

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

Java

public static double code(double K, double m, double n, double M, double l) {
	return 1.0;
}

Python

def code(K, m, n, M, l):
	return 1.0

Julia

function code(K, m, n, M, l)
	return 1.0
end

MATLAB

function tmp = code(K, m, n, M, l)
	tmp = 1.0;
end

Wolfram

code[K_, m_, n_, M_, l_] := 1.0

Derivation

1. Initial program 77.4%

   \[\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)} \]
2. Add Preprocessing

3. Taylor expanded in l around inf 29.3%

   \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-1 \cdot \ell}} \]
4. Step-by-step derivation

   1. mul-1-neg 29.3%

      \[\leadsto \cos \left(\frac{1}{\frac{\frac{2}{m + n}}{K}} - M\right) \cdot e^{\color{blue}{-\ell}} \]

5. Simplified 29.3%

   \[\leadsto \cos \left(\frac{K \cdot \left(m + n\right)}{2} - M\right) \cdot e^{\color{blue}{-\ell}} \]

6. Taylor expanded in l around 0 6.2%

   \[\leadsto \color{blue}{\cos \left(0.5 \cdot \left(K \cdot \left(m + n\right)\right) - M\right)} \]
7. Step-by-step derivation

   1. *-commutative 6.2%

      \[\leadsto \cos \left(0.5 \cdot \color{blue}{\left(\left(m + n\right) \cdot K\right)} - M\right) \]

   2. associate-*r* 6.2%

      \[\leadsto \cos \left(\color{blue}{\left(0.5 \cdot \left(m + n\right)\right) \cdot K} - M\right) \]

   3. *-commutative 6.2%

      \[\leadsto \cos \left(\color{blue}{\left(\left(m + n\right) \cdot 0.5\right)} \cdot K - M\right) \]

   4. associate-*l* 6.2%

      \[\leadsto \cos \left(\color{blue}{\left(m + n\right) \cdot \left(0.5 \cdot K\right)} - M\right) \]

8. Simplified 6.2%

   \[\leadsto \color{blue}{\cos \left(\left(m + n\right) \cdot \left(0.5 \cdot K\right) - M\right)} \]

9. Taylor expanded in K around 0 6.4%

   \[\leadsto \color{blue}{\cos \left(-M\right)} \]
10. Step-by-step derivation

    1. cos-neg 6.4%

       \[\leadsto \color{blue}{\cos M} \]

11. Simplified 6.4%

    \[\leadsto \color{blue}{\cos M} \]

12. Taylor expanded in M around 0 6.4%

    \[\leadsto \color{blue}{1} \]
13. Add Preprocessing

Reproduce

herbie shell --seed 2024163 
(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)))))))