Maksimov and Kolovsky, Equation (3)

Percentage Accurate: 73.4% → 96.7%

Time: 12.9s

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.4% 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: 96.7% accurate, 0.6× 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}\;\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}} \leq -\infty:\\ \;\;\;\;-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 (<=
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J_m 2.0))) 2.0))))
         (- INFINITY))
      (- 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 ((((-2.0 * J_m) * t_0) * sqrt((1.0 + pow((U_m / (t_0 * (J_m * 2.0))), 2.0)))) <= -((double) INFINITY)) {
		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 ((((-2.0 * J_m) * t_0) * Math.sqrt((1.0 + Math.pow((U_m / (t_0 * (J_m * 2.0))), 2.0)))) <= -Double.POSITIVE_INFINITY) {
		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 (((-2.0 * J_m) * t_0) * math.sqrt((1.0 + math.pow((U_m / (t_0 * (J_m * 2.0))), 2.0)))) <= -math.inf:
		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 (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)))) <= Float64(-Inf))
		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 ((((-2.0 * J_m) * t_0) * sqrt((1.0 + ((U_m / (t_0 * (J_m * 2.0))) ^ 2.0)))) <= -Inf)
		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[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], (-Infinity)], (-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 (*.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 4.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 56.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 J around 0 39.1%

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

      1. neg-mul-1 39.1%

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

   7. Simplified 39.1%

      \[\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. Initial program 87.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 96.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
3. Recombined 2 regimes into one program.

4. Final simplification 87.6%

   \[\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{else}:\\ \;\;\;\;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)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 89.2% 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) \\ J\_s \cdot \begin{array}{l} \mathbf{if}\;J\_m \leq 3.5 \cdot 10^{-260}:\\ \;\;\;\;-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{\frac{0.5}{J\_m}}{\cos \left(K \cdot 0.5\right)}\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 3.5e-260)
    (- U_m)
    (*
     J_m
     (*
      (* -2.0 (cos (/ K 2.0)))
      (hypot 1.0 (* U_m (/ (/ 0.5 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.5e-260) {
		tmp = -U_m;
	} else {
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (U_m * ((0.5 / 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.5e-260) {
		tmp = -U_m;
	} else {
		tmp = J_m * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, (U_m * ((0.5 / 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.5e-260:
		tmp = -U_m
	else:
		tmp = J_m * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, (U_m * ((0.5 / 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.5e-260)
		tmp = Float64(-U_m);
	else
		tmp = Float64(J_m * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(U_m * Float64(Float64(0.5 / 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.5e-260)
		tmp = -U_m;
	else
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (U_m * ((0.5 / 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.5e-260], (-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[(U$95$m * N[(N[(0.5 / J$95$m), $MachinePrecision] / N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if J < 3.5e-260

   1. Initial program 71.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 87.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 23.4%

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

      1. neg-mul-1 23.4%

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

   7. Simplified 23.4%

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

   if 3.5e-260 < J

   1. Initial program 77.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 92.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. Step-by-step derivation

      1. associate-/r* 92.9%

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

      2. associate-*l* 92.9%

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

      3. clear-num 92.8%

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

      4. associate-/r/ 92.8%

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

      5. *-commutative 92.8%

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

      6. associate-/r* 92.8%

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

      7. *-commutative 92.8%

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

      8. associate-/r* 92.8%

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

      9. metadata-eval 92.8%

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

      10. div-inv 92.8%

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

      11. metadata-eval 92.8%

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

   6. Applied egg-rr 92.8%

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

4. Final simplification 56.8%

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

Alternative 3: 78.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) \\ J\_s \cdot \begin{array}{l} \mathbf{if}\;U\_m \leq 4.5 \cdot 10^{+167}:\\ \;\;\;\;\left(J\_m \cdot \left(-2 \cdot \cos \left(\frac{K}{2}\right)\right)\right) \cdot \mathsf{hypot}\left(1, \frac{U\_m \cdot 0.5}{J\_m}\right)\\ \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 4.5e+167)
    (* (* J_m (* -2.0 (cos (/ K 2.0)))) (hypot 1.0 (/ (* U_m 0.5) J_m)))
    (- U_m))))

C

U_m = fabs(U);
J\_m = fabs(J);
J\_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (U_m <= 4.5e+167) {
		tmp = (J_m * (-2.0 * cos((K / 2.0)))) * hypot(1.0, ((U_m * 0.5) / J_m));
	} else {
		tmp = -U_m;
	}
	return J_s * tmp;
}

Java

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

Python

U_m = math.fabs(U)
J\_m = math.fabs(J)
J\_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	tmp = 0
	if U_m <= 4.5e+167:
		tmp = (J_m * (-2.0 * math.cos((K / 2.0)))) * math.hypot(1.0, ((U_m * 0.5) / J_m))
	else:
		tmp = -U_m
	return J_s * tmp

Julia

U_m = abs(U)
J\_m = abs(J)
J\_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	tmp = 0.0
	if (U_m <= 4.5e+167)
		tmp = Float64(Float64(J_m * Float64(-2.0 * cos(Float64(K / 2.0)))) * hypot(1.0, Float64(Float64(U_m * 0.5) / J_m)));
	else
		tmp = Float64(-U_m);
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J\_m = abs(J);
J\_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	tmp = 0.0;
	if (U_m <= 4.5e+167)
		tmp = (J_m * (-2.0 * cos((K / 2.0)))) * hypot(1.0, ((U_m * 0.5) / J_m));
	else
		tmp = -U_m;
	end
	tmp_2 = J_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if U < 4.4999999999999999e167

   1. Initial program 77.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}} \]
   2. Step-by-step derivation

      1. unpow2 77.1%

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

      2. hypot-1-def 92.7%

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

      3. associate-/r* 92.6%

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

      4. cos-neg 92.6%

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

      5. distribute-frac-neg 92.6%

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

      6. associate-/r* 92.7%

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

      7. hypot-1-def 77.1%

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

      8. unpow2 77.1%

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

   3. Simplified 92.6%

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

   5. Taylor expanded in K around 0 77.9%

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

      1. /-rgt-identity 77.9%

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

      2. div-inv 77.8%

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

      3. metadata-eval 77.8%

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

      4. div-inv 77.8%

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

      5. clear-num 77.8%

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

      6. *-un-lft-identity 77.8%

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

      7. clear-num 77.8%

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

      8. div-inv 77.8%

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

      9. metadata-eval 77.8%

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

      10. div-inv 77.9%

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

      11. *-un-lft-identity 77.9%

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

      12. *-commutative 77.9%

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

      13. times-frac 77.9%

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

      14. metadata-eval 77.9%

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

   7. Applied egg-rr 77.9%

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

      1. *-lft-identity 77.9%

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

      2. associate-*r/ 77.9%

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

      3. *-commutative 77.9%

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

   9. Simplified 77.9%

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

   if 4.4999999999999999e167 < U

   1. Initial program 54.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 70.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 39.2%

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

      1. neg-mul-1 39.2%

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

   7. Simplified 39.2%

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

Alternative 4: 78.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) \\ J\_s \cdot \begin{array}{l} \mathbf{if}\;U\_m \leq 3.3 \cdot 10^{+167}:\\ \;\;\;\;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)\\ \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 3.3e+167)
    (* J_m (* (* -2.0 (cos (/ K 2.0))) (hypot 1.0 (/ (/ U_m 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 <= 3.3e+167) {
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, ((U_m / 2.0) / J_m)));
	} else {
		tmp = -U_m;
	}
	return J_s * tmp;
}

Java

U_m = Math.abs(U);
J\_m = Math.abs(J);
J\_s = Math.copySign(1.0, J);
public static double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (U_m <= 3.3e+167) {
		tmp = J_m * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, ((U_m / 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 <= 3.3e+167:
		tmp = J_m * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, ((U_m / 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 <= 3.3e+167)
		tmp = Float64(J_m * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(Float64(U_m / 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 <= 3.3e+167)
		tmp = J_m * ((-2.0 * cos((K / 2.0))) * hypot(1.0, ((U_m / 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, 3.3e+167], 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], (-U$95$m)]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if U < 3.30000000000000018e167

   1. Initial program 77.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 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 K around 0 77.9%

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

   if 3.30000000000000018e167 < U

   1. Initial program 54.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 70.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 39.2%

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

      1. neg-mul-1 39.2%

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

   7. Simplified 39.2%

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

Alternative 5: 62.9% 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}\;K \leq 1.2 \cdot 10^{-14}:\\ \;\;\;\;\left(-2 \cdot J\_m\right) \cdot \mathsf{hypot}\left(1, \frac{U\_m \cdot 0.5}{J\_m}\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 (<= K 1.2e-14)
    (* (* -2.0 J_m) (hypot 1.0 (/ (* U_m 0.5) 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 (K <= 1.2e-14) {
		tmp = (-2.0 * J_m) * hypot(1.0, ((U_m * 0.5) / 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 (K <= 1.2e-14) {
		tmp = (-2.0 * J_m) * Math.hypot(1.0, ((U_m * 0.5) / 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 K <= 1.2e-14:
		tmp = (-2.0 * J_m) * math.hypot(1.0, ((U_m * 0.5) / 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 (K <= 1.2e-14)
		tmp = Float64(Float64(-2.0 * J_m) * hypot(1.0, Float64(Float64(U_m * 0.5) / 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 (K <= 1.2e-14)
		tmp = (-2.0 * J_m) * hypot(1.0, ((U_m * 0.5) / 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[K, 1.2e-14], N[(N[(-2.0 * J$95$m), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m * 0.5), $MachinePrecision] / J$95$m), $MachinePrecision] ^ 2], $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 2 regimes

2. if K < 1.2e-14

   1. Initial program 72.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}} \]
   2. Step-by-step derivation

      1. unpow2 72.1%

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

      2. hypot-1-def 89.7%

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

      3. associate-/r* 89.6%

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

      4. cos-neg 89.6%

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

      5. distribute-frac-neg 89.6%

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

      6. associate-/r* 89.7%

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

      7. hypot-1-def 72.1%

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

      8. unpow2 72.1%

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

   3. Simplified 89.6%

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

      1. log1p-expm1-u 89.6%

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

      2. div-inv 89.6%

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

      3. metadata-eval 89.6%

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

   6. Applied egg-rr 89.6%

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

   7. Taylor expanded in K around 0 35.8%

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

      1. associate-*r* 35.8%

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

      2. *-commutative 35.8%

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

      3. rem-cube-cbrt 34.6%

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

      4. *-commutative 34.6%

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

      5. metadata-eval 34.6%

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

      6. metadata-eval 34.6%

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

      7. unpow2 34.6%

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

      8. unpow2 34.6%

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

      9. times-frac 49.1%

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

      10. swap-sqr 49.1%

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

      11. hypot-undefine 65.0%

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

      12. associate-*r/ 65.0%

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

      13. *-commutative 65.0%

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

      14. rem-cube-cbrt 67.4%

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

      15. *-commutative 67.4%

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

   9. Simplified 67.4%

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

   if 1.2e-14 < K

   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 91.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 U around 0 52.3%

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

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

Alternative 6: 67.5% 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 5.2 \cdot 10^{+14}:\\ \;\;\;\;J\_m \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-U\_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (* J_s (if (<= U_m 5.2e+14) (* J_m (* -2.0 (cos (* K 0.5)))) (- U_m))))

C

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

Fortran

U_m = abs(u)
J\_m = abs(j)
J\_s = copysign(1.0d0, j)
real(8) function code(j_s, j_m, k, u_m)
    real(8), intent (in) :: j_s
    real(8), intent (in) :: j_m
    real(8), intent (in) :: k
    real(8), intent (in) :: u_m
    real(8) :: tmp
    if (u_m <= 5.2d+14) then
        tmp = j_m * ((-2.0d0) * cos((k * 0.5d0)))
    else
        tmp = -u_m
    end if
    code = j_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if U < 5.2e14

   1. Initial program 79.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 93.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 U around 0 59.0%

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

   if 5.2e14 < U

   1. Initial program 59.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 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 28.8%

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

      1. neg-mul-1 28.8%

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

   7. Simplified 28.8%

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

4. Final simplification 51.2%

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

Alternative 7: 49.9% 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 8.8 \cdot 10^{-115}:\\ \;\;\;\;-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 8.8e-115) (* -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 <= 8.8e-115) {
		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 <= 8.8d-115) 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 <= 8.8e-115) {
		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 <= 8.8e-115:
		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 <= 8.8e-115)
		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 <= 8.8e-115)
		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, 8.8e-115], N[(-2.0 * J$95$m), $MachinePrecision], (-U$95$m)]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if U < 8.7999999999999997e-115

   1. Initial program 80.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 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

   5. Taylor expanded in U around 0 60.4%

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

      1. *-commutative 60.4%

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

      2. expm1-log1p-u 60.4%

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

   7. Applied egg-rr 60.4%

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

   8. Taylor expanded in K around 0 31.7%

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

   if 8.7999999999999997e-115 < U

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

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

      1. neg-mul-1 27.8%

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

   7. Simplified 27.8%

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

4. Final simplification 30.4%

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

Alternative 8: 38.9% 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 74.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 90.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 22.7%

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

   1. neg-mul-1 22.7%

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

7. Simplified 22.7%

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

Alternative 9: 13.6% 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.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 90.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 29.9%

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

Reproduce

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