
(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 12 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))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_1 1e+308) 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 = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_1 <= 1e+308) {
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 = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_1 <= 1e+308) tmp = t_1; else tmp = U_m; end return 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)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], 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:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+308}:\\
\;\;\;\;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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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))))) < 1e308Initial program 99.8%
if 1e308 < (*.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.9%
Taylor expanded in U around -inf
Simplified47.1%
Final simplification86.3%
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)))
(t_2 (* t_1 (sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J 2.0))) 2.0)))))
(t_3 (* (sqrt (+ 1.0 (pow (/ U_m (* J 2.0)) 2.0))) (* -2.0 J))))
(if (<= t_2 (- INFINITY))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_2 -4e+161)
t_3
(if (<= t_2 -5e-147)
(* t_1 (sqrt (fma 0.25 (/ (* U_m U_m) (* J J)) 1.0)))
(if (<= t_2 -5e-292)
t_3
(if (<= t_2 1e+308) (* (* -2.0 J) (cos (* K 0.5))) 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);
double t_2 = t_1 * sqrt((1.0 + pow((U_m / (t_0 * (J * 2.0))), 2.0)));
double t_3 = sqrt((1.0 + pow((U_m / (J * 2.0)), 2.0))) * (-2.0 * J);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_2 <= -4e+161) {
tmp = t_3;
} else if (t_2 <= -5e-147) {
tmp = t_1 * sqrt(fma(0.25, ((U_m * U_m) / (J * J)), 1.0));
} else if (t_2 <= -5e-292) {
tmp = t_3;
} else if (t_2 <= 1e+308) {
tmp = (-2.0 * J) * cos((K * 0.5));
} 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(t_0 * Float64(-2.0 * J)) t_2 = Float64(t_1 * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_0 * Float64(J * 2.0))) ^ 2.0)))) t_3 = Float64(sqrt(Float64(1.0 + (Float64(U_m / Float64(J * 2.0)) ^ 2.0))) * Float64(-2.0 * J)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_2 <= -4e+161) tmp = t_3; elseif (t_2 <= -5e-147) tmp = Float64(t_1 * sqrt(fma(0.25, Float64(Float64(U_m * U_m) / Float64(J * J)), 1.0))); elseif (t_2 <= -5e-292) tmp = t_3; elseif (t_2 <= 1e+308) tmp = Float64(Float64(-2.0 * J) * cos(Float64(K * 0.5))); else tmp = U_m; end return 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[(t$95$0 * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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]}, Block[{t$95$3 = N[(N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(J * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$2, -4e+161], t$95$3, If[LessEqual[t$95$2, -5e-147], N[(t$95$1 * N[Sqrt[N[(0.25 * N[(N[(U$95$m * U$95$m), $MachinePrecision] / N[(J * J), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-292], t$95$3, If[LessEqual[t$95$2, 1e+308], N[(N[(-2.0 * J), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], U$95$m]]]]]]]]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K}{2}\right)\\
t_1 := t\_0 \cdot \left(-2 \cdot J\right)\\
t_2 := t\_1 \cdot \sqrt{1 + {\left(\frac{U\_m}{t\_0 \cdot \left(J \cdot 2\right)}\right)}^{2}}\\
t_3 := \sqrt{1 + {\left(\frac{U\_m}{J \cdot 2}\right)}^{2}} \cdot \left(-2 \cdot J\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{+161}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-147}:\\
\;\;\;\;t\_1 \cdot \sqrt{\mathsf{fma}\left(0.25, \frac{U\_m \cdot U\_m}{J \cdot J}, 1\right)}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq 10^{+308}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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.0000000000000002e161 or -5.00000000000000013e-147 < (*.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.99999999999999981e-292Initial program 99.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6488.4
Simplified88.4%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6458.9
Simplified58.9%
if -4.0000000000000002e161 < (*.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))))) < -5.00000000000000013e-147Initial program 99.8%
Taylor expanded in K around 0
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6495.3
Simplified95.3%
if -4.99999999999999981e-292 < (*.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))))) < 1e308Initial program 99.7%
Taylor expanded in J around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.4
Simplified67.4%
if 1e308 < (*.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.9%
Taylor expanded in U around -inf
Simplified47.1%
Final simplification66.3%
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))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_1 -2e+150)
(* -2.0 J)
(if (<= t_1 -3e-132)
(* (* -2.0 J) (sqrt (fma 0.25 (/ (* U_m U_m) (* J J)) 1.0)))
(if (<= t_1 -5e-292) (- U_m) 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 = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_1 <= -2e+150) {
tmp = -2.0 * J;
} else if (t_1 <= -3e-132) {
tmp = (-2.0 * J) * sqrt(fma(0.25, ((U_m * U_m) / (J * J)), 1.0));
} else if (t_1 <= -5e-292) {
tmp = -U_m;
} 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 = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_1 <= -2e+150) tmp = Float64(-2.0 * J); elseif (t_1 <= -3e-132) tmp = Float64(Float64(-2.0 * J) * sqrt(fma(0.25, Float64(Float64(U_m * U_m) / Float64(J * J)), 1.0))); elseif (t_1 <= -5e-292) tmp = Float64(-U_m); else tmp = U_m; end return 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)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$1, -2e+150], N[(-2.0 * J), $MachinePrecision], If[LessEqual[t$95$1, -3e-132], N[(N[(-2.0 * J), $MachinePrecision] * N[Sqrt[N[(0.25 * N[(N[(U$95$m * U$95$m), $MachinePrecision] / N[(J * J), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -5e-292], (-U$95$m), 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:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{+150}:\\
\;\;\;\;-2 \cdot J\\
\mathbf{elif}\;t\_1 \leq -3 \cdot 10^{-132}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \sqrt{\mathsf{fma}\left(0.25, \frac{U\_m \cdot U\_m}{J \cdot J}, 1\right)}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;-U\_m\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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.99999999999999996e150Initial program 99.9%
Taylor expanded in J around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6479.5
Simplified79.5%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6441.3
Simplified41.3%
if -1.99999999999999996e150 < (*.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))))) < -3e-132Initial program 99.8%
Taylor expanded in K around 0
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.1
Simplified69.1%
if -3e-132 < (*.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.99999999999999981e-292Initial program 100.0%
Taylor expanded in J around 0
mul-1-negN/A
neg-lowering-neg.f6421.6
Simplified21.6%
if -4.99999999999999981e-292 < (*.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 76.7%
Taylor expanded in U around -inf
Simplified26.3%
Final simplification39.1%
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))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_1 -5e-292)
(* (sqrt (+ 1.0 (pow (/ U_m (* J 2.0)) 2.0))) (* -2.0 J))
(if (<= t_1 1e+308) (* (* -2.0 J) (cos (* K 0.5))) 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 = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_1 <= -5e-292) {
tmp = sqrt((1.0 + pow((U_m / (J * 2.0)), 2.0))) * (-2.0 * J);
} else if (t_1 <= 1e+308) {
tmp = (-2.0 * J) * cos((K * 0.5));
} 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 = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_1 <= -5e-292) tmp = Float64(sqrt(Float64(1.0 + (Float64(U_m / Float64(J * 2.0)) ^ 2.0))) * Float64(-2.0 * J)); elseif (t_1 <= 1e+308) tmp = Float64(Float64(-2.0 * J) * cos(Float64(K * 0.5))); else tmp = U_m; end return 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)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$1, -5e-292], N[(N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(J * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], N[(N[(-2.0 * J), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 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:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;\sqrt{1 + {\left(\frac{U\_m}{J \cdot 2}\right)}^{2}} \cdot \left(-2 \cdot J\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+308}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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.99999999999999981e-292Initial program 99.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6492.1
Simplified92.1%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6463.2
Simplified63.2%
if -4.99999999999999981e-292 < (*.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))))) < 1e308Initial program 99.7%
Taylor expanded in J around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.4
Simplified67.4%
if 1e308 < (*.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.9%
Taylor expanded in U around -inf
Simplified47.1%
Final simplification60.5%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(let* ((t_0 (sqrt (/ U_m (* J 2.0))))
(t_1 (cos (/ K 2.0)))
(t_2
(*
(* t_1 (* -2.0 J))
(sqrt (+ 1.0 (pow (/ U_m (* t_1 (* J 2.0))) 2.0))))))
(if (<= t_2 (- INFINITY))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_2 -5e-292)
(* (* -2.0 J) (sqrt (fma (/ t_0 J) (/ t_0 (/ 2.0 U_m)) 1.0)))
(if (<= t_2 1e+308) (* (* -2.0 J) (cos (* K 0.5))) U_m)))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double t_0 = sqrt((U_m / (J * 2.0)));
double t_1 = cos((K / 2.0));
double t_2 = (t_1 * (-2.0 * J)) * sqrt((1.0 + pow((U_m / (t_1 * (J * 2.0))), 2.0)));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_2 <= -5e-292) {
tmp = (-2.0 * J) * sqrt(fma((t_0 / J), (t_0 / (2.0 / U_m)), 1.0));
} else if (t_2 <= 1e+308) {
tmp = (-2.0 * J) * cos((K * 0.5));
} else {
tmp = U_m;
}
return tmp;
}
U_m = abs(U) function code(J, K, U_m) t_0 = sqrt(Float64(U_m / Float64(J * 2.0))) t_1 = cos(Float64(K / 2.0)) t_2 = Float64(Float64(t_1 * Float64(-2.0 * J)) * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_1 * Float64(J * 2.0))) ^ 2.0)))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_2 <= -5e-292) tmp = Float64(Float64(-2.0 * J) * sqrt(fma(Float64(t_0 / J), Float64(t_0 / Float64(2.0 / U_m)), 1.0))); elseif (t_2 <= 1e+308) tmp = Float64(Float64(-2.0 * J) * cos(Float64(K * 0.5))); else tmp = U_m; end return tmp end
U_m = N[Abs[U], $MachinePrecision]
code[J_, K_, U$95$m_] := Block[{t$95$0 = N[Sqrt[N[(U$95$m / N[(J * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(t$95$1 * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(t$95$1 * N[(J * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$2, -5e-292], N[(N[(-2.0 * J), $MachinePrecision] * N[Sqrt[N[(N[(t$95$0 / J), $MachinePrecision] * N[(t$95$0 / N[(2.0 / U$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+308], N[(N[(-2.0 * J), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], U$95$m]]]]]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \sqrt{\frac{U\_m}{J \cdot 2}}\\
t_1 := \cos \left(\frac{K}{2}\right)\\
t_2 := \left(t\_1 \cdot \left(-2 \cdot J\right)\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{t\_1 \cdot \left(J \cdot 2\right)}\right)}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \sqrt{\mathsf{fma}\left(\frac{t\_0}{J}, \frac{t\_0}{\frac{2}{U\_m}}, 1\right)}\\
\mathbf{elif}\;t\_2 \leq 10^{+308}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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.99999999999999981e-292Initial program 99.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6492.1
Simplified92.1%
+-commutativeN/A
unpow2N/A
clear-numN/A
un-div-invN/A
unpow1N/A
sqr-powN/A
associate-/l*N/A
times-fracN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr54.6%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6438.1
Simplified38.1%
if -4.99999999999999981e-292 < (*.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))))) < 1e308Initial program 99.7%
Taylor expanded in J around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.4
Simplified67.4%
if 1e308 < (*.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.9%
Taylor expanded in U around -inf
Simplified47.1%
Final simplification50.8%
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))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_1 -3e-132) (* -2.0 J) (if (<= t_1 -5e-292) (- U_m) 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 = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_1 <= -3e-132) {
tmp = -2.0 * J;
} else if (t_1 <= -5e-292) {
tmp = -U_m;
} 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 = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_1 <= -3e-132) tmp = Float64(-2.0 * J); elseif (t_1 <= -5e-292) tmp = Float64(-U_m); else tmp = U_m; end return 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)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$1, -3e-132], N[(-2.0 * J), $MachinePrecision], If[LessEqual[t$95$1, -5e-292], (-U$95$m), 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:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_1 \leq -3 \cdot 10^{-132}:\\
\;\;\;\;-2 \cdot J\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;-U\_m\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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))))) < -3e-132Initial program 99.8%
Taylor expanded in J around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.1
Simplified83.1%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6449.1
Simplified49.1%
if -3e-132 < (*.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.99999999999999981e-292Initial program 100.0%
Taylor expanded in J around 0
mul-1-negN/A
neg-lowering-neg.f6421.6
Simplified21.6%
if -4.99999999999999981e-292 < (*.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 76.7%
Taylor expanded in U around -inf
Simplified26.3%
Final simplification36.6%
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 -3e-132) (* -2.0 J) (if (<= t_1 -5e-292) (- U_m) 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 <= -3e-132) {
tmp = -2.0 * J;
} else if (t_1 <= -5e-292) {
tmp = -U_m;
} 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 <= -3e-132) {
tmp = -2.0 * J;
} else if (t_1 <= -5e-292) {
tmp = -U_m;
} 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 <= -3e-132: tmp = -2.0 * J elif t_1 <= -5e-292: tmp = -U_m 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 <= -3e-132) tmp = Float64(-2.0 * J); elseif (t_1 <= -5e-292) tmp = Float64(-U_m); 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 <= -3e-132) tmp = -2.0 * J; elseif (t_1 <= -5e-292) tmp = -U_m; 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, -3e-132], N[(-2.0 * J), $MachinePrecision], If[LessEqual[t$95$1, -5e-292], (-U$95$m), 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 -3 \cdot 10^{-132}:\\
\;\;\;\;-2 \cdot J\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;-U\_m\\
\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.0 or -3e-132 < (*.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.99999999999999981e-292Initial program 30.3%
Taylor expanded in J around 0
mul-1-negN/A
neg-lowering-neg.f6439.9
Simplified39.9%
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))))) < -3e-132Initial program 99.8%
Taylor expanded in J around inf
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.1
Simplified83.1%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6449.1
Simplified49.1%
if -4.99999999999999981e-292 < (*.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 76.7%
Taylor expanded in U around -inf
Simplified26.3%
Final simplification36.6%
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)))
(t_2 (* t_1 (sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J 2.0))) 2.0))))))
(if (<= t_2 (- INFINITY))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_2 1e+308)
(* t_1 (sqrt (+ 1.0 (pow (/ U_m (* J 2.0)) 2.0))))
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);
double t_2 = t_1 * sqrt((1.0 + pow((U_m / (t_0 * (J * 2.0))), 2.0)));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_2 <= 1e+308) {
tmp = t_1 * sqrt((1.0 + pow((U_m / (J * 2.0)), 2.0)));
} 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(t_0 * Float64(-2.0 * J)) t_2 = Float64(t_1 * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_0 * Float64(J * 2.0))) ^ 2.0)))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_2 <= 1e+308) tmp = Float64(t_1 * sqrt(Float64(1.0 + (Float64(U_m / Float64(J * 2.0)) ^ 2.0)))); else tmp = U_m; end return 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[(t$95$0 * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 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$2, (-Infinity)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$2, 1e+308], N[(t$95$1 * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(J * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], U$95$m]]]]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K}{2}\right)\\
t_1 := t\_0 \cdot \left(-2 \cdot J\right)\\
t_2 := t\_1 \cdot \sqrt{1 + {\left(\frac{U\_m}{t\_0 \cdot \left(J \cdot 2\right)}\right)}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_2 \leq 10^{+308}:\\
\;\;\;\;t\_1 \cdot \sqrt{1 + {\left(\frac{U\_m}{J \cdot 2}\right)}^{2}}\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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))))) < 1e308Initial program 99.8%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6490.2
Simplified90.2%
if 1e308 < (*.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.9%
Taylor expanded in U around -inf
Simplified47.1%
Final simplification79.1%
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)))))
(t_2 (* U_m (/ 0.5 J))))
(if (<= t_1 (- INFINITY))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_1 1e+308)
(/
1.0
(/ (/ 1.0 (* (* -2.0 J) (cos (* K 0.5)))) (sqrt (fma t_2 t_2 1.0))))
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 t_2 = U_m * (0.5 / J);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_1 <= 1e+308) {
tmp = 1.0 / ((1.0 / ((-2.0 * J) * cos((K * 0.5)))) / sqrt(fma(t_2, t_2, 1.0)));
} 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)))) t_2 = Float64(U_m * Float64(0.5 / J)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_1 <= 1e+308) tmp = Float64(1.0 / Float64(Float64(1.0 / Float64(Float64(-2.0 * J) * cos(Float64(K * 0.5)))) / sqrt(fma(t_2, t_2, 1.0)))); else tmp = U_m; end return 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]}, Block[{t$95$2 = N[(U$95$m * N[(0.5 / J), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], N[(1.0 / N[(N[(1.0 / N[(N[(-2.0 * J), $MachinePrecision] * N[Cos[N[(K * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[N[(t$95$2 * t$95$2 + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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}}\\
t_2 := U\_m \cdot \frac{0.5}{J}\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+308}:\\
\;\;\;\;\frac{1}{\frac{\frac{1}{\left(-2 \cdot J\right) \cdot \cos \left(K \cdot 0.5\right)}}{\sqrt{\mathsf{fma}\left(t\_2, t\_2, 1\right)}}}\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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))))) < 1e308Initial program 99.8%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6490.2
Simplified90.2%
+-commutativeN/A
unpow2N/A
clear-numN/A
un-div-invN/A
unpow1N/A
sqr-powN/A
associate-/l*N/A
times-fracN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr50.6%
Applied egg-rr50.5%
associate-*l/N/A
clear-numN/A
/-lowering-/.f64N/A
*-lft-identityN/A
/-lowering-/.f64N/A
Applied egg-rr89.9%
if 1e308 < (*.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.9%
Taylor expanded in U around -inf
Simplified47.1%
Final simplification78.9%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(let* ((t_0 (sqrt (/ U_m (* J 2.0))))
(t_1 (cos (/ K 2.0)))
(t_2
(*
(* t_1 (* -2.0 J))
(sqrt (+ 1.0 (pow (/ U_m (* t_1 (* J 2.0))) 2.0))))))
(if (<= t_2 (- INFINITY))
(fma -2.0 (/ (* J J) U_m) (- U_m))
(if (<= t_2 -5e-292)
(* (* -2.0 J) (sqrt (fma (/ t_0 J) (/ t_0 (/ 2.0 U_m)) 1.0)))
U_m))))U_m = fabs(U);
double code(double J, double K, double U_m) {
double t_0 = sqrt((U_m / (J * 2.0)));
double t_1 = cos((K / 2.0));
double t_2 = (t_1 * (-2.0 * J)) * sqrt((1.0 + pow((U_m / (t_1 * (J * 2.0))), 2.0)));
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = fma(-2.0, ((J * J) / U_m), -U_m);
} else if (t_2 <= -5e-292) {
tmp = (-2.0 * J) * sqrt(fma((t_0 / J), (t_0 / (2.0 / U_m)), 1.0));
} else {
tmp = U_m;
}
return tmp;
}
U_m = abs(U) function code(J, K, U_m) t_0 = sqrt(Float64(U_m / Float64(J * 2.0))) t_1 = cos(Float64(K / 2.0)) t_2 = Float64(Float64(t_1 * Float64(-2.0 * J)) * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_1 * Float64(J * 2.0))) ^ 2.0)))) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = fma(-2.0, Float64(Float64(J * J) / U_m), Float64(-U_m)); elseif (t_2 <= -5e-292) tmp = Float64(Float64(-2.0 * J) * sqrt(fma(Float64(t_0 / J), Float64(t_0 / Float64(2.0 / U_m)), 1.0))); else tmp = U_m; end return tmp end
U_m = N[Abs[U], $MachinePrecision]
code[J_, K_, U$95$m_] := Block[{t$95$0 = N[Sqrt[N[(U$95$m / N[(J * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(K / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(t$95$1 * N[(-2.0 * J), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 + N[Power[N[(U$95$m / N[(t$95$1 * N[(J * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(-2.0 * N[(N[(J * J), $MachinePrecision] / U$95$m), $MachinePrecision] + (-U$95$m)), $MachinePrecision], If[LessEqual[t$95$2, -5e-292], N[(N[(-2.0 * J), $MachinePrecision] * N[Sqrt[N[(N[(t$95$0 / J), $MachinePrecision] * N[(t$95$0 / N[(2.0 / U$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], U$95$m]]]]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \sqrt{\frac{U\_m}{J \cdot 2}}\\
t_1 := \cos \left(\frac{K}{2}\right)\\
t_2 := \left(t\_1 \cdot \left(-2 \cdot J\right)\right) \cdot \sqrt{1 + {\left(\frac{U\_m}{t\_1 \cdot \left(J \cdot 2\right)}\right)}^{2}}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-2, \frac{J \cdot J}{U\_m}, -U\_m\right)\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-292}:\\
\;\;\;\;\left(-2 \cdot J\right) \cdot \sqrt{\mathsf{fma}\left(\frac{t\_0}{J}, \frac{t\_0}{\frac{2}{U\_m}}, 1\right)}\\
\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 6.4%
Taylor expanded in J around 0
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
pow-lowering-pow.f64N/A
cos-lowering-cos.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6446.1
Simplified46.1%
Taylor expanded in K around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6446.1
Simplified46.1%
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.99999999999999981e-292Initial program 99.9%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6492.1
Simplified92.1%
+-commutativeN/A
unpow2N/A
clear-numN/A
un-div-invN/A
unpow1N/A
sqr-powN/A
associate-/l*N/A
times-fracN/A
accelerator-lowering-fma.f64N/A
Applied egg-rr54.6%
Taylor expanded in K around 0
*-commutativeN/A
*-lowering-*.f6438.1
Simplified38.1%
if -4.99999999999999981e-292 < (*.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 76.7%
Taylor expanded in U around -inf
Simplified26.3%
Final simplification33.6%
U_m = (fabs.f64 U)
(FPCore (J K U_m)
:precision binary64
(let* ((t_0 (cos (/ K 2.0))))
(if (<=
(*
(* t_0 (* -2.0 J))
(sqrt (+ 1.0 (pow (/ U_m (* t_0 (* J 2.0))) 2.0))))
-5e-292)
(- U_m)
U_m)))U_m = fabs(U);
double code(double J, double K, double U_m) {
double t_0 = cos((K / 2.0));
double tmp;
if (((t_0 * (-2.0 * J)) * sqrt((1.0 + pow((U_m / (t_0 * (J * 2.0))), 2.0)))) <= -5e-292) {
tmp = -U_m;
} else {
tmp = U_m;
}
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) :: t_0
real(8) :: tmp
t_0 = cos((k / 2.0d0))
if (((t_0 * ((-2.0d0) * j)) * sqrt((1.0d0 + ((u_m / (t_0 * (j * 2.0d0))) ** 2.0d0)))) <= (-5d-292)) then
tmp = -u_m
else
tmp = u_m
end if
code = tmp
end function
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 (((t_0 * (-2.0 * J)) * Math.sqrt((1.0 + Math.pow((U_m / (t_0 * (J * 2.0))), 2.0)))) <= -5e-292) {
tmp = -U_m;
} else {
tmp = U_m;
}
return tmp;
}
U_m = math.fabs(U) def code(J, K, U_m): t_0 = math.cos((K / 2.0)) tmp = 0 if ((t_0 * (-2.0 * J)) * math.sqrt((1.0 + math.pow((U_m / (t_0 * (J * 2.0))), 2.0)))) <= -5e-292: tmp = -U_m else: tmp = U_m return tmp
U_m = abs(U) function code(J, K, U_m) t_0 = cos(Float64(K / 2.0)) tmp = 0.0 if (Float64(Float64(t_0 * Float64(-2.0 * J)) * sqrt(Float64(1.0 + (Float64(U_m / Float64(t_0 * Float64(J * 2.0))) ^ 2.0)))) <= -5e-292) tmp = Float64(-U_m); 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)); tmp = 0.0; if (((t_0 * (-2.0 * J)) * sqrt((1.0 + ((U_m / (t_0 * (J * 2.0))) ^ 2.0)))) <= -5e-292) tmp = -U_m; 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]}, If[LessEqual[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], -5e-292], (-U$95$m), U$95$m]]
\begin{array}{l}
U_m = \left|U\right|
\\
\begin{array}{l}
t_0 := \cos \left(\frac{K}{2}\right)\\
\mathbf{if}\;\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}} \leq -5 \cdot 10^{-292}:\\
\;\;\;\;-U\_m\\
\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))))) < -4.99999999999999981e-292Initial program 75.4%
Taylor expanded in J around 0
mul-1-negN/A
neg-lowering-neg.f6421.1
Simplified21.1%
if -4.99999999999999981e-292 < (*.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 76.7%
Taylor expanded in U around -inf
Simplified26.3%
Final simplification23.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 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 76.0%
Taylor expanded in U around -inf
Simplified25.7%
herbie shell --seed 2024198
(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)))))