Maksimov and Kolovsky, Equation (3)

Percentage Accurate: 73.6% → 99.7%

Time: 16.5s

Alternatives: 7

Speedup: 0.4×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \left(\left(-2 \cdot J\right) \cdot t_0\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot t_0}\right)}^{2}} \end{array} \end{array} \]

FPCore

(FPCore (J K U)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (* (* (* -2.0 J) t_0) (sqrt (+ 1.0 (pow (/ U (* (* 2.0 J) t_0)) 2.0))))))

C

double code(double J, double K, double U) {
	double t_0 = cos((K / 2.0));
	return ((-2.0 * J) * t_0) * sqrt((1.0 + pow((U / ((2.0 * J) * t_0)), 2.0)));
}

Fortran

real(8) function code(j, k, u)
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    real(8) :: t_0
    t_0 = cos((k / 2.0d0))
    code = (((-2.0d0) * j) * t_0) * sqrt((1.0d0 + ((u / ((2.0d0 * j) * t_0)) ** 2.0d0)))
end function

Java

public static double code(double J, double K, double U) {
	double t_0 = Math.cos((K / 2.0));
	return ((-2.0 * J) * t_0) * Math.sqrt((1.0 + Math.pow((U / ((2.0 * J) * t_0)), 2.0)));
}

Python

def code(J, K, U):
	t_0 = math.cos((K / 2.0))
	return ((-2.0 * J) * t_0) * math.sqrt((1.0 + math.pow((U / ((2.0 * J) * t_0)), 2.0)))

Julia

function code(J, K, U)
	t_0 = cos(Float64(K / 2.0))
	return Float64(Float64(Float64(-2.0 * J) * t_0) * sqrt(Float64(1.0 + (Float64(U / Float64(Float64(2.0 * J) * t_0)) ^ 2.0))))
end

MATLAB

function tmp = code(J, K, U)
	t_0 = cos((K / 2.0));
	tmp = ((-2.0 * J) * t_0) * sqrt((1.0 + ((U / ((2.0 * J) * t_0)) ^ 2.0)));
end

Wolfram

code[J_, K_, U_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, N[(N[(N[(-2.0 * J), $MachinePrecision] * t$95$0), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U / N[(N[(2.0 * J), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Initial Program: 73.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ \left(\left(-2 \cdot J\right) \cdot t_0\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot t_0}\right)}^{2}} \end{array} \end{array} \]

FPCore

(FPCore (J K U)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (* (* (* -2.0 J) t_0) (sqrt (+ 1.0 (pow (/ U (* (* 2.0 J) t_0)) 2.0))))))

C

double code(double J, double K, double U) {
	double t_0 = cos((K / 2.0));
	return ((-2.0 * J) * t_0) * sqrt((1.0 + pow((U / ((2.0 * J) * t_0)), 2.0)));
}

Fortran

real(8) function code(j, k, u)
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8), intent (in) :: u
    real(8) :: t_0
    t_0 = cos((k / 2.0d0))
    code = (((-2.0d0) * j) * t_0) * sqrt((1.0d0 + ((u / ((2.0d0 * j) * t_0)) ** 2.0d0)))
end function

Java

public static double code(double J, double K, double U) {
	double t_0 = Math.cos((K / 2.0));
	return ((-2.0 * J) * t_0) * Math.sqrt((1.0 + Math.pow((U / ((2.0 * J) * t_0)), 2.0)));
}

Python

def code(J, K, U):
	t_0 = math.cos((K / 2.0))
	return ((-2.0 * J) * t_0) * math.sqrt((1.0 + math.pow((U / ((2.0 * J) * t_0)), 2.0)))

Julia

function code(J, K, U)
	t_0 = cos(Float64(K / 2.0))
	return Float64(Float64(Float64(-2.0 * J) * t_0) * sqrt(Float64(1.0 + (Float64(U / Float64(Float64(2.0 * J) * t_0)) ^ 2.0))))
end

MATLAB

function tmp = code(J, K, U)
	t_0 = cos((K / 2.0));
	tmp = ((-2.0 * J) * t_0) * sqrt((1.0 + ((U / ((2.0 * J) * t_0)) ^ 2.0)));
end

Wolfram

code[J_, K_, U_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, N[(N[(N[(-2.0 * J), $MachinePrecision] * t$95$0), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U / N[(N[(2.0 * J), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Alternative 1: 99.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ t_1 := J_m \cdot t_0\\ t_2 := \left(\left(-2 \cdot J_m\right) \cdot t_0\right) \cdot \sqrt{1 + {\left(\frac{U_m}{t_0 \cdot \left(J_m \cdot 2\right)}\right)}^{2}}\\ J_s \cdot \begin{array}{l} \mathbf{if}\;t_2 \leq -\infty:\\ \;\;\;\;-U_m\\ \mathbf{elif}\;t_2 \leq 10^{+304}:\\ \;\;\;\;-2 \cdot \left(t_1 \cdot \mathsf{hypot}\left(1, \frac{\frac{U_m}{2}}{t_1}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;U_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1 (* J_m t_0))
        (t_2
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J_m 2.0))) 2.0))))))
   (*
    J_s
    (if (<= t_2 (- INFINITY))
      (- U_m)
      (if (<= t_2 1e+304)
        (* -2.0 (* t_1 (hypot 1.0 (/ (/ U_m 2.0) t_1))))
        U_m)))))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double t_0 = cos((K / 2.0));
	double t_1 = J_m * t_0;
	double t_2 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + pow((U_m / (t_0 * (J_m * 2.0))), 2.0)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_2 <= 1e+304) {
		tmp = -2.0 * (t_1 * hypot(1.0, ((U_m / 2.0) / t_1)));
	} else {
		tmp = U_m;
	}
	return J_s * tmp;
}

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	double t_0 = Math.cos((K / 2.0));
	double t_1 = J_m * t_0;
	double t_2 = ((-2.0 * J_m) * t_0) * Math.sqrt((1.0 + Math.pow((U_m / (t_0 * (J_m * 2.0))), 2.0)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = -U_m;
	} else if (t_2 <= 1e+304) {
		tmp = -2.0 * (t_1 * Math.hypot(1.0, ((U_m / 2.0) / t_1)));
	} else {
		tmp = U_m;
	}
	return J_s * tmp;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	t_0 = math.cos((K / 2.0))
	t_1 = J_m * t_0
	t_2 = ((-2.0 * J_m) * t_0) * math.sqrt((1.0 + math.pow((U_m / (t_0 * (J_m * 2.0))), 2.0)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = -U_m
	elif t_2 <= 1e+304:
		tmp = -2.0 * (t_1 * math.hypot(1.0, ((U_m / 2.0) / t_1)))
	else:
		tmp = U_m
	return J_s * tmp

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	t_0 = cos(Float64(K / 2.0))
	t_1 = Float64(J_m * t_0)
	t_2 = Float64(Float64(Float64(-2.0 * J_m) * t_0) * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_0 * Float64(J_m * 2.0))) ^ 2.0))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_2 <= 1e+304)
		tmp = Float64(-2.0 * Float64(t_1 * hypot(1.0, Float64(Float64(U_m / 2.0) / t_1))));
	else
		tmp = U_m;
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	t_0 = cos((K / 2.0));
	t_1 = J_m * t_0;
	t_2 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + ((U_m / (t_0 * (J_m * 2.0))) ^ 2.0)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = -U_m;
	elseif (t_2 <= 1e+304)
		tmp = -2.0 * (t_1 * hypot(1.0, ((U_m / 2.0) / t_1)));
	else
		tmp = U_m;
	end
	tmp_2 = J_s * tmp;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(J$95$m * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(t$95$0 * N[(J$95$m * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$2, (-Infinity)], (-U$95$m), If[LessEqual[t$95$2, 1e+304], N[(-2.0 * N[(t$95$1 * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / t$95$1), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], U$95$m]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 (*.f64 -2 J) (cos.f64 (/.f64 K 2))) (sqrt.f64 (+.f64 1 (pow.f64 (/.f64 U (*.f64 (*.f64 2 J) (cos.f64 (/.f64 K 2)))) 2)))) < -inf.0

   1. Initial program 5.6%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 5.6%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 40.4%

      \[\leadsto \color{blue}{-1 \cdot U} \]
   6. Step-by-step derivation

      1. mul-1-neg 40.4%

         \[\leadsto \color{blue}{-U} \]

   7. Simplified 40.4%

      \[\leadsto \color{blue}{-U} \]

   if -inf.0 < (*.f64 (*.f64 (*.f64 -2 J) (cos.f64 (/.f64 K 2))) (sqrt.f64 (+.f64 1 (pow.f64 (/.f64 U (*.f64 (*.f64 2 J) (cos.f64 (/.f64 K 2)))) 2)))) < 9.9999999999999994e303

   1. Initial program 99.8%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]
   2. Step-by-step derivation

      1. associate-*l* 99.8%

         \[\leadsto \color{blue}{\left(-2 \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

      2. associate-*l* 99.8%

         \[\leadsto \color{blue}{-2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]

      3. unpow2 99.8%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)} \cdot \frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}}}\right) \]

      4. sqr-neg 99.8%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right) \cdot \left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}}\right) \]

      5. distribute-frac-neg 99.8%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}} \cdot \left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}\right) \]

      6. distribute-frac-neg 99.8%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)} \cdot \color{blue}{\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}}}\right) \]

      7. unpow2 99.8%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{{\left(\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}}}\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{-2 \cdot \left(\mathsf{hypot}\left(1, \frac{\frac{U}{2}}{J \cdot \cos \left(\frac{K}{2}\right)}\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} \]
   4. Add Preprocessing

   if 9.9999999999999994e303 < (*.f64 (*.f64 (*.f64 -2 J) (cos.f64 (/.f64 K 2))) (sqrt.f64 (+.f64 1 (pow.f64 (/.f64 U (*.f64 (*.f64 2 J) (cos.f64 (/.f64 K 2)))) 2))))

   1. Initial program 7.8%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 7.8%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in U around -inf 57.1%

      \[\leadsto \color{blue}{U} \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\cos \left(\frac{K}{2}\right) \cdot \left(J \cdot 2\right)}\right)}^{2}} \leq -\infty:\\ \;\;\;\;-U\\ \mathbf{elif}\;\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\cos \left(\frac{K}{2}\right) \cdot \left(J \cdot 2\right)}\right)}^{2}} \leq 10^{+304}:\\ \;\;\;\;-2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{U}{2}}{J \cdot \cos \left(\frac{K}{2}\right)}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;U\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 69.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ \begin{array}{l} t_0 := \cos \left(K \cdot 0.5\right)\\ t_1 := J_m \cdot t_0\\ J_s \cdot \begin{array}{l} \mathbf{if}\;U_m \leq 2.4 \cdot 10^{-37}:\\ \;\;\;\;\left(-2 \cdot J_m\right) \cdot t_0\\ \mathbf{elif}\;U_m \leq 8.2 \cdot 10^{+79}:\\ \;\;\;\;-2 \cdot \left(J_m \cdot \mathsf{hypot}\left(1, \frac{U_m \cdot 0.5}{J_m}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_1 \cdot \left(\frac{-2}{U_m} \cdot t_1\right) - U_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (* K 0.5))) (t_1 (* J_m t_0)))
   (*
    J_s
    (if (<= U_m 2.4e-37)
      (* (* -2.0 J_m) t_0)
      (if (<= U_m 8.2e+79)
        (* -2.0 (* J_m (hypot 1.0 (/ (* U_m 0.5) J_m))))
        (- (* t_1 (* (/ -2.0 U_m) t_1)) U_m))))))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double t_0 = cos((K * 0.5));
	double t_1 = J_m * t_0;
	double tmp;
	if (U_m <= 2.4e-37) {
		tmp = (-2.0 * J_m) * t_0;
	} else if (U_m <= 8.2e+79) {
		tmp = -2.0 * (J_m * hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = (t_1 * ((-2.0 / U_m) * t_1)) - U_m;
	}
	return J_s * tmp;
}

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	double t_0 = Math.cos((K * 0.5));
	double t_1 = J_m * t_0;
	double tmp;
	if (U_m <= 2.4e-37) {
		tmp = (-2.0 * J_m) * t_0;
	} else if (U_m <= 8.2e+79) {
		tmp = -2.0 * (J_m * Math.hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = (t_1 * ((-2.0 / U_m) * t_1)) - U_m;
	}
	return J_s * tmp;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	t_0 = math.cos((K * 0.5))
	t_1 = J_m * t_0
	tmp = 0
	if U_m <= 2.4e-37:
		tmp = (-2.0 * J_m) * t_0
	elif U_m <= 8.2e+79:
		tmp = -2.0 * (J_m * math.hypot(1.0, ((U_m * 0.5) / J_m)))
	else:
		tmp = (t_1 * ((-2.0 / U_m) * t_1)) - U_m
	return J_s * tmp

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	t_0 = cos(Float64(K * 0.5))
	t_1 = Float64(J_m * t_0)
	tmp = 0.0
	if (U_m <= 2.4e-37)
		tmp = Float64(Float64(-2.0 * J_m) * t_0);
	elseif (U_m <= 8.2e+79)
		tmp = Float64(-2.0 * Float64(J_m * hypot(1.0, Float64(Float64(U_m * 0.5) / J_m))));
	else
		tmp = Float64(Float64(t_1 * Float64(Float64(-2.0 / U_m) * t_1)) - U_m);
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	t_0 = cos((K * 0.5));
	t_1 = J_m * t_0;
	tmp = 0.0;
	if (U_m <= 2.4e-37)
		tmp = (-2.0 * J_m) * t_0;
	elseif (U_m <= 8.2e+79)
		tmp = -2.0 * (J_m * hypot(1.0, ((U_m * 0.5) / J_m)));
	else
		tmp = (t_1 * ((-2.0 / U_m) * t_1)) - U_m;
	end
	tmp_2 = J_s * tmp;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := Block[{t$95$0 = N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(J$95$m * t$95$0), $MachinePrecision]}, N[(J$95$s * If[LessEqual[U$95$m, 2.4e-37], N[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[U$95$m, 8.2e+79], N[(-2.0 * N[(J$95$m * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m * 0.5), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[(N[(-2.0 / U$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] - U$95$m), $MachinePrecision]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if U < 2.39999999999999991e-37

   1. Initial program 81.8%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 81.8%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 62.6%

      \[\leadsto \color{blue}{-2 \cdot \left(J \cdot \cos \left(0.5 \cdot K\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 62.6%

         \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   7. Simplified 62.6%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   if 2.39999999999999991e-37 < U < 8.2e79

   1. Initial program 74.2%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]
   2. Step-by-step derivation

      1. associate-*l* 74.2%

         \[\leadsto \color{blue}{\left(-2 \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

      2. associate-*l* 74.2%

         \[\leadsto \color{blue}{-2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]

      3. unpow2 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)} \cdot \frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}}}\right) \]

      4. sqr-neg 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right) \cdot \left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}}\right) \]

      5. distribute-frac-neg 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}} \cdot \left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}\right) \]

      6. distribute-frac-neg 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)} \cdot \color{blue}{\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}}}\right) \]

      7. unpow2 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{{\left(\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}}}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{-2 \cdot \left(\mathsf{hypot}\left(1, \frac{\frac{U}{2}}{J \cdot \cos \left(\frac{K}{2}\right)}\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 60.8%

      \[\leadsto -2 \cdot \color{blue}{\left(J \cdot \sqrt{1 + 0.25 \cdot \frac{{U}^{2}}{{J}^{2}}}\right)} \]
   6. Step-by-step derivation

      1. metadata-eval 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{\left(0.5 \cdot 0.5\right)} \cdot \frac{{U}^{2}}{{J}^{2}}}\right) \]

      2. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \frac{{U}^{2}}{\color{blue}{J \cdot J}}}\right) \]

      3. associate-/r* 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \color{blue}{\frac{\frac{{U}^{2}}{J}}{J}}}\right) \]

      4. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \frac{\frac{\color{blue}{U \cdot U}}{J}}{J}}\right) \]

      5. associate-*r/ 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \frac{\color{blue}{U \cdot \frac{U}{J}}}{J}}\right) \]

      6. associate-*l/ 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \color{blue}{\left(\frac{U}{J} \cdot \frac{U}{J}\right)}}\right) \]

      7. swap-sqr 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{\left(0.5 \cdot \frac{U}{J}\right) \cdot \left(0.5 \cdot \frac{U}{J}\right)}}\right) \]

      8. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{{\left(0.5 \cdot \frac{U}{J}\right)}^{2}}}\right) \]

   7. Simplified 60.8%

      \[\leadsto -2 \cdot \color{blue}{\left(J \cdot \sqrt{1 + {\left(0.5 \cdot \frac{U}{J}\right)}^{2}}\right)} \]
   8. Step-by-step derivation

      1. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{\left(0.5 \cdot \frac{U}{J}\right) \cdot \left(0.5 \cdot \frac{U}{J}\right)}}\right) \]

      2. hypot-1-def 80.1%

         \[\leadsto -2 \cdot \left(J \cdot \color{blue}{\mathsf{hypot}\left(1, 0.5 \cdot \frac{U}{J}\right)}\right) \]

      3. *-commutative 80.1%

         \[\leadsto -2 \cdot \left(J \cdot \mathsf{hypot}\left(1, \color{blue}{\frac{U}{J} \cdot 0.5}\right)\right) \]

      4. associate-*l/ 80.1%

         \[\leadsto -2 \cdot \left(J \cdot \mathsf{hypot}\left(1, \color{blue}{\frac{U \cdot 0.5}{J}}\right)\right) \]

   9. Applied egg-rr 80.1%

      \[\leadsto -2 \cdot \left(J \cdot \color{blue}{\mathsf{hypot}\left(1, \frac{U \cdot 0.5}{J}\right)}\right) \]

   if 8.2e79 < U

   1. Initial program 39.6%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 39.7%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 32.7%

      \[\leadsto \color{blue}{-2 \cdot \frac{{J}^{2} \cdot {\cos \left(0.5 \cdot K\right)}^{2}}{U} + -1 \cdot U} \]
   6. Step-by-step derivation

      1. mul-1-neg 32.7%

         \[\leadsto -2 \cdot \frac{{J}^{2} \cdot {\cos \left(0.5 \cdot K\right)}^{2}}{U} + \color{blue}{\left(-U\right)} \]

      2. unsub-neg 32.7%

         \[\leadsto \color{blue}{-2 \cdot \frac{{J}^{2} \cdot {\cos \left(0.5 \cdot K\right)}^{2}}{U} - U} \]

      3. associate-*r/ 32.7%

         \[\leadsto \color{blue}{\frac{-2 \cdot \left({J}^{2} \cdot {\cos \left(0.5 \cdot K\right)}^{2}\right)}{U}} - U \]

      4. associate-/l* 32.7%

         \[\leadsto \color{blue}{\frac{-2}{\frac{U}{{J}^{2} \cdot {\cos \left(0.5 \cdot K\right)}^{2}}}} - U \]

      5. *-commutative 32.7%

         \[\leadsto \frac{-2}{\frac{U}{{J}^{2} \cdot {\cos \color{blue}{\left(K \cdot 0.5\right)}}^{2}}} - U \]

      6. unpow2 32.7%

         \[\leadsto \frac{-2}{\frac{U}{\color{blue}{\left(J \cdot J\right)} \cdot {\cos \left(K \cdot 0.5\right)}^{2}}} - U \]

      7. unpow2 32.7%

         \[\leadsto \frac{-2}{\frac{U}{\left(J \cdot J\right) \cdot \color{blue}{\left(\cos \left(K \cdot 0.5\right) \cdot \cos \left(K \cdot 0.5\right)\right)}}} - U \]

      8. swap-sqr 32.7%

         \[\leadsto \frac{-2}{\frac{U}{\color{blue}{\left(J \cdot \cos \left(K \cdot 0.5\right)\right) \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)}}} - U \]

      9. unpow2 32.7%

         \[\leadsto \frac{-2}{\frac{U}{\color{blue}{{\left(J \cdot \cos \left(K \cdot 0.5\right)\right)}^{2}}}} - U \]

      10. *-commutative 32.7%

          \[\leadsto \frac{-2}{\frac{U}{{\left(J \cdot \cos \color{blue}{\left(0.5 \cdot K\right)}\right)}^{2}}} - U \]

   7. Simplified 32.7%

      \[\leadsto \color{blue}{\frac{-2}{\frac{U}{{\left(J \cdot \cos \left(0.5 \cdot K\right)\right)}^{2}}} - U} \]
   8. Step-by-step derivation

      1. associate-/r/ 32.7%

         \[\leadsto \color{blue}{\frac{-2}{U} \cdot {\left(J \cdot \cos \left(0.5 \cdot K\right)\right)}^{2}} - U \]

      2. *-commutative 32.7%

         \[\leadsto \frac{-2}{U} \cdot {\left(J \cdot \cos \color{blue}{\left(K \cdot 0.5\right)}\right)}^{2} - U \]

      3. metadata-eval 32.7%

         \[\leadsto \frac{-2}{U} \cdot {\left(J \cdot \cos \left(K \cdot \color{blue}{\frac{1}{2}}\right)\right)}^{2} - U \]

      4. div-inv 32.7%

         \[\leadsto \frac{-2}{U} \cdot {\left(J \cdot \cos \color{blue}{\left(\frac{K}{2}\right)}\right)}^{2} - U \]

      5. pow2 32.7%

         \[\leadsto \frac{-2}{U} \cdot \color{blue}{\left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} - U \]

      6. associate-*r* 36.7%

         \[\leadsto \color{blue}{\left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)} - U \]

      7. div-inv 36.7%

         \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \color{blue}{\left(K \cdot \frac{1}{2}\right)}\right)\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right) - U \]

      8. metadata-eval 36.7%

         \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot \color{blue}{0.5}\right)\right)\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right) - U \]

      9. *-commutative 36.7%

         \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \color{blue}{\left(0.5 \cdot K\right)}\right)\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right) - U \]

      10. *-commutative 36.7%

          \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \color{blue}{\left(K \cdot 0.5\right)}\right)\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right) - U \]

      11. div-inv 36.7%

          \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)\right) \cdot \left(J \cdot \cos \color{blue}{\left(K \cdot \frac{1}{2}\right)}\right) - U \]

      12. metadata-eval 36.7%

          \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)\right) \cdot \left(J \cdot \cos \left(K \cdot \color{blue}{0.5}\right)\right) - U \]

      13. *-commutative 36.7%

          \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)\right) \cdot \left(J \cdot \cos \color{blue}{\left(0.5 \cdot K\right)}\right) - U \]

      14. *-commutative 36.7%

          \[\leadsto \left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)\right) \cdot \left(J \cdot \cos \color{blue}{\left(K \cdot 0.5\right)}\right) - U \]

   9. Applied egg-rr 36.7%

      \[\leadsto \color{blue}{\left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)\right) \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)} - U \]
3. Recombined 3 regimes into one program.

4. Final simplification 58.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;U \leq 2.4 \cdot 10^{-37}:\\ \;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U \leq 8.2 \cdot 10^{+79}:\\ \;\;\;\;-2 \cdot \left(J \cdot \mathsf{hypot}\left(1, \frac{U \cdot 0.5}{J}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(J \cdot \cos \left(K \cdot 0.5\right)\right) \cdot \left(\frac{-2}{U} \cdot \left(J \cdot \cos \left(K \cdot 0.5\right)\right)\right) - U\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 69.4% accurate, 3.5× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ J_s \cdot \begin{array}{l} \mathbf{if}\;U_m \leq 2.25 \cdot 10^{-37}:\\ \;\;\;\;\left(-2 \cdot J_m\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U_m \leq 2.75 \cdot 10^{+78}:\\ \;\;\;\;-2 \cdot \left(J_m \cdot \mathsf{hypot}\left(1, \frac{U_m \cdot 0.5}{J_m}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-U_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= U_m 2.25e-37)
    (* (* -2.0 J_m) (cos (* K 0.5)))
    (if (<= U_m 2.75e+78)
      (* -2.0 (* J_m (hypot 1.0 (/ (* U_m 0.5) J_m))))
      (- U_m)))))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (U_m <= 2.25e-37) {
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	} else if (U_m <= 2.75e+78) {
		tmp = -2.0 * (J_m * hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = -U_m;
	}
	return J_s * tmp;
}

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (U_m <= 2.25e-37) {
		tmp = (-2.0 * J_m) * Math.cos((K * 0.5));
	} else if (U_m <= 2.75e+78) {
		tmp = -2.0 * (J_m * Math.hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = -U_m;
	}
	return J_s * tmp;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	tmp = 0
	if U_m <= 2.25e-37:
		tmp = (-2.0 * J_m) * math.cos((K * 0.5))
	elif U_m <= 2.75e+78:
		tmp = -2.0 * (J_m * math.hypot(1.0, ((U_m * 0.5) / J_m)))
	else:
		tmp = -U_m
	return J_s * tmp

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	tmp = 0.0
	if (U_m <= 2.25e-37)
		tmp = Float64(Float64(-2.0 * J_m) * cos(Float64(K * 0.5)));
	elseif (U_m <= 2.75e+78)
		tmp = Float64(-2.0 * Float64(J_m * hypot(1.0, Float64(Float64(U_m * 0.5) / J_m))));
	else
		tmp = Float64(-U_m);
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	tmp = 0.0;
	if (U_m <= 2.25e-37)
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	elseif (U_m <= 2.75e+78)
		tmp = -2.0 * (J_m * hypot(1.0, ((U_m * 0.5) / J_m)));
	else
		tmp = -U_m;
	end
	tmp_2 = J_s * tmp;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := N[(J$95$s * If[LessEqual[U$95$m, 2.25e-37], N[(N[(-2.0 * J$95$m), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[U$95$m, 2.75e+78], N[(-2.0 * N[(J$95$m * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m * 0.5), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-U$95$m)]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if U < 2.2500000000000002e-37

   1. Initial program 81.8%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 81.8%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 62.6%

      \[\leadsto \color{blue}{-2 \cdot \left(J \cdot \cos \left(0.5 \cdot K\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 62.6%

         \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   7. Simplified 62.6%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   if 2.2500000000000002e-37 < U < 2.7499999999999999e78

   1. Initial program 74.2%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]
   2. Step-by-step derivation

      1. associate-*l* 74.2%

         \[\leadsto \color{blue}{\left(-2 \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

      2. associate-*l* 74.2%

         \[\leadsto \color{blue}{-2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]

      3. unpow2 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)} \cdot \frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}}}\right) \]

      4. sqr-neg 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right) \cdot \left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}}\right) \]

      5. distribute-frac-neg 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}} \cdot \left(-\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}\right) \]

      6. distribute-frac-neg 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)} \cdot \color{blue}{\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}}}\right) \]

      7. unpow2 74.2%

         \[\leadsto -2 \cdot \left(\left(J \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + \color{blue}{{\left(\frac{-U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}}}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{-2 \cdot \left(\mathsf{hypot}\left(1, \frac{\frac{U}{2}}{J \cdot \cos \left(\frac{K}{2}\right)}\right) \cdot \left(J \cdot \cos \left(\frac{K}{2}\right)\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 60.8%

      \[\leadsto -2 \cdot \color{blue}{\left(J \cdot \sqrt{1 + 0.25 \cdot \frac{{U}^{2}}{{J}^{2}}}\right)} \]
   6. Step-by-step derivation

      1. metadata-eval 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{\left(0.5 \cdot 0.5\right)} \cdot \frac{{U}^{2}}{{J}^{2}}}\right) \]

      2. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \frac{{U}^{2}}{\color{blue}{J \cdot J}}}\right) \]

      3. associate-/r* 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \color{blue}{\frac{\frac{{U}^{2}}{J}}{J}}}\right) \]

      4. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \frac{\frac{\color{blue}{U \cdot U}}{J}}{J}}\right) \]

      5. associate-*r/ 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \frac{\color{blue}{U \cdot \frac{U}{J}}}{J}}\right) \]

      6. associate-*l/ 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \left(0.5 \cdot 0.5\right) \cdot \color{blue}{\left(\frac{U}{J} \cdot \frac{U}{J}\right)}}\right) \]

      7. swap-sqr 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{\left(0.5 \cdot \frac{U}{J}\right) \cdot \left(0.5 \cdot \frac{U}{J}\right)}}\right) \]

      8. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{{\left(0.5 \cdot \frac{U}{J}\right)}^{2}}}\right) \]

   7. Simplified 60.8%

      \[\leadsto -2 \cdot \color{blue}{\left(J \cdot \sqrt{1 + {\left(0.5 \cdot \frac{U}{J}\right)}^{2}}\right)} \]
   8. Step-by-step derivation

      1. unpow2 60.8%

         \[\leadsto -2 \cdot \left(J \cdot \sqrt{1 + \color{blue}{\left(0.5 \cdot \frac{U}{J}\right) \cdot \left(0.5 \cdot \frac{U}{J}\right)}}\right) \]

      2. hypot-1-def 80.1%

         \[\leadsto -2 \cdot \left(J \cdot \color{blue}{\mathsf{hypot}\left(1, 0.5 \cdot \frac{U}{J}\right)}\right) \]

      3. *-commutative 80.1%

         \[\leadsto -2 \cdot \left(J \cdot \mathsf{hypot}\left(1, \color{blue}{\frac{U}{J} \cdot 0.5}\right)\right) \]

      4. associate-*l/ 80.1%

         \[\leadsto -2 \cdot \left(J \cdot \mathsf{hypot}\left(1, \color{blue}{\frac{U \cdot 0.5}{J}}\right)\right) \]

   9. Applied egg-rr 80.1%

      \[\leadsto -2 \cdot \left(J \cdot \color{blue}{\mathsf{hypot}\left(1, \frac{U \cdot 0.5}{J}\right)}\right) \]

   if 2.7499999999999999e78 < U

   1. Initial program 39.6%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 39.7%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 36.6%

      \[\leadsto \color{blue}{-1 \cdot U} \]
   6. Step-by-step derivation

      1. mul-1-neg 36.6%

         \[\leadsto \color{blue}{-U} \]

   7. Simplified 36.6%

      \[\leadsto \color{blue}{-U} \]
3. Recombined 3 regimes into one program.

4. Final simplification 58.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;U \leq 2.25 \cdot 10^{-37}:\\ \;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U \leq 2.75 \cdot 10^{+78}:\\ \;\;\;\;-2 \cdot \left(J \cdot \mathsf{hypot}\left(1, \frac{U \cdot 0.5}{J}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-U\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.2% accurate, 3.7× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ J_s \cdot \begin{array}{l} \mathbf{if}\;U_m \leq 2.2 \cdot 10^{+49}:\\ \;\;\;\;\left(-2 \cdot J_m\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;-U_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (* J_s (if (<= U_m 2.2e+49) (* (* -2.0 J_m) (cos (* K 0.5))) (- U_m))))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (U_m <= 2.2e+49) {
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	} else {
		tmp = -U_m;
	}
	return J_s * tmp;
}

Fortran

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0d0, J)
real(8) function code(j_s, j_m, k, u_m)
    real(8), intent (in) :: j_s
    real(8), intent (in) :: j_m
    real(8), intent (in) :: k
    real(8), intent (in) :: u_m
    real(8) :: tmp
    if (u_m <= 2.2d+49) then
        tmp = ((-2.0d0) * j_m) * cos((k * 0.5d0))
    else
        tmp = -u_m
    end if
    code = j_s * tmp
end function

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (U_m <= 2.2e+49) {
		tmp = (-2.0 * J_m) * Math.cos((K * 0.5));
	} else {
		tmp = -U_m;
	}
	return J_s * tmp;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	tmp = 0
	if U_m <= 2.2e+49:
		tmp = (-2.0 * J_m) * math.cos((K * 0.5))
	else:
		tmp = -U_m
	return J_s * tmp

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	tmp = 0.0
	if (U_m <= 2.2e+49)
		tmp = Float64(Float64(-2.0 * J_m) * cos(Float64(K * 0.5)));
	else
		tmp = Float64(-U_m);
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	tmp = 0.0;
	if (U_m <= 2.2e+49)
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	else
		tmp = -U_m;
	end
	tmp_2 = J_s * tmp;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := N[(J$95$s * If[LessEqual[U$95$m, 2.2e+49], N[(N[(-2.0 * J$95$m), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-U$95$m)]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if U < 2.2000000000000001e49

   1. Initial program 81.6%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 81.6%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 62.3%

      \[\leadsto \color{blue}{-2 \cdot \left(J \cdot \cos \left(0.5 \cdot K\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 62.3%

         \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   7. Simplified 62.3%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   if 2.2000000000000001e49 < U

   1. Initial program 38.9%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 38.9%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 37.9%

      \[\leadsto \color{blue}{-1 \cdot U} \]
   6. Step-by-step derivation

      1. mul-1-neg 37.9%

         \[\leadsto \color{blue}{-U} \]

   7. Simplified 37.9%

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

4. Final simplification 57.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;U \leq 2.2 \cdot 10^{+49}:\\ \;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;-U\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 48.0% accurate, 52.4× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ J_s \cdot \begin{array}{l} \mathbf{if}\;J_m \leq 7.8 \cdot 10^{-44}:\\ \;\;\;\;-U_m\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot J_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (* J_s (if (<= J_m 7.8e-44) (- U_m) (* -2.0 J_m))))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (J_m <= 7.8e-44) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * J_m;
	}
	return J_s * tmp;
}

Fortran

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0d0, J)
real(8) function code(j_s, j_m, k, u_m)
    real(8), intent (in) :: j_s
    real(8), intent (in) :: j_m
    real(8), intent (in) :: k
    real(8), intent (in) :: u_m
    real(8) :: tmp
    if (j_m <= 7.8d-44) then
        tmp = -u_m
    else
        tmp = (-2.0d0) * j_m
    end if
    code = j_s * tmp
end function

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (J_m <= 7.8e-44) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * J_m;
	}
	return J_s * tmp;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	tmp = 0
	if J_m <= 7.8e-44:
		tmp = -U_m
	else:
		tmp = -2.0 * J_m
	return J_s * tmp

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	tmp = 0.0
	if (J_m <= 7.8e-44)
		tmp = Float64(-U_m);
	else
		tmp = Float64(-2.0 * J_m);
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	tmp = 0.0;
	if (J_m <= 7.8e-44)
		tmp = -U_m;
	else
		tmp = -2.0 * J_m;
	end
	tmp_2 = J_s * tmp;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := N[(J$95$s * If[LessEqual[J$95$m, 7.8e-44], (-U$95$m), N[(-2.0 * J$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if J < 7.8000000000000004e-44

   1. Initial program 63.1%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 63.1%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 28.3%

      \[\leadsto \color{blue}{-1 \cdot U} \]
   6. Step-by-step derivation

      1. mul-1-neg 28.3%

         \[\leadsto \color{blue}{-U} \]

   7. Simplified 28.3%

      \[\leadsto \color{blue}{-U} \]

   if 7.8000000000000004e-44 < J

   1. Initial program 98.6%

      \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

   3. Simplified 98.6%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 81.5%

      \[\leadsto \color{blue}{-2 \cdot \left(J \cdot \cos \left(0.5 \cdot K\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 81.5%

         \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   7. Simplified 81.5%

      \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \cos \left(0.5 \cdot K\right)} \]

   8. Taylor expanded in K around 0 43.4%

      \[\leadsto \color{blue}{-2 \cdot J} \]
   9. Step-by-step derivation

      1. *-commutative 43.4%

         \[\leadsto \color{blue}{J \cdot -2} \]

   10. Simplified 43.4%

       \[\leadsto \color{blue}{J \cdot -2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 32.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;J \leq 7.8 \cdot 10^{-44}:\\ \;\;\;\;-U\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot J\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 39.3% accurate, 210.0× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ J_s \cdot \left(-U_m\right) \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m) :precision binary64 (* J_s (- U_m)))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	return J_s * -U_m;
}

Fortran

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0d0, J)
real(8) function code(j_s, j_m, k, u_m)
    real(8), intent (in) :: j_s
    real(8), intent (in) :: j_m
    real(8), intent (in) :: k
    real(8), intent (in) :: u_m
    code = j_s * -u_m
end function

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	return J_s * -U_m;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	return J_s * -U_m

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	return Float64(J_s * Float64(-U_m))
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp = code(J_s, J_m, K, U_m)
	tmp = J_s * -U_m;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := N[(J$95$s * (-U$95$m)), $MachinePrecision]

Derivation

1. Initial program 73.6%

   \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

3. Simplified 73.6%

   \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
4. Add Preprocessing

5. Taylor expanded in J around 0 22.8%

   \[\leadsto \color{blue}{-1 \cdot U} \]
6. Step-by-step derivation

   1. mul-1-neg 22.8%

      \[\leadsto \color{blue}{-U} \]

7. Simplified 22.8%

   \[\leadsto \color{blue}{-U} \]

8. Final simplification 22.8%

   \[\leadsto -U \]
9. Add Preprocessing

Alternative 7: 14.2% accurate, 420.0× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ J_s \cdot U_m \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m) :precision binary64 (* J_s U_m))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	return J_s * U_m;
}

Fortran

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0d0, J)
real(8) function code(j_s, j_m, k, u_m)
    real(8), intent (in) :: j_s
    real(8), intent (in) :: j_m
    real(8), intent (in) :: k
    real(8), intent (in) :: u_m
    code = j_s * u_m
end function

Java

U_m = Math.abs(U);
J_m = Math.abs(J);
J_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	return J_s * U_m;
}

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	return J_s * U_m

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	return Float64(J_s * U_m)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp = code(J_s, J_m, K, U_m)
	tmp = J_s * U_m;
end

Wolfram

U_m = N[Abs[U], $MachinePrecision]
J_m = N[Abs[J], $MachinePrecision]
J_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[J]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[J$95$s_, J$95$m_, K_, U$95$m_] := N[(J$95$s * U$95$m), $MachinePrecision]

Derivation

1. Initial program 73.6%

   \[\left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\left(2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)}\right)}^{2}} \]

3. Simplified 73.6%

   \[\leadsto \color{blue}{\left(-2 \cdot J\right) \cdot \left(\cos \left(\frac{K}{2}\right) \cdot \sqrt{1 + {\left(\frac{\frac{U}{J \cdot 2}}{\cos \left(\frac{K}{2}\right)}\right)}^{2}}\right)} \]
4. Add Preprocessing

5. Taylor expanded in U around -inf 29.3%

   \[\leadsto \color{blue}{U} \]

6. Final simplification 29.3%

   \[\leadsto U \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024026 
(FPCore (J K U)
  :name "Maksimov and Kolovsky, Equation (3)"
  :precision binary64
  (* (* (* -2.0 J) (cos (/ K 2.0))) (sqrt (+ 1.0 (pow (/ U (* (* 2.0 J) (cos (/ K 2.0)))) 2.0)))))