Maksimov and Kolovsky, Equation (3)

Percentage Accurate: 73.3% → 99.8%

Time: 12.2s

Alternatives: 9

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: 73.3% 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.8% 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(t\_0 \cdot \left(-2 \cdot J\_m\right)\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 5 \cdot 10^{+307}:\\ \;\;\;\;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
         (*
          (* t_0 (* -2.0 J_m))
          (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 5e+307) 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 = (t_0 * (-2.0 * J_m)) * 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 <= 5e+307) {
		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 = (t_0 * (-2.0 * J_m)) * 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 <= 5e+307) {
		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 = (t_0 * (-2.0 * J_m)) * 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 <= 5e+307:
		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(t_0 * Float64(-2.0 * J_m)) * 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 <= 5e+307)
		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 = (t_0 * (-2.0 * J_m)) * 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 <= 5e+307)
		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[(t$95$0 * N[(-2.0 * J$95$m), $MachinePrecision]), $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, 5e+307], 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 6.0%

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

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

      1. neg-mul-1 56.3%

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

   7. Simplified 56.3%

      \[\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))))) < 5e307

   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. Add Preprocessing

   if 5e307 < (*.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.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 57.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 U around -inf 40.8%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\cos \left(\frac{K}{2}\right) \cdot \left(-2 \cdot J\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(\cos \left(\frac{K}{2}\right) \cdot \left(-2 \cdot J\right)\right) \cdot \sqrt{1 + {\left(\frac{U}{\cos \left(\frac{K}{2}\right) \cdot \left(J \cdot 2\right)}\right)}^{2}} \leq 5 \cdot 10^{+307}:\\ \;\;\;\;\left(\cos \left(\frac{K}{2}\right) \cdot \left(-2 \cdot J\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: 89.5% 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^{-213}:\\ \;\;\;\;-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-213)
      (- 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-213) {
		tmp = -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-213) {
		tmp = -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-213:
		tmp = -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-213)
		tmp = Float64(-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-213)
		tmp = -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-213], (-U$95$m), 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.8e-213

   1. Initial program 62.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 79.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 0 36.6%

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

      1. neg-mul-1 36.6%

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

   7. Simplified 36.6%

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

   if 2.8e-213 < J

   1. Initial program 79.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 93.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
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 78.2% 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 1.6 \cdot 10^{-169}:\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;J\_m \cdot \left(\left(-2 \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{2}}{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 1.6e-169)
    (- U_m)
    (* J_m (* (* -2.0 (cos (/ K 2.0))) (hypot 1.0 (/ (/ 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 <= 1.6e-169) {
		tmp = -U_m;
	} else {
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, ((U_m / 2.0) / 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 <= 1.6e-169) {
		tmp = -U_m;
	} else {
		tmp = J_m * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, ((U_m / 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 <= 1.6e-169:
		tmp = -U_m
	else:
		tmp = J_m * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, ((U_m / 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 <= 1.6e-169)
		tmp = Float64(-U_m);
	else
		tmp = Float64(J_m * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(Float64(U_m / 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 <= 1.6e-169)
		tmp = -U_m;
	else
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, ((U_m / 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, 1.6e-169], (-U$95$m), N[(J$95$m * N[(N[(-2.0 * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if J < 1.59999999999999997e-169

   1. Initial program 61.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 79.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 0 36.9%

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

      1. neg-mul-1 36.9%

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

   7. Simplified 36.9%

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

   if 1.59999999999999997e-169 < J

   1. Initial program 82.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 93.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 K around 0 83.5%

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

Alternative 4: 69.8% 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 1.2 \cdot 10^{-101}:\\ \;\;\;\;\frac{-2 \cdot {\left(J\_m \cdot t\_0\right)}^{2}}{U\_m} - U\_m\\ \mathbf{elif}\;J\_m \leq 1.6 \cdot 10^{+31}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{2}}{J\_m}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot t\_0\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 0.5))))
   (*
    J_s
    (if (<= J_m 1.2e-101)
      (- (/ (* -2.0 (pow (* J_m t_0) 2.0)) U_m) U_m)
      (if (<= J_m 1.6e+31)
        (* J_m (* -2.0 (hypot 1.0 (/ (/ U_m 2.0) J_m))))
        (* J_m (* -2.0 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 <= 1.2e-101) {
		tmp = ((-2.0 * pow((J_m * t_0), 2.0)) / U_m) - U_m;
	} else if (J_m <= 1.6e+31) {
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m / 2.0) / J_m)));
	} else {
		tmp = J_m * (-2.0 * 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 <= 1.2e-101) {
		tmp = ((-2.0 * Math.pow((J_m * t_0), 2.0)) / U_m) - U_m;
	} else if (J_m <= 1.6e+31) {
		tmp = J_m * (-2.0 * Math.hypot(1.0, ((U_m / 2.0) / J_m)));
	} else {
		tmp = J_m * (-2.0 * 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 <= 1.2e-101:
		tmp = ((-2.0 * math.pow((J_m * t_0), 2.0)) / U_m) - U_m
	elif J_m <= 1.6e+31:
		tmp = J_m * (-2.0 * math.hypot(1.0, ((U_m / 2.0) / J_m)))
	else:
		tmp = J_m * (-2.0 * 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 <= 1.2e-101)
		tmp = Float64(Float64(Float64(-2.0 * (Float64(J_m * t_0) ^ 2.0)) / U_m) - U_m);
	elseif (J_m <= 1.6e+31)
		tmp = Float64(J_m * Float64(-2.0 * hypot(1.0, Float64(Float64(U_m / 2.0) / J_m))));
	else
		tmp = Float64(J_m * Float64(-2.0 * 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 <= 1.2e-101)
		tmp = ((-2.0 * ((J_m * t_0) ^ 2.0)) / U_m) - U_m;
	elseif (J_m <= 1.6e+31)
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m / 2.0) / J_m)));
	else
		tmp = J_m * (-2.0 * 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, 1.2e-101], 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, 1.6e+31], N[(J$95$m * N[(-2.0 * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(J$95$m * N[(-2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if J < 1.2e-101

   1. Initial program 60.0%

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

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

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

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

      2. unsub-neg 36.1%

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

      3. *-commutative 36.1%

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

      4. associate-*l/ 36.1%

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

      5. unpow2 36.1%

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

      6. *-commutative 36.1%

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

      7. unpow2 36.1%

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

      8. swap-sqr 36.1%

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

      9. unpow2 36.1%

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

      10. *-commutative 36.1%

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

   7. Simplified 36.1%

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

   if 1.2e-101 < J < 1.6e31

   1. Initial program 72.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 96.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 K around 0 84.3%

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

   6. Taylor expanded in K around 0 69.6%

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

   if 1.6e31 < J

   1. Initial program 96.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 99.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 0 80.7%

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

4. Final simplification 49.9%

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

Alternative 5: 69.9% 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 1.05 \cdot 10^{-128}:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;J\_m \leq 1.2 \cdot 10^{+31}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{2}}{J\_m}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\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 1.05e-128)
    (- U_m)
    (if (<= J_m 1.2e+31)
      (* J_m (* -2.0 (hypot 1.0 (/ (/ U_m 2.0) J_m))))
      (* J_m (* -2.0 (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 <= 1.05e-128) {
		tmp = -U_m;
	} else if (J_m <= 1.2e+31) {
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m / 2.0) / J_m)));
	} else {
		tmp = J_m * (-2.0 * 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 <= 1.05e-128) {
		tmp = -U_m;
	} else if (J_m <= 1.2e+31) {
		tmp = J_m * (-2.0 * Math.hypot(1.0, ((U_m / 2.0) / J_m)));
	} else {
		tmp = J_m * (-2.0 * 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 <= 1.05e-128:
		tmp = -U_m
	elif J_m <= 1.2e+31:
		tmp = J_m * (-2.0 * math.hypot(1.0, ((U_m / 2.0) / J_m)))
	else:
		tmp = J_m * (-2.0 * 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 <= 1.05e-128)
		tmp = Float64(-U_m);
	elseif (J_m <= 1.2e+31)
		tmp = Float64(J_m * Float64(-2.0 * hypot(1.0, Float64(Float64(U_m / 2.0) / J_m))));
	else
		tmp = Float64(J_m * Float64(-2.0 * 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 <= 1.05e-128)
		tmp = -U_m;
	elseif (J_m <= 1.2e+31)
		tmp = J_m * (-2.0 * hypot(1.0, ((U_m / 2.0) / J_m)));
	else
		tmp = J_m * (-2.0 * 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, 1.05e-128], (-U$95$m), If[LessEqual[J$95$m, 1.2e+31], N[(J$95$m * N[(-2.0 * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(J$95$m * N[(-2.0 * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if J < 1.0500000000000001e-128

   1. Initial program 61.0%

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

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

      1. neg-mul-1 37.2%

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

   7. Simplified 37.2%

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

   if 1.0500000000000001e-128 < J < 1.19999999999999991e31

   1. Initial program 64.4%

      \[\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.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 K around 0 74.1%

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

   6. Taylor expanded in K around 0 62.6%

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

   if 1.19999999999999991e31 < J

   1. Initial program 96.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 99.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 0 80.7%

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

4. Final simplification 50.9%

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

Alternative 6: 66.7% 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}\;J\_m \leq 10^{-44}:\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\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 1e-44) (- U_m) (* J_m (* -2.0 (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 <= 1e-44) {
		tmp = -U_m;
	} else {
		tmp = J_m * (-2.0 * cos((K * 0.5)));
	}
	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 <= 1d-44) then
        tmp = -u_m
    else
        tmp = j_m * ((-2.0d0) * cos((k * 0.5d0)))
    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 <= 1e-44) {
		tmp = -U_m;
	} else {
		tmp = J_m * (-2.0 * 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 <= 1e-44:
		tmp = -U_m
	else:
		tmp = J_m * (-2.0 * 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 <= 1e-44)
		tmp = Float64(-U_m);
	else
		tmp = Float64(J_m * Float64(-2.0 * 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 <= 1e-44)
		tmp = -U_m;
	else
		tmp = J_m * (-2.0 * 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, 1e-44], (-U$95$m), N[(J$95$m * N[(-2.0 * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if J < 9.99999999999999953e-45

   1. Initial program 60.4%

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

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

      1. neg-mul-1 37.4%

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

   7. Simplified 37.4%

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

   if 9.99999999999999953e-45 < J

   1. Initial program 91.4%

      \[\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.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 U around 0 74.2%

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

4. Final simplification 48.5%

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

Alternative 7: 50.8% 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}\;U\_m \leq 1.45 \cdot 10^{-30}:\\ \;\;\;\;-2 \cdot J\_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 1.45e-30) (* -2.0 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 <= 1.45e-30) {
		tmp = -2.0 * J_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 <= 1.45d-30) then
        tmp = (-2.0d0) * j_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 <= 1.45e-30) {
		tmp = -2.0 * 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 <= 1.45e-30:
		tmp = -2.0 * 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 <= 1.45e-30)
		tmp = Float64(-2.0 * 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 <= 1.45e-30)
		tmp = -2.0 * 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, 1.45e-30], N[(-2.0 * J$95$m), $MachinePrecision], (-U$95$m)]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if U < 1.44999999999999995e-30

   1. Initial program 76.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 89.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 0 56.8%

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

   6. Taylor expanded in K around 0 32.7%

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

   if 1.44999999999999995e-30 < U

   1. Initial program 52.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 75.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 J around 0 40.4%

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

      1. neg-mul-1 40.4%

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

   7. Simplified 40.4%

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

4. Final simplification 34.9%

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

Alternative 8: 39.0% 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 #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 * 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 69.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 85.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 0 30.4%

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

   1. neg-mul-1 30.4%

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

7. Simplified 30.4%

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

Alternative 9: 13.9% 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 69.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 85.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 U around -inf 25.2%

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

Reproduce

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