Maksimov and Kolovsky, Equation (3)

Percentage Accurate: 73.4% → 99.8%

Time: 20.9s

Alternatives: 9

Speedup: 1.9×

• could not determine a ground truth

  1. J = -4.457000297209934e-81
  2. K = 3.031101454391962e+42
  3. U = -1.3631011347625051e-292

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: 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(\left(-2 \cdot J\_m\right) \cdot t\_0\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{t\_0 \cdot \left(J\_m \cdot 2\right)}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq 10^{+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 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J_m 2.0))) 2.0))))))
   (* J_s (if (<= t_1 (- INFINITY)) (- U_m) (if (<= t_1 1e+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 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + pow((U_m / (t_0 * (J_m * 2.0))), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= 1e+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 = ((-2.0 * J_m) * t_0) * Math.sqrt((1.0 + Math.pow((U_m / (t_0 * (J_m * 2.0))), 2.0)));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = -U_m;
	} else if (t_1 <= 1e+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 = ((-2.0 * J_m) * t_0) * math.sqrt((1.0 + math.pow((U_m / (t_0 * (J_m * 2.0))), 2.0)))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = -U_m
	elif t_1 <= 1e+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(Float64(-2.0 * J_m) * t_0) * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_0 * Float64(J_m * 2.0))) ^ 2.0))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= 1e+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 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + ((U_m / (t_0 * (J_m * 2.0))) ^ 2.0)));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = -U_m;
	elseif (t_1 <= 1e+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[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(t$95$0 * N[(J$95$m * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$1, (-Infinity)], (-U$95$m), If[LessEqual[t$95$1, 1e+307], t$95$1, U$95$m]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 4.9%

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

   3. Taylor expanded in J around 0 48.5%

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

      1. neg-mul-1 48.5%

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

   5. Simplified 48.5%

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

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

   1. Initial program 99.9%

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

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

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

   3. Taylor expanded in J around 0 55.2%

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

      1. neg-mul-1 55.2%

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

   5. Simplified 55.2%

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

      1. neg-sub0 55.2%

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

      2. sub-neg 55.2%

         \[\leadsto \color{blue}{0 + \left(-U\right)} \]

      3. add-sqr-sqrt 54.6%

         \[\leadsto 0 + \color{blue}{\sqrt{-U} \cdot \sqrt{-U}} \]

      4. sqrt-unprod 36.1%

         \[\leadsto 0 + \color{blue}{\sqrt{\left(-U\right) \cdot \left(-U\right)}} \]

      5. sqr-neg 36.1%

         \[\leadsto 0 + \sqrt{\color{blue}{U \cdot U}} \]

      6. sqrt-unprod 40.1%

         \[\leadsto 0 + \color{blue}{\sqrt{U} \cdot \sqrt{U}} \]

      7. add-sqr-sqrt 40.8%

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

   7. Applied egg-rr 40.8%

      \[\leadsto \color{blue}{0 + U} \]
   8. Step-by-step derivation

      1. +-lft-identity 40.8%

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

   9. Simplified 40.8%

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

4. Final simplification 84.8%

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

Alternative 2: 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) \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;J\_m \leq 4.1 \cdot 10^{-168}:\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \left(J\_m \cdot \left(t\_0 \cdot \mathsf{hypot}\left(1, \frac{U\_m}{t\_0} \cdot \frac{0.5}{J\_m}\right)\right)\right)\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (*
    J_s
    (if (<= J_m 4.1e-168)
      (- U_m)
      (* -2.0 (* J_m (* t_0 (hypot 1.0 (* (/ U_m t_0) (/ 0.5 J_m))))))))))

C

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

Java

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

Python

U_m = math.fabs(U)
J_m = math.fabs(J)
J_s = math.copysign(1.0, J)
def code(J_s, J_m, K, U_m):
	t_0 = math.cos((K / 2.0))
	tmp = 0
	if J_m <= 4.1e-168:
		tmp = -U_m
	else:
		tmp = -2.0 * (J_m * (t_0 * math.hypot(1.0, ((U_m / t_0) * (0.5 / J_m)))))
	return J_s * tmp

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	t_0 = cos(Float64(K / 2.0))
	tmp = 0.0
	if (J_m <= 4.1e-168)
		tmp = Float64(-U_m);
	else
		tmp = Float64(-2.0 * Float64(J_m * Float64(t_0 * hypot(1.0, Float64(Float64(U_m / t_0) * Float64(0.5 / J_m))))));
	end
	return Float64(J_s * tmp)
end

MATLAB

U_m = abs(U);
J_m = abs(J);
J_s = sign(J) * abs(1.0);
function tmp_2 = code(J_s, J_m, K, U_m)
	t_0 = cos((K / 2.0));
	tmp = 0.0;
	if (J_m <= 4.1e-168)
		tmp = -U_m;
	else
		tmp = -2.0 * (J_m * (t_0 * hypot(1.0, ((U_m / t_0) * (0.5 / J_m)))));
	end
	tmp_2 = J_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if J < 4.0999999999999998e-168

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

   3. Taylor expanded in J around 0 27.1%

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

      1. neg-mul-1 27.1%

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

   5. Simplified 27.1%

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

   if 4.0999999999999998e-168 < J

   1. Initial program 89.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 97.9%

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

4. Final simplification 55.3%

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

Alternative 3: 89.3% 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 3.5 \cdot 10^{-169}:\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \left(\left(J\_m \cdot t\_0\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{J\_m \cdot 2}}{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 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0))))
   (*
    J_s
    (if (<= J_m 3.5e-169)
      (- U_m)
      (* -2.0 (* (* J_m t_0) (hypot 1.0 (/ (/ U_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 / 2.0));
	double tmp;
	if (J_m <= 3.5e-169) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * ((J_m * t_0) * hypot(1.0, ((U_m / (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 / 2.0));
	double tmp;
	if (J_m <= 3.5e-169) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * ((J_m * t_0) * Math.hypot(1.0, ((U_m / (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 / 2.0))
	tmp = 0
	if J_m <= 3.5e-169:
		tmp = -U_m
	else:
		tmp = -2.0 * ((J_m * t_0) * math.hypot(1.0, ((U_m / (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 / 2.0))
	tmp = 0.0
	if (J_m <= 3.5e-169)
		tmp = Float64(-U_m);
	else
		tmp = Float64(-2.0 * Float64(Float64(J_m * t_0) * hypot(1.0, Float64(Float64(U_m / Float64(J_m * 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 / 2.0));
	tmp = 0.0;
	if (J_m <= 3.5e-169)
		tmp = -U_m;
	else
		tmp = -2.0 * ((J_m * t_0) * hypot(1.0, ((U_m / (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 / 2.0), $MachinePrecision]], $MachinePrecision]}, N[(J$95$s * If[LessEqual[J$95$m, 3.5e-169], (-U$95$m), N[(-2.0 * N[(N[(J$95$m * t$95$0), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / N[(J$95$m * 2.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if J < 3.5000000000000003e-169

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

   3. Taylor expanded in J around 0 27.1%

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

      1. neg-mul-1 27.1%

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

   5. Simplified 27.1%

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

   if 3.5000000000000003e-169 < J

   1. Initial program 89.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 98.0%

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

4. Final simplification 55.3%

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

Alternative 4: 78.4% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if J < 2.50000000000000014e-129

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

   3. Taylor expanded in J around 0 27.9%

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

      1. neg-mul-1 27.9%

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

   5. Simplified 27.9%

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

   if 2.50000000000000014e-129 < J

   1. Initial program 90.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 97.9%

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

   5. Taylor expanded in K around 0 85.1%

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

      1. associate-*r/ 85.1%

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

      2. *-commutative 85.1%

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

      3. associate-/l* 85.1%

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

   7. Simplified 85.1%

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

4. Final simplification 50.0%

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

Alternative 5: 67.7% accurate, 3.4× speedup

Math

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

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (*
  J_s
  (if (<= J_m 2.3e-47)
    (- U_m)
    (*
     -2.0
     (*
      J_m
      (* (cos (/ K 2.0)) (+ 1.0 (* (* (/ U_m J_m) (/ U_m J_m)) 0.125))))))))

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 <= 2.3e-47) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * (J_m * (cos((K / 2.0)) * (1.0 + (((U_m / J_m) * (U_m / J_m)) * 0.125))));
	}
	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 <= 2.3d-47) then
        tmp = -u_m
    else
        tmp = (-2.0d0) * (j_m * (cos((k / 2.0d0)) * (1.0d0 + (((u_m / j_m) * (u_m / j_m)) * 0.125d0))))
    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 <= 2.3e-47) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * (J_m * (Math.cos((K / 2.0)) * (1.0 + (((U_m / J_m) * (U_m / J_m)) * 0.125))));
	}
	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 <= 2.3e-47:
		tmp = -U_m
	else:
		tmp = -2.0 * (J_m * (math.cos((K / 2.0)) * (1.0 + (((U_m / J_m) * (U_m / J_m)) * 0.125))))
	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 <= 2.3e-47)
		tmp = Float64(-U_m);
	else
		tmp = Float64(-2.0 * Float64(J_m * Float64(cos(Float64(K / 2.0)) * Float64(1.0 + Float64(Float64(Float64(U_m / J_m) * Float64(U_m / J_m)) * 0.125)))));
	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 <= 2.3e-47)
		tmp = -U_m;
	else
		tmp = -2.0 * (J_m * (cos((K / 2.0)) * (1.0 + (((U_m / J_m) * (U_m / J_m)) * 0.125))));
	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, 2.3e-47], (-U$95$m), N[(-2.0 * N[(J$95$m * N[(N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision] * N[(1.0 + N[(N[(N[(U$95$m / J$95$m), $MachinePrecision] * N[(U$95$m / J$95$m), $MachinePrecision]), $MachinePrecision] * 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if J < 2.29999999999999982e-47

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

   3. Taylor expanded in J around 0 28.1%

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

      1. neg-mul-1 28.1%

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

   5. Simplified 28.1%

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

   if 2.29999999999999982e-47 < J

   1. Initial program 95.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 99.7%

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

   5. Taylor expanded in K around 0 89.7%

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

      1. associate-*r/ 89.7%

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

      2. *-commutative 89.7%

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

      3. associate-/l* 89.6%

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

   7. Simplified 89.6%

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

   8. Taylor expanded in U around 0 74.8%

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

      1. *-commutative 74.8%

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

   10. Simplified 74.8%

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

       1. unpow2 74.8%

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

       2. unpow2 74.8%

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

       3. times-frac 81.7%

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

   12. Applied egg-rr 81.7%

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

4. Final simplification 44.2%

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

Alternative 6: 67.2% accurate, 3.7× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J_m = \left|J\right| \\ J_s = \mathsf{copysign}\left(1, J\right) \\ J\_s \cdot \begin{array}{l} \mathbf{if}\;J\_m \leq 1.8 \cdot 10^{-21}:\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \left(J\_m \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 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (* J_s (if (<= J_m 1.8e-21) (- U_m) (* -2.0 (* J_m (cos (* K 0.5)))))))

C

U_m = fabs(U);
J_m = fabs(J);
J_s = copysign(1.0, J);
double code(double J_s, double J_m, double K, double U_m) {
	double tmp;
	if (J_m <= 1.8e-21) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * (J_m * 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 <= 1.8d-21) then
        tmp = -u_m
    else
        tmp = (-2.0d0) * (j_m * 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 <= 1.8e-21) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * (J_m * Math.cos((K * 0.5)));
	}
	return J_s * tmp;
}

Python

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

Julia

U_m = abs(U)
J_m = abs(J)
J_s = copysign(1.0, J)
function code(J_s, J_m, K, U_m)
	tmp = 0.0
	if (J_m <= 1.8e-21)
		tmp = Float64(-U_m);
	else
		tmp = Float64(-2.0 * Float64(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 <= 1.8e-21)
		tmp = -U_m;
	else
		tmp = -2.0 * (J_m * cos((K * 0.5)));
	end
	tmp_2 = J_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if J < 1.79999999999999995e-21

   1. Initial program 67.2%

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

   3. Taylor expanded in J around 0 27.7%

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

      1. neg-mul-1 27.7%

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

   5. Simplified 27.7%

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

   if 1.79999999999999995e-21 < J

   1. Initial program 94.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 99.7%

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

   5. Taylor expanded in J around inf 80.7%

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

4. Final simplification 43.0%

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

Alternative 7: 49.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}\;J\_m \leq 2.95 \cdot 10^{-15}:\\ \;\;\;\;-U\_m\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot J\_m\\ \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J_m = (fabs.f64 J)
J_s = (copysign.f64 1 J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (* J_s (if (<= J_m 2.95e-15) (- 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 <= 2.95e-15) {
		tmp = -U_m;
	} else {
		tmp = -2.0 * J_m;
	}
	return J_s * tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if J < 2.94999999999999982e-15

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

   3. Taylor expanded in J around 0 27.3%

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

      1. neg-mul-1 27.3%

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

   5. Simplified 27.3%

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

   if 2.94999999999999982e-15 < J

   1. Initial program 95.9%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in J around inf 81.3%

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

   6. Taylor expanded in K around 0 50.2%

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

4. Final simplification 33.7%

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

Alternative 8: 39.2% accurate, 210.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.2%

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

3. Taylor expanded in J around 0 23.9%

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

   1. neg-mul-1 23.9%

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

5. Simplified 23.9%

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

6. Final simplification 23.9%

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

Alternative 9: 14.0% accurate, 420.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.2%

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

3. Taylor expanded in J around 0 23.9%

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

   1. neg-mul-1 23.9%

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

5. Simplified 23.9%

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

   1. neg-sub0 23.9%

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

   2. sub-neg 23.9%

      \[\leadsto \color{blue}{0 + \left(-U\right)} \]

   3. add-sqr-sqrt 13.9%

      \[\leadsto 0 + \color{blue}{\sqrt{-U} \cdot \sqrt{-U}} \]

   4. sqrt-unprod 16.2%

      \[\leadsto 0 + \color{blue}{\sqrt{\left(-U\right) \cdot \left(-U\right)}} \]

   5. sqr-neg 16.2%

      \[\leadsto 0 + \sqrt{\color{blue}{U \cdot U}} \]

   6. sqrt-unprod 15.5%

      \[\leadsto 0 + \color{blue}{\sqrt{U} \cdot \sqrt{U}} \]

   7. add-sqr-sqrt 27.6%

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

7. Applied egg-rr 27.6%

   \[\leadsto \color{blue}{0 + U} \]
8. Step-by-step derivation

   1. +-lft-identity 27.6%

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

9. Simplified 27.6%

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

10. Final simplification 27.6%

    \[\leadsto U \]
11. Add Preprocessing

Reproduce

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