Maksimov and Kolovsky, Equation (3)

Percentage Accurate: 72.9% → 99.4%

Time: 5.4s

Alternatives: 11

Speedup: 0.4×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 72.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(j, k, u)
use fmin_fmax_functions
    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.4% 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}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq 10^{+298}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0))))))
   (* J_s (if (<= t_1 (- INFINITY)) (- U_m) (if (<= t_1 1e+298) 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 / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= 1e+298) {
		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 / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = -U_m;
	} else if (t_1 <= 1e+298) {
		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 / ((2.0 * J_m) * t_0)), 2.0)))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = -U_m
	elif t_1 <= 1e+298:
		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(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= 1e+298)
		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 / ((2.0 * J_m) * t_0)) ^ 2.0)));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = -U_m;
	elseif (t_1 <= 1e+298)
		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[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $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+298], t$95$1, U$95$m]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < 9.9999999999999996e297

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

   if 9.9999999999999996e297 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 97.9% 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(0.5 \cdot K\right)\\ t_1 := \cos \left(\frac{K}{2}\right)\\ t_2 := \left(\left(-2 \cdot J\_m\right) \cdot t\_1\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{\left(2 \cdot J\_m\right) \cdot t\_1}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_2 \leq 10^{+298}:\\ \;\;\;\;\left(\left(-2 \cdot J\_m\right) \cdot t\_0\right) \cdot \cosh \sinh^{-1} \left(\frac{U\_m}{\left(J\_m + J\_m\right) \cdot t\_0}\right)\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (* 0.5 K)))
        (t_1 (cos (/ K 2.0)))
        (t_2
         (*
          (* (* -2.0 J_m) t_1)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_1)) 2.0))))))
   (*
    J_s
    (if (<= t_2 (- INFINITY))
      (- U_m)
      (if (<= t_2 1e+298)
        (* (* (* -2.0 J_m) t_0) (cosh (asinh (/ U_m (* (+ J_m J_m) t_0)))))
        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((0.5 * K));
	double t_1 = cos((K / 2.0));
	double t_2 = ((-2.0 * J_m) * t_1) * sqrt((1.0 + pow((U_m / ((2.0 * J_m) * t_1)), 2.0)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_2 <= 1e+298) {
		tmp = ((-2.0 * J_m) * t_0) * cosh(asinh((U_m / ((J_m + J_m) * t_0))));
	} 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((0.5 * K))
	t_1 = math.cos((K / 2.0))
	t_2 = ((-2.0 * J_m) * t_1) * math.sqrt((1.0 + math.pow((U_m / ((2.0 * J_m) * t_1)), 2.0)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = -U_m
	elif t_2 <= 1e+298:
		tmp = ((-2.0 * J_m) * t_0) * math.cosh(math.asinh((U_m / ((J_m + J_m) * t_0))))
	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(0.5 * K))
	t_1 = cos(Float64(K / 2.0))
	t_2 = Float64(Float64(Float64(-2.0 * J_m) * t_1) * sqrt(Float64(1.0 + (Float64(U_m / Float64(Float64(2.0 * J_m) * t_1)) ^ 2.0))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_2 <= 1e+298)
		tmp = Float64(Float64(Float64(-2.0 * J_m) * t_0) * cosh(asinh(Float64(U_m / Float64(Float64(J_m + J_m) * t_0)))));
	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((0.5 * K));
	t_1 = cos((K / 2.0));
	t_2 = ((-2.0 * J_m) * t_1) * sqrt((1.0 + ((U_m / ((2.0 * J_m) * t_1)) ^ 2.0)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = -U_m;
	elseif (t_2 <= 1e+298)
		tmp = ((-2.0 * J_m) * t_0) * cosh(asinh((U_m / ((J_m + J_m) * t_0))));
	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[(0.5 * K), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$2, (-Infinity)], (-U$95$m), If[LessEqual[t$95$2, 1e+298], N[(N[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision] * N[Cosh[N[ArcSinh[N[(U$95$m / N[(N[(J$95$m + J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], U$95$m]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < 9.9999999999999996e297

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

      1. lift-sqrt.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-pow.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-/.f64 N/A

         \[\leadsto \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 \color{blue}{\left(\frac{K}{2}\right)}}\right)}^{2}} \]

      8. lift-cos.f64 N/A

         \[\leadsto \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 \color{blue}{\cos \left(\frac{K}{2}\right)}}\right)}^{2}} \]

      9. +-commutative N/A

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

      10. unpow2 N/A

          \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\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)}} + 1} \]

      11. cosh-asinh-rev N/A

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

      12. lower-cosh.f64 N/A

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

      13. lower-asinh.f64 N/A

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

   3. Applied rewrites 85.0%

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

   4. Taylor expanded in K around 0

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

      1. lower-*.f64 85.0

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

   6. Applied rewrites 85.0%

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

   7. Taylor expanded in K around 0

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

      1. lower-*.f64 85.0

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

   9. Applied rewrites 85.0%

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

   if 9.9999999999999996e297 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 90.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J\_m = \left|J\right| \\ J\_s = \mathsf{copysign}\left(1, J\right) \\ \begin{array}{l} t_0 := \frac{U\_m}{J\_m} \cdot 0.5\\ t_1 := \cos \left(\frac{K}{2}\right)\\ t_2 := \left(\left(-2 \cdot J\_m\right) \cdot t\_1\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{\left(2 \cdot J\_m\right) \cdot t\_1}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_2 \leq 10^{+298}:\\ \;\;\;\;\left(J\_m \cdot -2\right) \cdot \left(t\_1 \cdot \sqrt{1 + t\_0 \cdot t\_0}\right)\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (* (/ U_m J_m) 0.5))
        (t_1 (cos (/ K 2.0)))
        (t_2
         (*
          (* (* -2.0 J_m) t_1)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_1)) 2.0))))))
   (*
    J_s
    (if (<= t_2 (- INFINITY))
      (- U_m)
      (if (<= t_2 1e+298)
        (* (* J_m -2.0) (* t_1 (sqrt (+ 1.0 (* t_0 t_0)))))
        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 = (U_m / J_m) * 0.5;
	double t_1 = cos((K / 2.0));
	double t_2 = ((-2.0 * J_m) * t_1) * sqrt((1.0 + pow((U_m / ((2.0 * J_m) * t_1)), 2.0)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_2 <= 1e+298) {
		tmp = (J_m * -2.0) * (t_1 * sqrt((1.0 + (t_0 * t_0))));
	} 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 = (U_m / J_m) * 0.5;
	double t_1 = Math.cos((K / 2.0));
	double t_2 = ((-2.0 * J_m) * t_1) * Math.sqrt((1.0 + Math.pow((U_m / ((2.0 * J_m) * t_1)), 2.0)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = -U_m;
	} else if (t_2 <= 1e+298) {
		tmp = (J_m * -2.0) * (t_1 * Math.sqrt((1.0 + (t_0 * t_0))));
	} 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 = (U_m / J_m) * 0.5
	t_1 = math.cos((K / 2.0))
	t_2 = ((-2.0 * J_m) * t_1) * math.sqrt((1.0 + math.pow((U_m / ((2.0 * J_m) * t_1)), 2.0)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = -U_m
	elif t_2 <= 1e+298:
		tmp = (J_m * -2.0) * (t_1 * math.sqrt((1.0 + (t_0 * t_0))))
	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 = Float64(Float64(U_m / J_m) * 0.5)
	t_1 = cos(Float64(K / 2.0))
	t_2 = Float64(Float64(Float64(-2.0 * J_m) * t_1) * sqrt(Float64(1.0 + (Float64(U_m / Float64(Float64(2.0 * J_m) * t_1)) ^ 2.0))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_2 <= 1e+298)
		tmp = Float64(Float64(J_m * -2.0) * Float64(t_1 * sqrt(Float64(1.0 + Float64(t_0 * t_0)))));
	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 = (U_m / J_m) * 0.5;
	t_1 = cos((K / 2.0));
	t_2 = ((-2.0 * J_m) * t_1) * sqrt((1.0 + ((U_m / ((2.0 * J_m) * t_1)) ^ 2.0)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = -U_m;
	elseif (t_2 <= 1e+298)
		tmp = (J_m * -2.0) * (t_1 * sqrt((1.0 + (t_0 * t_0))));
	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[(N[(U$95$m / J$95$m), $MachinePrecision] * 0.5), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(-2.0 * J$95$m), $MachinePrecision] * t$95$1), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$2, (-Infinity)], (-U$95$m), If[LessEqual[t$95$2, 1e+298], N[(N[(J$95$m * -2.0), $MachinePrecision] * N[(t$95$1 * N[Sqrt[N[(1.0 + N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], U$95$m]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < 9.9999999999999996e297

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 64.0

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

   4. Applied rewrites 64.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. associate-*l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-cos.f64 N/A

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

      12. lift-/.f64 64.0

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

   6. Applied rewrites 64.0%

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

   if 9.9999999999999996e297 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 90.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J\_m = \left|J\right| \\ J\_s = \mathsf{copysign}\left(1, J\right) \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ t_1 := \left(-2 \cdot J\_m\right) \cdot t\_0\\ t_2 := t\_1 \cdot \sqrt{1 + {\left(\frac{U\_m}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_2 \leq 10^{+298}:\\ \;\;\;\;t\_1 \cdot \sqrt{\mathsf{fma}\left(\frac{U\_m}{J\_m} \cdot \frac{U\_m}{J\_m}, 0.25, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1 (* (* -2.0 J_m) t_0))
        (t_2 (* t_1 (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0))))))
   (*
    J_s
    (if (<= t_2 (- INFINITY))
      (- U_m)
      (if (<= t_2 1e+298)
        (* t_1 (sqrt (fma (* (/ U_m J_m) (/ U_m J_m)) 0.25 1.0)))
        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;
	double t_2 = t_1 * sqrt((1.0 + pow((U_m / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_2 <= 1e+298) {
		tmp = t_1 * sqrt(fma(((U_m / J_m) * (U_m / J_m)), 0.25, 1.0));
	} 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(-2.0 * J_m) * t_0)
	t_2 = Float64(t_1 * sqrt(Float64(1.0 + (Float64(U_m / Float64(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_2 <= 1e+298)
		tmp = Float64(t_1 * sqrt(fma(Float64(Float64(U_m / J_m) * Float64(U_m / J_m)), 0.25, 1.0)));
	else
		tmp = U_m;
	end
	return Float64(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[(-2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$2, (-Infinity)], (-U$95$m), If[LessEqual[t$95$2, 1e+298], N[(t$95$1 * N[Sqrt[N[(N[(N[(U$95$m / J$95$m), $MachinePrecision] * N[(U$95$m / J$95$m), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], U$95$m]]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < 9.9999999999999996e297

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \]

      5. unpow2 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \]

      7. unpow2 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \]

      8. lower-*.f64 50.7

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \]

   4. Applied rewrites 50.7%

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

      1. lift-*.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \]

      4. times-frac N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \]

      6. lift-/.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \]

      7. lift-/.f64 64.0

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \]

   6. Applied rewrites 64.0%

      \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \]

   if 9.9999999999999996e297 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 87.1% accurate, 0.2× 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}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-12}:\\ \;\;\;\;\left(J\_m \cdot -2\right) \cdot \left(t\_0 \cdot \sqrt{\mathsf{fma}\left(U\_m \cdot \frac{U\_m}{J\_m \cdot J\_m}, 0.25, 1\right)}\right)\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-243}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(\frac{U\_m}{J\_m} \cdot \frac{U\_m}{J\_m}, 0.25, 1\right)} \cdot J\_m\right) \cdot -2\\ \mathbf{elif}\;t\_1 \leq 10^{+298}:\\ \;\;\;\;\left(\left(\cos \left(0.5 \cdot K\right) \cdot J\_m\right) \cdot -2\right) \cdot 1\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0))))))
   (*
    J_s
    (if (<= t_1 (- INFINITY))
      (- U_m)
      (if (<= t_1 -5e-12)
        (*
         (* J_m -2.0)
         (* t_0 (sqrt (fma (* U_m (/ U_m (* J_m J_m))) 0.25 1.0))))
        (if (<= t_1 -1e-243)
          (* (* (sqrt (fma (* (/ U_m J_m) (/ U_m J_m)) 0.25 1.0)) J_m) -2.0)
          (if (<= t_1 1e+298)
            (* (* (* (cos (* 0.5 K)) J_m) -2.0) 1.0)
            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 / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= -5e-12) {
		tmp = (J_m * -2.0) * (t_0 * sqrt(fma((U_m * (U_m / (J_m * J_m))), 0.25, 1.0)));
	} else if (t_1 <= -1e-243) {
		tmp = (sqrt(fma(((U_m / J_m) * (U_m / J_m)), 0.25, 1.0)) * J_m) * -2.0;
	} else if (t_1 <= 1e+298) {
		tmp = ((cos((0.5 * K)) * J_m) * -2.0) * 1.0;
	} 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(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= -5e-12)
		tmp = Float64(Float64(J_m * -2.0) * Float64(t_0 * sqrt(fma(Float64(U_m * Float64(U_m / Float64(J_m * J_m))), 0.25, 1.0))));
	elseif (t_1 <= -1e-243)
		tmp = Float64(Float64(sqrt(fma(Float64(Float64(U_m / J_m) * Float64(U_m / J_m)), 0.25, 1.0)) * J_m) * -2.0);
	elseif (t_1 <= 1e+298)
		tmp = Float64(Float64(Float64(cos(Float64(0.5 * K)) * J_m) * -2.0) * 1.0);
	else
		tmp = U_m;
	end
	return Float64(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[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$1, (-Infinity)], (-U$95$m), If[LessEqual[t$95$1, -5e-12], N[(N[(J$95$m * -2.0), $MachinePrecision] * N[(t$95$0 * N[Sqrt[N[(N[(U$95$m * N[(U$95$m / N[(J$95$m * J$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-243], N[(N[(N[Sqrt[N[(N[(N[(U$95$m / J$95$m), $MachinePrecision] * N[(U$95$m / J$95$m), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision] * J$95$m), $MachinePrecision] * -2.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+298], N[(N[(N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * J$95$m), $MachinePrecision] * -2.0), $MachinePrecision] * 1.0), $MachinePrecision], U$95$m]]]]), $MachinePrecision]]]

Derivation

1. Split input into 5 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 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < -4.9999999999999997e-12

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \]

      5. unpow2 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \]

      7. unpow2 N/A

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \]

      8. lower-*.f64 50.7

         \[\leadsto \left(\left(-2 \cdot J\right) \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \]

   4. Applied rewrites 50.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. associate-*l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-cos.f64 N/A

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

      12. lift-/.f64 50.7

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

   6. Applied rewrites 55.8%

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

   if -4.9999999999999997e-12 < (*.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))))) < -9.99999999999999995e-244

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      9. lower-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      10. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      12. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      13. lower-*.f64 32.3

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   4. Applied rewrites 32.3%

      \[\leadsto \color{blue}{\left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      4. times-frac N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      6. lift-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      7. lift-/.f64 45.0

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   6. Applied rewrites 45.0%

      \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   if -9.99999999999999995e-244 < (*.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))))) < 9.9999999999999996e297

   1. Initial program 72.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. Taylor expanded in J around inf

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

   4. Applied rewrites 51.6%

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

   5. Taylor expanded in J around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-cos.f64 N/A

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

      6. lower-*.f64 51.6

         \[\leadsto \left(\left(\cos \left(0.5 \cdot K\right) \cdot J\right) \cdot -2\right) \cdot 1 \]

   7. Applied rewrites 51.6%

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

   if 9.9999999999999996e297 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 5 regimes into one program.
4. Add Preprocessing

Alternative 6: 82.7% accurate, 0.2× 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}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ t_2 := \left(\left(\cos \left(0.5 \cdot K\right) \cdot J\_m\right) \cdot -2\right) \cdot 1\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq -0.7:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-243}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(\frac{U\_m}{J\_m} \cdot \frac{U\_m}{J\_m}, 0.25, 1\right)} \cdot J\_m\right) \cdot -2\\ \mathbf{elif}\;t\_1 \leq 10^{+298}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0)))))
        (t_2 (* (* (* (cos (* 0.5 K)) J_m) -2.0) 1.0)))
   (*
    J_s
    (if (<= t_1 (- INFINITY))
      (- U_m)
      (if (<= t_1 -0.7)
        t_2
        (if (<= t_1 -1e-243)
          (* (* (sqrt (fma (* (/ U_m J_m) (/ U_m J_m)) 0.25 1.0)) J_m) -2.0)
          (if (<= t_1 1e+298) t_2 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 / ((2.0 * J_m) * t_0)), 2.0)));
	double t_2 = ((cos((0.5 * K)) * J_m) * -2.0) * 1.0;
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= -0.7) {
		tmp = t_2;
	} else if (t_1 <= -1e-243) {
		tmp = (sqrt(fma(((U_m / J_m) * (U_m / J_m)), 0.25, 1.0)) * J_m) * -2.0;
	} else if (t_1 <= 1e+298) {
		tmp = t_2;
	} 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(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	t_2 = Float64(Float64(Float64(cos(Float64(0.5 * K)) * J_m) * -2.0) * 1.0)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= -0.7)
		tmp = t_2;
	elseif (t_1 <= -1e-243)
		tmp = Float64(Float64(sqrt(fma(Float64(Float64(U_m / J_m) * Float64(U_m / J_m)), 0.25, 1.0)) * J_m) * -2.0);
	elseif (t_1 <= 1e+298)
		tmp = t_2;
	else
		tmp = U_m;
	end
	return Float64(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[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[Cos[N[(0.5 * K), $MachinePrecision]], $MachinePrecision] * J$95$m), $MachinePrecision] * -2.0), $MachinePrecision] * 1.0), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$1, (-Infinity)], (-U$95$m), If[LessEqual[t$95$1, -0.7], t$95$2, If[LessEqual[t$95$1, -1e-243], N[(N[(N[Sqrt[N[(N[(N[(U$95$m / J$95$m), $MachinePrecision] * N[(U$95$m / J$95$m), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision] * J$95$m), $MachinePrecision] * -2.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+298], t$95$2, U$95$m]]]]), $MachinePrecision]]]]

Derivation

1. Split input into 4 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 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < -0.69999999999999996 or -9.99999999999999995e-244 < (*.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))))) < 9.9999999999999996e297

   1. Initial program 72.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. Taylor expanded in J around inf

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

   4. Applied rewrites 51.6%

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

   5. Taylor expanded in J around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-cos.f64 N/A

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

      6. lower-*.f64 51.6

         \[\leadsto \left(\left(\cos \left(0.5 \cdot K\right) \cdot J\right) \cdot -2\right) \cdot 1 \]

   7. Applied rewrites 51.6%

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

   if -0.69999999999999996 < (*.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))))) < -9.99999999999999995e-244

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      9. lower-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      10. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      12. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      13. lower-*.f64 32.3

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   4. Applied rewrites 32.3%

      \[\leadsto \color{blue}{\left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      4. times-frac N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      6. lift-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      7. lift-/.f64 45.0

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   6. Applied rewrites 45.0%

      \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   if 9.9999999999999996e297 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 7: 77.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} U_m = \left|U\right| \\ J\_m = \left|J\right| \\ J\_s = \mathsf{copysign}\left(1, J\right) \\ \begin{array}{l} t_0 := \cos \left(\frac{K}{2}\right)\\ t_1 := \left(\left(-2 \cdot J\_m\right) \cdot t\_0\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq -2 \cdot 10^{-272}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(\frac{U\_m}{J\_m} \cdot \frac{U\_m}{J\_m}, 0.25, 1\right)} \cdot J\_m\right) \cdot -2\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0))))))
   (*
    J_s
    (if (<= t_1 (- INFINITY))
      (- U_m)
      (if (<= t_1 -2e-272)
        (* (* (sqrt (fma (* (/ U_m J_m) (/ U_m J_m)) 0.25 1.0)) J_m) -2.0)
        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 / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= -2e-272) {
		tmp = (sqrt(fma(((U_m / J_m) * (U_m / J_m)), 0.25, 1.0)) * J_m) * -2.0;
	} 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(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= -2e-272)
		tmp = Float64(Float64(sqrt(fma(Float64(Float64(U_m / J_m) * Float64(U_m / J_m)), 0.25, 1.0)) * J_m) * -2.0);
	else
		tmp = U_m;
	end
	return Float64(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[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $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, -2e-272], N[(N[(N[Sqrt[N[(N[(N[(U$95$m / J$95$m), $MachinePrecision] * N[(U$95$m / J$95$m), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision] * J$95$m), $MachinePrecision] * -2.0), $MachinePrecision], U$95$m]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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.99999999999999986e-272

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      9. lower-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      10. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      12. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      13. lower-*.f64 32.3

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   4. Applied rewrites 32.3%

      \[\leadsto \color{blue}{\left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      4. times-frac N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      6. lift-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      7. lift-/.f64 45.0

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   6. Applied rewrites 45.0%

      \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U}{J} \cdot \frac{U}{J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   if -1.99999999999999986e-272 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 66.2% 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}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq -5 \cdot 10^{+202}:\\ \;\;\;\;\left(J\_m \cdot \left(0.25 \cdot \left(K \cdot K\right) - 2\right)\right) \cdot 1\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-154}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(\frac{U\_m \cdot U\_m}{J\_m \cdot J\_m}, 0.25, 1\right)} \cdot J\_m\right) \cdot -2\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0))))))
   (*
    J_s
    (if (<= t_1 (- INFINITY))
      (- U_m)
      (if (<= t_1 -5e+202)
        (* (* J_m (- (* 0.25 (* K K)) 2.0)) 1.0)
        (if (<= t_1 -1e-154)
          (* (* (sqrt (fma (/ (* U_m U_m) (* J_m J_m)) 0.25 1.0)) J_m) -2.0)
          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 / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= -5e+202) {
		tmp = (J_m * ((0.25 * (K * K)) - 2.0)) * 1.0;
	} else if (t_1 <= -1e-154) {
		tmp = (sqrt(fma(((U_m * U_m) / (J_m * J_m)), 0.25, 1.0)) * J_m) * -2.0;
	} 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(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= -5e+202)
		tmp = Float64(Float64(J_m * Float64(Float64(0.25 * Float64(K * K)) - 2.0)) * 1.0);
	elseif (t_1 <= -1e-154)
		tmp = Float64(Float64(sqrt(fma(Float64(Float64(U_m * U_m) / Float64(J_m * J_m)), 0.25, 1.0)) * J_m) * -2.0);
	else
		tmp = U_m;
	end
	return Float64(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[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, N[(J$95$s * If[LessEqual[t$95$1, (-Infinity)], (-U$95$m), If[LessEqual[t$95$1, -5e+202], N[(N[(J$95$m * N[(N[(0.25 * N[(K * K), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] * 1.0), $MachinePrecision], If[LessEqual[t$95$1, -1e-154], N[(N[(N[Sqrt[N[(N[(N[(U$95$m * U$95$m), $MachinePrecision] / N[(J$95$m * J$95$m), $MachinePrecision]), $MachinePrecision] * 0.25 + 1.0), $MachinePrecision]], $MachinePrecision] * J$95$m), $MachinePrecision] * -2.0), $MachinePrecision], U$95$m]]]), $MachinePrecision]]]

Derivation

1. Split input into 4 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 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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))))) < -4.9999999999999999e202

   1. Initial program 72.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. Taylor expanded in J around inf

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

   4. Applied rewrites 51.6%

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

   5. Taylor expanded in K around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(J, \color{blue}{-2}, \frac{1}{4} \cdot \left(J \cdot {K}^{2}\right)\right) \cdot 1 \]

      3. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(J, -2, \left(J \cdot {K}^{2}\right) \cdot \frac{1}{4}\right) \cdot 1 \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(J, -2, \left(J \cdot {K}^{2}\right) \cdot \frac{1}{4}\right) \cdot 1 \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(J, -2, \left({K}^{2} \cdot J\right) \cdot \frac{1}{4}\right) \cdot 1 \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(J, -2, \left({K}^{2} \cdot J\right) \cdot \frac{1}{4}\right) \cdot 1 \]

      7. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(J, -2, \left(\left(K \cdot K\right) \cdot J\right) \cdot \frac{1}{4}\right) \cdot 1 \]

      8. lower-*.f64 27.4

         \[\leadsto \mathsf{fma}\left(J, -2, \left(\left(K \cdot K\right) \cdot J\right) \cdot 0.25\right) \cdot 1 \]

   7. Applied rewrites 27.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(J, -2, \left(\left(K \cdot K\right) \cdot J\right) \cdot 0.25\right)} \cdot 1 \]

   8. Taylor expanded in J around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

         \[\leadsto \left(J \cdot \left(\frac{1}{4} \cdot {K}^{2} - 2\right)\right) \cdot 1 \]

      3. lower-*.f64 N/A

         \[\leadsto \left(J \cdot \left(\frac{1}{4} \cdot {K}^{2} - 2\right)\right) \cdot 1 \]

      4. pow2 N/A

         \[\leadsto \left(J \cdot \left(\frac{1}{4} \cdot \left(K \cdot K\right) - 2\right)\right) \cdot 1 \]

      5. lift-*.f64 27.4

         \[\leadsto \left(J \cdot \left(0.25 \cdot \left(K \cdot K\right) - 2\right)\right) \cdot 1 \]

   10. Applied rewrites 27.4%

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

   if -4.9999999999999999e202 < (*.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))))) < -9.9999999999999997e-155

   1. Initial program 72.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. Taylor expanded in K around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      9. lower-/.f64 N/A

         \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{{U}^{2}}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      10. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{{J}^{2}}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      12. unpow2 N/A

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, \frac{1}{4}, 1\right)} \cdot J\right) \cdot -2 \]

      13. lower-*.f64 32.3

          \[\leadsto \left(\sqrt{\mathsf{fma}\left(\frac{U \cdot U}{J \cdot J}, 0.25, 1\right)} \cdot J\right) \cdot -2 \]

   4. Applied rewrites 32.3%

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

   if -9.9999999999999997e-155 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 9: 61.1% accurate, 0.5× 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}{\left(2 \cdot J\_m\right) \cdot t\_0}\right)}^{2}}\\ J\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-U\_m\\ \mathbf{elif}\;t\_1 \leq -2 \cdot 10^{-272}:\\ \;\;\;\;\mathsf{fma}\left(-2, J\_m, -0.25 \cdot \frac{U\_m \cdot U\_m}{J\_m}\right)\\ \mathbf{else}:\\ \;\;\;\;U\_m\\ \end{array} \end{array} \end{array} \]

FPCore

U_m = (fabs.f64 U)
J\_m = (fabs.f64 J)
J\_s = (copysign.f64 #s(literal 1 binary64) J)
(FPCore (J_s J_m K U_m)
 :precision binary64
 (let* ((t_0 (cos (/ K 2.0)))
        (t_1
         (*
          (* (* -2.0 J_m) t_0)
          (sqrt (+ 1.0 (pow (/ U_m (* (* 2.0 J_m) t_0)) 2.0))))))
   (*
    J_s
    (if (<= t_1 (- INFINITY))
      (- U_m)
      (if (<= t_1 -2e-272)
        (fma -2.0 J_m (* -0.25 (/ (* U_m U_m) 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 t_0 = cos((K / 2.0));
	double t_1 = ((-2.0 * J_m) * t_0) * sqrt((1.0 + pow((U_m / ((2.0 * J_m) * t_0)), 2.0)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = -U_m;
	} else if (t_1 <= -2e-272) {
		tmp = fma(-2.0, J_m, (-0.25 * ((U_m * U_m) / 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)
	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(Float64(2.0 * J_m) * t_0)) ^ 2.0))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(-U_m);
	elseif (t_1 <= -2e-272)
		tmp = fma(-2.0, J_m, Float64(-0.25 * Float64(Float64(U_m * U_m) / J_m)));
	else
		tmp = U_m;
	end
	return Float64(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[(N[(2.0 * J$95$m), $MachinePrecision] * t$95$0), $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, -2e-272], N[(-2.0 * J$95$m + N[(-0.25 * N[(N[(U$95$m * U$95$m), $MachinePrecision] / J$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], U$95$m]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

      \[\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.99999999999999986e-272

   1. Initial program 72.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. Taylor expanded in U around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{{U}^{2}}{J \cdot \cos \left(\frac{1}{2} \cdot K\right)}, \frac{-1}{4}, -2 \cdot \left(J \cdot \cos \left(\frac{1}{2} \cdot K\right)\right)\right) \]

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-cos.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

   4. Applied rewrites 49.6%

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

   5. Taylor expanded in K around 0

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

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-2, J, \frac{-1}{4} \cdot \frac{{U}^{2}}{J}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-2, J, \frac{-1}{4} \cdot \frac{{U}^{2}}{J}\right) \]

      3. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(-2, J, \frac{-1}{4} \cdot \frac{{U}^{2}}{J}\right) \]

      4. pow2 N/A

         \[\leadsto \mathsf{fma}\left(-2, J, \frac{-1}{4} \cdot \frac{U \cdot U}{J}\right) \]

      5. lift-*.f64 28.3

         \[\leadsto \mathsf{fma}\left(-2, J, -0.25 \cdot \frac{U \cdot U}{J}\right) \]

   7. Applied rewrites 28.3%

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

   if -1.99999999999999986e-272 < (*.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 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 52.4% accurate, 2.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}\;\cos \left(\frac{K}{2}\right) \leq -5 \cdot 10^{-310}:\\ \;\;\;\;U\_m\\ \mathbf{else}:\\ \;\;\;\;-U\_m\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

U_m =     private
J\_m =     private
J\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(j_s, j_m, k, u_m)
use fmin_fmax_functions
    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 (cos((k / 2.0d0)) <= (-5d-310)) then
        tmp = u_m
    else
        tmp = -u_m
    end if
    code = j_s * tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (cos.f64 (/.f64 K #s(literal 2 binary64))) < -4.999999999999985e-310

   1. Initial program 72.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. Taylor expanded in U around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

   4. Applied rewrites 12.1%

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

   5. Taylor expanded in J around 0

      \[\leadsto U \]
   6. Step-by-step derivation

   7. Applied rewrites 14.3%

      \[\leadsto U \]

   if -4.999999999999985e-310 < (cos.f64 (/.f64 K #s(literal 2 binary64)))

   1. Initial program 72.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. Taylor expanded in J around 0

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(U\right) \]

      2. lower-neg.f64 39.5

         \[\leadsto -U \]

   4. Applied rewrites 39.5%

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

Alternative 11: 14.3% accurate, 110.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 =     private
J\_m =     private
J\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(j_s, j_m, k, u_m)
use fmin_fmax_functions
    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 72.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. Taylor expanded in U around -inf

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

   1. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower-neg.f64 N/A

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

   5. lower--.f64 N/A

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

4. Applied rewrites 12.1%

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

5. Taylor expanded in J around 0

   \[\leadsto U \]
6. Step-by-step derivation

7. Applied rewrites 14.3%

   \[\leadsto U \]
8. Add Preprocessing

Reproduce

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