Maksimov and Kolovsky, Equation (3)

Percentage Accurate: 72.9% → 99.7%

Time: 15.2s

Alternatives: 10

Speedup: 1.9×

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: 72.9% 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.3× 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 := \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\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq 10^{+306}:\\ \;\;\;\;t\_1\\ \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 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J_m 2.0))) 2.0))))))
   (* J_s (if (<= t_1 (- INFINITY)) (- U_m) (if (<= t_1 1e+306) 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 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + pow((U_m / (t_0 * (J_m * 2.0))), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= 1e+306) {
		tmp = 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 = ((-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_1 <= -Double.POSITIVE_INFINITY) {
		tmp = -U_m;
	} else if (t_1 <= 1e+306) {
		tmp = 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 = ((-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_1 <= -math.inf:
		tmp = -U_m
	elif t_1 <= 1e+306:
		tmp = 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(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_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= 1e+306)
		tmp = 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 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + ((U_m / (t_0 * (J_m * 2.0))) ^ 2.0)));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = -U_m;
	elseif (t_1 <= 1e+306)
		tmp = 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[(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$1, (-Infinity)], (-U$95$m), If[LessEqual[t$95$1, 1e+306], t$95$1, U$95$m]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 5.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 60.8%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 55.8%

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

      1. neg-mul-1 55.8%

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

   7. Simplified 55.8%

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

   if -inf.0 < (*.f64 (*.f64 (*.f64 #s(literal -2 binary64) J) (cos.f64 (/.f64 K #s(literal 2 binary64)))) (sqrt.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 U (*.f64 (*.f64 #s(literal 2 binary64) J) (cos.f64 (/.f64 K #s(literal 2 binary64))))) #s(literal 2 binary64))))) < 1.00000000000000002e306

   1. Initial program 99.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}} \]
   2. Add Preprocessing

   if 1.00000000000000002e306 < (*.f64 (*.f64 (*.f64 #s(literal -2 binary64) J) (cos.f64 (/.f64 K #s(literal 2 binary64)))) (sqrt.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 U (*.f64 (*.f64 #s(literal 2 binary64) J) (cos.f64 (/.f64 K #s(literal 2 binary64))))) #s(literal 2 binary64)))))

   1. Initial program 8.5%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in U around -inf 51.8%

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

4. Final simplification 87.1%

   \[\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^{+306}:\\ \;\;\;\;\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}}\\ \mathbf{else}:\\ \;\;\;\;U\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 88.0% accurate, 1.3× 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)\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;J\_m \leq 2.8 \cdot 10^{-141}:\\ \;\;\;\;\frac{-2}{U\_m} \cdot {J\_m}^{2} - U\_m\\ \mathbf{else}:\\ \;\;\;\;J\_m \cdot \left(\left(-2 \cdot t\_0\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{2}}{J\_m \cdot t\_0}\right)\right)\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (*
    J_s
    (if (<= J_m 2.8e-141)
      (- (* (/ -2.0 U_m) (pow J_m 2.0)) U_m)
      (* J_m (* (* -2.0 t_0) (hypot 1.0 (/ (/ U_m 2.0) (* J_m t_0)))))))))

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 tmp;
	if (J_m <= 2.8e-141) {
		tmp = ((-2.0 / U_m) * pow(J_m, 2.0)) - U_m;
	} else {
		tmp = J_m * ((-2.0 * t_0) * hypot(1.0, ((U_m / 2.0) / (J_m * t_0))));
	}
	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 tmp;
	if (J_m <= 2.8e-141) {
		tmp = ((-2.0 / U_m) * Math.pow(J_m, 2.0)) - U_m;
	} else {
		tmp = J_m * ((-2.0 * t_0) * Math.hypot(1.0, ((U_m / 2.0) / (J_m * t_0))));
	}
	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))
	tmp = 0
	if J_m <= 2.8e-141:
		tmp = ((-2.0 / U_m) * math.pow(J_m, 2.0)) - U_m
	else:
		tmp = J_m * ((-2.0 * t_0) * math.hypot(1.0, ((U_m / 2.0) / (J_m * t_0))))
	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))
	tmp = 0.0
	if (J_m <= 2.8e-141)
		tmp = Float64(Float64(Float64(-2.0 / U_m) * (J_m ^ 2.0)) - U_m);
	else
		tmp = Float64(J_m * Float64(Float64(-2.0 * t_0) * hypot(1.0, Float64(Float64(U_m / 2.0) / Float64(J_m * t_0)))));
	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));
	tmp = 0.0;
	if (J_m <= 2.8e-141)
		tmp = ((-2.0 / U_m) * (J_m ^ 2.0)) - U_m;
	else
		tmp = J_m * ((-2.0 * t_0) * hypot(1.0, ((U_m / 2.0) / (J_m * t_0))));
	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]}, N[(J$95$s * If[LessEqual[J$95$m, 2.8e-141], N[(N[(N[(-2.0 / U$95$m), $MachinePrecision] * N[Power[J$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - U$95$m), $MachinePrecision], N[(J$95$m * N[(N[(-2.0 * t$95$0), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / N[(J$95$m * t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if J < 2.80000000000000012e-141

   1. Initial program 64.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 79.8%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 64.8%

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

      1. associate-*r/ 64.8%

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

      2. *-commutative 64.8%

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

      3. associate-/l* 64.6%

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

   7. Simplified 64.6%

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

   8. Taylor expanded in K around 0 28.1%

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

      1. metadata-eval 28.1%

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

      2. unpow2 28.1%

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

      3. unpow2 28.1%

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

      4. times-frac 41.0%

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

      5. swap-sqr 41.0%

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

      6. metadata-eval 41.0%

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

      7. hypot-undefine 51.3%

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

      8. associate-*r/ 51.3%

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

      9. *-commutative 51.3%

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

   10. Simplified 51.3%

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

   11. Taylor expanded in J around 0 29.9%

       \[\leadsto \color{blue}{-2 \cdot \frac{{J}^{2}}{U} + -1 \cdot U} \]
   12. Step-by-step derivation

       1. neg-mul-1 29.9%

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

       2. unsub-neg 29.9%

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

       3. /-rgt-identity 29.9%

          \[\leadsto \color{blue}{\frac{-2 \cdot \frac{{J}^{2}}{U}}{1}} - U \]

       4. associate-*r/ 29.9%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot {J}^{2}}{U}}}{1} - U \]

       5. associate-/r* 29.9%

          \[\leadsto \color{blue}{\frac{-2 \cdot {J}^{2}}{U \cdot 1}} - U \]

       6. times-frac 29.9%

          \[\leadsto \color{blue}{\frac{-2}{U} \cdot \frac{{J}^{2}}{1}} - U \]

       7. /-rgt-identity 29.9%

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

   13. Simplified 29.9%

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

   if 2.80000000000000012e-141 < J

   1. Initial program 89.3%

      \[\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.8%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 78.7% accurate, 1.9× 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 8.15 \cdot 10^{-135}:\\ \;\;\;\;\frac{-2}{U\_m} \cdot {J\_m}^{2} - U\_m\\ \mathbf{else}:\\ \;\;\;\;J\_m \cdot \left(\left(-2 \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \mathsf{hypot}\left(1, U\_m \cdot \frac{0.5}{J\_m}\right)\right)\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= J_m 8.15e-135)
    (- (* (/ -2.0 U_m) (pow J_m 2.0)) U_m)
    (* J_m (* (* -2.0 (cos (/ K 2.0))) (hypot 1.0 (* U_m (/ 0.5 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 <= 8.15e-135) {
		tmp = ((-2.0 / U_m) * pow(J_m, 2.0)) - U_m;
	} else {
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (U_m * (0.5 / J_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 (J_m <= 8.15e-135) {
		tmp = ((-2.0 / U_m) * Math.pow(J_m, 2.0)) - U_m;
	} else {
		tmp = J_m * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, (U_m * (0.5 / 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 <= 8.15e-135:
		tmp = ((-2.0 / U_m) * math.pow(J_m, 2.0)) - U_m
	else:
		tmp = J_m * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, (U_m * (0.5 / 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 <= 8.15e-135)
		tmp = Float64(Float64(Float64(-2.0 / U_m) * (J_m ^ 2.0)) - U_m);
	else
		tmp = Float64(J_m * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(U_m * Float64(0.5 / 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 <= 8.15e-135)
		tmp = ((-2.0 / U_m) * (J_m ^ 2.0)) - U_m;
	else
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (U_m * (0.5 / 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, 8.15e-135], N[(N[(N[(-2.0 / U$95$m), $MachinePrecision] * N[Power[J$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - U$95$m), $MachinePrecision], N[(J$95$m * N[(N[(-2.0 * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(U$95$m * N[(0.5 / J$95$m), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if J < 8.14999999999999993e-135

   1. Initial program 64.5%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 65.0%

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

      1. associate-*r/ 65.0%

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

      2. *-commutative 65.0%

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

      3. associate-/l* 64.8%

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

   7. Simplified 64.8%

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

   8. Taylor expanded in K around 0 28.0%

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

      1. metadata-eval 28.0%

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

      2. unpow2 28.0%

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

      3. unpow2 28.0%

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

      4. times-frac 40.8%

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

      5. swap-sqr 40.8%

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

      6. metadata-eval 40.8%

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

      7. hypot-undefine 51.6%

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

      8. associate-*r/ 51.6%

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

      9. *-commutative 51.6%

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

   10. Simplified 51.6%

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

   11. Taylor expanded in J around 0 29.7%

       \[\leadsto \color{blue}{-2 \cdot \frac{{J}^{2}}{U} + -1 \cdot U} \]
   12. Step-by-step derivation

       1. neg-mul-1 29.7%

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

       2. unsub-neg 29.7%

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

       3. /-rgt-identity 29.7%

          \[\leadsto \color{blue}{\frac{-2 \cdot \frac{{J}^{2}}{U}}{1}} - U \]

       4. associate-*r/ 29.7%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot {J}^{2}}{U}}}{1} - U \]

       5. associate-/r* 29.7%

          \[\leadsto \color{blue}{\frac{-2 \cdot {J}^{2}}{U \cdot 1}} - U \]

       6. times-frac 29.7%

          \[\leadsto \color{blue}{\frac{-2}{U} \cdot \frac{{J}^{2}}{1}} - U \]

       7. /-rgt-identity 29.7%

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

   13. Simplified 29.7%

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

   if 8.14999999999999993e-135 < J

   1. Initial program 90.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}} \]

   3. Simplified 98.8%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 84.7%

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

      1. associate-*r/ 84.7%

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

      2. *-commutative 84.7%

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

      3. associate-/l* 84.7%

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

   7. Simplified 84.7%

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

Alternative 4: 69.4% accurate, 1.9× 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)\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;J\_m \leq 3.35 \cdot 10^{-130}:\\ \;\;\;\;\frac{-2 \cdot {\left(J\_m \cdot t\_0\right)}^{2}}{U\_m} - U\_m\\ \mathbf{elif}\;J\_m \leq 2.3 \cdot 10^{+142}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \mathsf{hypot}\left(1, \frac{U\_m \cdot 0.5}{J\_m}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-2 \cdot J\_m\right) \cdot t\_0\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (* K 0.5))))
   (*
    J_s
    (if (<= J_m 3.35e-130)
      (- (/ (* -2.0 (pow (* J_m t_0) 2.0)) U_m) U_m)
      (if (<= J_m 2.3e+142)
        (* J_m (* -2.0 (hypot 1.0 (/ (* U_m 0.5) J_m))))
        (* (* -2.0 J_m) t_0))))))

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 tmp;
	if (J_m <= 3.35e-130) {
		tmp = ((-2.0 * pow((J_m * t_0), 2.0)) / U_m) - U_m;
	} else if (J_m <= 2.3e+142) {
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = (-2.0 * J_m) * t_0;
	}
	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 tmp;
	if (J_m <= 3.35e-130) {
		tmp = ((-2.0 * Math.pow((J_m * t_0), 2.0)) / U_m) - U_m;
	} else if (J_m <= 2.3e+142) {
		tmp = J_m * (-2.0 * Math.hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = (-2.0 * J_m) * t_0;
	}
	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))
	tmp = 0
	if J_m <= 3.35e-130:
		tmp = ((-2.0 * math.pow((J_m * t_0), 2.0)) / U_m) - U_m
	elif J_m <= 2.3e+142:
		tmp = J_m * (-2.0 * math.hypot(1.0, ((U_m * 0.5) / J_m)))
	else:
		tmp = (-2.0 * J_m) * t_0
	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))
	tmp = 0.0
	if (J_m <= 3.35e-130)
		tmp = Float64(Float64(Float64(-2.0 * (Float64(J_m * t_0) ^ 2.0)) / U_m) - U_m);
	elseif (J_m <= 2.3e+142)
		tmp = Float64(J_m * Float64(-2.0 * hypot(1.0, Float64(Float64(U_m * 0.5) / J_m))));
	else
		tmp = Float64(Float64(-2.0 * J_m) * t_0);
	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));
	tmp = 0.0;
	if (J_m <= 3.35e-130)
		tmp = ((-2.0 * ((J_m * t_0) ^ 2.0)) / U_m) - U_m;
	elseif (J_m <= 2.3e+142)
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m * 0.5) / J_m)));
	else
		tmp = (-2.0 * J_m) * t_0;
	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]}, N[(J$95$s * If[LessEqual[J$95$m, 3.35e-130], N[(N[(N[(-2.0 * N[Power[N[(J$95$m * t$95$0), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] / U$95$m), $MachinePrecision] - U$95$m), $MachinePrecision], If[LessEqual[J$95$m, 2.3e+142], N[(J$95$m * N[(-2.0 * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m * 0.5), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if J < 3.34999999999999993e-130

   1. Initial program 64.5%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 29.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. neg-mul-1 29.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 29.7%

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

      3. associate-*r/ 29.7%

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

      4. unpow2 29.7%

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

      5. *-commutative 29.7%

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

      6. unpow2 29.7%

         \[\leadsto \frac{-2 \cdot \left(\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)}\right)}{U} - U \]

      7. swap-sqr 29.7%

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

      8. unpow2 29.7%

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

      9. *-commutative 29.7%

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

   7. Simplified 29.7%

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

   if 3.34999999999999993e-130 < J < 2.30000000000000002e142

   1. Initial program 83.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.0%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 78.1%

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

      1. associate-*r/ 78.1%

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

      2. *-commutative 78.1%

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

      3. associate-/l* 78.1%

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

   7. Simplified 78.1%

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

   8. Taylor expanded in K around 0 57.2%

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

      1. metadata-eval 57.2%

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

      2. unpow2 57.2%

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

      3. unpow2 57.2%

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

      4. times-frac 58.9%

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

      5. swap-sqr 58.9%

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

      6. metadata-eval 58.9%

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

      7. hypot-undefine 71.8%

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

      8. associate-*r/ 71.8%

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

      9. *-commutative 71.8%

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

   10. Simplified 71.8%

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

   if 2.30000000000000002e142 < J

   1. Initial program 99.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 99.9%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 86.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* 86.6%

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

      2. *-commutative 86.6%

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

      3. *-commutative 86.6%

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

      4. *-commutative 86.6%

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

      5. *-commutative 86.6%

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

      6. *-commutative 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 47.8%

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

Alternative 5: 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}\;J\_m \leq 3.7 \cdot 10^{-130}:\\ \;\;\;\;\frac{-2}{U\_m} \cdot {J\_m}^{2} - U\_m\\ \mathbf{elif}\;J\_m \leq 2.35 \cdot 10^{+142}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \mathsf{hypot}\left(1, \frac{U\_m \cdot 0.5}{J\_m}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-2 \cdot J\_m\right) \cdot \cos \left(K \cdot 0.5\right)\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= J_m 3.7e-130)
    (- (* (/ -2.0 U_m) (pow J_m 2.0)) U_m)
    (if (<= J_m 2.35e+142)
      (* J_m (* -2.0 (hypot 1.0 (/ (* U_m 0.5) J_m))))
      (* (* -2.0 J_m) (cos (* K 0.5)))))))

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 <= 3.7e-130) {
		tmp = ((-2.0 / U_m) * pow(J_m, 2.0)) - U_m;
	} else if (J_m <= 2.35e+142) {
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	}
	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 (J_m <= 3.7e-130) {
		tmp = ((-2.0 / U_m) * Math.pow(J_m, 2.0)) - U_m;
	} else if (J_m <= 2.35e+142) {
		tmp = J_m * (-2.0 * Math.hypot(1.0, ((U_m * 0.5) / J_m)));
	} else {
		tmp = (-2.0 * J_m) * Math.cos((K * 0.5));
	}
	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 <= 3.7e-130:
		tmp = ((-2.0 / U_m) * math.pow(J_m, 2.0)) - U_m
	elif J_m <= 2.35e+142:
		tmp = J_m * (-2.0 * math.hypot(1.0, ((U_m * 0.5) / J_m)))
	else:
		tmp = (-2.0 * J_m) * math.cos((K * 0.5))
	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 <= 3.7e-130)
		tmp = Float64(Float64(Float64(-2.0 / U_m) * (J_m ^ 2.0)) - U_m);
	elseif (J_m <= 2.35e+142)
		tmp = Float64(J_m * Float64(-2.0 * hypot(1.0, Float64(Float64(U_m * 0.5) / J_m))));
	else
		tmp = Float64(Float64(-2.0 * J_m) * cos(Float64(K * 0.5)));
	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 <= 3.7e-130)
		tmp = ((-2.0 / U_m) * (J_m ^ 2.0)) - U_m;
	elseif (J_m <= 2.35e+142)
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m * 0.5) / J_m)));
	else
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	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, 3.7e-130], N[(N[(N[(-2.0 / U$95$m), $MachinePrecision] * N[Power[J$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - U$95$m), $MachinePrecision], If[LessEqual[J$95$m, 2.35e+142], N[(J$95$m * N[(-2.0 * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m * 0.5), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 * J$95$m), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if J < 3.7000000000000004e-130

   1. Initial program 64.5%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 65.0%

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

      1. associate-*r/ 65.0%

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

      2. *-commutative 65.0%

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

      3. associate-/l* 64.8%

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

   7. Simplified 64.8%

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

   8. Taylor expanded in K around 0 28.0%

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

      1. metadata-eval 28.0%

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

      2. unpow2 28.0%

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

      3. unpow2 28.0%

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

      4. times-frac 40.8%

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

      5. swap-sqr 40.8%

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

      6. metadata-eval 40.8%

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

      7. hypot-undefine 51.6%

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

      8. associate-*r/ 51.6%

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

      9. *-commutative 51.6%

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

   10. Simplified 51.6%

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

   11. Taylor expanded in J around 0 29.7%

       \[\leadsto \color{blue}{-2 \cdot \frac{{J}^{2}}{U} + -1 \cdot U} \]
   12. Step-by-step derivation

       1. neg-mul-1 29.7%

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

       2. unsub-neg 29.7%

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

       3. /-rgt-identity 29.7%

          \[\leadsto \color{blue}{\frac{-2 \cdot \frac{{J}^{2}}{U}}{1}} - U \]

       4. associate-*r/ 29.7%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot {J}^{2}}{U}}}{1} - U \]

       5. associate-/r* 29.7%

          \[\leadsto \color{blue}{\frac{-2 \cdot {J}^{2}}{U \cdot 1}} - U \]

       6. times-frac 29.7%

          \[\leadsto \color{blue}{\frac{-2}{U} \cdot \frac{{J}^{2}}{1}} - U \]

       7. /-rgt-identity 29.7%

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

   13. Simplified 29.7%

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

   if 3.7000000000000004e-130 < J < 2.35e142

   1. Initial program 83.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.0%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 78.1%

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

      1. associate-*r/ 78.1%

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

      2. *-commutative 78.1%

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

      3. associate-/l* 78.1%

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

   7. Simplified 78.1%

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

   8. Taylor expanded in K around 0 57.2%

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

      1. metadata-eval 57.2%

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

      2. unpow2 57.2%

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

      3. unpow2 57.2%

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

      4. times-frac 58.9%

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

      5. swap-sqr 58.9%

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

      6. metadata-eval 58.9%

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

      7. hypot-undefine 71.8%

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

      8. associate-*r/ 71.8%

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

      9. *-commutative 71.8%

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

   10. Simplified 71.8%

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

   if 2.35e142 < J

   1. Initial program 99.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 99.9%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 86.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* 86.6%

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

      2. *-commutative 86.6%

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

      3. *-commutative 86.6%

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

      4. *-commutative 86.6%

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

      5. *-commutative 86.6%

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

      6. *-commutative 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 47.8%

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

Alternative 6: 65.4% accurate, 3.6× 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 8.8 \cdot 10^{+26}:\\ \;\;\;\;\left(-2 \cdot J\_m\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U\_m \leq 8.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{-2}{U\_m} \cdot {J\_m}^{2} - U\_m\\ \mathbf{elif}\;U\_m \leq 4.1 \cdot 10^{+186}:\\ \;\;\;\;U\_m\\ \mathbf{else}:\\ \;\;\;\;-U\_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= U_m 8.8e+26)
    (* (* -2.0 J_m) (cos (* K 0.5)))
    (if (<= U_m 8.8e+153)
      (- (* (/ -2.0 U_m) (pow J_m 2.0)) U_m)
      (if (<= U_m 4.1e+186) U_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 <= 8.8e+26) {
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	} else if (U_m <= 8.8e+153) {
		tmp = ((-2.0 / U_m) * pow(J_m, 2.0)) - U_m;
	} else if (U_m <= 4.1e+186) {
		tmp = U_m;
	} 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 <= 8.8d+26) then
        tmp = ((-2.0d0) * j_m) * cos((k * 0.5d0))
    else if (u_m <= 8.8d+153) then
        tmp = (((-2.0d0) / u_m) * (j_m ** 2.0d0)) - u_m
    else if (u_m <= 4.1d+186) then
        tmp = u_m
    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 <= 8.8e+26) {
		tmp = (-2.0 * J_m) * Math.cos((K * 0.5));
	} else if (U_m <= 8.8e+153) {
		tmp = ((-2.0 / U_m) * Math.pow(J_m, 2.0)) - U_m;
	} else if (U_m <= 4.1e+186) {
		tmp = U_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 <= 8.8e+26:
		tmp = (-2.0 * J_m) * math.cos((K * 0.5))
	elif U_m <= 8.8e+153:
		tmp = ((-2.0 / U_m) * math.pow(J_m, 2.0)) - U_m
	elif U_m <= 4.1e+186:
		tmp = U_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 <= 8.8e+26)
		tmp = Float64(Float64(-2.0 * J_m) * cos(Float64(K * 0.5)));
	elseif (U_m <= 8.8e+153)
		tmp = Float64(Float64(Float64(-2.0 / U_m) * (J_m ^ 2.0)) - U_m);
	elseif (U_m <= 4.1e+186)
		tmp = U_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 <= 8.8e+26)
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	elseif (U_m <= 8.8e+153)
		tmp = ((-2.0 / U_m) * (J_m ^ 2.0)) - U_m;
	elseif (U_m <= 4.1e+186)
		tmp = U_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, 8.8e+26], N[(N[(-2.0 * J$95$m), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[U$95$m, 8.8e+153], N[(N[(N[(-2.0 / U$95$m), $MachinePrecision] * N[Power[J$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - U$95$m), $MachinePrecision], If[LessEqual[U$95$m, 4.1e+186], U$95$m, (-U$95$m)]]]), $MachinePrecision]

Derivation

1. Split input into 4 regimes

2. if U < 8.80000000000000028e26

   1. Initial program 82.7%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 57.8%

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

      1. associate-*r* 57.8%

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

      2. *-commutative 57.8%

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

      3. *-commutative 57.8%

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

      4. *-commutative 57.8%

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

      5. *-commutative 57.8%

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

      6. *-commutative 57.8%

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

   7. Simplified 57.8%

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

   if 8.80000000000000028e26 < U < 8.7999999999999998e153

   1. Initial program 67.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 85.9%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in K around 0 65.8%

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

      1. associate-*r/ 65.8%

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

      2. *-commutative 65.8%

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

      3. associate-/l* 65.5%

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

   7. Simplified 65.5%

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

   8. Taylor expanded in K around 0 58.2%

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

      1. metadata-eval 58.2%

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

      2. unpow2 58.2%

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

      3. unpow2 58.2%

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

      4. times-frac 58.3%

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

      5. swap-sqr 58.3%

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

      6. metadata-eval 58.3%

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

      7. hypot-undefine 72.0%

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

      8. associate-*r/ 72.0%

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

      9. *-commutative 72.0%

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

   10. Simplified 72.0%

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

   11. Taylor expanded in J around 0 34.5%

       \[\leadsto \color{blue}{-2 \cdot \frac{{J}^{2}}{U} + -1 \cdot U} \]
   12. Step-by-step derivation

       1. neg-mul-1 34.5%

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

       2. unsub-neg 34.5%

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

       3. /-rgt-identity 34.5%

          \[\leadsto \color{blue}{\frac{-2 \cdot \frac{{J}^{2}}{U}}{1}} - U \]

       4. associate-*r/ 34.5%

          \[\leadsto \frac{\color{blue}{\frac{-2 \cdot {J}^{2}}{U}}}{1} - U \]

       5. associate-/r* 34.5%

          \[\leadsto \color{blue}{\frac{-2 \cdot {J}^{2}}{U \cdot 1}} - U \]

       6. times-frac 34.5%

          \[\leadsto \color{blue}{\frac{-2}{U} \cdot \frac{{J}^{2}}{1}} - U \]

       7. /-rgt-identity 34.5%

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

   13. Simplified 34.5%

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

   if 8.7999999999999998e153 < U < 4.1e186

   1. Initial program 22.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}} \]

   3. Simplified 56.7%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in U around -inf 46.7%

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

   if 4.1e186 < U

   1. Initial program 35.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 53.4%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 48.7%

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

      1. neg-mul-1 48.7%

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

   7. Simplified 48.7%

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

4. Final simplification 54.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;U \leq 8.8 \cdot 10^{+26}:\\ \;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U \leq 8.8 \cdot 10^{+153}:\\ \;\;\;\;\frac{-2}{U} \cdot {J}^{2} - U\\ \mathbf{elif}\;U \leq 4.1 \cdot 10^{+186}:\\ \;\;\;\;U\\ \mathbf{else}:\\ \;\;\;\;-U\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 65.3% 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 7.5 \cdot 10^{+26}:\\ \;\;\;\;\left(-2 \cdot J\_m\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U\_m \leq 8.8 \cdot 10^{+153} \lor \neg \left(U\_m \leq 4.1 \cdot 10^{+186}\right):\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= U_m 7.5e+26)
    (* (* -2.0 J_m) (cos (* K 0.5)))
    (if (or (<= U_m 8.8e+153) (not (<= U_m 4.1e+186))) (- U_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 <= 7.5e+26) {
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	} else if ((U_m <= 8.8e+153) || !(U_m <= 4.1e+186)) {
		tmp = -U_m;
	} 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 <= 7.5d+26) then
        tmp = ((-2.0d0) * j_m) * cos((k * 0.5d0))
    else if ((u_m <= 8.8d+153) .or. (.not. (u_m <= 4.1d+186))) then
        tmp = -u_m
    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 <= 7.5e+26) {
		tmp = (-2.0 * J_m) * Math.cos((K * 0.5));
	} else if ((U_m <= 8.8e+153) || !(U_m <= 4.1e+186)) {
		tmp = -U_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 <= 7.5e+26:
		tmp = (-2.0 * J_m) * math.cos((K * 0.5))
	elif (U_m <= 8.8e+153) or not (U_m <= 4.1e+186):
		tmp = -U_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 <= 7.5e+26)
		tmp = Float64(Float64(-2.0 * J_m) * cos(Float64(K * 0.5)));
	elseif ((U_m <= 8.8e+153) || !(U_m <= 4.1e+186))
		tmp = Float64(-U_m);
	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)
	tmp = 0.0;
	if (U_m <= 7.5e+26)
		tmp = (-2.0 * J_m) * cos((K * 0.5));
	elseif ((U_m <= 8.8e+153) || ~((U_m <= 4.1e+186)))
		tmp = -U_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, 7.5e+26], N[(N[(-2.0 * J$95$m), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[U$95$m, 8.8e+153], N[Not[LessEqual[U$95$m, 4.1e+186]], $MachinePrecision]], (-U$95$m), U$95$m]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if U < 7.49999999999999941e26

   1. Initial program 82.7%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 57.8%

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

      1. associate-*r* 57.8%

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

      2. *-commutative 57.8%

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

      3. *-commutative 57.8%

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

      4. *-commutative 57.8%

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

      5. *-commutative 57.8%

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

      6. *-commutative 57.8%

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

   7. Simplified 57.8%

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

   if 7.49999999999999941e26 < U < 8.7999999999999998e153 or 4.1e186 < U

   1. Initial program 50.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 67.9%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 42.4%

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

      1. neg-mul-1 42.4%

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

   7. Simplified 42.4%

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

   if 8.7999999999999998e153 < U < 4.1e186

   1. Initial program 22.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}} \]

   3. Simplified 56.7%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in U around -inf 46.7%

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

4. Final simplification 54.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;U \leq 7.5 \cdot 10^{+26}:\\ \;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\ \mathbf{elif}\;U \leq 8.8 \cdot 10^{+153} \lor \neg \left(U \leq 4.1 \cdot 10^{+186}\right):\\ \;\;\;\;-U\\ \mathbf{else}:\\ \;\;\;\;U\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 39.0% accurate, 15.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}\;K \leq 280000000 \lor \neg \left(K \leq 1.9 \cdot 10^{+163}\right) \land \left(K \leq 1.02 \cdot 10^{+180} \lor \neg \left(K \leq 3 \cdot 10^{+219}\right) \land K \leq 5.7 \cdot 10^{+256}\right):\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (or (<= K 280000000.0)
          (and (not (<= K 1.9e+163))
               (or (<= K 1.02e+180)
                   (and (not (<= K 3e+219)) (<= K 5.7e+256)))))
    (- U_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 ((K <= 280000000.0) || (!(K <= 1.9e+163) && ((K <= 1.02e+180) || (!(K <= 3e+219) && (K <= 5.7e+256))))) {
		tmp = -U_m;
	} 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 ((k <= 280000000.0d0) .or. (.not. (k <= 1.9d+163)) .and. (k <= 1.02d+180) .or. (.not. (k <= 3d+219)) .and. (k <= 5.7d+256)) then
        tmp = -u_m
    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 ((K <= 280000000.0) || (!(K <= 1.9e+163) && ((K <= 1.02e+180) || (!(K <= 3e+219) && (K <= 5.7e+256))))) {
		tmp = -U_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 (K <= 280000000.0) or (not (K <= 1.9e+163) and ((K <= 1.02e+180) or (not (K <= 3e+219) and (K <= 5.7e+256)))):
		tmp = -U_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 ((K <= 280000000.0) || (!(K <= 1.9e+163) && ((K <= 1.02e+180) || (!(K <= 3e+219) && (K <= 5.7e+256)))))
		tmp = Float64(-U_m);
	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)
	tmp = 0.0;
	if ((K <= 280000000.0) || (~((K <= 1.9e+163)) && ((K <= 1.02e+180) || (~((K <= 3e+219)) && (K <= 5.7e+256)))))
		tmp = -U_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[Or[LessEqual[K, 280000000.0], And[N[Not[LessEqual[K, 1.9e+163]], $MachinePrecision], Or[LessEqual[K, 1.02e+180], And[N[Not[LessEqual[K, 3e+219]], $MachinePrecision], LessEqual[K, 5.7e+256]]]]], (-U$95$m), U$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if K < 2.8e8 or 1.90000000000000004e163 < K < 1.02e180 or 2.9999999999999997e219 < K < 5.6999999999999997e256

   1. Initial program 74.3%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 26.2%

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

      1. neg-mul-1 26.2%

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

   7. Simplified 26.2%

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

   if 2.8e8 < K < 1.90000000000000004e163 or 1.02e180 < K < 2.9999999999999997e219 or 5.6999999999999997e256 < K

   1. Initial program 73.5%

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

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in U around -inf 29.2%

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

4. Final simplification 26.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;K \leq 280000000 \lor \neg \left(K \leq 1.9 \cdot 10^{+163}\right) \land \left(K \leq 1.02 \cdot 10^{+180} \lor \neg \left(K \leq 3 \cdot 10^{+219}\right) \land K \leq 5.7 \cdot 10^{+256}\right):\\ \;\;\;\;-U\\ \mathbf{else}:\\ \;\;\;\;U\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 48.5% accurate, 24.6× 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.1 \cdot 10^{-41}:\\ \;\;\;\;-2 \cdot J\_m\\ \mathbf{elif}\;U\_m \leq 8.8 \cdot 10^{+153} \lor \neg \left(U\_m \leq 4.1 \cdot 10^{+186}\right):\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= U_m 2.1e-41)
    (* -2.0 J_m)
    (if (or (<= U_m 8.8e+153) (not (<= U_m 4.1e+186))) (- U_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.1e-41) {
		tmp = -2.0 * J_m;
	} else if ((U_m <= 8.8e+153) || !(U_m <= 4.1e+186)) {
		tmp = -U_m;
	} 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.1d-41) then
        tmp = (-2.0d0) * j_m
    else if ((u_m <= 8.8d+153) .or. (.not. (u_m <= 4.1d+186))) then
        tmp = -u_m
    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.1e-41) {
		tmp = -2.0 * J_m;
	} else if ((U_m <= 8.8e+153) || !(U_m <= 4.1e+186)) {
		tmp = -U_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.1e-41:
		tmp = -2.0 * J_m
	elif (U_m <= 8.8e+153) or not (U_m <= 4.1e+186):
		tmp = -U_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.1e-41)
		tmp = Float64(-2.0 * J_m);
	elseif ((U_m <= 8.8e+153) || !(U_m <= 4.1e+186))
		tmp = Float64(-U_m);
	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)
	tmp = 0.0;
	if (U_m <= 2.1e-41)
		tmp = -2.0 * J_m;
	elseif ((U_m <= 8.8e+153) || ~((U_m <= 4.1e+186)))
		tmp = -U_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.1e-41], N[(-2.0 * J$95$m), $MachinePrecision], If[Or[LessEqual[U$95$m, 8.8e+153], N[Not[LessEqual[U$95$m, 4.1e+186]], $MachinePrecision]], (-U$95$m), U$95$m]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if U < 2.10000000000000013e-41

   1. Initial program 82.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 92.6%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around inf 58.2%

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

      1. associate-*r* 58.2%

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

      2. *-commutative 58.2%

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

      3. *-commutative 58.2%

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

      4. *-commutative 58.2%

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

      5. *-commutative 58.2%

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

      6. *-commutative 58.2%

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

   7. Simplified 58.2%

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

   8. Taylor expanded in K around 0 35.7%

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

   if 2.10000000000000013e-41 < U < 8.7999999999999998e153 or 4.1e186 < U

   1. Initial program 58.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}} \]

   3. Simplified 76.0%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in J around 0 40.9%

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

      1. neg-mul-1 40.9%

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

   7. Simplified 40.9%

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

   if 8.7999999999999998e153 < U < 4.1e186

   1. Initial program 22.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}} \]

   3. Simplified 56.7%

      \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
   4. Add Preprocessing

   5. Taylor expanded in U around -inf 46.7%

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

4. Final simplification 37.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;U \leq 2.1 \cdot 10^{-41}:\\ \;\;\;\;-2 \cdot J\\ \mathbf{elif}\;U \leq 8.8 \cdot 10^{+153} \lor \neg \left(U \leq 4.1 \cdot 10^{+186}\right):\\ \;\;\;\;-U\\ \mathbf{else}:\\ \;\;\;\;U\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 13.8% 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 #s(literal 1 binary64) 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 74.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 87.0%

   \[\leadsto \color{blue}{J \cdot \left(\left(-2 \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)} \]
4. Add Preprocessing

5. Taylor expanded in U around -inf 29.8%

   \[\leadsto \color{blue}{U} \]
6. Add Preprocessing

Reproduce

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