
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1
(*
(* (* 2.0 n) U)
(+
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U* U))))))
(if (<= t_1 1e-68)
(sqrt
(*
2.0
(* U (* n (+ t (/ l (/ Om (fma -2.0 l (/ n (/ Om (* l U*)))))))))))
(if (<= t_1 2e+292)
(sqrt t_1)
(*
(* l (sqrt 2.0))
(pow (/ n (/ Om (* U (+ -2.0 (/ n (/ Om (- U* U))))))) 0.5))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = ((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) + ((n * pow((l / Om), 2.0)) * (U_42_ - U)));
double tmp;
if (t_1 <= 1e-68) {
tmp = sqrt((2.0 * (U * (n * (t + (l / (Om / fma(-2.0, l, (n / (Om / (l * U_42_)))))))))));
} else if (t_1 <= 2e+292) {
tmp = sqrt(t_1);
} else {
tmp = (l * sqrt(2.0)) * pow((n / (Om / (U * (-2.0 + (n / (Om / (U_42_ - U))))))), 0.5);
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) + Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U_42_ - U)))) tmp = 0.0 if (t_1 <= 1e-68) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(l / Float64(Om / fma(-2.0, l, Float64(n / Float64(Om / Float64(l * U_42_))))))))))); elseif (t_1 <= 2e+292) tmp = sqrt(t_1); else tmp = Float64(Float64(l * sqrt(2.0)) * (Float64(n / Float64(Om / Float64(U * Float64(-2.0 + Float64(n / Float64(Om / Float64(U_42_ - U))))))) ^ 0.5)); end return tmp end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1e-68], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(l / N[(Om / N[(-2.0 * l + N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$1, 2e+292], N[Sqrt[t$95$1], $MachinePrecision], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n / N[(Om / N[(U * N[(-2.0 + N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) + \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)\\
\mathbf{if}\;t_1 \leq 10^{-68}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell}{\frac{Om}{\mathsf{fma}\left(-2, \ell, \frac{n}{\frac{Om}{\ell \cdot U*}}\right)}}\right)\right)\right)}\\
\mathbf{elif}\;t_1 \leq 2 \cdot 10^{+292}:\\
\;\;\;\;\sqrt{t_1}\\
\mathbf{else}:\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot {\left(\frac{n}{\frac{Om}{U \cdot \left(-2 + \frac{n}{\frac{Om}{U* - U}}\right)}}\right)}^{0.5}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 1.00000000000000007e-68Initial program 43.1%
Simplified63.1%
Taylor expanded in U around 0 64.5%
associate-*r*68.6%
associate-/l*68.1%
fma-def68.1%
associate-/l*68.1%
Simplified68.1%
if 1.00000000000000007e-68 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 2e292Initial program 98.9%
if 2e292 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) Initial program 22.5%
Simplified36.8%
Taylor expanded in t around 0 38.8%
Taylor expanded in l around 0 22.9%
pow1/224.3%
associate-/l*25.6%
*-commutative25.6%
sub-neg25.6%
associate-/l*24.7%
metadata-eval24.7%
Applied egg-rr24.7%
Final simplification56.3%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (/ n (/ Om (- U* U)))))
(if (<= l 4.2e-96)
(sqrt
(*
2.0
(* U (* n (+ t (/ l (/ Om (fma -2.0 l (/ n (/ Om (* l U*)))))))))))
(if (<= l 4.8e+113)
(sqrt (* (* 2.0 n) (+ (* U t) (/ (- t_1 2.0) (/ Om (* U (* l l)))))))
(if (or (<= l 1.45e+240) (not (<= l 5.2e+267)))
(* (* l (sqrt 2.0)) (pow (/ n (/ Om (* U (+ -2.0 t_1)))) 0.5))
(sqrt
(*
2.0
(/ (* (* n l) (* U (fma (* l (/ n Om)) U* (* l -2.0)))) Om))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = n / (Om / (U_42_ - U));
double tmp;
if (l <= 4.2e-96) {
tmp = sqrt((2.0 * (U * (n * (t + (l / (Om / fma(-2.0, l, (n / (Om / (l * U_42_)))))))))));
} else if (l <= 4.8e+113) {
tmp = sqrt(((2.0 * n) * ((U * t) + ((t_1 - 2.0) / (Om / (U * (l * l)))))));
} else if ((l <= 1.45e+240) || !(l <= 5.2e+267)) {
tmp = (l * sqrt(2.0)) * pow((n / (Om / (U * (-2.0 + t_1)))), 0.5);
} else {
tmp = sqrt((2.0 * (((n * l) * (U * fma((l * (n / Om)), U_42_, (l * -2.0)))) / Om)));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(n / Float64(Om / Float64(U_42_ - U))) tmp = 0.0 if (l <= 4.2e-96) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(l / Float64(Om / fma(-2.0, l, Float64(n / Float64(Om / Float64(l * U_42_))))))))))); elseif (l <= 4.8e+113) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(Float64(U * t) + Float64(Float64(t_1 - 2.0) / Float64(Om / Float64(U * Float64(l * l))))))); elseif ((l <= 1.45e+240) || !(l <= 5.2e+267)) tmp = Float64(Float64(l * sqrt(2.0)) * (Float64(n / Float64(Om / Float64(U * Float64(-2.0 + t_1)))) ^ 0.5)); else tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(n * l) * Float64(U * fma(Float64(l * Float64(n / Om)), U_42_, Float64(l * -2.0)))) / Om))); end return tmp end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 4.2e-96], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(l / N[(Om / N[(-2.0 * l + N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 4.8e+113], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(N[(U * t), $MachinePrecision] + N[(N[(t$95$1 - 2.0), $MachinePrecision] / N[(Om / N[(U * N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[l, 1.45e+240], N[Not[LessEqual[l, 5.2e+267]], $MachinePrecision]], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n / N[(Om / N[(U * N[(-2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(N[(n * l), $MachinePrecision] * N[(U * N[(N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision] * U$42$ + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \frac{n}{\frac{Om}{U* - U}}\\
\mathbf{if}\;\ell \leq 4.2 \cdot 10^{-96}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell}{\frac{Om}{\mathsf{fma}\left(-2, \ell, \frac{n}{\frac{Om}{\ell \cdot U*}}\right)}}\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 4.8 \cdot 10^{+113}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t + \frac{t_1 - 2}{\frac{Om}{U \cdot \left(\ell \cdot \ell\right)}}\right)}\\
\mathbf{elif}\;\ell \leq 1.45 \cdot 10^{+240} \lor \neg \left(\ell \leq 5.2 \cdot 10^{+267}\right):\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot {\left(\frac{n}{\frac{Om}{U \cdot \left(-2 + t_1\right)}}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(n \cdot \ell\right) \cdot \left(U \cdot \mathsf{fma}\left(\ell \cdot \frac{n}{Om}, U*, \ell \cdot -2\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 4.20000000000000002e-96Initial program 51.6%
Simplified56.1%
Taylor expanded in U around 0 59.7%
associate-*r*63.3%
associate-/l*64.2%
fma-def64.2%
associate-/l*64.1%
Simplified64.1%
if 4.20000000000000002e-96 < l < 4.79999999999999966e113Initial program 53.8%
Simplified56.4%
Taylor expanded in l around -inf 61.1%
mul-1-neg61.1%
unsub-neg61.1%
*-commutative61.1%
associate-/l*61.1%
mul-1-neg61.1%
unsub-neg61.1%
associate-/l*63.6%
*-commutative63.6%
unpow263.6%
Simplified63.6%
if 4.79999999999999966e113 < l < 1.44999999999999999e240 or 5.20000000000000005e267 < l Initial program 20.3%
Simplified42.5%
Taylor expanded in t around 0 38.8%
Taylor expanded in l around 0 76.1%
pow1/276.4%
associate-/l*82.0%
*-commutative82.0%
sub-neg82.0%
associate-/l*78.3%
metadata-eval78.3%
Applied egg-rr78.3%
if 1.44999999999999999e240 < l < 5.20000000000000005e267Initial program 26.9%
Simplified51.9%
Taylor expanded in U around 0 26.9%
associate-*r*26.9%
associate-/l*26.9%
fma-def26.9%
associate-/l*26.9%
Simplified26.9%
Taylor expanded in t around 0 26.9%
associate-*r*50.6%
*-commutative50.6%
associate-*l/50.6%
+-commutative50.6%
associate-*r*75.6%
fma-def75.6%
*-commutative75.6%
Simplified75.6%
Final simplification65.7%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.02e+152)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (/ n (/ Om (* l U*))) (* l -2.0))) Om)))))
(if (or (<= l 9.5e+238) (not (<= l 2.1e+268)))
(*
(* l (sqrt 2.0))
(pow (/ n (/ Om (* U (+ -2.0 (/ n (/ Om (- U* U))))))) 0.5))
(sqrt
(* 2.0 (/ (* (* n l) (* U (fma (* l (/ n Om)) U* (* l -2.0)))) Om))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.02e+152) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om)))));
} else if ((l <= 9.5e+238) || !(l <= 2.1e+268)) {
tmp = (l * sqrt(2.0)) * pow((n / (Om / (U * (-2.0 + (n / (Om / (U_42_ - U))))))), 0.5);
} else {
tmp = sqrt((2.0 * (((n * l) * (U * fma((l * (n / Om)), U_42_, (l * -2.0)))) / Om)));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.02e+152) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(n / Float64(Om / Float64(l * U_42_))) + Float64(l * -2.0))) / Om))))); elseif ((l <= 9.5e+238) || !(l <= 2.1e+268)) tmp = Float64(Float64(l * sqrt(2.0)) * (Float64(n / Float64(Om / Float64(U * Float64(-2.0 + Float64(n / Float64(Om / Float64(U_42_ - U))))))) ^ 0.5)); else tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(n * l) * Float64(U * fma(Float64(l * Float64(n / Om)), U_42_, Float64(l * -2.0)))) / Om))); end return tmp end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.02e+152], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[l, 9.5e+238], N[Not[LessEqual[l, 2.1e+268]], $MachinePrecision]], N[(N[(l * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Power[N[(n / N[(Om / N[(U * N[(-2.0 + N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(N[(n * l), $MachinePrecision] * N[(U * N[(N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision] * U$42$ + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.02 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\frac{n}{\frac{Om}{\ell \cdot U*}} + \ell \cdot -2\right)}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 9.5 \cdot 10^{+238} \lor \neg \left(\ell \leq 2.1 \cdot 10^{+268}\right):\\
\;\;\;\;\left(\ell \cdot \sqrt{2}\right) \cdot {\left(\frac{n}{\frac{Om}{U \cdot \left(-2 + \frac{n}{\frac{Om}{U* - U}}\right)}}\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(n \cdot \ell\right) \cdot \left(U \cdot \mathsf{fma}\left(\ell \cdot \frac{n}{Om}, U*, \ell \cdot -2\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 1.01999999999999999e152Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
*-un-lft-identity58.2%
associate-/l*59.5%
Applied egg-rr59.5%
if 1.01999999999999999e152 < l < 9.5000000000000003e238 or 2.1000000000000001e268 < l Initial program 17.7%
Simplified41.9%
Taylor expanded in t around 0 41.7%
Taylor expanded in l around 0 78.3%
pow1/278.3%
associate-/l*84.4%
*-commutative84.4%
sub-neg84.4%
associate-/l*80.6%
metadata-eval80.6%
Applied egg-rr80.6%
if 9.5000000000000003e238 < l < 2.1000000000000001e268Initial program 26.9%
Simplified51.9%
Taylor expanded in U around 0 26.9%
associate-*r*26.9%
associate-/l*26.9%
fma-def26.9%
associate-/l*26.9%
Simplified26.9%
Taylor expanded in t around 0 26.9%
associate-*r*50.6%
*-commutative50.6%
associate-*l/50.6%
+-commutative50.6%
associate-*r*75.6%
fma-def75.6%
*-commutative75.6%
Simplified75.6%
Final simplification61.8%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 6.2e+151)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (/ n (/ Om (* l U*))) (* l -2.0))) Om)))))
(if (or (<= l 5.1e+238) (not (<= l 3.4e+268)))
(*
(sqrt 2.0)
(* l (sqrt (* n (* U (+ (* (/ n Om) (/ U* Om)) (/ -2.0 Om)))))))
(sqrt
(* 2.0 (/ (* (* n l) (* U (fma (* l (/ n Om)) U* (* l -2.0)))) Om))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.2e+151) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om)))));
} else if ((l <= 5.1e+238) || !(l <= 3.4e+268)) {
tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) + (-2.0 / Om))))));
} else {
tmp = sqrt((2.0 * (((n * l) * (U * fma((l * (n / Om)), U_42_, (l * -2.0)))) / Om)));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.2e+151) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(n / Float64(Om / Float64(l * U_42_))) + Float64(l * -2.0))) / Om))))); elseif ((l <= 5.1e+238) || !(l <= 3.4e+268)) tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) + Float64(-2.0 / Om))))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(n * l) * Float64(U * fma(Float64(l * Float64(n / Om)), U_42_, Float64(l * -2.0)))) / Om))); end return tmp end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.2e+151], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[l, 5.1e+238], N[Not[LessEqual[l, 3.4e+268]], $MachinePrecision]], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(N[(n * l), $MachinePrecision] * N[(U * N[(N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision] * U$42$ + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.2 \cdot 10^{+151}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\frac{n}{\frac{Om}{\ell \cdot U*}} + \ell \cdot -2\right)}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 5.1 \cdot 10^{+238} \lor \neg \left(\ell \leq 3.4 \cdot 10^{+268}\right):\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{n \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} + \frac{-2}{Om}\right)\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(n \cdot \ell\right) \cdot \left(U \cdot \mathsf{fma}\left(\ell \cdot \frac{n}{Om}, U*, \ell \cdot -2\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 6.2000000000000004e151Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
*-un-lft-identity58.2%
associate-/l*59.5%
Applied egg-rr59.5%
if 6.2000000000000004e151 < l < 5.1000000000000002e238 or 3.4000000000000003e268 < l Initial program 17.7%
Simplified41.9%
Taylor expanded in U around 0 31.8%
Taylor expanded in l around inf 61.1%
associate-*l*61.0%
*-commutative61.0%
sub-neg61.0%
unpow261.0%
times-frac76.8%
associate-*r/76.8%
metadata-eval76.8%
distribute-neg-frac76.8%
metadata-eval76.8%
Simplified76.8%
if 5.1000000000000002e238 < l < 3.4000000000000003e268Initial program 26.9%
Simplified51.9%
Taylor expanded in U around 0 26.9%
associate-*r*26.9%
associate-/l*26.9%
fma-def26.9%
associate-/l*26.9%
Simplified26.9%
Taylor expanded in t around 0 26.9%
associate-*r*50.6%
*-commutative50.6%
associate-*l/50.6%
+-commutative50.6%
associate-*r*75.6%
fma-def75.6%
*-commutative75.6%
Simplified75.6%
Final simplification61.4%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1.75e+152)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (/ n (/ Om (* l U*))) (* l -2.0))) Om)))))
(if (<= l 1.75e+239)
(*
(sqrt 2.0)
(* l (sqrt (/ n (/ Om (* U (+ -2.0 (/ n (/ Om (- U* U))))))))))
(if (<= l 1e+267)
(sqrt
(* 2.0 (/ (* (* n l) (* U (fma (* l (/ n Om)) U* (* l -2.0)))) Om)))
(*
(sqrt 2.0)
(* l (sqrt (* n (* U (+ (* (/ n Om) (/ U* Om)) (/ -2.0 Om)))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1.75e+152) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om)))));
} else if (l <= 1.75e+239) {
tmp = sqrt(2.0) * (l * sqrt((n / (Om / (U * (-2.0 + (n / (Om / (U_42_ - U)))))))));
} else if (l <= 1e+267) {
tmp = sqrt((2.0 * (((n * l) * (U * fma((l * (n / Om)), U_42_, (l * -2.0)))) / Om)));
} else {
tmp = sqrt(2.0) * (l * sqrt((n * (U * (((n / Om) * (U_42_ / Om)) + (-2.0 / Om))))));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1.75e+152) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(n / Float64(Om / Float64(l * U_42_))) + Float64(l * -2.0))) / Om))))); elseif (l <= 1.75e+239) tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n / Float64(Om / Float64(U * Float64(-2.0 + Float64(n / Float64(Om / Float64(U_42_ - U)))))))))); elseif (l <= 1e+267) tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(n * l) * Float64(U * fma(Float64(l * Float64(n / Om)), U_42_, Float64(l * -2.0)))) / Om))); else tmp = Float64(sqrt(2.0) * Float64(l * sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n / Om) * Float64(U_42_ / Om)) + Float64(-2.0 / Om))))))); end return tmp end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1.75e+152], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 1.75e+239], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n / N[(Om / N[(U * N[(-2.0 + N[(n / N[(Om / N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[l, 1e+267], N[Sqrt[N[(2.0 * N[(N[(N[(n * l), $MachinePrecision] * N[(U * N[(N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision] * U$42$ + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[2.0], $MachinePrecision] * N[(l * N[Sqrt[N[(n * N[(U * N[(N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / Om), $MachinePrecision]), $MachinePrecision] + N[(-2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 1.75 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\frac{n}{\frac{Om}{\ell \cdot U*}} + \ell \cdot -2\right)}{Om}\right)\right)}\\
\mathbf{elif}\;\ell \leq 1.75 \cdot 10^{+239}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{\frac{n}{\frac{Om}{U \cdot \left(-2 + \frac{n}{\frac{Om}{U* - U}}\right)}}}\right)\\
\mathbf{elif}\;\ell \leq 10^{+267}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(n \cdot \ell\right) \cdot \left(U \cdot \mathsf{fma}\left(\ell \cdot \frac{n}{Om}, U*, \ell \cdot -2\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2} \cdot \left(\ell \cdot \sqrt{n \cdot \left(U \cdot \left(\frac{n}{Om} \cdot \frac{U*}{Om} + \frac{-2}{Om}\right)\right)}\right)\\
\end{array}
\end{array}
if l < 1.74999999999999991e152Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
*-un-lft-identity58.2%
associate-/l*59.5%
Applied egg-rr59.5%
if 1.74999999999999991e152 < l < 1.7500000000000001e239Initial program 14.7%
Simplified33.3%
Taylor expanded in t around 0 33.2%
Taylor expanded in l around 0 69.8%
associate-*l*69.7%
associate-/l*75.6%
*-commutative75.6%
sub-neg75.6%
associate-/l*69.8%
metadata-eval69.8%
Simplified69.8%
if 1.7500000000000001e239 < l < 9.9999999999999997e266Initial program 26.9%
Simplified51.9%
Taylor expanded in U around 0 26.9%
associate-*r*26.9%
associate-/l*26.9%
fma-def26.9%
associate-/l*26.9%
Simplified26.9%
Taylor expanded in t around 0 26.9%
associate-*r*50.6%
*-commutative50.6%
associate-*l/50.6%
+-commutative50.6%
associate-*r*75.6%
fma-def75.6%
*-commutative75.6%
Simplified75.6%
if 9.9999999999999997e266 < l Initial program 22.9%
Simplified57.0%
Taylor expanded in U around 0 58.7%
Taylor expanded in l around inf 88.7%
associate-*l*88.5%
*-commutative88.5%
sub-neg88.5%
unpow288.5%
times-frac99.7%
associate-*r/99.7%
metadata-eval99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification61.8%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 7.6e+151)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (/ n (/ Om (* l U*))) (* l -2.0))) Om)))))
(sqrt (* 2.0 (/ (* (* n l) (* U (fma (* l (/ n Om)) U* (* l -2.0)))) Om)))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 7.6e+151) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om)))));
} else {
tmp = sqrt((2.0 * (((n * l) * (U * fma((l * (n / Om)), U_42_, (l * -2.0)))) / Om)));
}
return tmp;
}
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 7.6e+151) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(n / Float64(Om / Float64(l * U_42_))) + Float64(l * -2.0))) / Om))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(n * l) * Float64(U * fma(Float64(l * Float64(n / Om)), U_42_, Float64(l * -2.0)))) / Om))); end return tmp end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 7.6e+151], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(N[(n * l), $MachinePrecision] * N[(U * N[(N[(l * N[(n / Om), $MachinePrecision]), $MachinePrecision] * U$42$ + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 7.6 \cdot 10^{+151}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\frac{n}{\frac{Om}{\ell \cdot U*}} + \ell \cdot -2\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(n \cdot \ell\right) \cdot \left(U \cdot \mathsf{fma}\left(\ell \cdot \frac{n}{Om}, U*, \ell \cdot -2\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 7.6000000000000001e151Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
*-un-lft-identity58.2%
associate-/l*59.5%
Applied egg-rr59.5%
if 7.6000000000000001e151 < l Initial program 18.9%
Simplified43.2%
Taylor expanded in U around 0 31.1%
associate-*r*31.1%
associate-/l*37.3%
fma-def37.3%
associate-/l*37.0%
Simplified37.0%
Taylor expanded in t around 0 40.6%
associate-*r*43.8%
*-commutative43.8%
associate-*l/43.4%
+-commutative43.4%
associate-*r*50.1%
fma-def50.1%
*-commutative50.1%
Simplified50.1%
Final simplification58.4%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 1e-169)
(sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om))))))))
(if (<= l 2.8e+152)
(sqrt
(* 2.0 (* U (* n (+ t (/ (* l l) (/ Om (+ -2.0 (/ n (/ Om U*))))))))))
(sqrt
(*
2.0
(*
(/ 1.0 Om)
(* (* U l) (* n (+ (* l -2.0) (/ (* n (* l U*)) Om))))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-169) {
tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
} else if (l <= 2.8e+152) {
tmp = sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_))))))))));
} else {
tmp = sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * ((l * -2.0) + ((n * (l * U_42_)) / Om)))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 1d-169) then
tmp = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
else if (l <= 2.8d+152) then
tmp = sqrt((2.0d0 * (u * (n * (t + ((l * l) / (om / ((-2.0d0) + (n / (om / u_42))))))))))
else
tmp = sqrt((2.0d0 * ((1.0d0 / om) * ((u * l) * (n * ((l * (-2.0d0)) + ((n * (l * u_42)) / om)))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 1e-169) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
} else if (l <= 2.8e+152) {
tmp = Math.sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_))))))))));
} else {
tmp = Math.sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * ((l * -2.0) + ((n * (l * U_42_)) / Om)))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 1e-169: tmp = math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))) elif l <= 2.8e+152: tmp = math.sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))))) else: tmp = math.sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * ((l * -2.0) + ((n * (l * U_42_)) / Om))))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 1e-169) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))); elseif (l <= 2.8e+152) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(Float64(l * l) / Float64(Om / Float64(-2.0 + Float64(n / Float64(Om / U_42_)))))))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(1.0 / Om) * Float64(Float64(U * l) * Float64(n * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 1e-169) tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); elseif (l <= 2.8e+152) tmp = sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))))); else tmp = sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * ((l * -2.0) + ((n * (l * U_42_)) / Om))))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 1e-169], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 2.8e+152], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(N[(l * l), $MachinePrecision] / N[(Om / N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(1.0 / Om), $MachinePrecision] * N[(N[(U * l), $MachinePrecision] * N[(n * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 10^{-169}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 2.8 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell \cdot \ell}{\frac{Om}{-2 + \frac{n}{\frac{Om}{U*}}}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\frac{1}{Om} \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if l < 1.00000000000000002e-169Initial program 51.3%
Simplified55.9%
Taylor expanded in U around 0 59.7%
associate-*r*62.5%
associate-/l*63.4%
fma-def63.4%
associate-/l*63.4%
Simplified63.4%
Taylor expanded in Om around inf 49.6%
unpow249.6%
associate-*r/51.9%
Simplified51.9%
if 1.00000000000000002e-169 < l < 2.8000000000000002e152Initial program 54.2%
Simplified56.8%
Taylor expanded in U around 0 53.8%
associate-*r*53.8%
associate-/l*53.8%
fma-def53.8%
associate-/l*53.8%
Simplified53.8%
Taylor expanded in l around 0 55.3%
associate-/l*53.6%
unpow253.6%
sub-neg53.6%
associate-/l*53.7%
metadata-eval53.7%
Simplified53.7%
if 2.8000000000000002e152 < l Initial program 18.9%
Simplified43.2%
Taylor expanded in t around 0 39.7%
div-inv39.7%
associate-/l*39.4%
*-commutative39.4%
Applied egg-rr39.4%
*-commutative39.4%
associate-*r*42.7%
+-commutative42.7%
associate-/r/42.8%
Simplified42.8%
Taylor expanded in U* around inf 43.9%
Final simplification51.4%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 6.2e+151)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (* l -2.0) (/ (* n (* l U*)) Om))) Om)))))
(sqrt
(*
2.0
(*
(/ 1.0 Om)
(* (* n (- (* l -2.0) (/ (* (* n l) (- U U*)) Om))) (* U l)))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.2e+151) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)))));
} else {
tmp = sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l)))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 6.2d+151) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))) / om)))))
else
tmp = sqrt((2.0d0 * ((1.0d0 / om) * ((n * ((l * (-2.0d0)) - (((n * l) * (u - u_42)) / om))) * (u * l)))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.2e+151) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om)))));
} else {
tmp = Math.sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l)))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6.2e+151: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om))))) else: tmp = math.sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.2e+151) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))) / Om))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(1.0 / Om) * Float64(Float64(n * Float64(Float64(l * -2.0) - Float64(Float64(Float64(n * l) * Float64(U - U_42_)) / Om))) * Float64(U * l))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6.2e+151) tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((l * -2.0) + ((n * (l * U_42_)) / Om))) / Om))))); else tmp = sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.2e+151], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(1.0 / Om), $MachinePrecision] * N[(N[(n * N[(N[(l * -2.0), $MachinePrecision] - N[(N[(N[(n * l), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.2 \cdot 10^{+151}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\frac{1}{Om} \cdot \left(\left(n \cdot \left(\ell \cdot -2 - \frac{\left(n \cdot \ell\right) \cdot \left(U - U*\right)}{Om}\right)\right) \cdot \left(U \cdot \ell\right)\right)\right)}\\
\end{array}
\end{array}
if l < 6.2000000000000004e151Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
if 6.2000000000000004e151 < l Initial program 18.9%
Simplified43.2%
Taylor expanded in t around 0 39.7%
div-inv39.7%
associate-/l*39.4%
*-commutative39.4%
Applied egg-rr39.4%
*-commutative39.4%
associate-*r*42.7%
+-commutative42.7%
associate-/r/42.8%
Simplified42.8%
Taylor expanded in n around 0 43.0%
associate-*r*46.5%
Simplified46.5%
Final simplification56.9%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 3e+152)
(sqrt
(*
(* 2.0 n)
(* U (+ t (/ (* l (+ (/ n (/ Om (* l U*))) (* l -2.0))) Om)))))
(sqrt
(*
2.0
(*
(/ 1.0 Om)
(* (* n (- (* l -2.0) (/ (* (* n l) (- U U*)) Om))) (* U l)))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3e+152) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om)))));
} else {
tmp = sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l)))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 3d+152) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l * ((n / (om / (l * u_42))) + (l * (-2.0d0)))) / om)))))
else
tmp = sqrt((2.0d0 * ((1.0d0 / om) * ((n * ((l * (-2.0d0)) - (((n * l) * (u - u_42)) / om))) * (u * l)))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 3e+152) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om)))));
} else {
tmp = Math.sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l)))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 3e+152: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om))))) else: tmp = math.sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 3e+152) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * Float64(Float64(n / Float64(Om / Float64(l * U_42_))) + Float64(l * -2.0))) / Om))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(1.0 / Om) * Float64(Float64(n * Float64(Float64(l * -2.0) - Float64(Float64(Float64(n * l) * Float64(U - U_42_)) / Om))) * Float64(U * l))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 3e+152) tmp = sqrt(((2.0 * n) * (U * (t + ((l * ((n / (Om / (l * U_42_))) + (l * -2.0))) / Om))))); else tmp = sqrt((2.0 * ((1.0 / Om) * ((n * ((l * -2.0) - (((n * l) * (U - U_42_)) / Om))) * (U * l))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 3e+152], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * N[(N[(n / N[(Om / N[(l * U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(l * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(1.0 / Om), $MachinePrecision] * N[(N[(n * N[(N[(l * -2.0), $MachinePrecision] - N[(N[(N[(n * l), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(U * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 3 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot \left(\frac{n}{\frac{Om}{\ell \cdot U*}} + \ell \cdot -2\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\frac{1}{Om} \cdot \left(\left(n \cdot \left(\ell \cdot -2 - \frac{\left(n \cdot \ell\right) \cdot \left(U - U*\right)}{Om}\right)\right) \cdot \left(U \cdot \ell\right)\right)\right)}\\
\end{array}
\end{array}
if l < 2.99999999999999991e152Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
*-un-lft-identity58.2%
associate-/l*59.5%
Applied egg-rr59.5%
if 2.99999999999999991e152 < l Initial program 18.9%
Simplified43.2%
Taylor expanded in t around 0 39.7%
div-inv39.7%
associate-/l*39.4%
*-commutative39.4%
Applied egg-rr39.4%
*-commutative39.4%
associate-*r*42.7%
+-commutative42.7%
associate-/r/42.8%
Simplified42.8%
Taylor expanded in n around 0 43.0%
associate-*r*46.5%
Simplified46.5%
Final simplification58.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(if (<= l 6.8e-164)
(sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om))))))))
(if (<= l 3.3e+152)
(sqrt
(* 2.0 (* U (* n (+ t (/ (* l l) (/ Om (+ -2.0 (/ n (/ Om U*))))))))))
(sqrt
(* 2.0 (/ (* n (* l (* U (+ (* l -2.0) (/ (* n (* l U*)) Om))))) Om))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.8e-164) {
tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
} else if (l <= 3.3e+152) {
tmp = sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_))))))))));
} else {
tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l <= 6.8d-164) then
tmp = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
else if (l <= 3.3d+152) then
tmp = sqrt((2.0d0 * (u * (n * (t + ((l * l) / (om / ((-2.0d0) + (n / (om / u_42))))))))))
else
tmp = sqrt((2.0d0 * ((n * (l * (u * ((l * (-2.0d0)) + ((n * (l * u_42)) / om))))) / om)))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (l <= 6.8e-164) {
tmp = Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
} else if (l <= 3.3e+152) {
tmp = Math.sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_))))))))));
} else {
tmp = Math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om)));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if l <= 6.8e-164: tmp = math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))) elif l <= 3.3e+152: tmp = math.sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))))) else: tmp = math.sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (l <= 6.8e-164) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))); elseif (l <= 3.3e+152) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(Float64(l * l) / Float64(Om / Float64(-2.0 + Float64(n / Float64(Om / U_42_)))))))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(l * Float64(U * Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om))))) / Om))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (l <= 6.8e-164) tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); elseif (l <= 3.3e+152) tmp = sqrt((2.0 * (U * (n * (t + ((l * l) / (Om / (-2.0 + (n / (Om / U_42_)))))))))); else tmp = sqrt((2.0 * ((n * (l * (U * ((l * -2.0) + ((n * (l * U_42_)) / Om))))) / Om))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[l, 6.8e-164], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l, 3.3e+152], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(N[(l * l), $MachinePrecision] / N[(Om / N[(-2.0 + N[(n / N[(Om / U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(n * N[(l * N[(U * N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;\ell \leq 6.8 \cdot 10^{-164}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}\\
\mathbf{elif}\;\ell \leq 3.3 \cdot 10^{+152}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + \frac{\ell \cdot \ell}{\frac{Om}{-2 + \frac{n}{\frac{Om}{U*}}}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n \cdot \left(\ell \cdot \left(U \cdot \left(\ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 6.8e-164Initial program 51.3%
Simplified55.9%
Taylor expanded in U around 0 59.7%
associate-*r*62.5%
associate-/l*63.4%
fma-def63.4%
associate-/l*63.4%
Simplified63.4%
Taylor expanded in Om around inf 49.6%
unpow249.6%
associate-*r/51.9%
Simplified51.9%
if 6.8e-164 < l < 3.3000000000000001e152Initial program 54.2%
Simplified56.8%
Taylor expanded in U around 0 53.8%
associate-*r*53.8%
associate-/l*53.8%
fma-def53.8%
associate-/l*53.8%
Simplified53.8%
Taylor expanded in l around 0 55.3%
associate-/l*53.6%
unpow253.6%
sub-neg53.6%
associate-/l*53.7%
metadata-eval53.7%
Simplified53.7%
if 3.3000000000000001e152 < l Initial program 18.9%
Simplified43.2%
Taylor expanded in U around 0 31.1%
associate-*r*31.1%
associate-/l*37.3%
fma-def37.3%
associate-/l*37.0%
Simplified37.0%
Taylor expanded in t around 0 40.6%
Final simplification51.0%
NOTE: l should be positive before calling this function
(FPCore (n U t l Om U*)
:precision binary64
(let* ((t_1 (+ (* l -2.0) (/ (* n (* l U*)) Om))))
(if (<= l 9e+151)
(sqrt (* (* 2.0 n) (* U (+ t (/ (* l t_1) Om)))))
(sqrt (* 2.0 (* (/ 1.0 Om) (* (* U l) (* n t_1))))))))l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + ((n * (l * U_42_)) / Om);
double tmp;
if (l <= 9e+151) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l * t_1) / Om)))));
} else {
tmp = sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * t_1)))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = (l * (-2.0d0)) + ((n * (l * u_42)) / om)
if (l <= 9d+151) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l * t_1) / om)))))
else
tmp = sqrt((2.0d0 * ((1.0d0 / om) * ((u * l) * (n * t_1)))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double t_1 = (l * -2.0) + ((n * (l * U_42_)) / Om);
double tmp;
if (l <= 9e+151) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l * t_1) / Om)))));
} else {
tmp = Math.sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * t_1)))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): t_1 = (l * -2.0) + ((n * (l * U_42_)) / Om) tmp = 0 if l <= 9e+151: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l * t_1) / Om))))) else: tmp = math.sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * t_1))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) t_1 = Float64(Float64(l * -2.0) + Float64(Float64(n * Float64(l * U_42_)) / Om)) tmp = 0.0 if (l <= 9e+151) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l * t_1) / Om))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(1.0 / Om) * Float64(Float64(U * l) * Float64(n * t_1))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) t_1 = (l * -2.0) + ((n * (l * U_42_)) / Om); tmp = 0.0; if (l <= 9e+151) tmp = sqrt(((2.0 * n) * (U * (t + ((l * t_1) / Om))))); else tmp = sqrt((2.0 * ((1.0 / Om) * ((U * l) * (n * t_1))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function
code[n_, U_, t_, l_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(l * -2.0), $MachinePrecision] + N[(N[(n * N[(l * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l, 9e+151], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l * t$95$1), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(1.0 / Om), $MachinePrecision] * N[(N[(U * l), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
t_1 := \ell \cdot -2 + \frac{n \cdot \left(\ell \cdot U*\right)}{Om}\\
\mathbf{if}\;\ell \leq 9 \cdot 10^{+151}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{\ell \cdot t_1}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(\frac{1}{Om} \cdot \left(\left(U \cdot \ell\right) \cdot \left(n \cdot t_1\right)\right)\right)}\\
\end{array}
\end{array}
if l < 8.9999999999999997e151Initial program 52.0%
Simplified56.1%
Taylor expanded in U around 0 58.2%
if 8.9999999999999997e151 < l Initial program 18.9%
Simplified43.2%
Taylor expanded in t around 0 39.7%
div-inv39.7%
associate-/l*39.4%
*-commutative39.4%
Applied egg-rr39.4%
*-commutative39.4%
associate-*r*42.7%
+-commutative42.7%
associate-/r/42.8%
Simplified42.8%
Taylor expanded in U* around inf 43.9%
Final simplification56.6%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (or (<= n -3.8e-104) (not (<= n 1.6e-69))) (sqrt (* (* 2.0 n) (* U (+ t (* (/ n Om) (/ (* (* l l) U*) Om)))))) (sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om))))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((n <= -3.8e-104) || !(n <= 1.6e-69)) {
tmp = sqrt(((2.0 * n) * (U * (t + ((n / Om) * (((l * l) * U_42_) / Om))))));
} else {
tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((n <= (-3.8d-104)) .or. (.not. (n <= 1.6d-69))) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((n / om) * (((l * l) * u_42) / om))))))
else
tmp = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((n <= -3.8e-104) || !(n <= 1.6e-69)) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((n / Om) * (((l * l) * U_42_) / Om))))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if (n <= -3.8e-104) or not (n <= 1.6e-69): tmp = math.sqrt(((2.0 * n) * (U * (t + ((n / Om) * (((l * l) * U_42_) / Om)))))) else: tmp = math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((n <= -3.8e-104) || !(n <= 1.6e-69)) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(n / Om) * Float64(Float64(Float64(l * l) * U_42_) / Om)))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((n <= -3.8e-104) || ~((n <= 1.6e-69))) tmp = sqrt(((2.0 * n) * (U * (t + ((n / Om) * (((l * l) * U_42_) / Om)))))); else tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[n, -3.8e-104], N[Not[LessEqual[n, 1.6e-69]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(n / Om), $MachinePrecision] * N[(N[(N[(l * l), $MachinePrecision] * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;n \leq -3.8 \cdot 10^{-104} \lor \neg \left(n \leq 1.6 \cdot 10^{-69}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{n}{Om} \cdot \frac{\left(\ell \cdot \ell\right) \cdot U*}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if n < -3.8000000000000001e-104 or 1.59999999999999999e-69 < n Initial program 56.1%
Simplified55.5%
Taylor expanded in U around 0 60.5%
Taylor expanded in n around inf 51.1%
unpow251.1%
times-frac55.1%
*-commutative55.1%
unpow255.1%
Simplified55.1%
if -3.8000000000000001e-104 < n < 1.59999999999999999e-69Initial program 36.6%
Simplified53.4%
Taylor expanded in U around 0 47.2%
associate-*r*54.7%
associate-/l*59.2%
fma-def59.2%
associate-/l*59.1%
Simplified59.1%
Taylor expanded in Om around inf 50.0%
unpow250.0%
associate-*r/56.4%
Simplified56.4%
Final simplification55.7%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (or (<= n -1.4e-103) (not (<= n 5.1e-76))) (sqrt (* (* (* 2.0 n) U) (+ t (* (/ n Om) (/ U* (/ Om (* l l))))))) (sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om))))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((n <= -1.4e-103) || !(n <= 5.1e-76)) {
tmp = sqrt((((2.0 * n) * U) * (t + ((n / Om) * (U_42_ / (Om / (l * l)))))));
} else {
tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((n <= (-1.4d-103)) .or. (.not. (n <= 5.1d-76))) then
tmp = sqrt((((2.0d0 * n) * u) * (t + ((n / om) * (u_42 / (om / (l * l)))))))
else
tmp = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if ((n <= -1.4e-103) || !(n <= 5.1e-76)) {
tmp = Math.sqrt((((2.0 * n) * U) * (t + ((n / Om) * (U_42_ / (Om / (l * l)))))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if (n <= -1.4e-103) or not (n <= 5.1e-76): tmp = math.sqrt((((2.0 * n) * U) * (t + ((n / Om) * (U_42_ / (Om / (l * l))))))) else: tmp = math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if ((n <= -1.4e-103) || !(n <= 5.1e-76)) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t + Float64(Float64(n / Om) * Float64(U_42_ / Float64(Om / Float64(l * l))))))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if ((n <= -1.4e-103) || ~((n <= 5.1e-76))) tmp = sqrt((((2.0 * n) * U) * (t + ((n / Om) * (U_42_ / (Om / (l * l))))))); else tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[Or[LessEqual[n, -1.4e-103], N[Not[LessEqual[n, 5.1e-76]], $MachinePrecision]], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t + N[(N[(n / Om), $MachinePrecision] * N[(U$42$ / N[(Om / N[(l * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;n \leq -1.4 \cdot 10^{-103} \lor \neg \left(n \leq 5.1 \cdot 10^{-76}\right):\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t + \frac{n}{Om} \cdot \frac{U*}{\frac{Om}{\ell \cdot \ell}}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if n < -1.40000000000000011e-103 or 5.09999999999999986e-76 < n Initial program 55.8%
Simplified55.2%
Taylor expanded in U around 0 60.1%
Taylor expanded in n around inf 50.8%
unpow250.8%
times-frac54.8%
*-commutative54.8%
unpow254.8%
Simplified54.8%
*-un-lft-identity54.8%
*-commutative54.8%
Applied egg-rr54.8%
*-lft-identity54.8%
associate-*r*55.7%
unpow255.7%
associate-/l*57.0%
unpow257.0%
Simplified57.0%
if -1.40000000000000011e-103 < n < 5.09999999999999986e-76Initial program 36.6%
Simplified53.9%
Taylor expanded in U around 0 47.5%
associate-*r*55.2%
associate-/l*59.9%
fma-def59.9%
associate-/l*59.7%
Simplified59.7%
Taylor expanded in Om around inf 50.4%
unpow250.4%
associate-*r/57.0%
Simplified57.0%
Final simplification57.0%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= U* -2.3e+166) (sqrt (* 2.0 (/ (* n (/ (* (* n (* l l)) (* U U*)) Om)) Om))) (sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om))))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= -2.3e+166) {
tmp = sqrt((2.0 * ((n * (((n * (l * l)) * (U * U_42_)) / Om)) / Om)));
} else {
tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= (-2.3d+166)) then
tmp = sqrt((2.0d0 * ((n * (((n * (l * l)) * (u * u_42)) / om)) / om)))
else
tmp = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= -2.3e+166) {
tmp = Math.sqrt((2.0 * ((n * (((n * (l * l)) * (U * U_42_)) / Om)) / Om)));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= -2.3e+166: tmp = math.sqrt((2.0 * ((n * (((n * (l * l)) * (U * U_42_)) / Om)) / Om))) else: tmp = math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= -2.3e+166) tmp = sqrt(Float64(2.0 * Float64(Float64(n * Float64(Float64(Float64(n * Float64(l * l)) * Float64(U * U_42_)) / Om)) / Om))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= -2.3e+166) tmp = sqrt((2.0 * ((n * (((n * (l * l)) * (U * U_42_)) / Om)) / Om))); else tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, -2.3e+166], N[Sqrt[N[(2.0 * N[(N[(n * N[(N[(N[(n * N[(l * l), $MachinePrecision]), $MachinePrecision] * N[(U * U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -2.3 \cdot 10^{+166}:\\
\;\;\;\;\sqrt{2 \cdot \frac{n \cdot \frac{\left(n \cdot \left(\ell \cdot \ell\right)\right) \cdot \left(U \cdot U*\right)}{Om}}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -2.30000000000000008e166Initial program 49.0%
Simplified57.7%
Taylor expanded in t around 0 41.7%
Taylor expanded in U* around inf 41.4%
associate-*r*41.3%
unpow241.3%
Simplified41.3%
if -2.30000000000000008e166 < U* Initial program 48.1%
Simplified54.1%
Taylor expanded in U around 0 54.3%
associate-*r*55.6%
associate-/l*57.1%
fma-def57.1%
associate-/l*57.1%
Simplified57.1%
Taylor expanded in Om around inf 47.2%
unpow247.2%
associate-*r/50.6%
Simplified50.6%
Final simplification49.3%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= U* -2.3e+166) (sqrt (* 2.0 (/ (* (* (* n l) (* n l)) (* U U*)) (* Om Om)))) (sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om))))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= -2.3e+166) {
tmp = sqrt((2.0 * ((((n * l) * (n * l)) * (U * U_42_)) / (Om * Om))));
} else {
tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= (-2.3d+166)) then
tmp = sqrt((2.0d0 * ((((n * l) * (n * l)) * (u * u_42)) / (om * om))))
else
tmp = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (U_42_ <= -2.3e+166) {
tmp = Math.sqrt((2.0 * ((((n * l) * (n * l)) * (U * U_42_)) / (Om * Om))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if U_42_ <= -2.3e+166: tmp = math.sqrt((2.0 * ((((n * l) * (n * l)) * (U * U_42_)) / (Om * Om)))) else: tmp = math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (U_42_ <= -2.3e+166) tmp = sqrt(Float64(2.0 * Float64(Float64(Float64(Float64(n * l) * Float64(n * l)) * Float64(U * U_42_)) / Float64(Om * Om)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))); end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (U_42_ <= -2.3e+166) tmp = sqrt((2.0 * ((((n * l) * (n * l)) * (U * U_42_)) / (Om * Om)))); else tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[U$42$, -2.3e+166], N[Sqrt[N[(2.0 * N[(N[(N[(N[(n * l), $MachinePrecision] * N[(n * l), $MachinePrecision]), $MachinePrecision] * N[(U * U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;U* \leq -2.3 \cdot 10^{+166}:\\
\;\;\;\;\sqrt{2 \cdot \frac{\left(\left(n \cdot \ell\right) \cdot \left(n \cdot \ell\right)\right) \cdot \left(U \cdot U*\right)}{Om \cdot Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}\\
\end{array}
\end{array}
if U* < -2.30000000000000008e166Initial program 49.0%
Simplified57.7%
Taylor expanded in U around 0 60.6%
*-un-lft-identity60.6%
associate-/l*60.6%
Applied egg-rr60.6%
Taylor expanded in n around inf 34.6%
*-commutative34.6%
associate-*r*34.6%
unpow234.6%
unpow234.6%
swap-sqr46.9%
*-commutative46.9%
unpow246.9%
Simplified46.9%
if -2.30000000000000008e166 < U* Initial program 48.1%
Simplified54.1%
Taylor expanded in U around 0 54.3%
associate-*r*55.6%
associate-/l*57.1%
fma-def57.1%
associate-/l*57.1%
Simplified57.1%
Taylor expanded in Om around inf 47.2%
unpow247.2%
associate-*r/50.6%
Simplified50.6%
Final simplification50.1%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n (+ t (* -2.0 (* l (/ l Om)))))))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (u * (n * (t + ((-2.0d0) * (l * (l / om))))))))
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))));
}
l = abs(l) def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om))))))))
l = abs(l) function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t + Float64(-2.0 * Float64(l * Float64(l / Om)))))))) end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (U * (n * (t + (-2.0 * (l * (l / Om)))))))); end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t + N[(-2.0 * N[(l * N[(l / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t + -2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right)\right)\right)}
\end{array}
Initial program 48.3%
Simplified54.6%
Taylor expanded in U around 0 55.2%
associate-*r*57.1%
associate-/l*58.4%
fma-def58.4%
associate-/l*58.3%
Simplified58.3%
Taylor expanded in Om around inf 44.8%
unpow244.8%
associate-*r/47.8%
Simplified47.8%
Final simplification47.8%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (if (<= n 2.7e-149) (sqrt (* 2.0 (* U (* n t)))) (pow (* 2.0 (* n (* U t))) 0.5)))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= 2.7e-149) {
tmp = sqrt((2.0 * (U * (n * t))));
} else {
tmp = pow((2.0 * (n * (U * t))), 0.5);
}
return tmp;
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (n <= 2.7d-149) then
tmp = sqrt((2.0d0 * (u * (n * t))))
else
tmp = (2.0d0 * (n * (u * t))) ** 0.5d0
end if
code = tmp
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
double tmp;
if (n <= 2.7e-149) {
tmp = Math.sqrt((2.0 * (U * (n * t))));
} else {
tmp = Math.pow((2.0 * (n * (U * t))), 0.5);
}
return tmp;
}
l = abs(l) def code(n, U, t, l, Om, U_42_): tmp = 0 if n <= 2.7e-149: tmp = math.sqrt((2.0 * (U * (n * t)))) else: tmp = math.pow((2.0 * (n * (U * t))), 0.5) return tmp
l = abs(l) function code(n, U, t, l, Om, U_42_) tmp = 0.0 if (n <= 2.7e-149) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t)))); else tmp = Float64(2.0 * Float64(n * Float64(U * t))) ^ 0.5; end return tmp end
l = abs(l) function tmp_2 = code(n, U, t, l, Om, U_42_) tmp = 0.0; if (n <= 2.7e-149) tmp = sqrt((2.0 * (U * (n * t)))); else tmp = (2.0 * (n * (U * t))) ^ 0.5; end tmp_2 = tmp; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := If[LessEqual[n, 2.7e-149], N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l = |l|\\
\\
\begin{array}{l}
\mathbf{if}\;n \leq 2.7 \cdot 10^{-149}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(2 \cdot \left(n \cdot \left(U \cdot t\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if n < 2.70000000000000014e-149Initial program 48.3%
Simplified52.2%
Taylor expanded in U around 0 53.4%
associate-*r*58.4%
associate-/l*61.2%
fma-def61.2%
associate-/l*61.2%
Simplified61.2%
Taylor expanded in t around inf 35.4%
associate-*r*41.1%
Simplified41.1%
if 2.70000000000000014e-149 < n Initial program 48.2%
Simplified58.3%
Taylor expanded in t around inf 37.8%
pow1/240.8%
associate-*l*40.8%
Applied egg-rr40.8%
Final simplification41.0%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (pow (* 2.0 (* U (* n t))) 0.5))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return pow((2.0 * (U * (n * t))), 0.5);
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = (2.0d0 * (u * (n * t))) ** 0.5d0
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.pow((2.0 * (U * (n * t))), 0.5);
}
l = abs(l) def code(n, U, t, l, Om, U_42_): return math.pow((2.0 * (U * (n * t))), 0.5)
l = abs(l) function code(n, U, t, l, Om, U_42_) return Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5 end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = (2.0 * (U * (n * t))) ^ 0.5; end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}
\end{array}
Initial program 48.3%
Simplified54.6%
Taylor expanded in U around 0 55.2%
associate-*r*57.1%
associate-/l*58.4%
fma-def58.4%
associate-/l*58.3%
Simplified58.3%
Taylor expanded in t around inf 36.4%
associate-*r*38.7%
Simplified38.7%
pow1/240.3%
associate-*r*38.0%
associate-*r*38.0%
Applied egg-rr38.0%
Taylor expanded in n around 0 38.0%
associate-*r*40.3%
Simplified40.3%
Final simplification40.3%
NOTE: l should be positive before calling this function (FPCore (n U t l Om U*) :precision binary64 (sqrt (* 2.0 (* U (* n t)))))
l = abs(l);
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((2.0 * (U * (n * t))));
}
NOTE: l should be positive before calling this function
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (u * (n * t))))
end function
l = Math.abs(l);
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((2.0 * (U * (n * t))));
}
l = abs(l) def code(n, U, t, l, Om, U_42_): return math.sqrt((2.0 * (U * (n * t))))
l = abs(l) function code(n, U, t, l, Om, U_42_) return sqrt(Float64(2.0 * Float64(U * Float64(n * t)))) end
l = abs(l) function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((2.0 * (U * (n * t)))); end
NOTE: l should be positive before calling this function code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l = |l|\\
\\
\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right)\right)}
\end{array}
Initial program 48.3%
Simplified54.6%
Taylor expanded in U around 0 55.2%
associate-*r*57.1%
associate-/l*58.4%
fma-def58.4%
associate-/l*58.3%
Simplified58.3%
Taylor expanded in t around inf 36.4%
associate-*r*38.7%
Simplified38.7%
Final simplification38.7%
herbie shell --seed 2023217
(FPCore (n U t l Om U*)
:name "Toniolo and Linder, Equation (13)"
:precision binary64
(sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))