
(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 18 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}
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (pow (/ l_m Om) 2.0))
(t_2 (* (* n t_1) (- U* U)))
(t_3
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2)))))
(if (<= t_3 0.0)
(*
(sqrt (* U (- t (fma n (* t_1 (- U U*)) (* 2.0 (/ (pow l_m 2.0) Om))))))
(sqrt (* 2.0 n)))
(if (<= t_3 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 (* 2.0 (* l_m (/ l_m Om)))))))
(*
(sqrt (* U (/ (* n (fma U* (/ n Om) -2.0)) Om)))
(* l_m (sqrt 2.0)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = pow((l_m / Om), 2.0);
double t_2 = (n * t_1) * (U_42_ - U);
double t_3 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((U * (t - fma(n, (t_1 * (U - U_42_)), (2.0 * (pow(l_m, 2.0) / Om)))))) * sqrt((2.0 * n));
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = sqrt((U * ((n * fma(U_42_, (n / Om), -2.0)) / Om))) * (l_m * sqrt(2.0));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(l_m / Om) ^ 2.0 t_2 = Float64(Float64(n * t_1) * Float64(U_42_ - U)) t_3 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(U * Float64(t - fma(n, Float64(t_1 * Float64(U - U_42_)), Float64(2.0 * Float64((l_m ^ 2.0) / Om)))))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(sqrt(Float64(U * Float64(Float64(n * fma(U_42_, Float64(n / Om), -2.0)) / Om))) * Float64(l_m * sqrt(2.0))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * t$95$1), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(U * N[(t - N[(n * N[(t$95$1 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(N[(n * N[(U$42$ * N[(n / Om), $MachinePrecision] + -2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_2 := \left(n \cdot t\_1\right) \cdot \left(U* - U\right)\\
t_3 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{U \cdot \left(t - \mathsf{fma}\left(n, t\_1 \cdot \left(U - U*\right), 2 \cdot \frac{{l\_m}^{2}}{Om}\right)\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \frac{n \cdot \mathsf{fma}\left(U*, \frac{n}{Om}, -2\right)}{Om}} \cdot \left(l\_m \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 11.0%
Simplified32.9%
*-commutative32.9%
sqrt-prod45.9%
Applied egg-rr43.0%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 71.4%
Simplified77.1%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 0.0%
Simplified14.2%
Taylor expanded in U around 0 11.4%
mul-1-neg11.4%
associate-/l*0.6%
unpow20.6%
unpow20.6%
times-frac14.3%
unpow214.3%
Simplified14.3%
Taylor expanded in Om around -inf 17.1%
mul-1-neg17.1%
fma-define17.1%
associate-/l*17.0%
Simplified17.0%
Taylor expanded in l around 0 32.3%
associate-/l*32.3%
sub-neg32.3%
associate-/l*34.9%
metadata-eval34.9%
Simplified34.9%
Taylor expanded in t around 0 14.3%
associate-/l*20.2%
associate-*r/20.2%
fmm-def20.2%
metadata-eval20.2%
Simplified20.2%
Final simplification64.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1)))))
(if (<= t_2 0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U (+ t (* (/ (pow l_m 2.0) Om) -2.0)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 (* 2.0 (* l_m (/ l_m Om)))))))
(*
(sqrt (* U (/ (* n (fma U* (/ n Om) -2.0)) Om)))
(* l_m (sqrt 2.0)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((pow(l_m, 2.0) / Om) * -2.0))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = sqrt((U * ((n * fma(U_42_, (n / Om), -2.0)) / Om))) * (l_m * sqrt(2.0));
}
return tmp;
}
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1))) tmp = 0.0 if (t_2 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64((l_m ^ 2.0) / Om) * -2.0))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(sqrt(Float64(U * Float64(Float64(n * fma(U_42_, Float64(n / Om), -2.0)) / Om))) * Float64(l_m * sqrt(2.0))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(N[(n * N[(U$42$ * N[(n / Om), $MachinePrecision] + -2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)}\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \frac{{l\_m}^{2}}{Om} \cdot -2\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \frac{n \cdot \mathsf{fma}\left(U*, \frac{n}{Om}, -2\right)}{Om}} \cdot \left(l\_m \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 11.0%
Simplified32.9%
Taylor expanded in Om around inf 30.1%
pow1/230.1%
*-commutative30.1%
unpow-prod-down40.6%
pow1/240.6%
cancel-sign-sub-inv40.6%
metadata-eval40.6%
pow1/240.6%
Applied egg-rr40.6%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 71.4%
Simplified77.1%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 0.0%
Simplified14.2%
Taylor expanded in U around 0 11.4%
mul-1-neg11.4%
associate-/l*0.6%
unpow20.6%
unpow20.6%
times-frac14.3%
unpow214.3%
Simplified14.3%
Taylor expanded in Om around -inf 17.1%
mul-1-neg17.1%
fma-define17.1%
associate-/l*17.0%
Simplified17.0%
Taylor expanded in l around 0 32.3%
associate-/l*32.3%
sub-neg32.3%
associate-/l*34.9%
metadata-eval34.9%
Simplified34.9%
Taylor expanded in t around 0 14.3%
associate-/l*20.2%
associate-*r/20.2%
fmm-def20.2%
metadata-eval20.2%
Simplified20.2%
Final simplification63.9%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1
(sqrt
(*
(* (* 2.0 n) U)
(+
(- t (* 2.0 (/ (* l_m l_m) Om)))
(* (* n (pow (/ l_m Om) 2.0)) (- U* U)))))))
(if (<= t_1 0.0)
(* (sqrt (* 2.0 n)) (sqrt (* U (+ t (* (/ (pow l_m 2.0) Om) -2.0)))))
(if (<= t_1 5e+152)
t_1
(*
(* l_m (sqrt 2.0))
(sqrt (/ (* U (* n (- (/ (* n U*) Om) 2.0))) Om)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_1 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t + ((pow(l_m, 2.0) / Om) * -2.0))));
} else if (t_1 <= 5e+152) {
tmp = t_1;
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) + ((n * ((l_m / om) ** 2.0d0)) * (u_42 - u)))))
if (t_1 <= 0.0d0) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * (t + (((l_m ** 2.0d0) / om) * (-2.0d0)))))
else if (t_1 <= 5d+152) then
tmp = t_1
else
tmp = (l_m * sqrt(2.0d0)) * sqrt(((u * (n * (((n * u_42) / om) - 2.0d0))) / om))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U)))));
double tmp;
if (t_1 <= 0.0) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * (t + ((Math.pow(l_m, 2.0) / Om) * -2.0))));
} else if (t_1 <= 5e+152) {
tmp = t_1;
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * math.pow((l_m / Om), 2.0)) * (U_42_ - U))))) tmp = 0 if t_1 <= 0.0: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * (t + ((math.pow(l_m, 2.0) / Om) * -2.0)))) elif t_1 <= 5e+152: tmp = t_1 else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U))))) tmp = 0.0 if (t_1 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t + Float64(Float64((l_m ^ 2.0) / Om) * -2.0))))); elseif (t_1 <= 5e+152) tmp = t_1; else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / Om) - 2.0))) / Om))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + ((n * ((l_m / Om) ^ 2.0)) * (U_42_ - U))))); tmp = 0.0; if (t_1 <= 0.0) tmp = sqrt((2.0 * n)) * sqrt((U * (t + (((l_m ^ 2.0) / Om) * -2.0)))); elseif (t_1 <= 5e+152) tmp = t_1; else tmp = (l_m * sqrt(2.0)) * sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t + N[(N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+152], t$95$1, N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\right)}\\
\mathbf{if}\;t\_1 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t + \frac{{l\_m}^{2}}{Om} \cdot -2\right)}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+152}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\frac{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{Om} - 2\right)\right)}{Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 0.0Initial program 11.0%
Simplified32.9%
Taylor expanded in Om around inf 30.1%
pow1/230.1%
*-commutative30.1%
unpow-prod-down40.6%
pow1/240.6%
cancel-sign-sub-inv40.6%
metadata-eval40.6%
pow1/240.6%
Applied egg-rr40.6%
if 0.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 5e152Initial program 98.3%
if 5e152 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 22.3%
Simplified34.6%
Taylor expanded in U around 0 23.2%
mul-1-neg23.2%
associate-/l*19.9%
unpow219.9%
unpow219.9%
times-frac34.6%
unpow234.6%
Simplified34.6%
Taylor expanded in Om around -inf 26.6%
mul-1-neg26.6%
fma-define26.6%
associate-/l*26.6%
Simplified26.6%
Taylor expanded in l around 0 31.4%
associate-/l*31.3%
sub-neg31.3%
associate-/l*32.4%
metadata-eval32.4%
Simplified32.4%
Taylor expanded in t around 0 24.6%
Final simplification57.9%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* l_m (/ l_m Om))))
(t_2 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_3 (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2))))
(if (<= t_3 2e-217)
(sqrt (* (* 2.0 n) (* U (- t t_1))))
(if (<= t_3 2e+305)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 t_1))))
(*
(* l_m (sqrt 2.0))
(sqrt (/ (* U (* n (- (/ (* n U*) Om) 2.0))) Om)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (l_m * (l_m / Om));
double t_2 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 2e-217) {
tmp = sqrt(((2.0 * n) * (U * (t - t_1))));
} else if (t_3 <= 2e+305) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = 2.0d0 * (l_m * (l_m / om))
t_2 = (n * ((l_m / om) ** 2.0d0)) * (u_42 - u)
t_3 = ((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) + t_2)
if (t_3 <= 2d-217) then
tmp = sqrt(((2.0d0 * n) * (u * (t - t_1))))
else if (t_3 <= 2d+305) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (t_2 - t_1))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt(((u * (n * (((n * u_42) / om) - 2.0d0))) / om))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (l_m * (l_m / Om));
double t_2 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2);
double tmp;
if (t_3 <= 2e-217) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - t_1))));
} else if (t_3 <= 2e+305) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = 2.0 * (l_m * (l_m / Om)) t_2 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2) tmp = 0 if t_3 <= 2e-217: tmp = math.sqrt(((2.0 * n) * (U * (t - t_1)))) elif t_3 <= 2e+305: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(2.0 * Float64(l_m * Float64(l_m / Om))) t_2 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2)) tmp = 0.0 if (t_3 <= 2e-217) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - t_1)))); elseif (t_3 <= 2e+305) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / Om) - 2.0))) / Om))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = 2.0 * (l_m * (l_m / Om)); t_2 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_3 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2); tmp = 0.0; if (t_3 <= 2e-217) tmp = sqrt(((2.0 * n) * (U * (t - t_1)))); elseif (t_3 <= 2e+305) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 2e-217], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$3, 2e+305], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\\
t_2 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)\\
\mathbf{if}\;t\_3 \leq 2 \cdot 10^{-217}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - t\_1\right)\right)}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+305}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\frac{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{Om} - 2\right)\right)}{Om}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 2.00000000000000016e-217Initial program 27.9%
Simplified44.4%
Taylor expanded in Om around inf 44.3%
unpow244.3%
associate-*r/46.3%
*-commutative46.3%
Applied egg-rr46.3%
if 2.00000000000000016e-217 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 1.9999999999999999e305Initial program 98.2%
Simplified98.2%
if 1.9999999999999999e305 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 23.8%
Simplified35.9%
Taylor expanded in U around 0 21.0%
mul-1-neg21.0%
associate-/l*21.2%
unpow221.2%
unpow221.2%
times-frac35.9%
unpow235.9%
Simplified35.9%
Taylor expanded in Om around -inf 24.6%
mul-1-neg24.6%
fma-define24.6%
associate-/l*24.6%
Simplified24.6%
Taylor expanded in l around 0 31.5%
associate-/l*31.4%
sub-neg31.4%
associate-/l*31.7%
metadata-eval31.7%
Simplified31.7%
Taylor expanded in t around 0 25.1%
Final simplification57.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* l_m (/ l_m Om))))
(if (<= l_m 3.1e-180)
(sqrt (fabs (* (* (* 2.0 n) U) t)))
(if (<= l_m 2e+144)
(sqrt
(*
(* 2.0 n)
(* U (+ t (* (* l_m l_m) (/ (+ -2.0 (* U* (/ n Om))) Om))))))
(if (<= l_m 2.35e+226)
(sqrt (* (* 2.0 n) (* U (- t (* 2.0 t_1)))))
(* (sqrt (* 2.0 (* n U))) (sqrt (+ t (* -2.0 t_1)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = l_m * (l_m / Om);
double tmp;
if (l_m <= 3.1e-180) {
tmp = sqrt(fabs((((2.0 * n) * U) * t)));
} else if (l_m <= 2e+144) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else if (l_m <= 2.35e+226) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * t_1)))));
} else {
tmp = sqrt((2.0 * (n * U))) * sqrt((t + (-2.0 * t_1)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: tmp
t_1 = l_m * (l_m / om)
if (l_m <= 3.1d-180) then
tmp = sqrt(abs((((2.0d0 * n) * u) * t)))
else if (l_m <= 2d+144) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l_m * l_m) * (((-2.0d0) + (u_42 * (n / om))) / om))))))
else if (l_m <= 2.35d+226) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * t_1)))))
else
tmp = sqrt((2.0d0 * (n * u))) * sqrt((t + ((-2.0d0) * t_1)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = l_m * (l_m / Om);
double tmp;
if (l_m <= 3.1e-180) {
tmp = Math.sqrt(Math.abs((((2.0 * n) * U) * t)));
} else if (l_m <= 2e+144) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else if (l_m <= 2.35e+226) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * t_1)))));
} else {
tmp = Math.sqrt((2.0 * (n * U))) * Math.sqrt((t + (-2.0 * t_1)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = l_m * (l_m / Om) tmp = 0 if l_m <= 3.1e-180: tmp = math.sqrt(math.fabs((((2.0 * n) * U) * t))) elif l_m <= 2e+144: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))) elif l_m <= 2.35e+226: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * t_1))))) else: tmp = math.sqrt((2.0 * (n * U))) * math.sqrt((t + (-2.0 * t_1))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(l_m * Float64(l_m / Om)) tmp = 0.0 if (l_m <= 3.1e-180) tmp = sqrt(abs(Float64(Float64(Float64(2.0 * n) * U) * t))); elseif (l_m <= 2e+144) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l_m * l_m) * Float64(Float64(-2.0 + Float64(U_42_ * Float64(n / Om))) / Om)))))); elseif (l_m <= 2.35e+226) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * t_1))))); else tmp = Float64(sqrt(Float64(2.0 * Float64(n * U))) * sqrt(Float64(t + Float64(-2.0 * t_1)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = l_m * (l_m / Om); tmp = 0.0; if (l_m <= 3.1e-180) tmp = sqrt(abs((((2.0 * n) * U) * t))); elseif (l_m <= 2e+144) tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))); elseif (l_m <= 2.35e+226) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * t_1))))); else tmp = sqrt((2.0 * (n * U))) * sqrt((t + (-2.0 * t_1))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l$95$m, 3.1e-180], N[Sqrt[N[Abs[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 2e+144], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 2.35e+226], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t + N[(-2.0 * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := l\_m \cdot \frac{l\_m}{Om}\\
\mathbf{if}\;l\_m \leq 3.1 \cdot 10^{-180}:\\
\;\;\;\;\sqrt{\left|\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right|}\\
\mathbf{elif}\;l\_m \leq 2 \cdot 10^{+144}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(l\_m \cdot l\_m\right) \cdot \frac{-2 + U* \cdot \frac{n}{Om}}{Om}\right)\right)}\\
\mathbf{elif}\;l\_m \leq 2.35 \cdot 10^{+226}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot U\right)} \cdot \sqrt{t + -2 \cdot t\_1}\\
\end{array}
\end{array}
if l < 3.0999999999999999e-180Initial program 57.0%
Simplified57.9%
Taylor expanded in l around 0 42.7%
associate-*r*42.7%
Simplified42.7%
add-sqr-sqrt42.7%
pow1/242.7%
pow1/243.4%
pow-prod-down30.5%
pow230.5%
Applied egg-rr30.5%
unpow1/230.5%
unpow230.5%
rem-sqrt-square43.9%
associate-*r*48.5%
associate-*r*48.5%
*-commutative48.5%
associate-*r*48.5%
Simplified48.5%
if 3.0999999999999999e-180 < l < 2.00000000000000005e144Initial program 48.8%
Simplified50.5%
Taylor expanded in U around 0 50.2%
mul-1-neg50.2%
associate-/l*50.1%
unpow250.1%
unpow250.1%
times-frac50.1%
unpow250.1%
Simplified50.1%
Taylor expanded in Om around -inf 53.3%
mul-1-neg53.3%
fma-define53.3%
associate-/l*56.3%
Simplified56.3%
Taylor expanded in l around 0 50.5%
associate-/l*50.4%
sub-neg50.4%
associate-/l*57.9%
metadata-eval57.9%
Simplified57.9%
unpow257.9%
Applied egg-rr57.9%
if 2.00000000000000005e144 < l < 2.34999999999999996e226Initial program 34.2%
Simplified66.9%
Taylor expanded in Om around inf 34.7%
unpow234.7%
associate-*r/66.9%
*-commutative66.9%
Applied egg-rr66.9%
if 2.34999999999999996e226 < l Initial program 29.6%
Simplified38.5%
Taylor expanded in Om around inf 29.6%
pow1/248.1%
associate-*r*48.1%
unpow-prod-down39.0%
pow1/229.6%
cancel-sign-sub-inv29.6%
metadata-eval29.6%
Applied egg-rr29.6%
unpow1/229.6%
associate-*l*29.6%
Simplified29.6%
unpow229.6%
associate-*r/38.5%
*-commutative38.5%
Applied egg-rr81.4%
Final simplification53.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 4.4e-180)
(sqrt (fabs (* (* (* 2.0 n) U) t)))
(if (<= l_m 2e+144)
(sqrt
(*
(* 2.0 n)
(* U (+ t (* (* l_m l_m) (/ (+ -2.0 (* U* (/ n Om))) Om))))))
(if (<= l_m 2.9e+214)
(sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l_m (/ l_m Om)))))))
(pow (* (* 2.0 n) (* (/ (pow l_m 2.0) Om) (* U -2.0))) 0.5)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 4.4e-180) {
tmp = sqrt(fabs((((2.0 * n) * U) * t)));
} else if (l_m <= 2e+144) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else if (l_m <= 2.9e+214) {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = pow(((2.0 * n) * ((pow(l_m, 2.0) / Om) * (U * -2.0))), 0.5);
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 4.4d-180) then
tmp = sqrt(abs((((2.0d0 * n) * u) * t)))
else if (l_m <= 2d+144) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l_m * l_m) * (((-2.0d0) + (u_42 * (n / om))) / om))))))
else if (l_m <= 2.9d+214) then
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l_m * (l_m / om)))))))
else
tmp = ((2.0d0 * n) * (((l_m ** 2.0d0) / om) * (u * (-2.0d0)))) ** 0.5d0
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 4.4e-180) {
tmp = Math.sqrt(Math.abs((((2.0 * n) * U) * t)));
} else if (l_m <= 2e+144) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else if (l_m <= 2.9e+214) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = Math.pow(((2.0 * n) * ((Math.pow(l_m, 2.0) / Om) * (U * -2.0))), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 4.4e-180: tmp = math.sqrt(math.fabs((((2.0 * n) * U) * t))) elif l_m <= 2e+144: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))) elif l_m <= 2.9e+214: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))) else: tmp = math.pow(((2.0 * n) * ((math.pow(l_m, 2.0) / Om) * (U * -2.0))), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 4.4e-180) tmp = sqrt(abs(Float64(Float64(Float64(2.0 * n) * U) * t))); elseif (l_m <= 2e+144) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l_m * l_m) * Float64(Float64(-2.0 + Float64(U_42_ * Float64(n / Om))) / Om)))))); elseif (l_m <= 2.9e+214) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(Float64(2.0 * n) * Float64(Float64((l_m ^ 2.0) / Om) * Float64(U * -2.0))) ^ 0.5; end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 4.4e-180) tmp = sqrt(abs((((2.0 * n) * U) * t))); elseif (l_m <= 2e+144) tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))); elseif (l_m <= 2.9e+214) tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))); else tmp = ((2.0 * n) * (((l_m ^ 2.0) / Om) * (U * -2.0))) ^ 0.5; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 4.4e-180], N[Sqrt[N[Abs[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 2e+144], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 2.9e+214], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision] * N[(U * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 4.4 \cdot 10^{-180}:\\
\;\;\;\;\sqrt{\left|\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right|}\\
\mathbf{elif}\;l\_m \leq 2 \cdot 10^{+144}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(l\_m \cdot l\_m\right) \cdot \frac{-2 + U* \cdot \frac{n}{Om}}{Om}\right)\right)}\\
\mathbf{elif}\;l\_m \leq 2.9 \cdot 10^{+214}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(\frac{{l\_m}^{2}}{Om} \cdot \left(U \cdot -2\right)\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 4.40000000000000026e-180Initial program 57.0%
Simplified57.9%
Taylor expanded in l around 0 42.7%
associate-*r*42.7%
Simplified42.7%
add-sqr-sqrt42.7%
pow1/242.7%
pow1/243.4%
pow-prod-down30.5%
pow230.5%
Applied egg-rr30.5%
unpow1/230.5%
unpow230.5%
rem-sqrt-square43.9%
associate-*r*48.5%
associate-*r*48.5%
*-commutative48.5%
associate-*r*48.5%
Simplified48.5%
if 4.40000000000000026e-180 < l < 2.00000000000000005e144Initial program 48.8%
Simplified50.5%
Taylor expanded in U around 0 50.2%
mul-1-neg50.2%
associate-/l*50.1%
unpow250.1%
unpow250.1%
times-frac50.1%
unpow250.1%
Simplified50.1%
Taylor expanded in Om around -inf 53.3%
mul-1-neg53.3%
fma-define53.3%
associate-/l*56.3%
Simplified56.3%
Taylor expanded in l around 0 50.5%
associate-/l*50.4%
sub-neg50.4%
associate-/l*57.9%
metadata-eval57.9%
Simplified57.9%
unpow257.9%
Applied egg-rr57.9%
if 2.00000000000000005e144 < l < 2.8999999999999999e214Initial program 50.6%
Simplified83.1%
Taylor expanded in Om around inf 50.8%
unpow250.8%
associate-*r/83.1%
*-commutative83.1%
Applied egg-rr83.1%
if 2.8999999999999999e214 < l Initial program 23.5%
Simplified37.6%
Taylor expanded in Om around inf 23.8%
Taylor expanded in t around 0 23.8%
associate-*r/23.8%
associate-*r*23.8%
Simplified23.8%
pow1/245.5%
associate-/l*45.5%
Applied egg-rr45.5%
Final simplification51.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 7e-179)
(sqrt (fabs (* (* (* 2.0 n) U) t)))
(if (<= l_m 1.7e+156)
(sqrt
(*
(* 2.0 n)
(* U (+ t (* (* l_m l_m) (/ (+ -2.0 (* U* (/ n Om))) Om))))))
(*
(* l_m (sqrt 2.0))
(sqrt (/ (* U (* n (- (/ (* n U*) Om) 2.0))) Om))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 7e-179) {
tmp = sqrt(fabs((((2.0 * n) * U) * t)));
} else if (l_m <= 1.7e+156) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 7d-179) then
tmp = sqrt(abs((((2.0d0 * n) * u) * t)))
else if (l_m <= 1.7d+156) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l_m * l_m) * (((-2.0d0) + (u_42 * (n / om))) / om))))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt(((u * (n * (((n * u_42) / om) - 2.0d0))) / om))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 7e-179) {
tmp = Math.sqrt(Math.abs((((2.0 * n) * U) * t)));
} else if (l_m <= 1.7e+156) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 7e-179: tmp = math.sqrt(math.fabs((((2.0 * n) * U) * t))) elif l_m <= 1.7e+156: tmp = math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 7e-179) tmp = sqrt(abs(Float64(Float64(Float64(2.0 * n) * U) * t))); elseif (l_m <= 1.7e+156) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l_m * l_m) * Float64(Float64(-2.0 + Float64(U_42_ * Float64(n / Om))) / Om)))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / Om) - 2.0))) / Om))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 7e-179) tmp = sqrt(abs((((2.0 * n) * U) * t))); elseif (l_m <= 1.7e+156) tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))); else tmp = (l_m * sqrt(2.0)) * sqrt(((U * (n * (((n * U_42_) / Om) - 2.0))) / Om)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 7e-179], N[Sqrt[N[Abs[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 1.7e+156], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 7 \cdot 10^{-179}:\\
\;\;\;\;\sqrt{\left|\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right|}\\
\mathbf{elif}\;l\_m \leq 1.7 \cdot 10^{+156}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(l\_m \cdot l\_m\right) \cdot \frac{-2 + U* \cdot \frac{n}{Om}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\frac{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{Om} - 2\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 7.00000000000000049e-179Initial program 57.0%
Simplified57.9%
Taylor expanded in l around 0 42.7%
associate-*r*42.7%
Simplified42.7%
add-sqr-sqrt42.7%
pow1/242.7%
pow1/243.4%
pow-prod-down30.5%
pow230.5%
Applied egg-rr30.5%
unpow1/230.5%
unpow230.5%
rem-sqrt-square43.9%
associate-*r*48.5%
associate-*r*48.5%
*-commutative48.5%
associate-*r*48.5%
Simplified48.5%
if 7.00000000000000049e-179 < l < 1.7e156Initial program 50.3%
Simplified51.9%
Taylor expanded in U around 0 50.2%
mul-1-neg50.2%
associate-/l*51.5%
unpow251.5%
unpow251.5%
times-frac51.5%
unpow251.5%
Simplified51.5%
Taylor expanded in Om around -inf 53.2%
mul-1-neg53.2%
fma-define53.2%
associate-/l*57.5%
Simplified57.5%
Taylor expanded in l around 0 51.9%
associate-/l*51.8%
sub-neg51.8%
associate-/l*59.1%
metadata-eval59.1%
Simplified59.1%
unpow259.1%
Applied egg-rr59.1%
if 1.7e156 < l Initial program 24.1%
Simplified45.9%
Taylor expanded in U around 0 16.9%
mul-1-neg16.9%
associate-/l*16.9%
unpow216.9%
unpow216.9%
times-frac45.9%
unpow245.9%
Simplified45.9%
Taylor expanded in Om around -inf 23.9%
mul-1-neg23.9%
fma-define23.9%
associate-/l*23.9%
Simplified23.9%
Taylor expanded in l around 0 41.3%
associate-/l*41.3%
sub-neg41.3%
associate-/l*41.3%
metadata-eval41.3%
Simplified41.3%
Taylor expanded in t around 0 72.4%
Final simplification53.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 8e-180)
(sqrt (fabs (* (* (* 2.0 n) U) t)))
(if (or (<= l_m 2e+144) (not (<= l_m 3.25e+214)))
(sqrt
(*
(* 2.0 n)
(* U (+ t (* (* l_m l_m) (/ (+ -2.0 (* U* (/ n Om))) Om))))))
(sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l_m (/ l_m Om))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 8e-180) {
tmp = sqrt(fabs((((2.0 * n) * U) * t)));
} else if ((l_m <= 2e+144) || !(l_m <= 3.25e+214)) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 8d-180) then
tmp = sqrt(abs((((2.0d0 * n) * u) * t)))
else if ((l_m <= 2d+144) .or. (.not. (l_m <= 3.25d+214))) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l_m * l_m) * (((-2.0d0) + (u_42 * (n / om))) / om))))))
else
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l_m * (l_m / om)))))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 8e-180) {
tmp = Math.sqrt(Math.abs((((2.0 * n) * U) * t)));
} else if ((l_m <= 2e+144) || !(l_m <= 3.25e+214)) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 8e-180: tmp = math.sqrt(math.fabs((((2.0 * n) * U) * t))) elif (l_m <= 2e+144) or not (l_m <= 3.25e+214): tmp = math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))) else: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 8e-180) tmp = sqrt(abs(Float64(Float64(Float64(2.0 * n) * U) * t))); elseif ((l_m <= 2e+144) || !(l_m <= 3.25e+214)) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l_m * l_m) * Float64(Float64(-2.0 + Float64(U_42_ * Float64(n / Om))) / Om)))))); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 8e-180) tmp = sqrt(abs((((2.0 * n) * U) * t))); elseif ((l_m <= 2e+144) || ~((l_m <= 3.25e+214))) tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))); else tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 8e-180], N[Sqrt[N[Abs[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[l$95$m, 2e+144], N[Not[LessEqual[l$95$m, 3.25e+214]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 8 \cdot 10^{-180}:\\
\;\;\;\;\sqrt{\left|\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\right|}\\
\mathbf{elif}\;l\_m \leq 2 \cdot 10^{+144} \lor \neg \left(l\_m \leq 3.25 \cdot 10^{+214}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(l\_m \cdot l\_m\right) \cdot \frac{-2 + U* \cdot \frac{n}{Om}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 8.0000000000000002e-180Initial program 57.0%
Simplified57.9%
Taylor expanded in l around 0 42.7%
associate-*r*42.7%
Simplified42.7%
add-sqr-sqrt42.7%
pow1/242.7%
pow1/243.4%
pow-prod-down30.5%
pow230.5%
Applied egg-rr30.5%
unpow1/230.5%
unpow230.5%
rem-sqrt-square43.9%
associate-*r*48.5%
associate-*r*48.5%
*-commutative48.5%
associate-*r*48.5%
Simplified48.5%
if 8.0000000000000002e-180 < l < 2.00000000000000005e144 or 3.25e214 < l Initial program 44.5%
Simplified48.3%
Taylor expanded in U around 0 44.1%
mul-1-neg44.1%
associate-/l*44.0%
unpow244.0%
unpow244.0%
times-frac48.0%
unpow248.0%
Simplified48.0%
Taylor expanded in Om around -inf 48.2%
mul-1-neg48.2%
fma-define48.2%
associate-/l*50.6%
Simplified50.6%
Taylor expanded in l around 0 49.6%
associate-/l*49.6%
sub-neg49.6%
associate-/l*55.8%
metadata-eval55.8%
Simplified55.8%
unpow255.8%
Applied egg-rr55.8%
if 2.00000000000000005e144 < l < 3.25e214Initial program 50.6%
Simplified83.1%
Taylor expanded in Om around inf 50.8%
unpow250.8%
associate-*r/83.1%
*-commutative83.1%
Applied egg-rr83.1%
Final simplification51.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 8e-179)
(sqrt (* (* (* 2.0 n) U) t))
(if (or (<= l_m 2e+144) (not (<= l_m 1.95e+214)))
(sqrt
(*
(* 2.0 n)
(* U (+ t (* (* l_m l_m) (/ (+ -2.0 (* U* (/ n Om))) Om))))))
(sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l_m (/ l_m Om))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 8e-179) {
tmp = sqrt((((2.0 * n) * U) * t));
} else if ((l_m <= 2e+144) || !(l_m <= 1.95e+214)) {
tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 8d-179) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else if ((l_m <= 2d+144) .or. (.not. (l_m <= 1.95d+214))) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((l_m * l_m) * (((-2.0d0) + (u_42 * (n / om))) / om))))))
else
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l_m * (l_m / om)))))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 8e-179) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else if ((l_m <= 2e+144) || !(l_m <= 1.95e+214)) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om))))));
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 8e-179: tmp = math.sqrt((((2.0 * n) * U) * t)) elif (l_m <= 2e+144) or not (l_m <= 1.95e+214): tmp = math.sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))) else: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 8e-179) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); elseif ((l_m <= 2e+144) || !(l_m <= 1.95e+214)) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(l_m * l_m) * Float64(Float64(-2.0 + Float64(U_42_ * Float64(n / Om))) / Om)))))); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 8e-179) tmp = sqrt((((2.0 * n) * U) * t)); elseif ((l_m <= 2e+144) || ~((l_m <= 1.95e+214))) tmp = sqrt(((2.0 * n) * (U * (t + ((l_m * l_m) * ((-2.0 + (U_42_ * (n / Om))) / Om)))))); else tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 8e-179], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[l$95$m, 2e+144], N[Not[LessEqual[l$95$m, 1.95e+214]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(N[(-2.0 + N[(U$42$ * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 8 \cdot 10^{-179}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{elif}\;l\_m \leq 2 \cdot 10^{+144} \lor \neg \left(l\_m \leq 1.95 \cdot 10^{+214}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(l\_m \cdot l\_m\right) \cdot \frac{-2 + U* \cdot \frac{n}{Om}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 8.0000000000000002e-179Initial program 57.0%
Simplified57.9%
Taylor expanded in l around 0 42.7%
associate-*r*42.7%
Simplified42.7%
Taylor expanded in U around 0 42.7%
associate-*r*42.7%
associate-*r*47.3%
associate-*r*47.3%
*-commutative47.3%
associate-*r*47.3%
Simplified47.3%
if 8.0000000000000002e-179 < l < 2.00000000000000005e144 or 1.95000000000000007e214 < l Initial program 44.5%
Simplified48.3%
Taylor expanded in U around 0 44.1%
mul-1-neg44.1%
associate-/l*44.0%
unpow244.0%
unpow244.0%
times-frac48.0%
unpow248.0%
Simplified48.0%
Taylor expanded in Om around -inf 48.2%
mul-1-neg48.2%
fma-define48.2%
associate-/l*50.6%
Simplified50.6%
Taylor expanded in l around 0 49.6%
associate-/l*49.6%
sub-neg49.6%
associate-/l*55.8%
metadata-eval55.8%
Simplified55.8%
unpow255.8%
Applied egg-rr55.8%
if 2.00000000000000005e144 < l < 1.95000000000000007e214Initial program 50.6%
Simplified83.1%
Taylor expanded in Om around inf 50.8%
unpow250.8%
associate-*r/83.1%
*-commutative83.1%
Applied egg-rr83.1%
Final simplification50.8%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 5.4e-195)
(sqrt (* (* (* 2.0 n) U) t))
(if (<= l_m 1e+58)
(sqrt (* (* 2.0 n) (* U (+ t (/ (* U* (* (* l_m l_m) (/ n Om))) Om)))))
(sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l_m (/ l_m Om))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 5.4e-195) {
tmp = sqrt((((2.0 * n) * U) * t));
} else if (l_m <= 1e+58) {
tmp = sqrt(((2.0 * n) * (U * (t + ((U_42_ * ((l_m * l_m) * (n / Om))) / Om)))));
} else {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 5.4d-195) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else if (l_m <= 1d+58) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((u_42 * ((l_m * l_m) * (n / om))) / om)))))
else
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l_m * (l_m / om)))))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 5.4e-195) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else if (l_m <= 1e+58) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((U_42_ * ((l_m * l_m) * (n / Om))) / Om)))));
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 5.4e-195: tmp = math.sqrt((((2.0 * n) * U) * t)) elif l_m <= 1e+58: tmp = math.sqrt(((2.0 * n) * (U * (t + ((U_42_ * ((l_m * l_m) * (n / Om))) / Om))))) else: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 5.4e-195) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); elseif (l_m <= 1e+58) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(U_42_ * Float64(Float64(l_m * l_m) * Float64(n / Om))) / Om))))); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 5.4e-195) tmp = sqrt((((2.0 * n) * U) * t)); elseif (l_m <= 1e+58) tmp = sqrt(((2.0 * n) * (U * (t + ((U_42_ * ((l_m * l_m) * (n / Om))) / Om))))); else tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 5.4e-195], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 1e+58], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(U$42$ * N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(n / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 5.4 \cdot 10^{-195}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{elif}\;l\_m \leq 10^{+58}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \frac{U* \cdot \left(\left(l\_m \cdot l\_m\right) \cdot \frac{n}{Om}\right)}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 5.4e-195Initial program 56.5%
Simplified57.4%
Taylor expanded in l around 0 42.6%
associate-*r*42.6%
Simplified42.6%
Taylor expanded in U around 0 42.6%
associate-*r*42.6%
associate-*r*46.7%
associate-*r*46.7%
*-commutative46.7%
associate-*r*46.7%
Simplified46.7%
if 5.4e-195 < l < 9.99999999999999944e57Initial program 50.5%
Simplified53.1%
Taylor expanded in U around 0 54.8%
mul-1-neg54.8%
associate-/l*52.5%
unpow252.5%
unpow252.5%
times-frac52.5%
unpow252.5%
Simplified52.5%
Taylor expanded in Om around -inf 52.8%
mul-1-neg52.8%
fma-define52.8%
associate-/l*55.0%
Simplified55.0%
Taylor expanded in U* around inf 49.8%
associate-/l*52.0%
associate-*r/54.0%
Simplified54.0%
unpow255.3%
Applied egg-rr54.0%
if 9.99999999999999944e57 < l Initial program 40.8%
Simplified50.2%
Taylor expanded in Om around inf 43.1%
unpow243.1%
associate-*r/52.5%
*-commutative52.5%
Applied egg-rr52.5%
Final simplification49.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 4.2e-44) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* (* 2.0 n) (* U (- t (* 2.0 (* l_m (/ l_m Om)))))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 4.2e-44) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 4.2d-44) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * n) * (u * (t - (2.0d0 * (l_m * (l_m / om)))))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 4.2e-44) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om)))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 4.2e-44: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 4.2e-44) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 4.2e-44) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt(((2.0 * n) * (U * (t - (2.0 * (l_m * (l_m / Om))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 4.2e-44], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 4.2 \cdot 10^{-44}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\end{array}
\end{array}
if l < 4.20000000000000003e-44Initial program 55.7%
Simplified56.7%
Taylor expanded in l around 0 41.3%
pow1/242.3%
associate-*r*46.0%
Applied egg-rr46.0%
if 4.20000000000000003e-44 < l Initial program 43.0%
Simplified51.3%
Taylor expanded in Om around inf 42.8%
unpow242.8%
associate-*r/49.5%
*-commutative49.5%
Applied egg-rr49.5%
Final simplification46.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 9e+55) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* -4.0 (/ (* U (* n (* l_m l_m))) Om)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 9e+55) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt((-4.0 * ((U * (n * (l_m * l_m))) / Om)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 9d+55) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((-4.0d0) * ((u * (n * (l_m * l_m))) / om)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 9e+55) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt((-4.0 * ((U * (n * (l_m * l_m))) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 9e+55: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt((-4.0 * ((U * (n * (l_m * l_m))) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 9e+55) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(-4.0 * Float64(Float64(U * Float64(n * Float64(l_m * l_m))) / Om))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 9e+55) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt((-4.0 * ((U * (n * (l_m * l_m))) / Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 9e+55], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(-4.0 * N[(N[(U * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 9 \cdot 10^{+55}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-4 \cdot \frac{U \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 8.99999999999999996e55Initial program 55.1%
Simplified56.4%
Taylor expanded in l around 0 41.1%
pow1/242.0%
associate-*r*45.0%
Applied egg-rr45.0%
if 8.99999999999999996e55 < l Initial program 40.8%
Simplified50.2%
Taylor expanded in Om around inf 43.1%
Taylor expanded in t around 0 40.5%
unpow257.9%
Applied egg-rr40.5%
Final simplification44.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 3e+14) (pow (* 2.0 (* t (* n U))) 0.5) (pow (* (* 2.0 U) (* n t)) 0.5)))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 3e+14) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 3d+14) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = ((2.0d0 * u) * (n * t)) ** 0.5d0
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 3e+14) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.pow(((2.0 * U) * (n * t)), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 3e+14: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.pow(((2.0 * U) * (n * t)), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 3e+14) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = Float64(Float64(2.0 * U) * Float64(n * t)) ^ 0.5; end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 3e+14) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = ((2.0 * U) * (n * t)) ^ 0.5; end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 3e+14], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 3 \cdot 10^{+14}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(2 \cdot U\right) \cdot \left(n \cdot t\right)\right)}^{0.5}\\
\end{array}
\end{array}
if l < 3e14Initial program 55.2%
Simplified56.5%
Taylor expanded in l around 0 41.6%
pow1/242.6%
associate-*r*45.7%
Applied egg-rr45.7%
if 3e14 < l Initial program 42.9%
Simplified50.8%
Taylor expanded in l around 0 19.4%
associate-*r*19.4%
Simplified19.4%
pow1/223.4%
Applied egg-rr23.4%
Final simplification41.4%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 2.3e+68) (sqrt (* (* (* 2.0 n) U) t)) (sqrt (* (* 2.0 U) (* n t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 2.3e+68) {
tmp = sqrt((((2.0 * n) * U) * t));
} else {
tmp = sqrt(((2.0 * U) * (n * t)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 2.3d+68) then
tmp = sqrt((((2.0d0 * n) * u) * t))
else
tmp = sqrt(((2.0d0 * u) * (n * t)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 2.3e+68) {
tmp = Math.sqrt((((2.0 * n) * U) * t));
} else {
tmp = Math.sqrt(((2.0 * U) * (n * t)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 2.3e+68: tmp = math.sqrt((((2.0 * n) * U) * t)) else: tmp = math.sqrt(((2.0 * U) * (n * t))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 2.3e+68) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t)); else tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 2.3e+68) tmp = sqrt((((2.0 * n) * U) * t)); else tmp = sqrt(((2.0 * U) * (n * t))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 2.3e+68], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 2.3 \cdot 10^{+68}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}\\
\end{array}
\end{array}
if l < 2.3e68Initial program 53.9%
Simplified55.2%
Taylor expanded in l around 0 39.6%
associate-*r*39.6%
Simplified39.6%
Taylor expanded in U around 0 39.6%
associate-*r*39.6%
associate-*r*43.1%
associate-*r*43.1%
*-commutative43.1%
associate-*r*43.2%
Simplified43.2%
if 2.3e68 < l Initial program 46.1%
Simplified56.9%
Taylor expanded in l around 0 20.1%
associate-*r*20.1%
Simplified20.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 2.05e+68) (sqrt (* t (* 2.0 (* n U)))) (sqrt (* (* 2.0 U) (* n t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 2.05e+68) {
tmp = sqrt((t * (2.0 * (n * U))));
} else {
tmp = sqrt(((2.0 * U) * (n * t)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 2.05d+68) then
tmp = sqrt((t * (2.0d0 * (n * u))))
else
tmp = sqrt(((2.0d0 * u) * (n * t)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 2.05e+68) {
tmp = Math.sqrt((t * (2.0 * (n * U))));
} else {
tmp = Math.sqrt(((2.0 * U) * (n * t)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 2.05e+68: tmp = math.sqrt((t * (2.0 * (n * U)))) else: tmp = math.sqrt(((2.0 * U) * (n * t))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 2.05e+68) tmp = sqrt(Float64(t * Float64(2.0 * Float64(n * U)))); else tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 2.05e+68) tmp = sqrt((t * (2.0 * (n * U)))); else tmp = sqrt(((2.0 * U) * (n * t))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 2.05e+68], N[Sqrt[N[(t * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 2.05 \cdot 10^{+68}:\\
\;\;\;\;\sqrt{t \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}\\
\end{array}
\end{array}
if l < 2.05e68Initial program 53.9%
Simplified57.9%
Taylor expanded in t around inf 43.1%
if 2.05e68 < l Initial program 46.1%
Simplified56.9%
Taylor expanded in l around 0 20.1%
associate-*r*20.1%
Simplified20.1%
Final simplification39.9%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U* 3.4e-243) (sqrt (* 2.0 (* n (* U t)))) (sqrt (* (* 2.0 U) (* n t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U_42_ <= 3.4e-243) {
tmp = sqrt((2.0 * (n * (U * t))));
} else {
tmp = sqrt(((2.0 * U) * (n * t)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (u_42 <= 3.4d-243) then
tmp = sqrt((2.0d0 * (n * (u * t))))
else
tmp = sqrt(((2.0d0 * u) * (n * t)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U_42_ <= 3.4e-243) {
tmp = Math.sqrt((2.0 * (n * (U * t))));
} else {
tmp = Math.sqrt(((2.0 * U) * (n * t)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U_42_ <= 3.4e-243: tmp = math.sqrt((2.0 * (n * (U * t)))) else: tmp = math.sqrt(((2.0 * U) * (n * t))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U_42_ <= 3.4e-243) tmp = sqrt(Float64(2.0 * Float64(n * Float64(U * t)))); else tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (U_42_ <= 3.4e-243) tmp = sqrt((2.0 * (n * (U * t)))); else tmp = sqrt(((2.0 * U) * (n * t))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U$42$, 3.4e-243], N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U* \leq 3.4 \cdot 10^{-243}:\\
\;\;\;\;\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\right)}\\
\end{array}
\end{array}
if U* < 3.39999999999999996e-243Initial program 57.7%
Simplified62.7%
Taylor expanded in l around 0 40.5%
if 3.39999999999999996e-243 < U* Initial program 46.9%
Simplified46.7%
Taylor expanded in l around 0 37.5%
associate-*r*37.5%
Simplified37.5%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (pow (* 2.0 (* t (* n U))) 0.5))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return pow((2.0 * (t * (n * U))), 0.5);
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = (2.0d0 * (t * (n * u))) ** 0.5d0
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return Math.pow((2.0 * (t * (n * U))), 0.5);
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.pow((2.0 * (t * (n * U))), 0.5)
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5 end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = (2.0 * (t * (n * U))) ^ 0.5; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}
\end{array}
Initial program 52.8%
Simplified55.4%
Taylor expanded in l around 0 36.6%
pow1/237.8%
associate-*r*39.9%
Applied egg-rr39.9%
Final simplification39.9%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* 2.0 (* n (* U t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return sqrt((2.0 * (n * (U * t))));
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (n * (u * t))))
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return Math.sqrt((2.0 * (n * (U * t))));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt((2.0 * (n * (U * t))))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(Float64(2.0 * Float64(n * Float64(U * t)))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt((2.0 * (n * (U * t)))); end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}
\end{array}
Initial program 52.8%
Simplified55.4%
Taylor expanded in l around 0 36.6%
herbie shell --seed 2024146
(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*))))))