
(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 15 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 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2 (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt (* (* 2.0 n) (* U (- t (* (/ l_m Om) (* 2.0 l_m))))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (- t (- (* 2.0 (* l_m (/ l_m Om))) t_1))))
(*
(sqrt (* U (/ (+ (* n -2.0) (/ (* (- U* U) (pow n 2.0)) Om)) Om)))
(* l_m (sqrt 2.0)))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = sqrt((U * (((n * -2.0) + (((U_42_ - U) * pow(n, 2.0)) / Om)) / Om))) * (l_m * sqrt(2.0));
}
return tmp;
}
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 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = Math.sqrt((U * (((n * -2.0) + (((U_42_ - U) * Math.pow(n, 2.0)) / Om)) / Om))) * (l_m * Math.sqrt(2.0));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))) else: tmp = math.sqrt((U * (((n * -2.0) + (((U_42_ - U) * math.pow(n, 2.0)) / Om)) / Om))) * (l_m * math.sqrt(2.0)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1)) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m)))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64(2.0 * Float64(l_m * Float64(l_m / Om))) - t_1)))); else tmp = Float64(sqrt(Float64(U * Float64(Float64(Float64(n * -2.0) + Float64(Float64(Float64(U_42_ - U) * (n ^ 2.0)) / Om)) / Om))) * Float64(l_m * sqrt(2.0))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))); else tmp = sqrt((U * (((n * -2.0) + (((U_42_ - U) * (n ^ 2.0)) / Om)) / Om))) * (l_m * sqrt(2.0)); 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[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * N[(N[(N[(n * -2.0), $MachinePrecision] + N[(N[(N[(U$42$ - U), $MachinePrecision] * N[Power[n, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \left(2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right) - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot \frac{n \cdot -2 + \frac{\left(U* - U\right) \cdot {n}^{2}}{Om}}{Om}} \cdot \left(l\_m \cdot \sqrt{2}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 10.0%
Simplified30.4%
Taylor expanded in Om around inf 33.0%
associate-*r/33.0%
Simplified33.0%
associate-/l*33.0%
unpow233.0%
associate-*r/33.0%
associate-*r*33.0%
Applied egg-rr33.0%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 61.3%
Simplified68.2%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Simplified10.9%
Taylor expanded in l around inf 23.6%
associate--l+23.6%
associate-/l*23.6%
associate-*r/23.6%
metadata-eval23.6%
Simplified23.6%
Taylor expanded in l around inf 34.3%
associate-*r/34.3%
metadata-eval34.3%
Simplified34.3%
Taylor expanded in Om around inf 31.3%
Final simplification57.2%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1)))))
(if (<= t_2 1e-161)
(* (sqrt (* 2.0 U)) (sqrt (* n (- t (/ (* 2.0 (pow l_m 2.0)) Om)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (- t (- (* 2.0 (* l_m (/ l_m Om))) t_1))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (* (* n (- U* U)) (pow Om -2.0)) (/ 2.0 Om))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 1e-161) {
tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * pow(l_m, 2.0)) / Om))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * (U_42_ - U)) * pow(Om, -2.0)) - (2.0 / Om)))));
}
return tmp;
}
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 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 1e-161) {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * (n * (((n * (U_42_ - U)) * Math.pow(Om, -2.0)) - (2.0 / Om)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))) tmp = 0 if t_2 <= 1e-161: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * (n * (((n * (U_42_ - U)) * math.pow(Om, -2.0)) - (2.0 / Om))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1))) tmp = 0.0 if (t_2 <= 1e-161) tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(Float64(n * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64(2.0 * Float64(l_m * Float64(l_m / Om))) - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(Float64(n * Float64(U_42_ - U)) * (Om ^ -2.0)) - Float64(2.0 / Om)))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))); tmp = 0.0; if (t_2 <= 1e-161) tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * (l_m ^ 2.0)) / Om)))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * (U_42_ - U)) * (Om ^ -2.0)) - (2.0 / Om))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 1e-161], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(N[(n * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision] * N[Power[Om, -2.0], $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)}\\
\mathbf{if}\;t\_2 \leq 10^{-161}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \left(2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right) - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(\left(n \cdot \left(U* - U\right)\right) \cdot {Om}^{-2} - \frac{2}{Om}\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 1.00000000000000003e-161Initial program 11.4%
Simplified11.4%
associate-*r*11.3%
pow111.3%
Applied egg-rr11.3%
unpow111.3%
*-commutative11.3%
Simplified11.3%
Taylor expanded in U around 0 10.3%
mul-1-neg10.3%
associate-/l*10.3%
unpow210.3%
unpow210.3%
times-frac11.3%
unpow211.3%
Simplified11.3%
Taylor expanded in n around 0 30.0%
associate-*r/30.0%
Simplified30.0%
pow1/230.0%
associate-*r*30.1%
unpow-prod-down34.3%
pow1/234.3%
associate-/l*34.3%
Applied egg-rr34.3%
unpow1/234.3%
*-commutative34.3%
associate-*r/34.3%
Simplified34.3%
if 1.00000000000000003e-161 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 61.4%
Simplified68.4%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 0.0%
Simplified12.6%
Taylor expanded in l around inf 24.2%
associate--l+24.2%
associate-/l*24.2%
associate-*r/24.2%
metadata-eval24.2%
Simplified24.2%
Taylor expanded in l around inf 34.2%
associate-*r/34.2%
metadata-eval34.2%
Simplified34.2%
div-inv34.3%
pow-flip34.3%
metadata-eval34.3%
Applied egg-rr34.3%
Final simplification57.9%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1)))))
(if (<= t_2 1e-161)
(* (sqrt (* 2.0 U)) (sqrt (* n (- t (/ (* 2.0 (pow l_m 2.0)) Om)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (- t (- (* 2.0 (* l_m (/ l_m Om))) t_1))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (/ (* n U*) (pow Om 2.0)) (/ 2.0 Om))))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 1e-161) {
tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * pow(l_m, 2.0)) / Om))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / pow(Om, 2.0)) - (2.0 / Om)))));
}
return tmp;
}
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 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 1e-161) {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * (n * (((n * U_42_) / Math.pow(Om, 2.0)) - (2.0 / Om)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))) tmp = 0 if t_2 <= 1e-161: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * (n * (((n * U_42_) / math.pow(Om, 2.0)) - (2.0 / Om))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1))) tmp = 0.0 if (t_2 <= 1e-161) tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(Float64(n * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64(2.0 * Float64(l_m * Float64(l_m / Om))) - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(Float64(n * U_42_) / (Om ^ 2.0)) - Float64(2.0 / Om)))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))); tmp = 0.0; if (t_2 <= 1e-161) tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * (l_m ^ 2.0)) / Om)))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * (((n * U_42_) / (Om ^ 2.0)) - (2.0 / Om))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 1e-161], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(N[(n * U$42$), $MachinePrecision] / N[Power[Om, 2.0], $MachinePrecision]), $MachinePrecision] - N[(2.0 / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)}\\
\mathbf{if}\;t\_2 \leq 10^{-161}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \left(2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right) - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(\frac{n \cdot U*}{{Om}^{2}} - \frac{2}{Om}\right)\right)}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 1.00000000000000003e-161Initial program 11.4%
Simplified11.4%
associate-*r*11.3%
pow111.3%
Applied egg-rr11.3%
unpow111.3%
*-commutative11.3%
Simplified11.3%
Taylor expanded in U around 0 10.3%
mul-1-neg10.3%
associate-/l*10.3%
unpow210.3%
unpow210.3%
times-frac11.3%
unpow211.3%
Simplified11.3%
Taylor expanded in n around 0 30.0%
associate-*r/30.0%
Simplified30.0%
pow1/230.0%
associate-*r*30.1%
unpow-prod-down34.3%
pow1/234.3%
associate-/l*34.3%
Applied egg-rr34.3%
unpow1/234.3%
*-commutative34.3%
associate-*r/34.3%
Simplified34.3%
if 1.00000000000000003e-161 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 61.4%
Simplified68.4%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 0.0%
Simplified12.6%
Taylor expanded in l around inf 24.2%
associate--l+24.2%
associate-/l*24.2%
associate-*r/24.2%
metadata-eval24.2%
Simplified24.2%
Taylor expanded in l around inf 34.2%
associate-*r/34.2%
metadata-eval34.2%
Simplified34.2%
Taylor expanded in U* around inf 32.7%
Final simplification57.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1)))))
(if (<= t_2 1e-161)
(* (sqrt (* 2.0 U)) (sqrt (* n (- t (/ (* 2.0 (pow l_m 2.0)) Om)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (- t (- (* 2.0 (* l_m (/ l_m Om))) t_1))))
(* (* l_m (sqrt 2.0)) (sqrt (* U (/ (* n -2.0) Om))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 1e-161) {
tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * pow(l_m, 2.0)) / Om))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * ((n * -2.0) / Om)));
}
return tmp;
}
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 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1)));
double tmp;
if (t_2 <= 1e-161) {
tmp = Math.sqrt((2.0 * U)) * Math.sqrt((n * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * ((n * -2.0) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))) tmp = 0 if t_2 <= 1e-161: tmp = math.sqrt((2.0 * U)) * math.sqrt((n * (t - ((2.0 * math.pow(l_m, 2.0)) / Om)))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * ((n * -2.0) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1))) tmp = 0.0 if (t_2 <= 1e-161) tmp = Float64(sqrt(Float64(2.0 * U)) * sqrt(Float64(n * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64(2.0 * Float64(l_m * Float64(l_m / Om))) - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(Float64(n * -2.0) / Om)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1))); tmp = 0.0; if (t_2 <= 1e-161) tmp = sqrt((2.0 * U)) * sqrt((n * (t - ((2.0 * (l_m ^ 2.0)) / Om)))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * ((n * -2.0) / Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$2, 1e-161], N[(N[Sqrt[N[(2.0 * U), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(n * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(N[(n * -2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)}\\
\mathbf{if}\;t\_2 \leq 10^{-161}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \left(2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right) - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \frac{n \cdot -2}{Om}}\\
\end{array}
\end{array}
if (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < 1.00000000000000003e-161Initial program 11.4%
Simplified11.4%
associate-*r*11.3%
pow111.3%
Applied egg-rr11.3%
unpow111.3%
*-commutative11.3%
Simplified11.3%
Taylor expanded in U around 0 10.3%
mul-1-neg10.3%
associate-/l*10.3%
unpow210.3%
unpow210.3%
times-frac11.3%
unpow211.3%
Simplified11.3%
Taylor expanded in n around 0 30.0%
associate-*r/30.0%
Simplified30.0%
pow1/230.0%
associate-*r*30.1%
unpow-prod-down34.3%
pow1/234.3%
associate-/l*34.3%
Applied egg-rr34.3%
unpow1/234.3%
*-commutative34.3%
associate-*r/34.3%
Simplified34.3%
if 1.00000000000000003e-161 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) < +inf.0Initial program 61.4%
Simplified68.4%
if +inf.0 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 0.0%
Simplified12.6%
Taylor expanded in l around inf 24.2%
associate--l+24.2%
associate-/l*24.2%
associate-*r/24.2%
metadata-eval24.2%
Simplified24.2%
Taylor expanded in l around inf 34.2%
associate-*r/34.2%
metadata-eval34.2%
Simplified34.2%
Taylor expanded in n around 0 15.7%
associate-*r/15.7%
Simplified15.7%
Final simplification54.8%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_2 (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_1))))
(if (<= t_2 0.0)
(sqrt (* (* 2.0 n) (* U (- t (* (/ l_m Om) (* 2.0 l_m))))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (- t (- (* 2.0 (* l_m (/ l_m Om))) t_1))))
(* (* l_m (sqrt 2.0)) (sqrt (* U (/ (* n -2.0) Om))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * ((n * -2.0) / Om)));
}
return tmp;
}
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 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1);
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * ((n * -2.0) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * ((n * -2.0) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_2 = Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_1)) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m)))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t - Float64(Float64(2.0 * Float64(l_m * Float64(l_m / Om))) - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(Float64(n * -2.0) / Om)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_2 = ((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_1); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * ((n * -2.0) / Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t - N[(N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(N[(n * -2.0), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_2 := \left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_1\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t - \left(2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right) - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \frac{n \cdot -2}{Om}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < 0.0Initial program 10.0%
Simplified30.4%
Taylor expanded in Om around inf 33.0%
associate-*r/33.0%
Simplified33.0%
associate-/l*33.0%
unpow233.0%
associate-*r/33.0%
associate-*r*33.0%
Applied egg-rr33.0%
if 0.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) < +inf.0Initial program 61.3%
Simplified68.2%
if +inf.0 < (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*)))) Initial program 0.0%
Simplified10.9%
Taylor expanded in l around inf 23.6%
associate--l+23.6%
associate-/l*23.6%
associate-*r/23.6%
metadata-eval23.6%
Simplified23.6%
Taylor expanded in l around inf 34.3%
associate-*r/34.3%
metadata-eval34.3%
Simplified34.3%
Taylor expanded in n around 0 14.3%
associate-*r/14.3%
Simplified14.3%
Final simplification54.6%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= t -5e+101)
(sqrt (fabs (* (* 2.0 n) (* U t))))
(if (<= t 8.5e+196)
(sqrt
(*
(* 2.0 (* n U))
(+ t (- (* n (* (pow (/ l_m Om) 2.0) U*)) (* 2.0 (* l_m (/ l_m Om)))))))
(* (sqrt (* n (* 2.0 U))) (sqrt t)))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= -5e+101) {
tmp = sqrt(fabs(((2.0 * n) * (U * t))));
} else if (t <= 8.5e+196) {
tmp = sqrt(((2.0 * (n * U)) * (t + ((n * (pow((l_m / Om), 2.0) * U_42_)) - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = sqrt((n * (2.0 * U))) * sqrt(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 (t <= (-5d+101)) then
tmp = sqrt(abs(((2.0d0 * n) * (u * t))))
else if (t <= 8.5d+196) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + ((n * (((l_m / om) ** 2.0d0) * u_42)) - (2.0d0 * (l_m * (l_m / om)))))))
else
tmp = sqrt((n * (2.0d0 * u))) * sqrt(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 (t <= -5e+101) {
tmp = Math.sqrt(Math.abs(((2.0 * n) * (U * t))));
} else if (t <= 8.5e+196) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + ((n * (Math.pow((l_m / Om), 2.0) * U_42_)) - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = Math.sqrt((n * (2.0 * U))) * Math.sqrt(t);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= -5e+101: tmp = math.sqrt(math.fabs(((2.0 * n) * (U * t)))) elif t <= 8.5e+196: tmp = math.sqrt(((2.0 * (n * U)) * (t + ((n * (math.pow((l_m / Om), 2.0) * U_42_)) - (2.0 * (l_m * (l_m / Om))))))) else: tmp = math.sqrt((n * (2.0 * U))) * math.sqrt(t) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= -5e+101) tmp = sqrt(abs(Float64(Float64(2.0 * n) * Float64(U * t)))); elseif (t <= 8.5e+196) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(Float64(n * Float64((Float64(l_m / Om) ^ 2.0) * U_42_)) - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(sqrt(Float64(n * Float64(2.0 * U))) * sqrt(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 (t <= -5e+101) tmp = sqrt(abs(((2.0 * n) * (U * t)))); elseif (t <= 8.5e+196) tmp = sqrt(((2.0 * (n * U)) * (t + ((n * (((l_m / Om) ^ 2.0) * U_42_)) - (2.0 * (l_m * (l_m / Om))))))); else tmp = sqrt((n * (2.0 * U))) * sqrt(t); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, -5e+101], N[Sqrt[N[Abs[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], If[LessEqual[t, 8.5e+196], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(N[(n * N[(N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision] * U$42$), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq -5 \cdot 10^{+101}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right|}\\
\mathbf{elif}\;t \leq 8.5 \cdot 10^{+196}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(n \cdot \left({\left(\frac{l\_m}{Om}\right)}^{2} \cdot U*\right) - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(2 \cdot U\right)} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < -4.99999999999999989e101Initial program 46.3%
Simplified54.9%
Taylor expanded in l around 0 52.2%
*-un-lft-identity52.2%
associate-*r*52.2%
Applied egg-rr52.2%
*-lft-identity52.2%
associate-*r*41.0%
Simplified41.0%
add-sqr-sqrt41.0%
pow1/241.0%
pow1/246.8%
pow-prod-down38.5%
pow238.5%
associate-*l*41.3%
Applied egg-rr41.3%
unpow1/241.3%
unpow241.3%
rem-sqrt-square58.2%
*-commutative58.2%
*-commutative58.2%
Simplified58.2%
if -4.99999999999999989e101 < t < 8.50000000000000041e196Initial program 45.7%
Simplified51.6%
associate-*r*51.5%
pow151.5%
Applied egg-rr51.5%
unpow151.5%
*-commutative51.5%
Simplified51.5%
Taylor expanded in U around 0 40.2%
mul-1-neg40.2%
associate-/l*42.6%
unpow242.6%
unpow242.6%
times-frac52.1%
unpow252.1%
Simplified52.1%
if 8.50000000000000041e196 < t Initial program 28.4%
Simplified42.5%
Taylor expanded in l around 0 42.3%
*-un-lft-identity42.3%
associate-*r*42.3%
Applied egg-rr42.3%
*-lft-identity42.3%
associate-*r*32.3%
Simplified32.3%
sqrt-prod62.5%
associate-*l*62.3%
Applied egg-rr62.3%
*-commutative62.3%
associate-*r*62.5%
*-commutative62.5%
Simplified62.5%
Final simplification53.9%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (- t (* (/ l_m Om) (* 2.0 l_m)))))
(if (<= l_m 1.34e+110)
(sqrt (* (* 2.0 n) (* U t_1)))
(if (<= l_m 1.95e+145)
(* (* l_m (/ (* n (sqrt 2.0)) Om)) (sqrt (* U U*)))
(if (<= l_m 1.95e+223)
(sqrt (* 2.0 (* U (* n t_1))))
(* (* l_m (sqrt 2.0)) (sqrt (* -2.0 (/ (* n U) Om)))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = t - ((l_m / Om) * (2.0 * l_m));
double tmp;
if (l_m <= 1.34e+110) {
tmp = sqrt(((2.0 * n) * (U * t_1)));
} else if (l_m <= 1.95e+145) {
tmp = (l_m * ((n * sqrt(2.0)) / Om)) * sqrt((U * U_42_));
} else if (l_m <= 1.95e+223) {
tmp = sqrt((2.0 * (U * (n * t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((-2.0 * ((n * U) / 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 = t - ((l_m / om) * (2.0d0 * l_m))
if (l_m <= 1.34d+110) then
tmp = sqrt(((2.0d0 * n) * (u * t_1)))
else if (l_m <= 1.95d+145) then
tmp = (l_m * ((n * sqrt(2.0d0)) / om)) * sqrt((u * u_42))
else if (l_m <= 1.95d+223) then
tmp = sqrt((2.0d0 * (u * (n * t_1))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt(((-2.0d0) * ((n * u) / 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 = t - ((l_m / Om) * (2.0 * l_m));
double tmp;
if (l_m <= 1.34e+110) {
tmp = Math.sqrt(((2.0 * n) * (U * t_1)));
} else if (l_m <= 1.95e+145) {
tmp = (l_m * ((n * Math.sqrt(2.0)) / Om)) * Math.sqrt((U * U_42_));
} else if (l_m <= 1.95e+223) {
tmp = Math.sqrt((2.0 * (U * (n * t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((-2.0 * ((n * U) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = t - ((l_m / Om) * (2.0 * l_m)) tmp = 0 if l_m <= 1.34e+110: tmp = math.sqrt(((2.0 * n) * (U * t_1))) elif l_m <= 1.95e+145: tmp = (l_m * ((n * math.sqrt(2.0)) / Om)) * math.sqrt((U * U_42_)) elif l_m <= 1.95e+223: tmp = math.sqrt((2.0 * (U * (n * t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((-2.0 * ((n * U) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m))) tmp = 0.0 if (l_m <= 1.34e+110) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t_1))); elseif (l_m <= 1.95e+145) tmp = Float64(Float64(l_m * Float64(Float64(n * sqrt(2.0)) / Om)) * sqrt(Float64(U * U_42_))); elseif (l_m <= 1.95e+223) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(-2.0 * Float64(Float64(n * U) / Om)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = t - ((l_m / Om) * (2.0 * l_m)); tmp = 0.0; if (l_m <= 1.34e+110) tmp = sqrt(((2.0 * n) * (U * t_1))); elseif (l_m <= 1.95e+145) tmp = (l_m * ((n * sqrt(2.0)) / Om)) * sqrt((U * U_42_)); elseif (l_m <= 1.95e+223) tmp = sqrt((2.0 * (U * (n * t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((-2.0 * ((n * U) / 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[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[l$95$m, 1.34e+110], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 1.95e+145], N[(N[(l$95$m * N[(N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 1.95e+223], N[Sqrt[N[(2.0 * N[(U * N[(n * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-2.0 * N[(N[(n * U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\\
\mathbf{if}\;l\_m \leq 1.34 \cdot 10^{+110}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\_1\right)}\\
\mathbf{elif}\;l\_m \leq 1.95 \cdot 10^{+145}:\\
\;\;\;\;\left(l\_m \cdot \frac{n \cdot \sqrt{2}}{Om}\right) \cdot \sqrt{U \cdot U*}\\
\mathbf{elif}\;l\_m \leq 1.95 \cdot 10^{+223}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{-2 \cdot \frac{n \cdot U}{Om}}\\
\end{array}
\end{array}
if l < 1.34000000000000007e110Initial program 50.3%
Simplified53.0%
Taylor expanded in Om around inf 48.7%
associate-*r/48.7%
Simplified48.7%
associate-/l*48.7%
unpow248.7%
associate-*r/50.1%
associate-*r*50.1%
Applied egg-rr50.1%
if 1.34000000000000007e110 < l < 1.9499999999999999e145Initial program 4.9%
Simplified5.9%
Taylor expanded in U* around inf 59.8%
associate-/l*59.8%
Simplified59.8%
if 1.9499999999999999e145 < l < 1.9499999999999999e223Initial program 23.1%
Simplified52.9%
associate-*r*57.1%
pow157.1%
Applied egg-rr57.1%
unpow157.1%
*-commutative57.1%
Simplified57.1%
Taylor expanded in U around 0 17.8%
mul-1-neg17.8%
associate-/l*20.6%
unpow220.6%
unpow220.6%
times-frac55.6%
unpow255.6%
Simplified55.6%
Taylor expanded in n around 0 22.0%
associate-*r/22.0%
Simplified22.0%
associate-/l*19.4%
unpow219.4%
associate-*r/53.4%
associate-*r*53.4%
Applied egg-rr56.0%
if 1.9499999999999999e223 < l Initial program 11.9%
Simplified12.5%
Taylor expanded in l around inf 14.9%
associate--l+14.9%
associate-/l*15.4%
associate-*r/15.4%
metadata-eval15.4%
Simplified15.4%
Taylor expanded in l around inf 50.1%
associate-*r/50.1%
metadata-eval50.1%
Simplified50.1%
Taylor expanded in n around 0 45.1%
Final simplification50.4%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (<= l_m 1.55e+110)
(sqrt (* (* 2.0 n) (* U (- t (/ (* 2.0 (pow l_m 2.0)) Om)))))
(if (<= l_m 1.95e+145)
(* (* l_m (/ (* n (sqrt 2.0)) Om)) (sqrt (* U U*)))
(if (<= l_m 7.5e+222)
(sqrt (* 2.0 (* U (* n (- t (* (/ l_m Om) (* 2.0 l_m)))))))
(* (* l_m (sqrt 2.0)) (sqrt (* -2.0 (/ (* n U) 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.55e+110) {
tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * pow(l_m, 2.0)) / Om)))));
} else if (l_m <= 1.95e+145) {
tmp = (l_m * ((n * sqrt(2.0)) / Om)) * sqrt((U * U_42_));
} else if (l_m <= 7.5e+222) {
tmp = sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m)))))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((-2.0 * ((n * U) / 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.55d+110) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((2.0d0 * (l_m ** 2.0d0)) / om)))))
else if (l_m <= 1.95d+145) then
tmp = (l_m * ((n * sqrt(2.0d0)) / om)) * sqrt((u * u_42))
else if (l_m <= 7.5d+222) then
tmp = sqrt((2.0d0 * (u * (n * (t - ((l_m / om) * (2.0d0 * l_m)))))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt(((-2.0d0) * ((n * u) / 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.55e+110) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om)))));
} else if (l_m <= 1.95e+145) {
tmp = (l_m * ((n * Math.sqrt(2.0)) / Om)) * Math.sqrt((U * U_42_));
} else if (l_m <= 7.5e+222) {
tmp = Math.sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m)))))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((-2.0 * ((n * U) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 1.55e+110: tmp = math.sqrt(((2.0 * n) * (U * (t - ((2.0 * math.pow(l_m, 2.0)) / Om))))) elif l_m <= 1.95e+145: tmp = (l_m * ((n * math.sqrt(2.0)) / Om)) * math.sqrt((U * U_42_)) elif l_m <= 7.5e+222: tmp = math.sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m))))))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((-2.0 * ((n * U) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 1.55e+110) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om))))); elseif (l_m <= 1.95e+145) tmp = Float64(Float64(l_m * Float64(Float64(n * sqrt(2.0)) / Om)) * sqrt(Float64(U * U_42_))); elseif (l_m <= 7.5e+222) tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m))))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(-2.0 * Float64(Float64(n * U) / 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.55e+110) tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * (l_m ^ 2.0)) / Om))))); elseif (l_m <= 1.95e+145) tmp = (l_m * ((n * sqrt(2.0)) / Om)) * sqrt((U * U_42_)); elseif (l_m <= 7.5e+222) tmp = sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m))))))); else tmp = (l_m * sqrt(2.0)) * sqrt((-2.0 * ((n * U) / 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.55e+110], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[l$95$m, 1.95e+145], N[(N[(l$95$m * N[(N[(n * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[l$95$m, 7.5e+222], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-2.0 * N[(N[(n * U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.55 \cdot 10^{+110}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{elif}\;l\_m \leq 1.95 \cdot 10^{+145}:\\
\;\;\;\;\left(l\_m \cdot \frac{n \cdot \sqrt{2}}{Om}\right) \cdot \sqrt{U \cdot U*}\\
\mathbf{elif}\;l\_m \leq 7.5 \cdot 10^{+222}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{-2 \cdot \frac{n \cdot U}{Om}}\\
\end{array}
\end{array}
if l < 1.55000000000000009e110Initial program 50.3%
Simplified53.0%
Taylor expanded in Om around inf 48.7%
associate-*r/48.7%
Simplified48.7%
if 1.55000000000000009e110 < l < 1.9499999999999999e145Initial program 4.9%
Simplified5.9%
Taylor expanded in U* around inf 59.8%
associate-/l*59.8%
Simplified59.8%
if 1.9499999999999999e145 < l < 7.50000000000000003e222Initial program 23.1%
Simplified52.9%
associate-*r*57.1%
pow157.1%
Applied egg-rr57.1%
unpow157.1%
*-commutative57.1%
Simplified57.1%
Taylor expanded in U around 0 17.8%
mul-1-neg17.8%
associate-/l*20.6%
unpow220.6%
unpow220.6%
times-frac55.6%
unpow255.6%
Simplified55.6%
Taylor expanded in n around 0 22.0%
associate-*r/22.0%
Simplified22.0%
associate-/l*19.4%
unpow219.4%
associate-*r/53.4%
associate-*r*53.4%
Applied egg-rr56.0%
if 7.50000000000000003e222 < l Initial program 11.9%
Simplified12.5%
Taylor expanded in l around inf 14.9%
associate--l+14.9%
associate-/l*15.4%
associate-*r/15.4%
metadata-eval15.4%
Simplified15.4%
Taylor expanded in l around inf 50.1%
associate-*r/50.1%
metadata-eval50.1%
Simplified50.1%
Taylor expanded in n around 0 45.1%
Final simplification49.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 9e+222) (sqrt (* (* 2.0 n) (* U (- t (* (/ l_m Om) (* 2.0 l_m)))))) (* (* l_m (sqrt 2.0)) (sqrt (* -2.0 (/ (* n U) Om))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 9e+222) {
tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((-2.0 * ((n * U) / Om)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 9d+222) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((l_m / om) * (2.0d0 * l_m))))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt(((-2.0d0) * ((n * u) / om)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 9e+222) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((-2.0 * ((n * U) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 9e+222: tmp = math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((-2.0 * ((n * U) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 9e+222) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m)))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(-2.0 * Float64(Float64(n * U) / Om)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 9e+222) tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))); else tmp = (l_m * sqrt(2.0)) * sqrt((-2.0 * ((n * U) / Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 9e+222], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(-2.0 * N[(N[(n * U), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 9 \cdot 10^{+222}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{-2 \cdot \frac{n \cdot U}{Om}}\\
\end{array}
\end{array}
if l < 8.99999999999999978e222Initial program 46.7%
Simplified52.8%
Taylor expanded in Om around inf 44.9%
associate-*r/44.9%
Simplified44.9%
associate-/l*44.9%
unpow244.9%
associate-*r/49.5%
associate-*r*49.5%
Applied egg-rr49.5%
if 8.99999999999999978e222 < l Initial program 11.9%
Simplified12.5%
Taylor expanded in l around inf 14.9%
associate--l+14.9%
associate-/l*15.4%
associate-*r/15.4%
metadata-eval15.4%
Simplified15.4%
Taylor expanded in l around inf 50.1%
associate-*r/50.1%
metadata-eval50.1%
Simplified50.1%
Taylor expanded in n around 0 45.1%
Final simplification49.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 3.4e-73) (sqrt (fabs (* (* 2.0 n) (* U t)))) (sqrt (* 2.0 (* U (* n (- t (* (/ l_m Om) (* 2.0 l_m)))))))))
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 <= 3.4e-73) {
tmp = sqrt(fabs(((2.0 * n) * (U * t))));
} else {
tmp = sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m)))))));
}
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 <= 3.4d-73) then
tmp = sqrt(abs(((2.0d0 * n) * (u * t))))
else
tmp = sqrt((2.0d0 * (u * (n * (t - ((l_m / om) * (2.0d0 * l_m)))))))
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 <= 3.4e-73) {
tmp = Math.sqrt(Math.abs(((2.0 * n) * (U * t))));
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m)))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 3.4e-73: tmp = math.sqrt(math.fabs(((2.0 * n) * (U * t)))) else: tmp = math.sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 3.4e-73) tmp = sqrt(abs(Float64(Float64(2.0 * n) * Float64(U * t)))); else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m))))))); 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 <= 3.4e-73) tmp = sqrt(abs(((2.0 * n) * (U * t)))); else tmp = sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m))))))); 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, 3.4e-73], N[Sqrt[N[Abs[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 3.4 \cdot 10^{-73}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if l < 3.40000000000000021e-73Initial program 49.7%
Simplified54.4%
Taylor expanded in l around 0 42.0%
*-un-lft-identity42.0%
associate-*r*42.0%
Applied egg-rr42.0%
*-lft-identity42.0%
associate-*r*39.0%
Simplified39.0%
add-sqr-sqrt39.0%
pow1/239.0%
pow1/241.4%
pow-prod-down29.0%
pow229.0%
associate-*l*31.1%
Applied egg-rr31.1%
unpow1/231.1%
unpow231.1%
rem-sqrt-square44.5%
*-commutative44.5%
*-commutative44.5%
Simplified44.5%
if 3.40000000000000021e-73 < l Initial program 32.8%
Simplified42.0%
associate-*r*41.0%
pow141.0%
Applied egg-rr41.0%
unpow141.0%
*-commutative41.0%
Simplified41.0%
Taylor expanded in U around 0 26.8%
mul-1-neg26.8%
associate-/l*31.1%
unpow231.1%
unpow231.1%
times-frac42.1%
unpow242.1%
Simplified42.1%
Taylor expanded in n around 0 27.5%
associate-*r/27.5%
Simplified27.5%
associate-/l*28.6%
unpow228.6%
associate-*r/37.8%
associate-*r*37.8%
Applied egg-rr37.8%
Final simplification42.3%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t 7e+139) (sqrt (* (* 2.0 n) (* U (- t (* (/ l_m Om) (* 2.0 l_m)))))) (* (sqrt t) (sqrt (* 2.0 (* n U))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= 7e+139) {
tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else {
tmp = sqrt(t) * sqrt((2.0 * (n * 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 (t <= 7d+139) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((l_m / om) * (2.0d0 * l_m))))))
else
tmp = sqrt(t) * sqrt((2.0d0 * (n * 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 (t <= 7e+139) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else {
tmp = Math.sqrt(t) * Math.sqrt((2.0 * (n * U)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= 7e+139: tmp = math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))) else: tmp = math.sqrt(t) * math.sqrt((2.0 * (n * U))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= 7e+139) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m)))))); else tmp = Float64(sqrt(t) * sqrt(Float64(2.0 * Float64(n * 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 (t <= 7e+139) tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))); else tmp = sqrt(t) * sqrt((2.0 * (n * U))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, 7e+139], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[t], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 7 \cdot 10^{+139}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{t} \cdot \sqrt{2 \cdot \left(n \cdot U\right)}\\
\end{array}
\end{array}
if t < 6.99999999999999957e139Initial program 45.6%
Simplified50.6%
Taylor expanded in Om around inf 43.3%
associate-*r/43.3%
Simplified43.3%
associate-/l*43.3%
unpow243.3%
associate-*r/47.7%
associate-*r*47.7%
Applied egg-rr47.7%
if 6.99999999999999957e139 < t Initial program 33.1%
Simplified44.6%
Taylor expanded in t around inf 50.6%
associate-*r*50.6%
Simplified50.6%
pow1/254.1%
associate-*r*36.6%
unpow-prod-down60.5%
pow1/260.5%
Applied egg-rr60.5%
unpow1/260.5%
associate-*r*60.4%
Simplified60.4%
Final simplification49.2%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t 3.4e+140) (sqrt (* (* 2.0 n) (* U (- t (* (/ l_m Om) (* 2.0 l_m)))))) (* (sqrt (* n (* 2.0 U))) (sqrt t))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= 3.4e+140) {
tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else {
tmp = sqrt((n * (2.0 * U))) * sqrt(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 (t <= 3.4d+140) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((l_m / om) * (2.0d0 * l_m))))))
else
tmp = sqrt((n * (2.0d0 * u))) * sqrt(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 (t <= 3.4e+140) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m))))));
} else {
tmp = Math.sqrt((n * (2.0 * U))) * Math.sqrt(t);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= 3.4e+140: tmp = math.sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))) else: tmp = math.sqrt((n * (2.0 * U))) * math.sqrt(t) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= 3.4e+140) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m)))))); else tmp = Float64(sqrt(Float64(n * Float64(2.0 * U))) * sqrt(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 (t <= 3.4e+140) tmp = sqrt(((2.0 * n) * (U * (t - ((l_m / Om) * (2.0 * l_m)))))); else tmp = sqrt((n * (2.0 * U))) * sqrt(t); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, 3.4e+140], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(n * N[(2.0 * U), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq 3.4 \cdot 10^{+140}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot \left(2 \cdot U\right)} \cdot \sqrt{t}\\
\end{array}
\end{array}
if t < 3.4e140Initial program 45.6%
Simplified50.6%
Taylor expanded in Om around inf 43.3%
associate-*r/43.3%
Simplified43.3%
associate-/l*43.3%
unpow243.3%
associate-*r/47.7%
associate-*r*47.7%
Applied egg-rr47.7%
if 3.4e140 < t Initial program 33.1%
Simplified44.6%
Taylor expanded in l around 0 41.3%
*-un-lft-identity41.3%
associate-*r*41.3%
Applied egg-rr41.3%
*-lft-identity41.3%
associate-*r*33.1%
Simplified33.1%
sqrt-prod60.5%
associate-*l*60.4%
Applied egg-rr60.4%
*-commutative60.4%
associate-*r*60.5%
*-commutative60.5%
Simplified60.5%
Final simplification49.2%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 4.6e-73) (pow (* (* 2.0 n) (* U t)) 0.5) (sqrt (* 2.0 (* U (* n (- t (* (/ l_m Om) (* 2.0 l_m)))))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 4.6e-73) {
tmp = pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m)))))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 4.6d-73) then
tmp = ((2.0d0 * n) * (u * t)) ** 0.5d0
else
tmp = sqrt((2.0d0 * (u * (n * (t - ((l_m / om) * (2.0d0 * l_m)))))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 4.6e-73) {
tmp = Math.pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = Math.sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m)))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 4.6e-73: tmp = math.pow(((2.0 * n) * (U * t)), 0.5) else: tmp = math.sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m))))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 4.6e-73) tmp = Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5; else tmp = sqrt(Float64(2.0 * Float64(U * Float64(n * Float64(t - Float64(Float64(l_m / Om) * Float64(2.0 * l_m))))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 4.6e-73) tmp = ((2.0 * n) * (U * t)) ^ 0.5; else tmp = sqrt((2.0 * (U * (n * (t - ((l_m / Om) * (2.0 * l_m))))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 4.6e-73], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[(2.0 * N[(U * N[(n * N[(t - N[(N[(l$95$m / Om), $MachinePrecision] * N[(2.0 * l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 4.6 \cdot 10^{-73}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot \left(t - \frac{l\_m}{Om} \cdot \left(2 \cdot l\_m\right)\right)\right)\right)}\\
\end{array}
\end{array}
if l < 4.59999999999999977e-73Initial program 49.7%
Simplified54.4%
Taylor expanded in l around 0 42.0%
pow1/243.8%
associate-*r*43.8%
Applied egg-rr43.8%
if 4.59999999999999977e-73 < l Initial program 32.8%
Simplified42.0%
associate-*r*41.0%
pow141.0%
Applied egg-rr41.0%
unpow141.0%
*-commutative41.0%
Simplified41.0%
Taylor expanded in U around 0 26.8%
mul-1-neg26.8%
associate-/l*31.1%
unpow231.1%
unpow231.1%
times-frac42.1%
unpow242.1%
Simplified42.1%
Taylor expanded in n around 0 27.5%
associate-*r/27.5%
Simplified27.5%
associate-/l*28.6%
unpow228.6%
associate-*r/37.8%
associate-*r*37.8%
Applied egg-rr37.8%
Final simplification41.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (pow (* (* 2.0 n) (* U t)) 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 * n) * (U * t)), 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 * n) * (u * t)) ** 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 * n) * (U * t)), 0.5);
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.pow(((2.0 * n) * (U * t)), 0.5)
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5 end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = ((2.0 * n) * (U * t)) ^ 0.5; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}
\end{array}
Initial program 44.1%
Simplified49.9%
Taylor expanded in l around 0 33.0%
pow1/234.6%
associate-*r*34.6%
Applied egg-rr34.6%
Final simplification34.6%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (sqrt (* 2.0 (* n (* U t)))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return sqrt((2.0 * (n * (U * t))));
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((2.0d0 * (n * (u * t))))
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
return Math.sqrt((2.0 * (n * (U * t))));
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): return math.sqrt((2.0 * (n * (U * t))))
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) return sqrt(Float64(2.0 * Float64(n * Float64(U * t)))) end
l_m = abs(l); function tmp = code(n, U, t, l_m, Om, U_42_) tmp = sqrt((2.0 * (n * (U * t)))); end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := N[Sqrt[N[(2.0 * N[(n * N[(U * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\sqrt{2 \cdot \left(n \cdot \left(U \cdot t\right)\right)}
\end{array}
Initial program 44.1%
Simplified49.9%
Taylor expanded in l around 0 33.0%
Final simplification33.0%
herbie shell --seed 2024076
(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*))))))