
(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))))))
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)));
}
real(8) function code(j, k, u)
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8), intent (in) :: u
real(8) :: t_0
t_0 = cos((k / 2.0d0))
code = (((-2.0d0) * j) * t_0) * sqrt((1.0d0 + ((u / ((2.0d0 * j) * t_0)) ** 2.0d0)))
end function
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)));
}
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)))
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
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
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]]
\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}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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))))))
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)));
}
real(8) function code(j, k, u)
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8), intent (in) :: u
real(8) :: t_0
t_0 = cos((k / 2.0d0))
code = (((-2.0d0) * j) * t_0) * sqrt((1.0d0 + ((u / ((2.0d0 * j) * t_0)) ** 2.0d0)))
end function
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)));
}
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)))
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
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
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]]
\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}
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(let* ((t_0 (cos (/ K 2.0)))
(t_1
(*
(* t_0 (* -2.0 J))
(sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J 2.0))) 2.0))))))
(if (<= t_1 (- INFINITY)) (- U_m) (if (<= t_1 1e+297) t_1 U_m))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double t_0 = cos((K / 2.0));
double t_1 = (t_0 * (-2.0 * J)) * sqrt((1.0 + pow((U_m / (t_0 * (J * 2.0))), 2.0)));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = -U_m;
} else if (t_1 <= 1e+297) {
tmp = t_1;
} else {
tmp = U_m;
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double t_0 = Math.cos((K / 2.0));
double t_1 = (t_0 * (-2.0 * J)) * Math.sqrt((1.0 + Math.pow((U_m / (t_0 * (J * 2.0))), 2.0)));
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = -U_m;
} else if (t_1 <= 1e+297) {
tmp = t_1;
} else {
tmp = U_m;
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): t_0 = math.cos((K / 2.0)) t_1 = (t_0 * (-2.0 * J)) * math.sqrt((1.0 + math.pow((U_m / (t_0 * (J * 2.0))), 2.0))) tmp = 0 if t_1 <= -math.inf: tmp = -U_m elif t_1 <= 1e+297: tmp = t_1 else: tmp = U_m return tmp
U_m = abs(U) function code(J, K, U_m) t_0 = cos(Float64(K / 2.0)) t_1 = Float64(Float64(t_0 * Float64(-2.0 * J)) * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_0 * Float64(J * 2.0))) ^ 2.0)))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(-U_m); elseif (t_1 <= 1e+297) tmp = t_1; else tmp = U_m; end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) t_0 = cos((K / 2.0)); t_1 = (t_0 * (-2.0 * J)) * sqrt((1.0 + ((U_m / (t_0 * (J * 2.0))) ^ 2.0))); tmp = 0.0; if (t_1 <= -Inf) tmp = -U_m; elseif (t_1 <= 1e+297) tmp = t_1; else tmp = U_m; end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision]
code[J_, K_, U$95$m_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(t$95$0 * N[(J * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], (-U$95$m), If[LessEqual[t$95$1, 1e+297], t$95$1, U$95$m]]]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K}{2}\right)\\
t_1 := \left(t\_0 \cdot \left(-2 \cdot J\right)\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{t\_0 \cdot \left(J \cdot 2\right)}\right)}^{2}}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;-U\_m\\
\mathbf{elif}\;t\_1 \leq 10^{+297}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;U\_m\\
\end{array}
\end{array}
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.0Initial program 4.9%
Simplified70.8%
Taylor expanded in J around 0 33.8%
neg-mul-133.8%
Simplified33.8%
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))))) < 1e297Initial program 99.8%
if 1e297 < (*.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))))) Initial program 5.8%
Simplified56.8%
Taylor expanded in U around -inf 69.4%
Final simplification86.6%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(if (<= J 2.2e-249)
(- U_m)
(*
J
(*
(* -2.0 (cos (/ K 2.0)))
(hypot 1.0 (/ (/ (/ U_m J) 2.0) (cos (* K 0.5))))))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (J <= 2.2e-249) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (((U_m / J) / 2.0) / cos((K * 0.5)))));
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (J <= 2.2e-249) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, (((U_m / J) / 2.0) / Math.cos((K * 0.5)))));
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if J <= 2.2e-249: tmp = -U_m else: tmp = J * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, (((U_m / J) / 2.0) / math.cos((K * 0.5))))) return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (J <= 2.2e-249) tmp = Float64(-U_m); else tmp = Float64(J * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(Float64(Float64(U_m / J) / 2.0) / cos(Float64(K * 0.5)))))); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (J <= 2.2e-249) tmp = -U_m; else tmp = J * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (((U_m / J) / 2.0) / cos((K * 0.5))))); end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[J, 2.2e-249], (-U$95$m), N[(J * N[(N[(-2.0 * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(N[(U$95$m / J), $MachinePrecision] / 2.0), $MachinePrecision] / N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;J \leq 2.2 \cdot 10^{-249}:\\
\;\;\;\;-U\_m\\
\mathbf{else}:\\
\;\;\;\;J \cdot \left(\left(-2 \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{\frac{U\_m}{J}}{2}}{\cos \left(K \cdot 0.5\right)}\right)\right)\\
\end{array}
\end{array}
if J < 2.2e-249Initial program 70.4%
Simplified87.7%
Taylor expanded in J around 0 24.8%
neg-mul-124.8%
Simplified24.8%
if 2.2e-249 < J Initial program 83.1%
Simplified95.4%
clear-num95.3%
inv-pow95.3%
associate-/l*95.3%
div-inv95.3%
metadata-eval95.3%
div-inv95.3%
metadata-eval95.3%
Applied egg-rr95.3%
unpow-195.3%
associate-*r/95.3%
*-commutative95.3%
Simplified95.3%
times-frac95.3%
associate-/r*95.4%
clear-num95.4%
*-commutative95.4%
metadata-eval95.4%
div-inv95.4%
div-inv95.4%
metadata-eval95.4%
associate-/l/95.4%
associate-/r*95.4%
frac-2neg95.4%
div-inv95.4%
distribute-neg-frac295.4%
distribute-rgt-neg-in95.4%
metadata-eval95.4%
div-inv95.4%
metadata-eval95.4%
Applied egg-rr95.4%
associate-*r/95.4%
*-rgt-identity95.4%
distribute-neg-frac295.4%
distribute-neg-frac95.4%
associate-/r*95.4%
distribute-neg-frac295.4%
metadata-eval95.4%
*-commutative95.4%
Simplified95.4%
Final simplification54.6%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(let* ((t_0 (cos (/ K 2.0))))
(if (<= J 1.55e-249)
(- U_m)
(* J (* (* -2.0 t_0) (hypot 1.0 (/ (/ U_m 2.0) (* J t_0))))))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double t_0 = cos((K / 2.0));
double tmp;
if (J <= 1.55e-249) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * t_0) * hypot(1.0, ((U_m / 2.0) / (J * t_0))));
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double t_0 = Math.cos((K / 2.0));
double tmp;
if (J <= 1.55e-249) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * t_0) * Math.hypot(1.0, ((U_m / 2.0) / (J * t_0))));
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): t_0 = math.cos((K / 2.0)) tmp = 0 if J <= 1.55e-249: tmp = -U_m else: tmp = J * ((-2.0 * t_0) * math.hypot(1.0, ((U_m / 2.0) / (J * t_0)))) return tmp
U_m = abs(U) function code(J, K, U_m) t_0 = cos(Float64(K / 2.0)) tmp = 0.0 if (J <= 1.55e-249) tmp = Float64(-U_m); else tmp = Float64(J * Float64(Float64(-2.0 * t_0) * hypot(1.0, Float64(Float64(U_m / 2.0) / Float64(J * t_0))))); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) t_0 = cos((K / 2.0)); tmp = 0.0; if (J <= 1.55e-249) tmp = -U_m; else tmp = J * ((-2.0 * t_0) * hypot(1.0, ((U_m / 2.0) / (J * t_0)))); end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision]
code[J_, K_, U$95$m_] := Block[{t$95$0 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[J, 1.55e-249], (-U$95$m), N[(J * N[(N[(-2.0 * t$95$0), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / N[(J * t$95$0), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K}{2}\right)\\
\mathbf{if}\;J \leq 1.55 \cdot 10^{-249}:\\
\;\;\;\;-U\_m\\
\mathbf{else}:\\
\;\;\;\;J \cdot \left(\left(-2 \cdot t\_0\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{2}}{J \cdot t\_0}\right)\right)\\
\end{array}
\end{array}
if J < 1.54999999999999993e-249Initial program 70.4%
Simplified87.7%
Taylor expanded in J around 0 24.8%
neg-mul-124.8%
Simplified24.8%
if 1.54999999999999993e-249 < J Initial program 83.1%
Simplified95.4%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(if (<= J 1.2e-247)
(- U_m)
(*
J
(*
(* -2.0 (cos (/ K 2.0)))
(hypot 1.0 (* U_m (/ (/ 0.5 J) (cos (* K 0.5)))))))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (J <= 1.2e-247) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (U_m * ((0.5 / J) / cos((K * 0.5))))));
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (J <= 1.2e-247) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, (U_m * ((0.5 / J) / Math.cos((K * 0.5))))));
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if J <= 1.2e-247: tmp = -U_m else: tmp = J * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, (U_m * ((0.5 / J) / math.cos((K * 0.5)))))) return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (J <= 1.2e-247) tmp = Float64(-U_m); else tmp = Float64(J * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(U_m * Float64(Float64(0.5 / J) / cos(Float64(K * 0.5))))))); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (J <= 1.2e-247) tmp = -U_m; else tmp = J * ((-2.0 * cos((K / 2.0))) * hypot(1.0, (U_m * ((0.5 / J) / cos((K * 0.5)))))); end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[J, 1.2e-247], (-U$95$m), N[(J * N[(N[(-2.0 * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(U$95$m * N[(N[(0.5 / J), $MachinePrecision] / N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;J \leq 1.2 \cdot 10^{-247}:\\
\;\;\;\;-U\_m\\
\mathbf{else}:\\
\;\;\;\;J \cdot \left(\left(-2 \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \mathsf{hypot}\left(1, U\_m \cdot \frac{\frac{0.5}{J}}{\cos \left(K \cdot 0.5\right)}\right)\right)\\
\end{array}
\end{array}
if J < 1.20000000000000005e-247Initial program 70.4%
Simplified87.7%
Taylor expanded in J around 0 24.8%
neg-mul-124.8%
Simplified24.8%
if 1.20000000000000005e-247 < J Initial program 83.1%
Simplified95.4%
associate-/r*95.4%
associate-*l*95.4%
clear-num95.3%
associate-/r/95.3%
*-commutative95.3%
associate-/r*95.3%
*-commutative95.3%
associate-/r*95.3%
metadata-eval95.3%
div-inv95.3%
metadata-eval95.3%
Applied egg-rr95.3%
Final simplification54.6%
U_m = (fabs.f64 U) (FPCore (J K U_m) :precision binary64 (if (<= J 5e-202) (- U_m) (* J (* (* -2.0 (cos (/ K 2.0))) (hypot 1.0 (/ (/ U_m 2.0) J))))))
U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (J <= 5e-202) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * cos((K / 2.0))) * hypot(1.0, ((U_m / 2.0) / J)));
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (J <= 5e-202) {
tmp = -U_m;
} else {
tmp = J * ((-2.0 * Math.cos((K / 2.0))) * Math.hypot(1.0, ((U_m / 2.0) / J)));
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if J <= 5e-202: tmp = -U_m else: tmp = J * ((-2.0 * math.cos((K / 2.0))) * math.hypot(1.0, ((U_m / 2.0) / J))) return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (J <= 5e-202) tmp = Float64(-U_m); else tmp = Float64(J * Float64(Float64(-2.0 * cos(Float64(K / 2.0))) * hypot(1.0, Float64(Float64(U_m / 2.0) / J)))); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (J <= 5e-202) tmp = -U_m; else tmp = J * ((-2.0 * cos((K / 2.0))) * hypot(1.0, ((U_m / 2.0) / J))); end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[J, 5e-202], (-U$95$m), N[(J * N[(N[(-2.0 * N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(N[(U$95$m / 2.0), $MachinePrecision] / J), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;J \leq 5 \cdot 10^{-202}:\\
\;\;\;\;-U\_m\\
\mathbf{else}:\\
\;\;\;\;J \cdot \left(\left(-2 \cdot \cos \left(\frac{K}{2}\right)\right) \cdot \mathsf{hypot}\left(1, \frac{\frac{U\_m}{2}}{J}\right)\right)\\
\end{array}
\end{array}
if J < 4.99999999999999973e-202Initial program 69.2%
Simplified87.5%
Taylor expanded in J around 0 26.0%
neg-mul-126.0%
Simplified26.0%
if 4.99999999999999973e-202 < J Initial program 86.9%
Simplified96.8%
Taylor expanded in K around 0 82.9%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(if (<= U_m 4.8e-118)
(* J (* -2.0 (cos (* K 0.5))))
(if (<= U_m 1.66e+224)
(* (* -2.0 J) (hypot 1.0 (/ U_m (* J 2.0))))
(- U_m))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (U_m <= 4.8e-118) {
tmp = J * (-2.0 * cos((K * 0.5)));
} else if (U_m <= 1.66e+224) {
tmp = (-2.0 * J) * hypot(1.0, (U_m / (J * 2.0)));
} else {
tmp = -U_m;
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (U_m <= 4.8e-118) {
tmp = J * (-2.0 * Math.cos((K * 0.5)));
} else if (U_m <= 1.66e+224) {
tmp = (-2.0 * J) * Math.hypot(1.0, (U_m / (J * 2.0)));
} else {
tmp = -U_m;
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if U_m <= 4.8e-118: tmp = J * (-2.0 * math.cos((K * 0.5))) elif U_m <= 1.66e+224: tmp = (-2.0 * J) * math.hypot(1.0, (U_m / (J * 2.0))) else: tmp = -U_m return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (U_m <= 4.8e-118) tmp = Float64(J * Float64(-2.0 * cos(Float64(K * 0.5)))); elseif (U_m <= 1.66e+224) tmp = Float64(Float64(-2.0 * J) * hypot(1.0, Float64(U_m / Float64(J * 2.0)))); else tmp = Float64(-U_m); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (U_m <= 4.8e-118) tmp = J * (-2.0 * cos((K * 0.5))); elseif (U_m <= 1.66e+224) tmp = (-2.0 * J) * hypot(1.0, (U_m / (J * 2.0))); else tmp = -U_m; end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[U$95$m, 4.8e-118], N[(J * N[(-2.0 * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[U$95$m, 1.66e+224], N[(N[(-2.0 * J), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(U$95$m / N[(J * 2.0), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], (-U$95$m)]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;U\_m \leq 4.8 \cdot 10^{-118}:\\
\;\;\;\;J \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\right)\right)\\
\mathbf{elif}\;U\_m \leq 1.66 \cdot 10^{+224}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \mathsf{hypot}\left(1, \frac{U\_m}{J \cdot 2}\right)\\
\mathbf{else}:\\
\;\;\;\;-U\_m\\
\end{array}
\end{array}
if U < 4.8000000000000003e-118Initial program 81.4%
Simplified93.0%
Taylor expanded in U around 0 60.2%
if 4.8000000000000003e-118 < U < 1.65999999999999996e224Initial program 67.3%
unpow267.3%
hypot-1-def92.5%
associate-/r*92.3%
cos-neg92.3%
distribute-frac-neg92.3%
associate-/r*92.5%
hypot-1-def67.3%
unpow267.3%
Simplified92.3%
add-sqr-sqrt75.5%
pow275.5%
div-inv75.5%
metadata-eval75.5%
Applied egg-rr75.5%
Taylor expanded in K around 0 66.4%
Taylor expanded in K around 0 73.2%
*-commutative73.2%
Simplified73.2%
if 1.65999999999999996e224 < U Initial program 34.2%
Simplified50.7%
Taylor expanded in J around 0 36.4%
neg-mul-136.4%
Simplified36.4%
Final simplification62.5%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(if (<= U_m 1.4e-119)
(* J (* -2.0 (cos (* K 0.5))))
(if (<= U_m 1.66e+224)
(* (* -2.0 J) (hypot 1.0 (* U_m (/ 0.5 J))))
(- U_m))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (U_m <= 1.4e-119) {
tmp = J * (-2.0 * cos((K * 0.5)));
} else if (U_m <= 1.66e+224) {
tmp = (-2.0 * J) * hypot(1.0, (U_m * (0.5 / J)));
} else {
tmp = -U_m;
}
return tmp;
}
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (U_m <= 1.4e-119) {
tmp = J * (-2.0 * Math.cos((K * 0.5)));
} else if (U_m <= 1.66e+224) {
tmp = (-2.0 * J) * Math.hypot(1.0, (U_m * (0.5 / J)));
} else {
tmp = -U_m;
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if U_m <= 1.4e-119: tmp = J * (-2.0 * math.cos((K * 0.5))) elif U_m <= 1.66e+224: tmp = (-2.0 * J) * math.hypot(1.0, (U_m * (0.5 / J))) else: tmp = -U_m return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (U_m <= 1.4e-119) tmp = Float64(J * Float64(-2.0 * cos(Float64(K * 0.5)))); elseif (U_m <= 1.66e+224) tmp = Float64(Float64(-2.0 * J) * hypot(1.0, Float64(U_m * Float64(0.5 / J)))); else tmp = Float64(-U_m); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (U_m <= 1.4e-119) tmp = J * (-2.0 * cos((K * 0.5))); elseif (U_m <= 1.66e+224) tmp = (-2.0 * J) * hypot(1.0, (U_m * (0.5 / J))); else tmp = -U_m; end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[U$95$m, 1.4e-119], N[(J * N[(-2.0 * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[U$95$m, 1.66e+224], N[(N[(-2.0 * J), $MachinePrecision] * N[Sqrt[1.0 ^ 2 + N[(U$95$m * N[(0.5 / J), $MachinePrecision]), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision], (-U$95$m)]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;U\_m \leq 1.4 \cdot 10^{-119}:\\
\;\;\;\;J \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\right)\right)\\
\mathbf{elif}\;U\_m \leq 1.66 \cdot 10^{+224}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \mathsf{hypot}\left(1, U\_m \cdot \frac{0.5}{J}\right)\\
\mathbf{else}:\\
\;\;\;\;-U\_m\\
\end{array}
\end{array}
if U < 1.4e-119Initial program 81.4%
Simplified93.0%
Taylor expanded in U around 0 60.2%
if 1.4e-119 < U < 1.65999999999999996e224Initial program 67.3%
unpow267.3%
hypot-1-def92.5%
associate-/r*92.3%
cos-neg92.3%
distribute-frac-neg92.3%
associate-/r*92.5%
hypot-1-def67.3%
unpow267.3%
Simplified92.3%
add-sqr-sqrt75.5%
pow275.5%
div-inv75.5%
metadata-eval75.5%
Applied egg-rr75.5%
Taylor expanded in K around 0 66.4%
Taylor expanded in K around 0 37.4%
associate-*r*37.4%
*-commutative37.4%
rem-cube-cbrt36.1%
*-commutative36.1%
metadata-eval36.1%
metadata-eval36.1%
unpow236.1%
unpow236.1%
times-frac49.1%
swap-sqr49.1%
hypot-undefine70.6%
associate-*r/70.6%
*-commutative70.6%
associate-*r/70.6%
rem-cube-cbrt73.1%
Simplified73.1%
if 1.65999999999999996e224 < U Initial program 34.2%
Simplified50.7%
Taylor expanded in J around 0 36.4%
neg-mul-136.4%
Simplified36.4%
Final simplification62.5%
U_m = (fabs.f64 U) (FPCore (J K U_m) :precision binary64 (if (<= J 4.6e-10) (- (/ (* -2.0 (pow J 2.0)) U_m) U_m) (* J (* -2.0 (cos (* K 0.5))))))
U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (J <= 4.6e-10) {
tmp = ((-2.0 * pow(J, 2.0)) / U_m) - U_m;
} else {
tmp = J * (-2.0 * cos((K * 0.5)));
}
return tmp;
}
U_m = abs(u)
real(8) function code(j, k, u_m)
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8), intent (in) :: u_m
real(8) :: tmp
if (j <= 4.6d-10) then
tmp = (((-2.0d0) * (j ** 2.0d0)) / u_m) - u_m
else
tmp = j * ((-2.0d0) * cos((k * 0.5d0)))
end if
code = tmp
end function
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (J <= 4.6e-10) {
tmp = ((-2.0 * Math.pow(J, 2.0)) / U_m) - U_m;
} else {
tmp = J * (-2.0 * Math.cos((K * 0.5)));
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if J <= 4.6e-10: tmp = ((-2.0 * math.pow(J, 2.0)) / U_m) - U_m else: tmp = J * (-2.0 * math.cos((K * 0.5))) return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (J <= 4.6e-10) tmp = Float64(Float64(Float64(-2.0 * (J ^ 2.0)) / U_m) - U_m); else tmp = Float64(J * Float64(-2.0 * cos(Float64(K * 0.5)))); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (J <= 4.6e-10) tmp = ((-2.0 * (J ^ 2.0)) / U_m) - U_m; else tmp = J * (-2.0 * cos((K * 0.5))); end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[J, 4.6e-10], N[(N[(N[(-2.0 * N[Power[J, 2.0], $MachinePrecision]), $MachinePrecision] / U$95$m), $MachinePrecision] - U$95$m), $MachinePrecision], N[(J * N[(-2.0 * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;J \leq 4.6 \cdot 10^{-10}:\\
\;\;\;\;\frac{-2 \cdot {J}^{2}}{U\_m} - U\_m\\
\mathbf{else}:\\
\;\;\;\;J \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if J < 4.60000000000000014e-10Initial program 70.2%
Simplified88.6%
Taylor expanded in J around 0 23.5%
neg-mul-123.5%
unsub-neg23.5%
associate-*r/23.5%
unpow223.5%
*-commutative23.5%
unpow223.5%
swap-sqr23.5%
unpow223.5%
*-commutative23.5%
Simplified23.5%
Taylor expanded in K around 0 23.5%
if 4.60000000000000014e-10 < J Initial program 96.2%
Simplified99.6%
Taylor expanded in U around 0 86.1%
Final simplification37.0%
U_m = (fabs.f64 U) (FPCore (J K U_m) :precision binary64 (if (<= J 8.8e-11) (- U_m) (* J (* -2.0 (cos (* K 0.5))))))
U_m = fabs(U);
double code(double J, double K, double U_m) {
double tmp;
if (J <= 8.8e-11) {
tmp = -U_m;
} else {
tmp = J * (-2.0 * cos((K * 0.5)));
}
return tmp;
}
U_m = abs(u)
real(8) function code(j, k, u_m)
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8), intent (in) :: u_m
real(8) :: tmp
if (j <= 8.8d-11) then
tmp = -u_m
else
tmp = j * ((-2.0d0) * cos((k * 0.5d0)))
end if
code = tmp
end function
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
double tmp;
if (J <= 8.8e-11) {
tmp = -U_m;
} else {
tmp = J * (-2.0 * Math.cos((K * 0.5)));
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): tmp = 0 if J <= 8.8e-11: tmp = -U_m else: tmp = J * (-2.0 * math.cos((K * 0.5))) return tmp
U_m = abs(U) function code(J, K, U_m) tmp = 0.0 if (J <= 8.8e-11) tmp = Float64(-U_m); else tmp = Float64(J * Float64(-2.0 * cos(Float64(K * 0.5)))); end return tmp end
U_m = abs(U); function tmp_2 = code(J, K, U_m) tmp = 0.0; if (J <= 8.8e-11) tmp = -U_m; else tmp = J * (-2.0 * cos((K * 0.5))); end tmp_2 = tmp; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := If[LessEqual[J, 8.8e-11], (-U$95$m), N[(J * N[(-2.0 * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
\mathbf{if}\;J \leq 8.8 \cdot 10^{-11}:\\
\;\;\;\;-U\_m\\
\mathbf{else}:\\
\;\;\;\;J \cdot \left(-2 \cdot \cos \left(K \cdot 0.5\right)\right)\\
\end{array}
\end{array}
if J < 8.8000000000000006e-11Initial program 70.2%
Simplified88.6%
Taylor expanded in J around 0 24.3%
neg-mul-124.3%
Simplified24.3%
if 8.8000000000000006e-11 < J Initial program 96.2%
Simplified99.6%
Taylor expanded in U around 0 86.1%
Final simplification37.6%
U_m = (fabs.f64 U) (FPCore (J K U_m) :precision binary64 (- U_m))
U_m = fabs(U);
double code(double J, double K, double U_m) {
return -U_m;
}
U_m = abs(u)
real(8) function code(j, k, u_m)
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8), intent (in) :: u_m
code = -u_m
end function
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
return -U_m;
}
U_m = math.fabs(U) def code(J, K, U_m): return -U_m
U_m = abs(U) function code(J, K, U_m) return Float64(-U_m) end
U_m = abs(U); function tmp = code(J, K, U_m) tmp = -U_m; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := (-U$95$m)
\begin{array}{l}
U_m = \left|U\right|
\\
-U\_m
\end{array}
Initial program 75.8%
Simplified91.0%
Taylor expanded in J around 0 20.3%
neg-mul-120.3%
Simplified20.3%
U_m = (fabs.f64 U) (FPCore (J K U_m) :precision binary64 U_m)
U_m = fabs(U);
double code(double J, double K, double U_m) {
return U_m;
}
U_m = abs(u)
real(8) function code(j, k, u_m)
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8), intent (in) :: u_m
code = u_m
end function
U_m = Math.abs(U);
public static double code(double J, double K, double U_m) {
return U_m;
}
U_m = math.fabs(U) def code(J, K, U_m): return U_m
U_m = abs(U) function code(J, K, U_m) return U_m end
U_m = abs(U); function tmp = code(J, K, U_m) tmp = U_m; end
U_m = N[Abs[U], $MachinePrecision] code[J_, K_, U$95$m_] := U$95$m
\begin{array}{l}
U_m = \left|U\right|
\\
U\_m
\end{array}
Initial program 75.8%
Simplified91.0%
Taylor expanded in U around -inf 30.9%
herbie shell --seed 2024149
(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)))))