
(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 24 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
(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 l_m) (pow (* 2.0 (* U (/ (* n t) l_m))) 0.5))
(if (<= t_1 1e+144)
t_1
(*
(sqrt l_m)
(pow
(/ (* -2.0 (* U (* (* n l_m) (+ 2.0 (/ (* n (- U U*)) Om))))) Om)
0.5))))))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(l_m) * pow((2.0 * (U * ((n * t) / l_m))), 0.5);
} else if (t_1 <= 1e+144) {
tmp = t_1;
} else {
tmp = sqrt(l_m) * pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 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) :: 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(l_m) * ((2.0d0 * (u * ((n * t) / l_m))) ** 0.5d0)
else if (t_1 <= 1d+144) then
tmp = t_1
else
tmp = sqrt(l_m) * ((((-2.0d0) * (u * ((n * l_m) * (2.0d0 + ((n * (u - u_42)) / om))))) / om) ** 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 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(l_m) * Math.pow((2.0 * (U * ((n * t) / l_m))), 0.5);
} else if (t_1 <= 1e+144) {
tmp = t_1;
} else {
tmp = Math.sqrt(l_m) * Math.pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 0.5);
}
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(l_m) * math.pow((2.0 * (U * ((n * t) / l_m))), 0.5) elif t_1 <= 1e+144: tmp = t_1 else: tmp = math.sqrt(l_m) * math.pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 0.5) 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(l_m) * (Float64(2.0 * Float64(U * Float64(Float64(n * t) / l_m))) ^ 0.5)); elseif (t_1 <= 1e+144) tmp = t_1; else tmp = Float64(sqrt(l_m) * (Float64(Float64(-2.0 * Float64(U * Float64(Float64(n * l_m) * Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om))))) / Om) ^ 0.5)); 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(l_m) * ((2.0 * (U * ((n * t) / l_m))) ^ 0.5); elseif (t_1 <= 1e+144) tmp = t_1; else tmp = sqrt(l_m) * (((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om) ^ 0.5); 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[l$95$m], $MachinePrecision] * N[Power[N[(2.0 * N[(U * N[(N[(n * t), $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+144], t$95$1, N[(N[Sqrt[l$95$m], $MachinePrecision] * N[Power[N[(N[(-2.0 * N[(U * N[(N[(n * l$95$m), $MachinePrecision] * N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], 0.5], $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{l\_m} \cdot {\left(2 \cdot \left(U \cdot \frac{n \cdot t}{l\_m}\right)\right)}^{0.5}\\
\mathbf{elif}\;t\_1 \leq 10^{+144}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{l\_m} \cdot {\left(\frac{-2 \cdot \left(U \cdot \left(\left(n \cdot l\_m\right) \cdot \left(2 + \frac{n \cdot \left(U - U*\right)}{Om}\right)\right)\right)}{Om}\right)}^{0.5}\\
\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 14.8%
Simplified14.8%
Taylor expanded in l around -inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified9.7%
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
metadata-evalN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr7.9%
Taylor expanded in l around 0
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6421.7%
Simplified21.7%
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*))))) < 1.00000000000000002e144Initial program 98.6%
if 1.00000000000000002e144 < (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 24.0%
Simplified38.0%
Taylor expanded in l around -inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified25.6%
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
metadata-evalN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr16.9%
Taylor expanded in l around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6425.4%
Simplified25.4%
Final simplification52.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 2.5e-56)
(sqrt
(*
(+ t (/ (+ (/ U* (/ (/ Om l_m) n)) (* l_m -2.0)) (/ Om l_m)))
(* 2.0 (* n U))))
(if (<= l_m 7.2e+186)
(*
(sqrt
(* U (+ (/ (* n t) (* l_m l_m)) (/ (* n (- (/ (* n U*) Om) 2.0)) Om))))
(* l_m (sqrt 2.0)))
(*
(sqrt l_m)
(pow
(/ (* -2.0 (* U (* (* n l_m) (+ 2.0 (/ (* n (- U U*)) Om))))) Om)
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 <= 2.5e-56) {
tmp = sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U))));
} else if (l_m <= 7.2e+186) {
tmp = sqrt((U * (((n * t) / (l_m * l_m)) + ((n * (((n * U_42_) / Om) - 2.0)) / Om)))) * (l_m * sqrt(2.0));
} else {
tmp = sqrt(l_m) * pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 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 <= 2.5d-56) then
tmp = sqrt(((t + (((u_42 / ((om / l_m) / n)) + (l_m * (-2.0d0))) / (om / l_m))) * (2.0d0 * (n * u))))
else if (l_m <= 7.2d+186) then
tmp = sqrt((u * (((n * t) / (l_m * l_m)) + ((n * (((n * u_42) / om) - 2.0d0)) / om)))) * (l_m * sqrt(2.0d0))
else
tmp = sqrt(l_m) * ((((-2.0d0) * (u * ((n * l_m) * (2.0d0 + ((n * (u - u_42)) / om))))) / om) ** 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 <= 2.5e-56) {
tmp = Math.sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U))));
} else if (l_m <= 7.2e+186) {
tmp = Math.sqrt((U * (((n * t) / (l_m * l_m)) + ((n * (((n * U_42_) / Om) - 2.0)) / Om)))) * (l_m * Math.sqrt(2.0));
} else {
tmp = Math.sqrt(l_m) * Math.pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 2.5e-56: tmp = math.sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U)))) elif l_m <= 7.2e+186: tmp = math.sqrt((U * (((n * t) / (l_m * l_m)) + ((n * (((n * U_42_) / Om) - 2.0)) / Om)))) * (l_m * math.sqrt(2.0)) else: tmp = math.sqrt(l_m) * math.pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 2.5e-56) tmp = sqrt(Float64(Float64(t + Float64(Float64(Float64(U_42_ / Float64(Float64(Om / l_m) / n)) + Float64(l_m * -2.0)) / Float64(Om / l_m))) * Float64(2.0 * Float64(n * U)))); elseif (l_m <= 7.2e+186) tmp = Float64(sqrt(Float64(U * Float64(Float64(Float64(n * t) / Float64(l_m * l_m)) + Float64(Float64(n * Float64(Float64(Float64(n * U_42_) / Om) - 2.0)) / Om)))) * Float64(l_m * sqrt(2.0))); else tmp = Float64(sqrt(l_m) * (Float64(Float64(-2.0 * Float64(U * Float64(Float64(n * l_m) * Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om))))) / Om) ^ 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 <= 2.5e-56) tmp = sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U)))); elseif (l_m <= 7.2e+186) tmp = sqrt((U * (((n * t) / (l_m * l_m)) + ((n * (((n * U_42_) / Om) - 2.0)) / Om)))) * (l_m * sqrt(2.0)); else tmp = sqrt(l_m) * (((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om) ^ 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, 2.5e-56], N[Sqrt[N[(N[(t + N[(N[(N[(U$42$ / N[(N[(Om / l$95$m), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l$95$m * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 7.2e+186], N[(N[Sqrt[N[(U * N[(N[(N[(n * t), $MachinePrecision] / N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] + N[(N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[l$95$m], $MachinePrecision] * N[Power[N[(N[(-2.0 * N[(U * N[(N[(n * l$95$m), $MachinePrecision] * N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 2.5 \cdot 10^{-56}:\\
\;\;\;\;\sqrt{\left(t + \frac{\frac{U*}{\frac{\frac{Om}{l\_m}}{n}} + l\_m \cdot -2}{\frac{Om}{l\_m}}\right) \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{elif}\;l\_m \leq 7.2 \cdot 10^{+186}:\\
\;\;\;\;\sqrt{U \cdot \left(\frac{n \cdot t}{l\_m \cdot l\_m} + \frac{n \cdot \left(\frac{n \cdot U*}{Om} - 2\right)}{Om}\right)} \cdot \left(l\_m \cdot \sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{l\_m} \cdot {\left(\frac{-2 \cdot \left(U \cdot \left(\left(n \cdot l\_m\right) \cdot \left(2 + \frac{n \cdot \left(U - U*\right)}{Om}\right)\right)\right)}{Om}\right)}^{0.5}\\
\end{array}
\end{array}
if l < 2.49999999999999999e-56Initial program 56.3%
Simplified58.8%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6459.6%
Simplified59.6%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7%
Applied egg-rr60.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr60.8%
if 2.49999999999999999e-56 < l < 7.2000000000000003e186Initial program 37.0%
Simplified42.1%
Taylor expanded in l around -inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified48.7%
Taylor expanded in U around 0
*-lowering-*.f64N/A
Simplified60.8%
if 7.2000000000000003e186 < l Initial program 13.5%
Simplified59.9%
Taylor expanded in l around -inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified24.3%
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
metadata-evalN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr48.3%
Taylor expanded in l around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6483.1%
Simplified83.1%
Final simplification62.3%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 1.65e+66)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* (/ l_m Om) (+ (/ U* (/ (/ Om l_m) n)) (* l_m -2.0)))))))
(*
(sqrt l_m)
(pow
(/ (* -2.0 (* U (* (* n l_m) (+ 2.0 (/ (* n (- U U*)) Om))))) Om)
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 <= 1.65e+66) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)))))));
} else {
tmp = sqrt(l_m) * pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 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 <= 1.65d+66) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l_m / om) * ((u_42 / ((om / l_m) / n)) + (l_m * (-2.0d0))))))))
else
tmp = sqrt(l_m) * ((((-2.0d0) * (u * ((n * l_m) * (2.0d0 + ((n * (u - u_42)) / om))))) / om) ** 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 <= 1.65e+66) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)))))));
} else {
tmp = Math.sqrt(l_m) * Math.pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 1.65e+66: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0))))))) else: tmp = math.sqrt(l_m) * math.pow(((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 1.65e+66) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l_m / Om) * Float64(Float64(U_42_ / Float64(Float64(Om / l_m) / n)) + Float64(l_m * -2.0))))))); else tmp = Float64(sqrt(l_m) * (Float64(Float64(-2.0 * Float64(U * Float64(Float64(n * l_m) * Float64(2.0 + Float64(Float64(n * Float64(U - U_42_)) / Om))))) / Om) ^ 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 <= 1.65e+66) tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0))))))); else tmp = sqrt(l_m) * (((-2.0 * (U * ((n * l_m) * (2.0 + ((n * (U - U_42_)) / Om))))) / Om) ^ 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, 1.65e+66], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l$95$m / Om), $MachinePrecision] * N[(N[(U$42$ / N[(N[(Om / l$95$m), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[l$95$m], $MachinePrecision] * N[Power[N[(N[(-2.0 * N[(U * N[(N[(n * l$95$m), $MachinePrecision] * N[(2.0 + N[(N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.65 \cdot 10^{+66}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \frac{l\_m}{Om} \cdot \left(\frac{U*}{\frac{\frac{Om}{l\_m}}{n}} + l\_m \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{l\_m} \cdot {\left(\frac{-2 \cdot \left(U \cdot \left(\left(n \cdot l\_m\right) \cdot \left(2 + \frac{n \cdot \left(U - U*\right)}{Om}\right)\right)\right)}{Om}\right)}^{0.5}\\
\end{array}
\end{array}
if l < 1.6500000000000001e66Initial program 56.0%
Simplified58.2%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.9%
Simplified58.9%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.4%
Applied egg-rr60.4%
*-commutativeN/A
clear-numN/A
associate-/r*N/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.4%
Applied egg-rr60.4%
if 1.6500000000000001e66 < l Initial program 19.5%
Simplified44.6%
Taylor expanded in l around -inf
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Simplified32.0%
pow1/2N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
metadata-evalN/A
unpow-prod-downN/A
*-lowering-*.f64N/A
metadata-evalN/A
pow1/2N/A
sqrt-lowering-sqrt.f64N/A
Applied egg-rr48.5%
Taylor expanded in l around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
--lowering--.f6466.7%
Simplified66.7%
Final simplification61.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 5.5e+108)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* (/ l_m Om) (+ (/ U* (/ (/ Om l_m) n)) (* l_m -2.0)))))))
(* (* l_m (sqrt 2.0)) (sqrt (/ (* (* n U) (+ -2.0 (/ (* n U*) Om))) 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.5e+108) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)))))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((((n * U) * (-2.0 + ((n * U_42_) / Om))) / 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.5d+108) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l_m / om) * ((u_42 / ((om / l_m) / n)) + (l_m * (-2.0d0))))))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt((((n * u) * ((-2.0d0) + ((n * u_42) / om))) / 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.5e+108) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)))))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((((n * U) * (-2.0 + ((n * U_42_) / Om))) / Om));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 5.5e+108: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0))))))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((((n * U) * (-2.0 + ((n * U_42_) / Om))) / Om)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 5.5e+108) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l_m / Om) * Float64(Float64(U_42_ / Float64(Float64(Om / l_m) / n)) + Float64(l_m * -2.0))))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(Float64(Float64(n * U) * Float64(-2.0 + Float64(Float64(n * U_42_) / Om))) / 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.5e+108) tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0))))))); else tmp = (l_m * sqrt(2.0)) * sqrt((((n * U) * (-2.0 + ((n * U_42_) / Om))) / 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.5e+108], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l$95$m / Om), $MachinePrecision] * N[(N[(U$42$ / N[(N[(Om / l$95$m), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(N[(n * U), $MachinePrecision] * N[(-2.0 + N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 5.5 \cdot 10^{+108}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \frac{l\_m}{Om} \cdot \left(\frac{U*}{\frac{\frac{Om}{l\_m}}{n}} + l\_m \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{\frac{\left(n \cdot U\right) \cdot \left(-2 + \frac{n \cdot U*}{Om}\right)}{Om}}\\
\end{array}
\end{array}
if l < 5.4999999999999998e108Initial program 55.4%
Simplified57.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.3%
Simplified58.3%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6459.8%
Applied egg-rr59.8%
*-commutativeN/A
clear-numN/A
associate-/r*N/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6459.8%
Applied egg-rr59.8%
if 5.4999999999999998e108 < l Initial program 16.6%
Simplified46.0%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6446.0%
Simplified46.0%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr43.8%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6445.5%
Simplified45.5%
Taylor expanded in l around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f6450.3%
Simplified50.3%
Final simplification58.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (- t (* 2.0 (/ (* l_m l_m) Om)))))
(if (<= Om -4.5e-73)
(sqrt (* (* 2.0 U) (* n t_1)))
(if (<= Om -1.75e-256)
(/ (* (sqrt (* 2.0 (* U (- U* U)))) (- 0.0 (* n l_m))) Om)
(if (<= Om 4e-114)
(sqrt (* n (/ (* 2.0 (* U (* U* (* n (* l_m l_m))))) (* Om Om))))
(sqrt (* (* (* 2.0 n) U) 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 = t - (2.0 * ((l_m * l_m) / Om));
double tmp;
if (Om <= -4.5e-73) {
tmp = sqrt(((2.0 * U) * (n * t_1)));
} else if (Om <= -1.75e-256) {
tmp = (sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om;
} else if (Om <= 4e-114) {
tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l_m * l_m))))) / (Om * Om))));
} else {
tmp = sqrt((((2.0 * n) * U) * 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 = t - (2.0d0 * ((l_m * l_m) / om))
if (om <= (-4.5d-73)) then
tmp = sqrt(((2.0d0 * u) * (n * t_1)))
else if (om <= (-1.75d-256)) then
tmp = (sqrt((2.0d0 * (u * (u_42 - u)))) * (0.0d0 - (n * l_m))) / om
else if (om <= 4d-114) then
tmp = sqrt((n * ((2.0d0 * (u * (u_42 * (n * (l_m * l_m))))) / (om * om))))
else
tmp = sqrt((((2.0d0 * n) * u) * 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 = t - (2.0 * ((l_m * l_m) / Om));
double tmp;
if (Om <= -4.5e-73) {
tmp = Math.sqrt(((2.0 * U) * (n * t_1)));
} else if (Om <= -1.75e-256) {
tmp = (Math.sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om;
} else if (Om <= 4e-114) {
tmp = Math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l_m * l_m))))) / (Om * Om))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = t - (2.0 * ((l_m * l_m) / Om)) tmp = 0 if Om <= -4.5e-73: tmp = math.sqrt(((2.0 * U) * (n * t_1))) elif Om <= -1.75e-256: tmp = (math.sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om elif Om <= 4e-114: tmp = math.sqrt((n * ((2.0 * (U * (U_42_ * (n * (l_m * l_m))))) / (Om * Om)))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) tmp = 0.0 if (Om <= -4.5e-73) tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t_1))); elseif (Om <= -1.75e-256) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(U * Float64(U_42_ - U)))) * Float64(0.0 - Float64(n * l_m))) / Om); elseif (Om <= 4e-114) tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * Float64(U_42_ * Float64(n * Float64(l_m * l_m))))) / Float64(Om * Om)))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = t - (2.0 * ((l_m * l_m) / Om)); tmp = 0.0; if (Om <= -4.5e-73) tmp = sqrt(((2.0 * U) * (n * t_1))); elseif (Om <= -1.75e-256) tmp = (sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om; elseif (Om <= 4e-114) tmp = sqrt((n * ((2.0 * (U * (U_42_ * (n * (l_m * l_m))))) / (Om * Om)))); else tmp = sqrt((((2.0 * n) * U) * 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[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -4.5e-73], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, -1.75e-256], N[(N[(N[Sqrt[N[(2.0 * N[(U * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(0.0 - N[(n * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], If[LessEqual[Om, 4e-114], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * N[(U$42$ * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\\
\mathbf{if}\;Om \leq -4.5 \cdot 10^{-73}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\_1\right)}\\
\mathbf{elif}\;Om \leq -1.75 \cdot 10^{-256}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(U \cdot \left(U* - U\right)\right)} \cdot \left(0 - n \cdot l\_m\right)}{Om}\\
\mathbf{elif}\;Om \leq 4 \cdot 10^{-114}:\\
\;\;\;\;\sqrt{n \cdot \frac{2 \cdot \left(U \cdot \left(U* \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)\right)\right)}{Om \cdot Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\_1}\\
\end{array}
\end{array}
if Om < -4.5e-73Initial program 43.0%
Simplified46.9%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6443.5%
Simplified43.5%
if -4.5e-73 < Om < -1.75000000000000007e-256Initial program 61.1%
Simplified57.9%
pow1/2N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
Applied egg-rr61.1%
Taylor expanded in n around -inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
--lowering--.f6422.9%
Simplified22.9%
associate-*l/N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f6423.0%
Applied egg-rr23.0%
if -1.75000000000000007e-256 < Om < 4.0000000000000002e-114Initial program 43.3%
Simplified60.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.6%
Simplified60.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr58.7%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6452.7%
Simplified52.7%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6439.8%
Simplified39.8%
if 4.0000000000000002e-114 < Om Initial program 56.4%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.2%
Simplified52.2%
Final simplification43.0%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (- t (* 2.0 (/ (* l_m l_m) Om)))))
(if (<= Om -4.5e-73)
(sqrt (* (* 2.0 U) (* n t_1)))
(if (<= Om -1.12e-298)
(/ (* (sqrt (* 2.0 (* U (- U* U)))) (- 0.0 (* n l_m))) Om)
(if (<= Om 5.3e-202)
(sqrt (* 2.0 (* U (/ (* (* (* l_m l_m) U*) (* n n)) (* Om Om)))))
(sqrt (* (* (* 2.0 n) U) 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 = t - (2.0 * ((l_m * l_m) / Om));
double tmp;
if (Om <= -4.5e-73) {
tmp = sqrt(((2.0 * U) * (n * t_1)));
} else if (Om <= -1.12e-298) {
tmp = (sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om;
} else if (Om <= 5.3e-202) {
tmp = sqrt((2.0 * (U * ((((l_m * l_m) * U_42_) * (n * n)) / (Om * Om)))));
} else {
tmp = sqrt((((2.0 * n) * U) * 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 = t - (2.0d0 * ((l_m * l_m) / om))
if (om <= (-4.5d-73)) then
tmp = sqrt(((2.0d0 * u) * (n * t_1)))
else if (om <= (-1.12d-298)) then
tmp = (sqrt((2.0d0 * (u * (u_42 - u)))) * (0.0d0 - (n * l_m))) / om
else if (om <= 5.3d-202) then
tmp = sqrt((2.0d0 * (u * ((((l_m * l_m) * u_42) * (n * n)) / (om * om)))))
else
tmp = sqrt((((2.0d0 * n) * u) * 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 = t - (2.0 * ((l_m * l_m) / Om));
double tmp;
if (Om <= -4.5e-73) {
tmp = Math.sqrt(((2.0 * U) * (n * t_1)));
} else if (Om <= -1.12e-298) {
tmp = (Math.sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om;
} else if (Om <= 5.3e-202) {
tmp = Math.sqrt((2.0 * (U * ((((l_m * l_m) * U_42_) * (n * n)) / (Om * Om)))));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = t - (2.0 * ((l_m * l_m) / Om)) tmp = 0 if Om <= -4.5e-73: tmp = math.sqrt(((2.0 * U) * (n * t_1))) elif Om <= -1.12e-298: tmp = (math.sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om elif Om <= 5.3e-202: tmp = math.sqrt((2.0 * (U * ((((l_m * l_m) * U_42_) * (n * n)) / (Om * Om))))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) tmp = 0.0 if (Om <= -4.5e-73) tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t_1))); elseif (Om <= -1.12e-298) tmp = Float64(Float64(sqrt(Float64(2.0 * Float64(U * Float64(U_42_ - U)))) * Float64(0.0 - Float64(n * l_m))) / Om); elseif (Om <= 5.3e-202) tmp = sqrt(Float64(2.0 * Float64(U * Float64(Float64(Float64(Float64(l_m * l_m) * U_42_) * Float64(n * n)) / Float64(Om * Om))))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = t - (2.0 * ((l_m * l_m) / Om)); tmp = 0.0; if (Om <= -4.5e-73) tmp = sqrt(((2.0 * U) * (n * t_1))); elseif (Om <= -1.12e-298) tmp = (sqrt((2.0 * (U * (U_42_ - U)))) * (0.0 - (n * l_m))) / Om; elseif (Om <= 5.3e-202) tmp = sqrt((2.0 * (U * ((((l_m * l_m) * U_42_) * (n * n)) / (Om * Om))))); else tmp = sqrt((((2.0 * n) * U) * 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[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, -4.5e-73], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, -1.12e-298], N[(N[(N[Sqrt[N[(2.0 * N[(U * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(0.0 - N[(n * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision], If[LessEqual[Om, 5.3e-202], N[Sqrt[N[(2.0 * N[(U * N[(N[(N[(N[(l$95$m * l$95$m), $MachinePrecision] * U$42$), $MachinePrecision] * N[(n * n), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\\
\mathbf{if}\;Om \leq -4.5 \cdot 10^{-73}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\_1\right)}\\
\mathbf{elif}\;Om \leq -1.12 \cdot 10^{-298}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(U \cdot \left(U* - U\right)\right)} \cdot \left(0 - n \cdot l\_m\right)}{Om}\\
\mathbf{elif}\;Om \leq 5.3 \cdot 10^{-202}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \frac{\left(\left(l\_m \cdot l\_m\right) \cdot U*\right) \cdot \left(n \cdot n\right)}{Om \cdot Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\_1}\\
\end{array}
\end{array}
if Om < -4.5e-73Initial program 43.0%
Simplified46.9%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6443.5%
Simplified43.5%
if -4.5e-73 < Om < -1.1200000000000001e-298Initial program 56.8%
Simplified56.6%
pow1/2N/A
sqr-powN/A
pow2N/A
pow-lowering-pow.f64N/A
Applied egg-rr59.1%
Taylor expanded in n around -inf
mul-1-negN/A
neg-lowering-neg.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
--lowering--.f6422.4%
Simplified22.4%
associate-*l/N/A
/-lowering-/.f64N/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
sqrt-unprodN/A
sqrt-lowering-sqrt.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
--lowering--.f6422.5%
Applied egg-rr22.5%
if -1.1200000000000001e-298 < Om < 5.30000000000000042e-202Initial program 22.8%
Simplified62.3%
Taylor expanded in U* around inf
*-lowering-*.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6450.9%
Simplified50.9%
if 5.30000000000000042e-202 < Om Initial program 56.9%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6447.4%
Simplified47.4%
Final simplification42.1%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= Om -5.2e-66)
(sqrt (+ (* (* n t) (* 2.0 U)) (* -4.0 (/ (* U (* n (* l_m l_m))) Om))))
(if (<= Om 5.8e-111)
(sqrt
(/
(* 2.0 (* U (* (* n l_m) (+ (* l_m -2.0) (/ (* U* (* n l_m)) 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 (Om <= -5.2e-66) {
tmp = sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om))));
} else if (Om <= 5.8e-111) {
tmp = sqrt(((2.0 * (U * ((n * l_m) * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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 (om <= (-5.2d-66)) then
tmp = sqrt((((n * t) * (2.0d0 * u)) + ((-4.0d0) * ((u * (n * (l_m * l_m))) / om))))
else if (om <= 5.8d-111) then
tmp = sqrt(((2.0d0 * (u * ((n * l_m) * ((l_m * (-2.0d0)) + ((u_42 * (n * l_m)) / 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 (Om <= -5.2e-66) {
tmp = Math.sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om))));
} else if (Om <= 5.8e-111) {
tmp = Math.sqrt(((2.0 * (U * ((n * l_m) * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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 Om <= -5.2e-66: tmp = math.sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om)))) elif Om <= 5.8e-111: tmp = math.sqrt(((2.0 * (U * ((n * l_m) * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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 (Om <= -5.2e-66) tmp = sqrt(Float64(Float64(Float64(n * t) * Float64(2.0 * U)) + Float64(-4.0 * Float64(Float64(U * Float64(n * Float64(l_m * l_m))) / Om)))); elseif (Om <= 5.8e-111) tmp = sqrt(Float64(Float64(2.0 * Float64(U * Float64(Float64(n * l_m) * Float64(Float64(l_m * -2.0) + Float64(Float64(U_42_ * Float64(n * l_m)) / Om))))) / Om)); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(2.0 * Float64(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 (Om <= -5.2e-66) tmp = sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om)))); elseif (Om <= 5.8e-111) tmp = sqrt(((2.0 * (U * ((n * l_m) * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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[Om, -5.2e-66], N[Sqrt[N[(N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(U * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 5.8e-111], N[Sqrt[N[(N[(2.0 * N[(U * N[(N[(n * l$95$m), $MachinePrecision] * N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(N[(U$42$ * N[(n * l$95$m), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -5.2 \cdot 10^{-66}:\\
\;\;\;\;\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\right) + -4 \cdot \frac{U \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}}\\
\mathbf{elif}\;Om \leq 5.8 \cdot 10^{-111}:\\
\;\;\;\;\sqrt{\frac{2 \cdot \left(U \cdot \left(\left(n \cdot l\_m\right) \cdot \left(l\_m \cdot -2 + \frac{U* \cdot \left(n \cdot l\_m\right)}{Om}\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right)}\\
\end{array}
\end{array}
if Om < -5.1999999999999998e-66Initial program 43.0%
Simplified46.9%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6444.6%
Simplified44.6%
if -5.1999999999999998e-66 < Om < 5.80000000000000003e-111Initial program 50.4%
Simplified59.5%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6459.5%
Simplified59.5%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.9%
Applied egg-rr60.9%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.0%
Simplified60.0%
if 5.80000000000000003e-111 < Om Initial program 56.4%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.2%
Simplified52.2%
Final simplification52.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= Om -4.7e-71)
(sqrt (+ (* (* n t) (* 2.0 U)) (* -4.0 (/ (* U (* n (* l_m l_m))) Om))))
(if (<= Om 3.3e-110)
(sqrt
(*
2.0
(/ (* U (* l_m (* n (+ (* l_m -2.0) (/ (* U* (* n l_m)) 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 (Om <= -4.7e-71) {
tmp = sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om))));
} else if (Om <= 3.3e-110) {
tmp = sqrt((2.0 * ((U * (l_m * (n * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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 (om <= (-4.7d-71)) then
tmp = sqrt((((n * t) * (2.0d0 * u)) + ((-4.0d0) * ((u * (n * (l_m * l_m))) / om))))
else if (om <= 3.3d-110) then
tmp = sqrt((2.0d0 * ((u * (l_m * (n * ((l_m * (-2.0d0)) + ((u_42 * (n * l_m)) / 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 (Om <= -4.7e-71) {
tmp = Math.sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om))));
} else if (Om <= 3.3e-110) {
tmp = Math.sqrt((2.0 * ((U * (l_m * (n * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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 Om <= -4.7e-71: tmp = math.sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om)))) elif Om <= 3.3e-110: tmp = math.sqrt((2.0 * ((U * (l_m * (n * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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 (Om <= -4.7e-71) tmp = sqrt(Float64(Float64(Float64(n * t) * Float64(2.0 * U)) + Float64(-4.0 * Float64(Float64(U * Float64(n * Float64(l_m * l_m))) / Om)))); elseif (Om <= 3.3e-110) tmp = sqrt(Float64(2.0 * Float64(Float64(U * Float64(l_m * Float64(n * Float64(Float64(l_m * -2.0) + Float64(Float64(U_42_ * Float64(n * l_m)) / Om))))) / Om))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(2.0 * Float64(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 (Om <= -4.7e-71) tmp = sqrt((((n * t) * (2.0 * U)) + (-4.0 * ((U * (n * (l_m * l_m))) / Om)))); elseif (Om <= 3.3e-110) tmp = sqrt((2.0 * ((U * (l_m * (n * ((l_m * -2.0) + ((U_42_ * (n * l_m)) / 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[Om, -4.7e-71], N[Sqrt[N[(N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(N[(U * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[Om, 3.3e-110], N[Sqrt[N[(2.0 * N[(N[(U * N[(l$95$m * N[(n * N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(N[(U$42$ * N[(n * l$95$m), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -4.7 \cdot 10^{-71}:\\
\;\;\;\;\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\right) + -4 \cdot \frac{U \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}}\\
\mathbf{elif}\;Om \leq 3.3 \cdot 10^{-110}:\\
\;\;\;\;\sqrt{2 \cdot \frac{U \cdot \left(l\_m \cdot \left(n \cdot \left(l\_m \cdot -2 + \frac{U* \cdot \left(n \cdot l\_m\right)}{Om}\right)\right)\right)}{Om}}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right)}\\
\end{array}
\end{array}
if Om < -4.69999999999999996e-71Initial program 43.0%
Simplified46.9%
Taylor expanded in Om around inf
+-commutativeN/A
+-lowering-+.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6444.6%
Simplified44.6%
if -4.69999999999999996e-71 < Om < 3.2999999999999999e-110Initial program 50.4%
Simplified59.5%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6459.5%
Simplified59.5%
Taylor expanded in t around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.0%
Simplified59.0%
if 3.2999999999999999e-110 < Om Initial program 56.4%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6452.2%
Simplified52.2%
Final simplification52.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 1.96e+177)
(sqrt
(*
(+ t (/ (+ (/ U* (/ (/ Om l_m) n)) (* l_m -2.0)) (/ Om l_m)))
(* 2.0 (* n U))))
(sqrt
(*
n
(* (* 2.0 (* U l_m)) (/ (+ (* l_m -2.0) (/ (* n U*) (/ Om 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 <= 1.96e+177) {
tmp = sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U))));
} else {
tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.96d+177) then
tmp = sqrt(((t + (((u_42 / ((om / l_m) / n)) + (l_m * (-2.0d0))) / (om / l_m))) * (2.0d0 * (n * u))))
else
tmp = sqrt((n * ((2.0d0 * (u * l_m)) * (((l_m * (-2.0d0)) + ((n * u_42) / (om / 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 <= 1.96e+177) {
tmp = Math.sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U))));
} else {
tmp = Math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.96e+177: tmp = math.sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U)))) else: tmp = math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.96e+177) tmp = sqrt(Float64(Float64(t + Float64(Float64(Float64(U_42_ / Float64(Float64(Om / l_m) / n)) + Float64(l_m * -2.0)) / Float64(Om / l_m))) * Float64(2.0 * Float64(n * U)))); else tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * l_m)) * Float64(Float64(Float64(l_m * -2.0) + Float64(Float64(n * U_42_) / Float64(Om / 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 <= 1.96e+177) tmp = sqrt(((t + (((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)) / (Om / l_m))) * (2.0 * (n * U)))); else tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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, 1.96e+177], N[Sqrt[N[(N[(t + N[(N[(N[(U$42$ / N[(N[(Om / l$95$m), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l$95$m * -2.0), $MachinePrecision]), $MachinePrecision] / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(N[(n * U$42$), $MachinePrecision] / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.96 \cdot 10^{+177}:\\
\;\;\;\;\sqrt{\left(t + \frac{\frac{U*}{\frac{\frac{Om}{l\_m}}{n}} + l\_m \cdot -2}{\frac{Om}{l\_m}}\right) \cdot \left(2 \cdot \left(n \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(\left(2 \cdot \left(U \cdot l\_m\right)\right) \cdot \frac{l\_m \cdot -2 + \frac{n \cdot U*}{\frac{Om}{l\_m}}}{Om}\right)}\\
\end{array}
\end{array}
if l < 1.96e177Initial program 53.1%
Simplified56.1%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.7%
Simplified56.7%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6458.0%
Applied egg-rr58.0%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
Applied egg-rr58.1%
if 1.96e177 < l Initial program 12.8%
Simplified56.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.6%
Simplified56.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr57.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.4%
Simplified57.4%
associate-*r*N/A
associate-/l*N/A
associate-/l*N/A
clear-numN/A
associate-/r*N/A
div-invN/A
*-commutativeN/A
+-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr67.7%
Final simplification58.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 1.75e+177)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* (/ l_m Om) (+ (/ U* (/ (/ Om l_m) n)) (* l_m -2.0)))))))
(sqrt
(*
n
(* (* 2.0 (* U l_m)) (/ (+ (* l_m -2.0) (/ (* n U*) (/ Om 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 <= 1.75e+177) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)))))));
} else {
tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.75d+177) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l_m / om) * ((u_42 / ((om / l_m) / n)) + (l_m * (-2.0d0))))))))
else
tmp = sqrt((n * ((2.0d0 * (u * l_m)) * (((l_m * (-2.0d0)) + ((n * u_42) / (om / 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 <= 1.75e+177) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0)))))));
} else {
tmp = Math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.75e+177: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0))))))) else: tmp = math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.75e+177) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l_m / Om) * Float64(Float64(U_42_ / Float64(Float64(Om / l_m) / n)) + Float64(l_m * -2.0))))))); else tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * l_m)) * Float64(Float64(Float64(l_m * -2.0) + Float64(Float64(n * U_42_) / Float64(Om / 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 <= 1.75e+177) tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((U_42_ / ((Om / l_m) / n)) + (l_m * -2.0))))))); else tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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, 1.75e+177], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l$95$m / Om), $MachinePrecision] * N[(N[(U$42$ / N[(N[(Om / l$95$m), $MachinePrecision] / n), $MachinePrecision]), $MachinePrecision] + N[(l$95$m * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(N[(n * U$42$), $MachinePrecision] / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.75 \cdot 10^{+177}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \frac{l\_m}{Om} \cdot \left(\frac{U*}{\frac{\frac{Om}{l\_m}}{n}} + l\_m \cdot -2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(\left(2 \cdot \left(U \cdot l\_m\right)\right) \cdot \frac{l\_m \cdot -2 + \frac{n \cdot U*}{\frac{Om}{l\_m}}}{Om}\right)}\\
\end{array}
\end{array}
if l < 1.74999999999999996e177Initial program 53.1%
Simplified56.1%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.7%
Simplified56.7%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6458.0%
Applied egg-rr58.0%
*-commutativeN/A
clear-numN/A
associate-/r*N/A
div-invN/A
/-lowering-/.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6458.1%
Applied egg-rr58.1%
if 1.74999999999999996e177 < l Initial program 12.8%
Simplified56.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.6%
Simplified56.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr57.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.4%
Simplified57.4%
associate-*r*N/A
associate-/l*N/A
associate-/l*N/A
clear-numN/A
associate-/r*N/A
div-invN/A
*-commutativeN/A
+-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr67.7%
Final simplification58.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 2.9e+177)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* (/ l_m Om) (+ (* l_m -2.0) (* U* (/ n (/ Om l_m)))))))))
(sqrt
(*
n
(* (* 2.0 (* U l_m)) (/ (+ (* l_m -2.0) (/ (* n U*) (/ Om 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 <= 2.9e+177) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * (n / (Om / l_m)))))))));
} else {
tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 2.9d+177) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l_m / om) * ((l_m * (-2.0d0)) + (u_42 * (n / (om / l_m)))))))))
else
tmp = sqrt((n * ((2.0d0 * (u * l_m)) * (((l_m * (-2.0d0)) + ((n * u_42) / (om / 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 <= 2.9e+177) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * (n / (Om / l_m)))))))));
} else {
tmp = Math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 2.9e+177: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * (n / (Om / l_m))))))))) else: tmp = math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 2.9e+177) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l_m / Om) * Float64(Float64(l_m * -2.0) + Float64(U_42_ * Float64(n / Float64(Om / l_m))))))))); else tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * l_m)) * Float64(Float64(Float64(l_m * -2.0) + Float64(Float64(n * U_42_) / Float64(Om / 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 <= 2.9e+177) tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * (n / (Om / l_m))))))))); else tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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, 2.9e+177], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l$95$m / Om), $MachinePrecision] * N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(U$42$ * N[(n / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(N[(n * U$42$), $MachinePrecision] / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 2.9 \cdot 10^{+177}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \frac{l\_m}{Om} \cdot \left(l\_m \cdot -2 + U* \cdot \frac{n}{\frac{Om}{l\_m}}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(\left(2 \cdot \left(U \cdot l\_m\right)\right) \cdot \frac{l\_m \cdot -2 + \frac{n \cdot U*}{\frac{Om}{l\_m}}}{Om}\right)}\\
\end{array}
\end{array}
if l < 2.90000000000000013e177Initial program 53.1%
Simplified56.1%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.7%
Simplified56.7%
*-commutativeN/A
*-lowering-*.f64N/A
associate-/l*N/A
*-commutativeN/A
associate-/r/N/A
/-lowering-/.f64N/A
/-lowering-/.f6458.0%
Applied egg-rr58.0%
if 2.90000000000000013e177 < l Initial program 12.8%
Simplified56.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.6%
Simplified56.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr57.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.4%
Simplified57.4%
associate-*r*N/A
associate-/l*N/A
associate-/l*N/A
clear-numN/A
associate-/r*N/A
div-invN/A
*-commutativeN/A
+-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr67.7%
Final simplification58.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 1.65e+177)
(sqrt
(*
2.0
(*
(* n U)
(+ t (* (/ l_m Om) (+ (* l_m -2.0) (* U* (/ (* n l_m) Om))))))))
(sqrt
(*
n
(* (* 2.0 (* U l_m)) (/ (+ (* l_m -2.0) (/ (* n U*) (/ Om 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 <= 1.65e+177) {
tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * ((n * l_m) / Om))))))));
} else {
tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.65d+177) then
tmp = sqrt((2.0d0 * ((n * u) * (t + ((l_m / om) * ((l_m * (-2.0d0)) + (u_42 * ((n * l_m) / om))))))))
else
tmp = sqrt((n * ((2.0d0 * (u * l_m)) * (((l_m * (-2.0d0)) + ((n * u_42) / (om / 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 <= 1.65e+177) {
tmp = Math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * ((n * l_m) / Om))))))));
} else {
tmp = Math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.65e+177: tmp = math.sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * ((n * l_m) / Om)))))))) else: tmp = math.sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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 <= 1.65e+177) tmp = sqrt(Float64(2.0 * Float64(Float64(n * U) * Float64(t + Float64(Float64(l_m / Om) * Float64(Float64(l_m * -2.0) + Float64(U_42_ * Float64(Float64(n * l_m) / Om)))))))); else tmp = sqrt(Float64(n * Float64(Float64(2.0 * Float64(U * l_m)) * Float64(Float64(Float64(l_m * -2.0) + Float64(Float64(n * U_42_) / Float64(Om / 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 <= 1.65e+177) tmp = sqrt((2.0 * ((n * U) * (t + ((l_m / Om) * ((l_m * -2.0) + (U_42_ * ((n * l_m) / Om)))))))); else tmp = sqrt((n * ((2.0 * (U * l_m)) * (((l_m * -2.0) + ((n * U_42_) / (Om / 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, 1.65e+177], N[Sqrt[N[(2.0 * N[(N[(n * U), $MachinePrecision] * N[(t + N[(N[(l$95$m / Om), $MachinePrecision] * N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(U$42$ * N[(N[(n * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(N[(2.0 * N[(U * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(l$95$m * -2.0), $MachinePrecision] + N[(N[(n * U$42$), $MachinePrecision] / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.65 \cdot 10^{+177}:\\
\;\;\;\;\sqrt{2 \cdot \left(\left(n \cdot U\right) \cdot \left(t + \frac{l\_m}{Om} \cdot \left(l\_m \cdot -2 + U* \cdot \frac{n \cdot l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(\left(2 \cdot \left(U \cdot l\_m\right)\right) \cdot \frac{l\_m \cdot -2 + \frac{n \cdot U*}{\frac{Om}{l\_m}}}{Om}\right)}\\
\end{array}
\end{array}
if l < 1.6500000000000001e177Initial program 53.1%
Simplified56.1%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.7%
Simplified56.7%
if 1.6500000000000001e177 < l Initial program 12.8%
Simplified56.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.6%
Simplified56.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr57.4%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.4%
Simplified57.4%
associate-*r*N/A
associate-/l*N/A
associate-/l*N/A
clear-numN/A
associate-/r*N/A
div-invN/A
*-commutativeN/A
+-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
Applied egg-rr67.7%
Final simplification57.4%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 1.85e-30) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* -2.0 (/ (* U (* (* l_m l_m) (* n (- 2.0 (/ (* n U*) Om))))) 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 <= 1.85e-30) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt((-2.0 * ((U * ((l_m * l_m) * (n * (2.0 - ((n * U_42_) / Om))))) / 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 <= 1.85d-30) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((-2.0d0) * ((u * ((l_m * l_m) * (n * (2.0d0 - ((n * u_42) / om))))) / 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 <= 1.85e-30) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt((-2.0 * ((U * ((l_m * l_m) * (n * (2.0 - ((n * U_42_) / Om))))) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 1.85e-30: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt((-2.0 * ((U * ((l_m * l_m) * (n * (2.0 - ((n * U_42_) / Om))))) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 1.85e-30) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(-2.0 * Float64(Float64(U * Float64(Float64(l_m * l_m) * Float64(n * Float64(2.0 - Float64(Float64(n * U_42_) / Om))))) / 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 <= 1.85e-30) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt((-2.0 * ((U * ((l_m * l_m) * (n * (2.0 - ((n * U_42_) / Om))))) / 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, 1.85e-30], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(-2.0 * N[(N[(U * N[(N[(l$95$m * l$95$m), $MachinePrecision] * N[(n * N[(2.0 - N[(N[(n * U$42$), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.85 \cdot 10^{-30}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{-2 \cdot \frac{U \cdot \left(\left(l\_m \cdot l\_m\right) \cdot \left(n \cdot \left(2 - \frac{n \cdot U*}{Om}\right)\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 1.8500000000000002e-30Initial program 55.8%
Simplified58.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6436.2%
Simplified36.2%
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval39.7%
Applied egg-rr39.7%
if 1.8500000000000002e-30 < l Initial program 29.7%
Simplified48.3%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.3%
Simplified48.3%
Taylor expanded in l around -inf
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
mul-1-negN/A
sub-negN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6439.0%
Simplified39.0%
Final simplification39.6%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 1.3e+175) (sqrt (* (* (* 2.0 n) U) (- t (* 2.0 (/ (* l_m l_m) Om))))) (sqrt (* n (* U (/ (* (* n (* l_m l_m)) (* 2.0 U*)) (* Om 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 <= 1.3e+175) {
tmp = sqrt((((2.0 * n) * U) * (t - (2.0 * ((l_m * l_m) / Om)))));
} else {
tmp = sqrt((n * (U * (((n * (l_m * l_m)) * (2.0 * U_42_)) / (Om * 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 <= 1.3d+175) then
tmp = sqrt((((2.0d0 * n) * u) * (t - (2.0d0 * ((l_m * l_m) / om)))))
else
tmp = sqrt((n * (u * (((n * (l_m * l_m)) * (2.0d0 * u_42)) / (om * 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 <= 1.3e+175) {
tmp = Math.sqrt((((2.0 * n) * U) * (t - (2.0 * ((l_m * l_m) / Om)))));
} else {
tmp = Math.sqrt((n * (U * (((n * (l_m * l_m)) * (2.0 * U_42_)) / (Om * Om)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 1.3e+175: tmp = math.sqrt((((2.0 * n) * U) * (t - (2.0 * ((l_m * l_m) / Om))))) else: tmp = math.sqrt((n * (U * (((n * (l_m * l_m)) * (2.0 * U_42_)) / (Om * Om))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 1.3e+175) tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))))); else tmp = sqrt(Float64(n * Float64(U * Float64(Float64(Float64(n * Float64(l_m * l_m)) * Float64(2.0 * U_42_)) / Float64(Om * 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 <= 1.3e+175) tmp = sqrt((((2.0 * n) * U) * (t - (2.0 * ((l_m * l_m) / Om))))); else tmp = sqrt((n * (U * (((n * (l_m * l_m)) * (2.0 * U_42_)) / (Om * 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, 1.3e+175], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(n * N[(U * N[(N[(N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(2.0 * U$42$), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.3 \cdot 10^{+175}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(U \cdot \frac{\left(n \cdot \left(l\_m \cdot l\_m\right)\right) \cdot \left(2 \cdot U*\right)}{Om \cdot Om}\right)}\\
\end{array}
\end{array}
if l < 1.3e175Initial program 53.3%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6441.4%
Simplified41.4%
if 1.3e175 < l Initial program 12.1%
Simplified54.1%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6454.1%
Simplified54.1%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr54.8%
Taylor expanded in U* around inf
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.7%
Simplified26.7%
Final simplification40.3%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* 2.0 n) U)))
(if (<= l_m 9e+174)
(sqrt (* t_1 (- t (* 2.0 (/ (* l_m l_m) Om)))))
(sqrt (* t_1 (/ (* U* (* n (* l_m l_m))) (* Om 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 * n) * U;
double tmp;
if (l_m <= 9e+174) {
tmp = sqrt((t_1 * (t - (2.0 * ((l_m * l_m) / Om)))));
} else {
tmp = sqrt((t_1 * ((U_42_ * (n * (l_m * l_m))) / (Om * 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 = (2.0d0 * n) * u
if (l_m <= 9d+174) then
tmp = sqrt((t_1 * (t - (2.0d0 * ((l_m * l_m) / om)))))
else
tmp = sqrt((t_1 * ((u_42 * (n * (l_m * l_m))) / (om * 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 * n) * U;
double tmp;
if (l_m <= 9e+174) {
tmp = Math.sqrt((t_1 * (t - (2.0 * ((l_m * l_m) / Om)))));
} else {
tmp = Math.sqrt((t_1 * ((U_42_ * (n * (l_m * l_m))) / (Om * Om))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (2.0 * n) * U tmp = 0 if l_m <= 9e+174: tmp = math.sqrt((t_1 * (t - (2.0 * ((l_m * l_m) / Om))))) else: tmp = math.sqrt((t_1 * ((U_42_ * (n * (l_m * l_m))) / (Om * Om)))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(2.0 * n) * U) tmp = 0.0 if (l_m <= 9e+174) tmp = sqrt(Float64(t_1 * Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))))); else tmp = sqrt(Float64(t_1 * Float64(Float64(U_42_ * Float64(n * Float64(l_m * l_m))) / Float64(Om * 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 * n) * U; tmp = 0.0; if (l_m <= 9e+174) tmp = sqrt((t_1 * (t - (2.0 * ((l_m * l_m) / Om))))); else tmp = sqrt((t_1 * ((U_42_ * (n * (l_m * l_m))) / (Om * 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[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision]}, If[LessEqual[l$95$m, 9e+174], N[Sqrt[N[(t$95$1 * N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(t$95$1 * N[(N[(U$42$ * N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(Om * Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(2 \cdot n\right) \cdot U\\
\mathbf{if}\;l\_m \leq 9 \cdot 10^{+174}:\\
\;\;\;\;\sqrt{t\_1 \cdot \left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t\_1 \cdot \frac{U* \cdot \left(n \cdot \left(l\_m \cdot l\_m\right)\right)}{Om \cdot Om}}\\
\end{array}
\end{array}
if l < 9.00000000000000084e174Initial program 53.3%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6441.4%
Simplified41.4%
if 9.00000000000000084e174 < l Initial program 12.1%
Taylor expanded in U* around inf
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6426.5%
Simplified26.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (- t (* 2.0 (/ (* l_m l_m) Om)))))
(if (<= Om 1.75e-114)
(sqrt (* (* 2.0 U) (* n t_1)))
(sqrt (* (* (* 2.0 n) U) 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 = t - (2.0 * ((l_m * l_m) / Om));
double tmp;
if (Om <= 1.75e-114) {
tmp = sqrt(((2.0 * U) * (n * t_1)));
} else {
tmp = sqrt((((2.0 * n) * U) * 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 = t - (2.0d0 * ((l_m * l_m) / om))
if (om <= 1.75d-114) then
tmp = sqrt(((2.0d0 * u) * (n * t_1)))
else
tmp = sqrt((((2.0d0 * n) * u) * 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 = t - (2.0 * ((l_m * l_m) / Om));
double tmp;
if (Om <= 1.75e-114) {
tmp = Math.sqrt(((2.0 * U) * (n * t_1)));
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t_1));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = t - (2.0 * ((l_m * l_m) / Om)) tmp = 0 if Om <= 1.75e-114: tmp = math.sqrt(((2.0 * U) * (n * t_1))) else: tmp = math.sqrt((((2.0 * n) * U) * t_1)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) tmp = 0.0 if (Om <= 1.75e-114) tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * t_1))); else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * t_1)); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = t - (2.0 * ((l_m * l_m) / Om)); tmp = 0.0; if (Om <= 1.75e-114) tmp = sqrt(((2.0 * U) * (n * t_1))); else tmp = sqrt((((2.0 * n) * U) * 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[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[Om, 1.75e-114], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\\
\mathbf{if}\;Om \leq 1.75 \cdot 10^{-114}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot t\_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t\_1}\\
\end{array}
\end{array}
if Om < 1.75e-114Initial program 47.0%
Simplified53.7%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6434.9%
Simplified34.9%
if 1.75e-114 < Om Initial program 56.2%
Taylor expanded in Om around inf
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6451.6%
Simplified51.6%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 1.25e-12) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* (* 2.0 U) (* n (- 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 <= 1.25e-12) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt(((2.0 * U) * (n * (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 <= 1.25d-12) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt(((2.0d0 * u) * (n * (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 <= 1.25e-12) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt(((2.0 * U) * (n * (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 <= 1.25e-12: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt(((2.0 * U) * (n * (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 <= 1.25e-12) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(2.0 * U) * Float64(n * Float64(t - Float64(2.0 * Float64(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 <= 1.25e-12) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt(((2.0 * U) * (n * (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, 1.25e-12], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(2.0 * U), $MachinePrecision] * N[(n * N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.25 \cdot 10^{-12}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right)\right)}\\
\end{array}
\end{array}
if l < 1.24999999999999992e-12Initial program 55.9%
Simplified58.3%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.9%
Simplified35.9%
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval39.3%
Applied egg-rr39.3%
if 1.24999999999999992e-12 < l Initial program 26.4%
Simplified46.9%
Taylor expanded in n around 0
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
cancel-sign-sub-invN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6421.0%
Simplified21.0%
Final simplification35.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 5.6e+56) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (/ (* (* n (* l_m l_m)) (* U -4.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 <= 5.6e+56) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt((((n * (l_m * l_m)) * (U * -4.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 <= 5.6d+56) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt((((n * (l_m * l_m)) * (u * (-4.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 <= 5.6e+56) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt((((n * (l_m * l_m)) * (U * -4.0)) / Om));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 5.6e+56: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt((((n * (l_m * l_m)) * (U * -4.0)) / Om)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 5.6e+56) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(Float64(Float64(n * Float64(l_m * l_m)) * Float64(U * -4.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 <= 5.6e+56) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt((((n * (l_m * l_m)) * (U * -4.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, 5.6e+56], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(N[(n * N[(l$95$m * l$95$m), $MachinePrecision]), $MachinePrecision] * N[(U * -4.0), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 5.6 \cdot 10^{+56}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(n \cdot \left(l\_m \cdot l\_m\right)\right) \cdot \left(U \cdot -4\right)}{Om}}\\
\end{array}
\end{array}
if l < 5.60000000000000017e56Initial program 56.0%
Simplified58.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.8%
Simplified35.8%
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval39.2%
Applied egg-rr39.2%
if 5.60000000000000017e56 < l Initial program 19.5%
Simplified44.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr42.8%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6444.3%
Simplified44.3%
Taylor expanded in U* around 0
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6419.1%
Simplified19.1%
Final simplification36.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 2.1e+54) (pow (* 2.0 (* t (* n U))) 0.5) (sqrt (* n (/ (* -4.0 (* U (* 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 <= 2.1e+54) {
tmp = pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = sqrt((n * ((-4.0 * (U * (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 <= 2.1d+54) then
tmp = (2.0d0 * (t * (n * u))) ** 0.5d0
else
tmp = sqrt((n * (((-4.0d0) * (u * (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 <= 2.1e+54) {
tmp = Math.pow((2.0 * (t * (n * U))), 0.5);
} else {
tmp = Math.sqrt((n * ((-4.0 * (U * (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 <= 2.1e+54: tmp = math.pow((2.0 * (t * (n * U))), 0.5) else: tmp = math.sqrt((n * ((-4.0 * (U * (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 <= 2.1e+54) tmp = Float64(2.0 * Float64(t * Float64(n * U))) ^ 0.5; else tmp = sqrt(Float64(n * Float64(Float64(-4.0 * Float64(U * 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 <= 2.1e+54) tmp = (2.0 * (t * (n * U))) ^ 0.5; else tmp = sqrt((n * ((-4.0 * (U * (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, 2.1e+54], N[Power[N[(2.0 * N[(t * N[(n * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(n * N[(N[(-4.0 * N[(U * 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 2.1 \cdot 10^{+54}:\\
\;\;\;\;{\left(2 \cdot \left(t \cdot \left(n \cdot U\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \frac{-4 \cdot \left(U \cdot \left(l\_m \cdot l\_m\right)\right)}{Om}}\\
\end{array}
\end{array}
if l < 2.09999999999999986e54Initial program 56.0%
Simplified58.2%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6435.8%
Simplified35.8%
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval39.2%
Applied egg-rr39.2%
if 2.09999999999999986e54 < l Initial program 19.5%
Simplified44.6%
Taylor expanded in U* around inf
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
Applied egg-rr42.8%
Taylor expanded in t around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6444.3%
Simplified44.3%
Taylor expanded in U* around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6414.5%
Simplified14.5%
Final simplification35.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= Om 5e-48) (pow (* 2.0 (* U (* n t))) 0.5) (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_) {
double tmp;
if (Om <= 5e-48) {
tmp = pow((2.0 * (U * (n * t))), 0.5);
} else {
tmp = sqrt((((2.0 * n) * U) * 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 (om <= 5d-48) then
tmp = (2.0d0 * (u * (n * t))) ** 0.5d0
else
tmp = sqrt((((2.0d0 * n) * u) * 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 (Om <= 5e-48) {
tmp = Math.pow((2.0 * (U * (n * t))), 0.5);
} else {
tmp = Math.sqrt((((2.0 * n) * U) * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if Om <= 5e-48: tmp = math.pow((2.0 * (U * (n * t))), 0.5) else: tmp = math.sqrt((((2.0 * n) * U) * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (Om <= 5e-48) tmp = Float64(2.0 * Float64(U * Float64(n * t))) ^ 0.5; else tmp = sqrt(Float64(Float64(Float64(2.0 * n) * U) * 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 (Om <= 5e-48) tmp = (2.0 * (U * (n * t))) ^ 0.5; else tmp = sqrt((((2.0 * n) * U) * t)); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[Om, 5e-48], N[Power[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;Om \leq 5 \cdot 10^{-48}:\\
\;\;\;\;{\left(2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}\\
\end{array}
\end{array}
if Om < 4.9999999999999999e-48Initial program 48.0%
Simplified53.8%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6428.4%
Simplified28.4%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6425.2%
Applied egg-rr25.2%
pow1/2N/A
pow-lowering-pow.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.3%
Applied egg-rr31.3%
if 4.9999999999999999e-48 < Om Initial program 55.1%
Taylor expanded in t around inf
Simplified45.6%
Final simplification35.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= U 2.5e-289) (sqrt (* n (* t (* 2.0 U)))) (sqrt (* (* n t) (* 2.0 U)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (U <= 2.5e-289) {
tmp = sqrt((n * (t * (2.0 * U))));
} else {
tmp = sqrt(((n * t) * (2.0 * U)));
}
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 <= 2.5d-289) then
tmp = sqrt((n * (t * (2.0d0 * u))))
else
tmp = sqrt(((n * t) * (2.0d0 * u)))
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 <= 2.5e-289) {
tmp = Math.sqrt((n * (t * (2.0 * U))));
} else {
tmp = Math.sqrt(((n * t) * (2.0 * U)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if U <= 2.5e-289: tmp = math.sqrt((n * (t * (2.0 * U)))) else: tmp = math.sqrt(((n * t) * (2.0 * U))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (U <= 2.5e-289) tmp = sqrt(Float64(n * Float64(t * Float64(2.0 * U)))); else tmp = sqrt(Float64(Float64(n * t) * Float64(2.0 * U))); 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 <= 2.5e-289) tmp = sqrt((n * (t * (2.0 * U)))); else tmp = sqrt(((n * t) * (2.0 * U))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[U, 2.5e-289], N[Sqrt[N[(n * N[(t * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;U \leq 2.5 \cdot 10^{-289}:\\
\;\;\;\;\sqrt{n \cdot \left(t \cdot \left(2 \cdot U\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\right)}\\
\end{array}
\end{array}
if U < 2.50000000000000014e-289Initial program 48.8%
Simplified54.4%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6428.9%
Simplified28.9%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6432.1%
Applied egg-rr32.1%
if 2.50000000000000014e-289 < U Initial program 51.7%
Simplified57.8%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6434.1%
Simplified34.1%
Final simplification33.1%
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 50.3%
Simplified56.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.5%
Simplified31.5%
pow1/2N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval34.3%
Applied egg-rr34.3%
Final simplification34.3%
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(Float64(Float64(2.0 * n) * 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[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * t), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot t}
\end{array}
Initial program 50.3%
Taylor expanded in t around inf
Simplified32.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* (* n t) (* 2.0 U))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return sqrt(((n * t) * (2.0 * U)));
}
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(((n * t) * (2.0d0 * u)))
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(((n * t) * (2.0 * U)));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt(((n * t) * (2.0 * U)))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(Float64(Float64(n * t) * Float64(2.0 * U))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt(((n * t) * (2.0 * U))); end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\right)}
\end{array}
Initial program 50.3%
Simplified56.1%
Taylor expanded in t around inf
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6431.5%
Simplified31.5%
Final simplification31.5%
herbie shell --seed 2024150
(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*))))))