
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
double code(double n, double U, double t, double l, double Om, double U_42_) {
return sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
real(8) function code(n, u, t, l, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l
real(8), intent (in) :: om
real(8), intent (in) :: u_42
code = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l * l) / om))) - ((n * ((l / om) ** 2.0d0)) * (u - u_42)))))
end function
public static double code(double n, double U, double t, double l, double Om, double U_42_) {
return Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * Math.pow((l / Om), 2.0)) * (U - U_42_)))));
}
def code(n, U, t, l, Om, U_42_): return math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * math.pow((l / Om), 2.0)) * (U - U_42_)))))
function code(n, U, t, l, Om, U_42_) return sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l * l) / Om))) - Float64(Float64(n * (Float64(l / Om) ^ 2.0)) * Float64(U - U_42_))))) end
function tmp = code(n, U, t, l, Om, U_42_) tmp = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * ((l / Om) ^ 2.0)) * (U - U_42_))))); end
code[n_, U_, t_, l_, Om_, U$42$_] := N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l * l), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(n * N[Power[N[(l / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
\\
\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}
\end{array}
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* n (pow (/ l_m Om) 2.0)))
(t_2 (* t_1 (- U* U)))
(t_3
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2)))))
(if (<= t_3 0.0)
(*
(sqrt (* U (- t (fma 2.0 (/ (pow l_m 2.0) Om) (* t_1 (- U U*))))))
(sqrt (* 2.0 n)))
(if (<= t_3 5e+145)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 (* 2.0 (* l_m (/ l_m Om)))))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (* U* (/ n (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);
double t_2 = t_1 * (U_42_ - U);
double t_3 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((U * (t - fma(2.0, (pow(l_m, 2.0) / Om), (t_1 * (U - U_42_)))))) * sqrt((2.0 * n));
} else if (t_3 <= 5e+145) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - (2.0 * (l_m * (l_m / Om)))))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * ((U_42_ * (n / 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(n * (Float64(l_m / Om) ^ 2.0)) t_2 = Float64(t_1 * Float64(U_42_ - U)) t_3 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(U * Float64(t - fma(2.0, Float64((l_m ^ 2.0) / Om), Float64(t_1 * Float64(U - U_42_)))))) * sqrt(Float64(2.0 * n))); elseif (t_3 <= 5e+145) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - Float64(2.0 * Float64(l_m * Float64(l_m / Om))))))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(U_42_ * Float64(n / (Om ^ 2.0))) - Float64(2.0 / Om)))))); end return tmp end
l_m = N[Abs[l], $MachinePrecision]
code[n_, U_, t_, l$95$m_, Om_, U$42$_] := Block[{t$95$1 = N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(U * N[(t - N[(2.0 * N[(N[Power[l$95$m, 2.0], $MachinePrecision] / Om), $MachinePrecision] + N[(t$95$1 * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e+145], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $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 := n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\\
t_2 := t\_1 \cdot \left(U* - U\right)\\
t_3 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{U \cdot \left(t - \mathsf{fma}\left(2, \frac{{l\_m}^{2}}{Om}, t\_1 \cdot \left(U - U*\right)\right)\right)} \cdot \sqrt{2 \cdot n}\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(U* \cdot \frac{n}{{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*))))) < 0.0Initial program 13.5%
Simplified39.9%
*-commutative39.9%
sqrt-prod44.4%
associate-*r/44.4%
pow244.4%
Applied egg-rr44.4%
associate-*r*47.2%
Simplified47.2%
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*))))) < 4.99999999999999967e145Initial program 97.9%
Simplified97.9%
if 4.99999999999999967e145 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 22.2%
Simplified30.5%
Taylor expanded in U around 0 22.9%
mul-1-neg22.9%
associate-/l*22.1%
unpow222.1%
unpow222.1%
times-frac30.7%
unpow230.7%
Simplified30.7%
clear-num30.7%
inv-pow30.7%
Applied egg-rr30.7%
unpow-130.7%
Simplified30.7%
distribute-rgt-neg-out30.7%
fmm-undef30.7%
clear-num30.7%
clear-num30.7%
inv-pow30.7%
pow-pow30.7%
metadata-eval30.7%
Applied egg-rr30.7%
Taylor expanded in l around inf 25.7%
*-commutative25.7%
associate-/l*25.7%
associate-*r/25.7%
metadata-eval25.7%
Simplified25.7%
Final simplification55.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* 2.0 (* l_m (/ l_m Om))))
(t_2 (* (* n (pow (/ l_m Om) 2.0)) (- U* U)))
(t_3
(sqrt (* (* (* 2.0 n) U) (+ (- t (* 2.0 (/ (* l_m l_m) Om))) t_2)))))
(if (<= t_3 0.0)
(*
(sqrt (* 2.0 n))
(sqrt (* U (- t (- t_1 (* n (* U* (pow (/ Om l_m) -2.0))))))))
(if (<= t_3 5e+145)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_2 t_1))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (* U* (/ n (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 = 2.0 * (l_m * (l_m / Om));
double t_2 = (n * pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = sqrt((2.0 * n)) * sqrt((U * (t - (t_1 - (n * (U_42_ * pow((Om / l_m), -2.0)))))));
} else if (t_3 <= 5e+145) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * ((U_42_ * (n / pow(Om, 2.0))) - (2.0 / Om)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = 2.0d0 * (l_m * (l_m / om))
t_2 = (n * ((l_m / om) ** 2.0d0)) * (u_42 - u)
t_3 = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) + t_2)))
if (t_3 <= 0.0d0) then
tmp = sqrt((2.0d0 * n)) * sqrt((u * (t - (t_1 - (n * (u_42 * ((om / l_m) ** (-2.0d0))))))))
else if (t_3 <= 5d+145) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (t_2 - t_1))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt((u * (n * ((u_42 * (n / (om ** 2.0d0))) - (2.0d0 / om)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = 2.0 * (l_m * (l_m / Om));
double t_2 = (n * Math.pow((l_m / Om), 2.0)) * (U_42_ - U);
double t_3 = Math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2)));
double tmp;
if (t_3 <= 0.0) {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * (t - (t_1 - (n * (U_42_ * Math.pow((Om / l_m), -2.0)))))));
} else if (t_3 <= 5e+145) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * (n * ((U_42_ * (n / 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 = 2.0 * (l_m * (l_m / Om)) t_2 = (n * math.pow((l_m / Om), 2.0)) * (U_42_ - U) t_3 = math.sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2))) tmp = 0 if t_3 <= 0.0: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * (t - (t_1 - (n * (U_42_ * math.pow((Om / l_m), -2.0))))))) elif t_3 <= 5e+145: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * (n * ((U_42_ * (n / 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(2.0 * Float64(l_m * Float64(l_m / Om))) t_2 = Float64(Float64(n * (Float64(l_m / Om) ^ 2.0)) * Float64(U_42_ - U)) t_3 = sqrt(Float64(Float64(Float64(2.0 * n) * U) * Float64(Float64(t - Float64(2.0 * Float64(Float64(l_m * l_m) / Om))) + t_2))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(U * Float64(t - Float64(t_1 - Float64(n * Float64(U_42_ * (Float64(Om / l_m) ^ -2.0)))))))); elseif (t_3 <= 5e+145) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_2 - t_1)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(U_42_ * Float64(n / (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 = 2.0 * (l_m * (l_m / Om)); t_2 = (n * ((l_m / Om) ^ 2.0)) * (U_42_ - U); t_3 = sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l_m * l_m) / Om))) + t_2))); tmp = 0.0; if (t_3 <= 0.0) tmp = sqrt((2.0 * n)) * sqrt((U * (t - (t_1 - (n * (U_42_ * ((Om / l_m) ^ -2.0))))))); elseif (t_3 <= 5e+145) tmp = sqrt(((2.0 * (n * U)) * (t + (t_2 - t_1)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * ((U_42_ * (n / (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[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(n * N[Power[N[(l$95$m / Om), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * N[(U$42$ - U), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(N[(N[(2.0 * n), $MachinePrecision] * U), $MachinePrecision] * N[(N[(t - N[(2.0 * N[(N[(l$95$m * l$95$m), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * N[(t - N[(t$95$1 - N[(n * N[(U$42$ * N[Power[N[(Om / l$95$m), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e+145], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$2 - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $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 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\\
t_2 := \left(n \cdot {\left(\frac{l\_m}{Om}\right)}^{2}\right) \cdot \left(U* - U\right)\\
t_3 := \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{l\_m \cdot l\_m}{Om}\right) + t\_2\right)}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(t - \left(t\_1 - n \cdot \left(U* \cdot {\left(\frac{Om}{l\_m}\right)}^{-2}\right)\right)\right)}\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_2 - t\_1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(U* \cdot \frac{n}{{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*))))) < 0.0Initial program 13.5%
Simplified39.9%
Taylor expanded in U around 0 28.3%
mul-1-neg28.3%
associate-/l*31.2%
unpow231.2%
unpow231.2%
times-frac39.9%
unpow239.9%
Simplified39.9%
clear-num39.9%
inv-pow39.9%
Applied egg-rr39.9%
unpow-139.9%
Simplified39.9%
Applied egg-rr44.4%
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*))))) < 4.99999999999999967e145Initial program 97.9%
Simplified97.9%
if 4.99999999999999967e145 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 22.2%
Simplified30.5%
Taylor expanded in U around 0 22.9%
mul-1-neg22.9%
associate-/l*22.1%
unpow222.1%
unpow222.1%
times-frac30.7%
unpow230.7%
Simplified30.7%
clear-num30.7%
inv-pow30.7%
Applied egg-rr30.7%
unpow-130.7%
Simplified30.7%
distribute-rgt-neg-out30.7%
fmm-undef30.7%
clear-num30.7%
clear-num30.7%
inv-pow30.7%
pow-pow30.7%
metadata-eval30.7%
Applied egg-rr30.7%
Taylor expanded in l around inf 25.7%
*-commutative25.7%
associate-/l*25.7%
associate-*r/25.7%
metadata-eval25.7%
Simplified25.7%
Final simplification55.1%
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))))
(t_3 (* 2.0 (* l_m (/ l_m Om)))))
(if (<= t_2 0.0)
(sqrt
(* (* 2.0 n) (* U (+ t (- (* (pow (/ Om l_m) -2.0) (* n U*)) t_3)))))
(if (<= t_2 5e+145)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 t_3))))
(*
(* l_m (sqrt 2.0))
(sqrt (* U (* n (- (* U* (/ n (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 t_3 = 2.0 * (l_m * (l_m / Om));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t + ((pow((Om / l_m), -2.0) * (n * U_42_)) - t_3)))));
} else if (t_2 <= 5e+145) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3))));
} else {
tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * ((U_42_ * (n / pow(Om, 2.0))) - (2.0 / Om)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (n * ((l_m / om) ** 2.0d0)) * (u_42 - u)
t_2 = sqrt((((2.0d0 * n) * u) * ((t - (2.0d0 * ((l_m * l_m) / om))) + t_1)))
t_3 = 2.0d0 * (l_m * (l_m / om))
if (t_2 <= 0.0d0) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((((om / l_m) ** (-2.0d0)) * (n * u_42)) - t_3)))))
else if (t_2 <= 5d+145) then
tmp = sqrt(((2.0d0 * (n * u)) * (t + (t_1 - t_3))))
else
tmp = (l_m * sqrt(2.0d0)) * sqrt((u * (n * ((u_42 * (n / (om ** 2.0d0))) - (2.0d0 / om)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double t_1 = (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 t_3 = 2.0 * (l_m * (l_m / Om));
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((Math.pow((Om / l_m), -2.0) * (n * U_42_)) - t_3)))));
} else if (t_2 <= 5e+145) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3))));
} else {
tmp = (l_m * Math.sqrt(2.0)) * Math.sqrt((U * (n * ((U_42_ * (n / 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))) t_3 = 2.0 * (l_m * (l_m / Om)) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t + ((math.pow((Om / l_m), -2.0) * (n * U_42_)) - t_3))))) elif t_2 <= 5e+145: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3)))) else: tmp = (l_m * math.sqrt(2.0)) * math.sqrt((U * (n * ((U_42_ * (n / 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))) t_3 = Float64(2.0 * Float64(l_m * Float64(l_m / Om))) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64((Float64(Om / l_m) ^ -2.0) * Float64(n * U_42_)) - t_3))))); elseif (t_2 <= 5e+145) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - t_3)))); else tmp = Float64(Float64(l_m * sqrt(2.0)) * sqrt(Float64(U * Float64(n * Float64(Float64(U_42_ * Float64(n / (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))); t_3 = 2.0 * (l_m * (l_m / Om)); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t + ((((Om / l_m) ^ -2.0) * (n * U_42_)) - t_3))))); elseif (t_2 <= 5e+145) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3)))); else tmp = (l_m * sqrt(2.0)) * sqrt((U * (n * ((U_42_ * (n / (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]}, Block[{t$95$3 = N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[Power[N[(Om / l$95$m), $MachinePrecision], -2.0], $MachinePrecision] * N[(n * U$42$), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, 5e+145], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[(l$95$m * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(U * N[(n * N[(N[(U$42$ * N[(n / N[Power[Om, 2.0], $MachinePrecision]), $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)}\\
t_3 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left({\left(\frac{Om}{l\_m}\right)}^{-2} \cdot \left(n \cdot U*\right) - t\_3\right)\right)\right)}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - t\_3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(l\_m \cdot \sqrt{2}\right) \cdot \sqrt{U \cdot \left(n \cdot \left(U* \cdot \frac{n}{{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*))))) < 0.0Initial program 13.5%
Simplified39.9%
Taylor expanded in U around 0 28.3%
mul-1-neg28.3%
associate-/l*31.2%
unpow231.2%
unpow231.2%
times-frac39.9%
unpow239.9%
Simplified39.9%
clear-num39.9%
inv-pow39.9%
Applied egg-rr39.9%
unpow-139.9%
Simplified39.9%
distribute-rgt-neg-out39.9%
fmm-undef39.9%
clear-num39.9%
clear-num39.9%
inv-pow39.9%
pow-pow39.9%
metadata-eval39.9%
Applied egg-rr39.9%
pow139.9%
associate-*r*40.7%
Applied egg-rr40.7%
unpow140.7%
*-commutative40.7%
Simplified40.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*))))) < 4.99999999999999967e145Initial program 97.9%
Simplified97.9%
if 4.99999999999999967e145 < (sqrt.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) n) U) (-.f64 (-.f64 t (*.f64 #s(literal 2 binary64) (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) #s(literal 2 binary64))) (-.f64 U U*))))) Initial program 22.2%
Simplified30.5%
Taylor expanded in U around 0 22.9%
mul-1-neg22.9%
associate-/l*22.1%
unpow222.1%
unpow222.1%
times-frac30.7%
unpow230.7%
Simplified30.7%
clear-num30.7%
inv-pow30.7%
Applied egg-rr30.7%
unpow-130.7%
Simplified30.7%
distribute-rgt-neg-out30.7%
fmm-undef30.7%
clear-num30.7%
clear-num30.7%
inv-pow30.7%
pow-pow30.7%
metadata-eval30.7%
Applied egg-rr30.7%
Taylor expanded in l around inf 25.7%
*-commutative25.7%
associate-/l*25.7%
associate-*r/25.7%
metadata-eval25.7%
Simplified25.7%
Final simplification54.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))))
(t_3 (* 2.0 (* l_m (/ l_m Om)))))
(if (<= t_2 0.0)
(sqrt
(* (* 2.0 n) (* U (+ t (- (* (pow (/ Om l_m) -2.0) (* n U*)) t_3)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 t_3))))
(sqrt
(*
2.0
(-
(* U (* n t))
(*
(pow l_m 2.0)
(* n (/ (+ (* 2.0 U) (/ (* U (* n (- U U*))) 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 = (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 t_3 = 2.0 * (l_m * (l_m / Om));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t + ((pow((Om / l_m), -2.0) * (n * U_42_)) - t_3)))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3))));
} else {
tmp = sqrt((2.0 * ((U * (n * t)) - (pow(l_m, 2.0) * (n * (((2.0 * U) + ((U * (n * (U - U_42_))) / Om)) / 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 t_3 = 2.0 * (l_m * (l_m / Om));
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((Math.pow((Om / l_m), -2.0) * (n * U_42_)) - t_3)))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3))));
} else {
tmp = Math.sqrt((2.0 * ((U * (n * t)) - (Math.pow(l_m, 2.0) * (n * (((2.0 * U) + ((U * (n * (U - U_42_))) / Om)) / 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))) t_3 = 2.0 * (l_m * (l_m / Om)) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t + ((math.pow((Om / l_m), -2.0) * (n * U_42_)) - t_3))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3)))) else: tmp = math.sqrt((2.0 * ((U * (n * t)) - (math.pow(l_m, 2.0) * (n * (((2.0 * U) + ((U * (n * (U - U_42_))) / Om)) / 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))) t_3 = Float64(2.0 * Float64(l_m * Float64(l_m / Om))) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64((Float64(Om / l_m) ^ -2.0) * Float64(n * U_42_)) - t_3))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - t_3)))); else tmp = sqrt(Float64(2.0 * Float64(Float64(U * Float64(n * t)) - Float64((l_m ^ 2.0) * Float64(n * Float64(Float64(Float64(2.0 * U) + Float64(Float64(U * Float64(n * Float64(U - U_42_))) / Om)) / 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))); t_3 = 2.0 * (l_m * (l_m / Om)); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t + ((((Om / l_m) ^ -2.0) * (n * U_42_)) - t_3))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3)))); else tmp = sqrt((2.0 * ((U * (n * t)) - ((l_m ^ 2.0) * (n * (((2.0 * U) + ((U * (n * (U - 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$_] := 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]}, Block[{t$95$3 = N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[Power[N[(Om / l$95$m), $MachinePrecision], -2.0], $MachinePrecision] * N[(n * U$42$), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] - N[(N[Power[l$95$m, 2.0], $MachinePrecision] * N[(n * N[(N[(N[(2.0 * U), $MachinePrecision] + N[(N[(U * N[(n * N[(U - U$42$), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision] / 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)}\\
t_3 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left({\left(\frac{Om}{l\_m}\right)}^{-2} \cdot \left(n \cdot U*\right) - t\_3\right)\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - t\_3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right) - {l\_m}^{2} \cdot \left(n \cdot \frac{2 \cdot U + \frac{U \cdot \left(n \cdot \left(U - U*\right)\right)}{Om}}{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*))))) < 0.0Initial program 13.5%
Simplified39.9%
Taylor expanded in U around 0 28.3%
mul-1-neg28.3%
associate-/l*31.2%
unpow231.2%
unpow231.2%
times-frac39.9%
unpow239.9%
Simplified39.9%
clear-num39.9%
inv-pow39.9%
Applied egg-rr39.9%
unpow-139.9%
Simplified39.9%
distribute-rgt-neg-out39.9%
fmm-undef39.9%
clear-num39.9%
clear-num39.9%
inv-pow39.9%
pow-pow39.9%
metadata-eval39.9%
Applied egg-rr39.9%
pow139.9%
associate-*r*40.7%
Applied egg-rr40.7%
unpow140.7%
*-commutative40.7%
Simplified40.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*))))) < +inf.0Initial program 70.6%
Simplified72.3%
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%
Simplified11.5%
Taylor expanded in Om around -inf 23.0%
+-commutative23.0%
mul-1-neg23.0%
unsub-neg23.0%
+-commutative23.0%
mul-1-neg23.0%
unsub-neg23.0%
associate-*r*23.0%
associate-/l*19.2%
associate-/l*19.0%
Simplified19.0%
Taylor expanded in l around 0 28.2%
Taylor expanded in Om around inf 38.9%
Final simplification61.5%
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))))
(t_3 (* 2.0 (* l_m (/ l_m Om)))))
(if (<= t_2 0.0)
(sqrt
(* (* 2.0 n) (* U (+ t (- (* (pow (/ Om l_m) -2.0) (* n U*)) t_3)))))
(if (<= t_2 INFINITY)
(sqrt (* (* 2.0 (* n U)) (+ t (- t_1 t_3))))
(* (sqrt (* U U*)) (* l_m (* n (/ (sqrt 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 t_3 = 2.0 * (l_m * (l_m / Om));
double tmp;
if (t_2 <= 0.0) {
tmp = sqrt(((2.0 * n) * (U * (t + ((pow((Om / l_m), -2.0) * (n * U_42_)) - t_3)))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3))));
} else {
tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(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 t_3 = 2.0 * (l_m * (l_m / Om));
double tmp;
if (t_2 <= 0.0) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((Math.pow((Om / l_m), -2.0) * (n * U_42_)) - t_3)))));
} else if (t_2 <= Double.POSITIVE_INFINITY) {
tmp = Math.sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3))));
} else {
tmp = Math.sqrt((U * U_42_)) * (l_m * (n * (Math.sqrt(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))) t_3 = 2.0 * (l_m * (l_m / Om)) tmp = 0 if t_2 <= 0.0: tmp = math.sqrt(((2.0 * n) * (U * (t + ((math.pow((Om / l_m), -2.0) * (n * U_42_)) - t_3))))) elif t_2 <= math.inf: tmp = math.sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3)))) else: tmp = math.sqrt((U * U_42_)) * (l_m * (n * (math.sqrt(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))) t_3 = Float64(2.0 * Float64(l_m * Float64(l_m / Om))) tmp = 0.0 if (t_2 <= 0.0) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64((Float64(Om / l_m) ^ -2.0) * Float64(n * U_42_)) - t_3))))); elseif (t_2 <= Inf) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * Float64(t + Float64(t_1 - t_3)))); else tmp = Float64(sqrt(Float64(U * U_42_)) * Float64(l_m * Float64(n * Float64(sqrt(2.0) / Float64(-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))); t_3 = 2.0 * (l_m * (l_m / Om)); tmp = 0.0; if (t_2 <= 0.0) tmp = sqrt(((2.0 * n) * (U * (t + ((((Om / l_m) ^ -2.0) * (n * U_42_)) - t_3))))); elseif (t_2 <= Inf) tmp = sqrt(((2.0 * (n * U)) * (t + (t_1 - t_3)))); else tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(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]}, Block[{t$95$3 = N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 0.0], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(N[Power[N[(Om / l$95$m), $MachinePrecision], -2.0], $MachinePrecision] * N[(n * U$42$), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * N[(t + N[(t$95$1 - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[(n * N[(N[Sqrt[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)}\\
t_3 := 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\\
\mathbf{if}\;t\_2 \leq 0:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left({\left(\frac{Om}{l\_m}\right)}^{-2} \cdot \left(n \cdot U*\right) - t\_3\right)\right)\right)}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \left(t + \left(t\_1 - t\_3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot U*} \cdot \left(l\_m \cdot \left(n \cdot \frac{\sqrt{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*))))) < 0.0Initial program 13.5%
Simplified39.9%
Taylor expanded in U around 0 28.3%
mul-1-neg28.3%
associate-/l*31.2%
unpow231.2%
unpow231.2%
times-frac39.9%
unpow239.9%
Simplified39.9%
clear-num39.9%
inv-pow39.9%
Applied egg-rr39.9%
unpow-139.9%
Simplified39.9%
distribute-rgt-neg-out39.9%
fmm-undef39.9%
clear-num39.9%
clear-num39.9%
inv-pow39.9%
pow-pow39.9%
metadata-eval39.9%
Applied egg-rr39.9%
pow139.9%
associate-*r*40.7%
Applied egg-rr40.7%
unpow140.7%
*-commutative40.7%
Simplified40.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*))))) < +inf.0Initial program 70.6%
Simplified72.3%
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%
Simplified11.5%
Taylor expanded in Om around -inf 23.0%
+-commutative23.0%
mul-1-neg23.0%
unsub-neg23.0%
+-commutative23.0%
mul-1-neg23.0%
unsub-neg23.0%
associate-*r*23.0%
associate-/l*19.2%
associate-/l*19.0%
Simplified19.0%
Taylor expanded in U* around inf 22.2%
associate-*r*19.8%
Simplified19.8%
Taylor expanded in n around -inf 21.5%
mul-1-neg21.5%
*-commutative21.5%
associate-*r*21.6%
distribute-rgt-neg-in21.6%
*-commutative21.6%
associate-*r*21.5%
associate-*r/23.4%
associate-/l*23.5%
Simplified23.5%
Final simplification58.5%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(if (or (<= n -8.2e-263) (not (<= n 1.08e-243)))
(sqrt
(*
(* 2.0 n)
(*
U
(+
t
(- (* n (* U* (pow (/ Om l_m) -2.0))) (* 2.0 (* l_m (/ l_m Om))))))))
(sqrt (* 2.0 (+ (* U (* n t)) (* -2.0 (* U (/ (* n (pow l_m 2.0)) Om))))))))l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if ((n <= -8.2e-263) || !(n <= 1.08e-243)) {
tmp = sqrt(((2.0 * n) * (U * (t + ((n * (U_42_ * pow((Om / l_m), -2.0))) - (2.0 * (l_m * (l_m / Om))))))));
} else {
tmp = sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * pow(l_m, 2.0)) / Om))))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if ((n <= (-8.2d-263)) .or. (.not. (n <= 1.08d-243))) then
tmp = sqrt(((2.0d0 * n) * (u * (t + ((n * (u_42 * ((om / l_m) ** (-2.0d0)))) - (2.0d0 * (l_m * (l_m / om))))))))
else
tmp = sqrt((2.0d0 * ((u * (n * t)) + ((-2.0d0) * (u * ((n * (l_m ** 2.0d0)) / om))))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if ((n <= -8.2e-263) || !(n <= 1.08e-243)) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + ((n * (U_42_ * Math.pow((Om / l_m), -2.0))) - (2.0 * (l_m * (l_m / Om))))))));
} else {
tmp = Math.sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * Math.pow(l_m, 2.0)) / Om))))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if (n <= -8.2e-263) or not (n <= 1.08e-243): tmp = math.sqrt(((2.0 * n) * (U * (t + ((n * (U_42_ * math.pow((Om / l_m), -2.0))) - (2.0 * (l_m * (l_m / Om)))))))) else: tmp = math.sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * math.pow(l_m, 2.0)) / Om)))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if ((n <= -8.2e-263) || !(n <= 1.08e-243)) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(Float64(n * Float64(U_42_ * (Float64(Om / l_m) ^ -2.0))) - Float64(2.0 * Float64(l_m * Float64(l_m / Om)))))))); else tmp = sqrt(Float64(2.0 * Float64(Float64(U * Float64(n * t)) + Float64(-2.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) / Om)))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if ((n <= -8.2e-263) || ~((n <= 1.08e-243))) tmp = sqrt(((2.0 * n) * (U * (t + ((n * (U_42_ * ((Om / l_m) ^ -2.0))) - (2.0 * (l_m * (l_m / Om)))))))); else tmp = sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * (l_m ^ 2.0)) / Om)))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[Or[LessEqual[n, -8.2e-263], N[Not[LessEqual[n, 1.08e-243]], $MachinePrecision]], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(N[(n * N[(U$42$ * N[Power[N[(Om / l$95$m), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(2.0 * N[(l$95$m * N[(l$95$m / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(2.0 * N[(N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq -8.2 \cdot 10^{-263} \lor \neg \left(n \leq 1.08 \cdot 10^{-243}\right):\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(n \cdot \left(U* \cdot {\left(\frac{Om}{l\_m}\right)}^{-2}\right) - 2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right) + -2 \cdot \left(U \cdot \frac{n \cdot {l\_m}^{2}}{Om}\right)\right)}\\
\end{array}
\end{array}
if n < -8.1999999999999994e-263 or 1.08e-243 < n Initial program 49.1%
Simplified54.2%
Taylor expanded in U around 0 46.2%
mul-1-neg46.2%
associate-/l*47.2%
unpow247.2%
unpow247.2%
times-frac54.3%
unpow254.3%
Simplified54.3%
clear-num54.3%
inv-pow54.3%
Applied egg-rr54.3%
unpow-154.3%
Simplified54.3%
distribute-rgt-neg-out54.3%
fmm-undef54.3%
clear-num54.3%
clear-num54.3%
inv-pow54.3%
pow-pow54.3%
metadata-eval54.3%
Applied egg-rr54.3%
if -8.1999999999999994e-263 < n < 1.08e-243Initial program 48.7%
Simplified40.2%
Taylor expanded in Om around -inf 38.6%
+-commutative38.6%
mul-1-neg38.6%
unsub-neg38.6%
+-commutative38.6%
mul-1-neg38.6%
unsub-neg38.6%
associate-*r*38.6%
associate-/l*38.6%
associate-/l*38.5%
Simplified38.5%
Taylor expanded in l around 0 51.4%
Taylor expanded in n around 0 63.7%
associate-/l*64.5%
Simplified64.5%
Final simplification55.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (* n (* U* (pow (/ Om l_m) -2.0)))))
(if (<= n -2.05e-263)
(sqrt
(* (* 2.0 n) (* U (+ t (+ t_1 (* 2.0 (* l_m (/ -1.0 (/ Om l_m)))))))))
(if (<= n 7.2e-244)
(sqrt
(* 2.0 (+ (* U (* n t)) (* -2.0 (* U (/ (* n (pow l_m 2.0)) Om))))))
(sqrt (* (* 2.0 n) (* U (- t (- (* 2.0 (* l_m (/ l_m Om))) 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 = n * (U_42_ * pow((Om / l_m), -2.0));
double tmp;
if (n <= -2.05e-263) {
tmp = sqrt(((2.0 * n) * (U * (t + (t_1 + (2.0 * (l_m * (-1.0 / (Om / l_m)))))))));
} else if (n <= 7.2e-244) {
tmp = sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * pow(l_m, 2.0)) / Om))))));
} else {
tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * (l_m * (l_m / Om))) - 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 = n * (u_42 * ((om / l_m) ** (-2.0d0)))
if (n <= (-2.05d-263)) then
tmp = sqrt(((2.0d0 * n) * (u * (t + (t_1 + (2.0d0 * (l_m * ((-1.0d0) / (om / l_m)))))))))
else if (n <= 7.2d-244) then
tmp = sqrt((2.0d0 * ((u * (n * t)) + ((-2.0d0) * (u * ((n * (l_m ** 2.0d0)) / om))))))
else
tmp = sqrt(((2.0d0 * n) * (u * (t - ((2.0d0 * (l_m * (l_m / om))) - 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 = n * (U_42_ * Math.pow((Om / l_m), -2.0));
double tmp;
if (n <= -2.05e-263) {
tmp = Math.sqrt(((2.0 * n) * (U * (t + (t_1 + (2.0 * (l_m * (-1.0 / (Om / l_m)))))))));
} else if (n <= 7.2e-244) {
tmp = Math.sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * Math.pow(l_m, 2.0)) / Om))))));
} else {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((2.0 * (l_m * (l_m / Om))) - t_1)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): t_1 = n * (U_42_ * math.pow((Om / l_m), -2.0)) tmp = 0 if n <= -2.05e-263: tmp = math.sqrt(((2.0 * n) * (U * (t + (t_1 + (2.0 * (l_m * (-1.0 / (Om / l_m))))))))) elif n <= 7.2e-244: tmp = math.sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * math.pow(l_m, 2.0)) / Om)))))) else: tmp = math.sqrt(((2.0 * n) * (U * (t - ((2.0 * (l_m * (l_m / Om))) - t_1))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) t_1 = Float64(n * Float64(U_42_ * (Float64(Om / l_m) ^ -2.0))) tmp = 0.0 if (n <= -2.05e-263) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t + Float64(t_1 + Float64(2.0 * Float64(l_m * Float64(-1.0 / Float64(Om / l_m))))))))); elseif (n <= 7.2e-244) tmp = sqrt(Float64(2.0 * Float64(Float64(U * Float64(n * t)) + Float64(-2.0 * Float64(U * Float64(Float64(n * (l_m ^ 2.0)) / Om)))))); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(2.0 * Float64(l_m * Float64(l_m / Om))) - t_1))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) t_1 = n * (U_42_ * ((Om / l_m) ^ -2.0)); tmp = 0.0; if (n <= -2.05e-263) tmp = sqrt(((2.0 * n) * (U * (t + (t_1 + (2.0 * (l_m * (-1.0 / (Om / l_m))))))))); elseif (n <= 7.2e-244) tmp = sqrt((2.0 * ((U * (n * t)) + (-2.0 * (U * ((n * (l_m ^ 2.0)) / Om)))))); else tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * (l_m * (l_m / Om))) - 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[(n * N[(U$42$ * N[Power[N[(Om / l$95$m), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -2.05e-263], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * N[(t + N[(t$95$1 + N[(2.0 * N[(l$95$m * N[(-1.0 / N[(Om / l$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], If[LessEqual[n, 7.2e-244], N[Sqrt[N[(2.0 * N[(N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(U * N[(N[(n * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * 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]], $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := n \cdot \left(U* \cdot {\left(\frac{Om}{l\_m}\right)}^{-2}\right)\\
\mathbf{if}\;n \leq -2.05 \cdot 10^{-263}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t + \left(t\_1 + 2 \cdot \left(l\_m \cdot \frac{-1}{\frac{Om}{l\_m}}\right)\right)\right)\right)}\\
\mathbf{elif}\;n \leq 7.2 \cdot 10^{-244}:\\
\;\;\;\;\sqrt{2 \cdot \left(U \cdot \left(n \cdot t\right) + -2 \cdot \left(U \cdot \frac{n \cdot {l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \left(2 \cdot \left(l\_m \cdot \frac{l\_m}{Om}\right) - t\_1\right)\right)\right)}\\
\end{array}
\end{array}
if n < -2.0499999999999998e-263Initial program 48.9%
Simplified54.8%
Taylor expanded in U around 0 46.0%
mul-1-neg46.0%
associate-/l*46.0%
unpow246.0%
unpow246.0%
times-frac54.8%
unpow254.8%
Simplified54.8%
clear-num54.9%
inv-pow54.9%
Applied egg-rr54.9%
unpow-154.9%
Simplified54.9%
distribute-rgt-neg-out54.9%
fmm-undef54.9%
clear-num54.8%
clear-num54.8%
inv-pow54.8%
pow-pow54.8%
metadata-eval54.8%
Applied egg-rr54.8%
clear-num54.9%
inv-pow54.9%
Applied egg-rr54.9%
unpow-154.9%
Simplified54.9%
if -2.0499999999999998e-263 < n < 7.1999999999999995e-244Initial program 48.7%
Simplified40.2%
Taylor expanded in Om around -inf 38.6%
+-commutative38.6%
mul-1-neg38.6%
unsub-neg38.6%
+-commutative38.6%
mul-1-neg38.6%
unsub-neg38.6%
associate-*r*38.6%
associate-/l*38.6%
associate-/l*38.5%
Simplified38.5%
Taylor expanded in l around 0 51.4%
Taylor expanded in n around 0 63.7%
associate-/l*64.5%
Simplified64.5%
if 7.1999999999999995e-244 < n Initial program 49.5%
Simplified53.5%
Taylor expanded in U around 0 46.5%
mul-1-neg46.5%
associate-/l*48.9%
unpow248.9%
unpow248.9%
times-frac53.5%
unpow253.5%
Simplified53.5%
clear-num53.5%
inv-pow53.5%
Applied egg-rr53.5%
unpow-153.5%
Simplified53.5%
distribute-rgt-neg-out53.5%
fmm-undef53.5%
clear-num53.5%
clear-num53.5%
inv-pow53.5%
pow-pow53.6%
metadata-eval53.6%
Applied egg-rr53.6%
Final simplification55.7%
l_m = (fabs.f64 l)
(FPCore (n U t l_m Om U*)
:precision binary64
(let* ((t_1 (- t (/ (* 2.0 (pow l_m 2.0)) Om))))
(if (<= U -4.1e-5)
(sqrt (* (* 2.0 (* n U)) t_1))
(if (<= U -1.3e-58)
(* (sqrt (* U U*)) (* l_m (* n (/ (sqrt 2.0) (- 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 * pow(l_m, 2.0)) / Om);
double tmp;
if (U <= -4.1e-5) {
tmp = sqrt(((2.0 * (n * U)) * t_1));
} else if (U <= -1.3e-58) {
tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / -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 ** 2.0d0)) / om)
if (u <= (-4.1d-5)) then
tmp = sqrt(((2.0d0 * (n * u)) * t_1))
else if (u <= (-1.3d-58)) then
tmp = sqrt((u * u_42)) * (l_m * (n * (sqrt(2.0d0) / -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 * Math.pow(l_m, 2.0)) / Om);
double tmp;
if (U <= -4.1e-5) {
tmp = Math.sqrt(((2.0 * (n * U)) * t_1));
} else if (U <= -1.3e-58) {
tmp = Math.sqrt((U * U_42_)) * (l_m * (n * (Math.sqrt(2.0) / -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 * math.pow(l_m, 2.0)) / Om) tmp = 0 if U <= -4.1e-5: tmp = math.sqrt(((2.0 * (n * U)) * t_1)) elif U <= -1.3e-58: tmp = math.sqrt((U * U_42_)) * (l_m * (n * (math.sqrt(2.0) / -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(Float64(2.0 * (l_m ^ 2.0)) / Om)) tmp = 0.0 if (U <= -4.1e-5) tmp = sqrt(Float64(Float64(2.0 * Float64(n * U)) * t_1)); elseif (U <= -1.3e-58) tmp = Float64(sqrt(Float64(U * U_42_)) * Float64(l_m * Float64(n * Float64(sqrt(2.0) / Float64(-Om))))); else tmp = sqrt(Float64(Float64(2.0 * n) * Float64(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 ^ 2.0)) / Om); tmp = 0.0; if (U <= -4.1e-5) tmp = sqrt(((2.0 * (n * U)) * t_1)); elseif (U <= -1.3e-58) tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / -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[(N[(2.0 * N[Power[l$95$m, 2.0], $MachinePrecision]), $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[U, -4.1e-5], N[Sqrt[N[(N[(2.0 * N[(n * U), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision], If[LessEqual[U, -1.3e-58], N[(N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[(n * N[(N[Sqrt[2.0], $MachinePrecision] / (-Om)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
t_1 := t - \frac{2 \cdot {l\_m}^{2}}{Om}\\
\mathbf{if}\;U \leq -4.1 \cdot 10^{-5}:\\
\;\;\;\;\sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot t\_1}\\
\mathbf{elif}\;U \leq -1.3 \cdot 10^{-58}:\\
\;\;\;\;\sqrt{U \cdot U*} \cdot \left(l\_m \cdot \left(n \cdot \frac{\sqrt{2}}{-Om}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\_1\right)}\\
\end{array}
\end{array}
if U < -4.10000000000000005e-5Initial program 58.5%
Simplified58.6%
Taylor expanded in Om around inf 51.6%
associate-*r/51.6%
Simplified51.6%
if -4.10000000000000005e-5 < U < -1.30000000000000003e-58Initial program 26.2%
Simplified26.9%
Taylor expanded in Om around -inf 33.9%
+-commutative33.9%
mul-1-neg33.9%
unsub-neg33.9%
+-commutative33.9%
mul-1-neg33.9%
unsub-neg33.9%
associate-*r*33.9%
associate-/l*33.9%
associate-/l*33.9%
Simplified33.9%
Taylor expanded in U* around inf 40.4%
associate-*r*40.4%
Simplified40.4%
Taylor expanded in n around -inf 31.6%
mul-1-neg31.6%
*-commutative31.6%
associate-*r*31.7%
distribute-rgt-neg-in31.7%
*-commutative31.7%
associate-*r*31.6%
associate-*r/38.8%
associate-/l*38.9%
Simplified38.9%
if -1.30000000000000003e-58 < U Initial program 48.0%
Simplified53.9%
Taylor expanded in Om around inf 44.1%
metadata-eval44.1%
cancel-sign-sub-inv44.1%
associate-*r/44.1%
Simplified44.1%
Final simplification45.4%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 1.02e+194) (sqrt (* (* 2.0 n) (* U (- t (/ (* 2.0 (pow l_m 2.0)) Om))))) (* (sqrt (* U U*)) (* l_m (* n (/ (sqrt 2.0) (- Om)))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 1.02e+194) {
tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * pow(l_m, 2.0)) / Om)))));
} else {
tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / -Om)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 1.02d+194) then
tmp = sqrt(((2.0d0 * n) * (u * (t - ((2.0d0 * (l_m ** 2.0d0)) / om)))))
else
tmp = sqrt((u * u_42)) * (l_m * (n * (sqrt(2.0d0) / -om)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 1.02e+194) {
tmp = Math.sqrt(((2.0 * n) * (U * (t - ((2.0 * Math.pow(l_m, 2.0)) / Om)))));
} else {
tmp = Math.sqrt((U * U_42_)) * (l_m * (n * (Math.sqrt(2.0) / -Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 1.02e+194: tmp = math.sqrt(((2.0 * n) * (U * (t - ((2.0 * math.pow(l_m, 2.0)) / Om))))) else: tmp = math.sqrt((U * U_42_)) * (l_m * (n * (math.sqrt(2.0) / -Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 1.02e+194) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * Float64(t - Float64(Float64(2.0 * (l_m ^ 2.0)) / Om))))); else tmp = Float64(sqrt(Float64(U * U_42_)) * Float64(l_m * Float64(n * Float64(sqrt(2.0) / Float64(-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.02e+194) tmp = sqrt(((2.0 * n) * (U * (t - ((2.0 * (l_m ^ 2.0)) / Om))))); else tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / -Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 1.02e+194], 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], N[(N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[(n * N[(N[Sqrt[2.0], $MachinePrecision] / (-Om)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 1.02 \cdot 10^{+194}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(t - \frac{2 \cdot {l\_m}^{2}}{Om}\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot U*} \cdot \left(l\_m \cdot \left(n \cdot \frac{\sqrt{2}}{-Om}\right)\right)\\
\end{array}
\end{array}
if l < 1.02e194Initial program 52.9%
Simplified55.1%
Taylor expanded in Om around inf 45.5%
metadata-eval45.5%
cancel-sign-sub-inv45.5%
associate-*r/45.5%
Simplified45.5%
if 1.02e194 < l Initial program 6.3%
Simplified22.4%
Taylor expanded in Om around -inf 1.4%
+-commutative1.4%
mul-1-neg1.4%
unsub-neg1.4%
+-commutative1.4%
mul-1-neg1.4%
unsub-neg1.4%
associate-*r*1.4%
associate-/l*1.4%
associate-/l*1.2%
Simplified1.2%
Taylor expanded in U* around inf 11.5%
associate-*r*11.3%
Simplified11.3%
Taylor expanded in n around -inf 25.0%
mul-1-neg25.0%
*-commutative25.0%
associate-*r*25.2%
distribute-rgt-neg-in25.2%
*-commutative25.2%
associate-*r*25.0%
associate-*r/29.5%
associate-/l*29.6%
Simplified29.6%
Final simplification44.2%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 6.5e+41) (sqrt (fabs (* (* 2.0 n) (* U t)))) (* (sqrt (* U U*)) (* l_m (* n (/ (sqrt 2.0) (- Om)))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 6.5e+41) {
tmp = sqrt(fabs(((2.0 * n) * (U * t))));
} else {
tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / -Om)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 6.5d+41) then
tmp = sqrt(abs(((2.0d0 * n) * (u * t))))
else
tmp = sqrt((u * u_42)) * (l_m * (n * (sqrt(2.0d0) / -om)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 6.5e+41) {
tmp = Math.sqrt(Math.abs(((2.0 * n) * (U * t))));
} else {
tmp = Math.sqrt((U * U_42_)) * (l_m * (n * (Math.sqrt(2.0) / -Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 6.5e+41: tmp = math.sqrt(math.fabs(((2.0 * n) * (U * t)))) else: tmp = math.sqrt((U * U_42_)) * (l_m * (n * (math.sqrt(2.0) / -Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 6.5e+41) tmp = sqrt(abs(Float64(Float64(2.0 * n) * Float64(U * t)))); else tmp = Float64(sqrt(Float64(U * U_42_)) * Float64(l_m * Float64(n * Float64(sqrt(2.0) / Float64(-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 <= 6.5e+41) tmp = sqrt(abs(((2.0 * n) * (U * t)))); else tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / -Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 6.5e+41], N[Sqrt[N[Abs[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[(n * N[(N[Sqrt[2.0], $MachinePrecision] / (-Om)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 6.5 \cdot 10^{+41}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot U*} \cdot \left(l\_m \cdot \left(n \cdot \frac{\sqrt{2}}{-Om}\right)\right)\\
\end{array}
\end{array}
if l < 6.49999999999999975e41Initial program 53.6%
Simplified56.0%
Taylor expanded in t around inf 38.9%
add-sqr-sqrt38.9%
pow1/238.9%
pow1/239.4%
pow-prod-down28.1%
pow228.1%
Applied egg-rr28.1%
unpow1/228.1%
unpow228.1%
rem-sqrt-square39.9%
*-commutative39.9%
Simplified39.9%
if 6.49999999999999975e41 < l Initial program 29.9%
Simplified36.9%
Taylor expanded in Om around -inf 26.0%
+-commutative26.0%
mul-1-neg26.0%
unsub-neg26.0%
+-commutative26.0%
mul-1-neg26.0%
unsub-neg26.0%
associate-*r*26.0%
associate-/l*26.0%
associate-/l*29.9%
Simplified29.9%
Taylor expanded in U* around inf 22.5%
associate-*r*22.1%
Simplified22.1%
Taylor expanded in n around -inf 27.4%
mul-1-neg27.4%
*-commutative27.4%
associate-*r*27.5%
distribute-rgt-neg-in27.5%
*-commutative27.5%
associate-*r*27.4%
associate-*r/29.4%
associate-/l*29.5%
Simplified29.5%
Final simplification37.9%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= l_m 7e+97) (sqrt (fabs (* (* 2.0 n) (* U t)))) (* (sqrt (* U U*)) (* l_m (* n (/ (sqrt 2.0) Om))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 7e+97) {
tmp = sqrt(fabs(((2.0 * n) * (U * t))));
} else {
tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / Om)));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (l_m <= 7d+97) then
tmp = sqrt(abs(((2.0d0 * n) * (u * t))))
else
tmp = sqrt((u * u_42)) * (l_m * (n * (sqrt(2.0d0) / om)))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (l_m <= 7e+97) {
tmp = Math.sqrt(Math.abs(((2.0 * n) * (U * t))));
} else {
tmp = Math.sqrt((U * U_42_)) * (l_m * (n * (Math.sqrt(2.0) / Om)));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if l_m <= 7e+97: tmp = math.sqrt(math.fabs(((2.0 * n) * (U * t)))) else: tmp = math.sqrt((U * U_42_)) * (l_m * (n * (math.sqrt(2.0) / Om))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (l_m <= 7e+97) tmp = sqrt(abs(Float64(Float64(2.0 * n) * Float64(U * t)))); else tmp = Float64(sqrt(Float64(U * U_42_)) * Float64(l_m * Float64(n * Float64(sqrt(2.0) / Om)))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (l_m <= 7e+97) tmp = sqrt(abs(((2.0 * n) * (U * t)))); else tmp = sqrt((U * U_42_)) * (l_m * (n * (sqrt(2.0) / Om))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[l$95$m, 7e+97], N[Sqrt[N[Abs[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(U * U$42$), $MachinePrecision]], $MachinePrecision] * N[(l$95$m * N[(n * N[(N[Sqrt[2.0], $MachinePrecision] / Om), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;l\_m \leq 7 \cdot 10^{+97}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{U \cdot U*} \cdot \left(l\_m \cdot \left(n \cdot \frac{\sqrt{2}}{Om}\right)\right)\\
\end{array}
\end{array}
if l < 7.0000000000000001e97Initial program 52.4%
Simplified55.1%
Taylor expanded in t around inf 38.0%
add-sqr-sqrt38.0%
pow1/238.0%
pow1/238.4%
pow-prod-down27.3%
pow227.3%
Applied egg-rr27.3%
unpow1/227.3%
unpow227.3%
rem-sqrt-square39.0%
*-commutative39.0%
Simplified39.0%
if 7.0000000000000001e97 < l Initial program 30.1%
Simplified36.4%
Taylor expanded in U around 0 25.3%
mul-1-neg25.3%
associate-/l*25.3%
unpow225.3%
unpow225.3%
times-frac37.0%
unpow237.0%
Simplified37.0%
clear-num36.9%
inv-pow36.9%
Applied egg-rr36.9%
unpow-136.9%
Simplified36.9%
Taylor expanded in n around inf 11.9%
*-commutative11.9%
*-commutative11.9%
associate-*r/19.5%
associate-/l*19.5%
Simplified19.5%
Final simplification36.1%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= n 4.4e-308) (sqrt (fabs (* (* 2.0 n) (* U t)))) (* (sqrt (* 2.0 n)) (sqrt (* 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 (n <= 4.4e-308) {
tmp = sqrt(fabs(((2.0 * n) * (U * t))));
} else {
tmp = sqrt((2.0 * n)) * sqrt((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 (n <= 4.4d-308) then
tmp = sqrt(abs(((2.0d0 * n) * (u * t))))
else
tmp = sqrt((2.0d0 * n)) * sqrt((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 (n <= 4.4e-308) {
tmp = Math.sqrt(Math.abs(((2.0 * n) * (U * t))));
} else {
tmp = Math.sqrt((2.0 * n)) * Math.sqrt((U * t));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if n <= 4.4e-308: tmp = math.sqrt(math.fabs(((2.0 * n) * (U * t)))) else: tmp = math.sqrt((2.0 * n)) * math.sqrt((U * t)) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (n <= 4.4e-308) tmp = sqrt(abs(Float64(Float64(2.0 * n) * Float64(U * t)))); else tmp = Float64(sqrt(Float64(2.0 * n)) * sqrt(Float64(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 (n <= 4.4e-308) tmp = sqrt(abs(((2.0 * n) * (U * t)))); else tmp = sqrt((2.0 * n)) * sqrt((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[n, 4.4e-308], N[Sqrt[N[Abs[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[(N[Sqrt[N[(2.0 * n), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(U * t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;n \leq 4.4 \cdot 10^{-308}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t}\\
\end{array}
\end{array}
if n < 4.3999999999999999e-308Initial program 49.1%
Simplified53.8%
Taylor expanded in t around inf 35.0%
add-sqr-sqrt35.0%
pow1/235.0%
pow1/235.7%
pow-prod-down26.5%
pow226.5%
Applied egg-rr26.5%
unpow1/226.5%
unpow226.5%
rem-sqrt-square36.3%
*-commutative36.3%
Simplified36.3%
if 4.3999999999999999e-308 < n Initial program 49.0%
Simplified50.6%
Taylor expanded in t around inf 31.0%
pow1/231.9%
*-commutative31.9%
unpow-prod-down39.9%
pow1/239.0%
pow1/239.0%
Applied egg-rr39.0%
Final simplification37.5%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t -5.8e-226) (sqrt (fabs (* (* 2.0 n) (* U t)))) (sqrt (fabs (* 2.0 (* U (* n t)))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= -5.8e-226) {
tmp = sqrt(fabs(((2.0 * n) * (U * t))));
} else {
tmp = sqrt(fabs((2.0 * (U * (n * t)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (t <= (-5.8d-226)) then
tmp = sqrt(abs(((2.0d0 * n) * (u * t))))
else
tmp = sqrt(abs((2.0d0 * (u * (n * t)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= -5.8e-226) {
tmp = Math.sqrt(Math.abs(((2.0 * n) * (U * t))));
} else {
tmp = Math.sqrt(Math.abs((2.0 * (U * (n * t)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= -5.8e-226: tmp = math.sqrt(math.fabs(((2.0 * n) * (U * t)))) else: tmp = math.sqrt(math.fabs((2.0 * (U * (n * t))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= -5.8e-226) tmp = sqrt(abs(Float64(Float64(2.0 * n) * Float64(U * t)))); else tmp = sqrt(abs(Float64(2.0 * Float64(U * Float64(n * t))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (t <= -5.8e-226) tmp = sqrt(abs(((2.0 * n) * (U * t)))); else tmp = sqrt(abs((2.0 * (U * (n * t))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, -5.8e-226], N[Sqrt[N[Abs[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision], N[Sqrt[N[Abs[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq -5.8 \cdot 10^{-226}:\\
\;\;\;\;\sqrt{\left|\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right|}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right|}\\
\end{array}
\end{array}
if t < -5.80000000000000003e-226Initial program 45.9%
Simplified50.2%
Taylor expanded in t around inf 36.4%
add-sqr-sqrt36.4%
pow1/236.4%
pow1/237.3%
pow-prod-down24.2%
pow224.2%
Applied egg-rr24.2%
unpow1/224.2%
unpow224.2%
rem-sqrt-square37.8%
*-commutative37.8%
Simplified37.8%
if -5.80000000000000003e-226 < t Initial program 51.8%
Simplified54.2%
Taylor expanded in l around 0 34.0%
associate-*r*34.0%
Simplified34.0%
Taylor expanded in U around 0 34.0%
associate-*r*34.0%
associate-*r*30.5%
Simplified30.5%
pow130.5%
metadata-eval30.5%
pow-prod-up31.2%
pow-prod-down27.5%
pow227.5%
associate-*l*25.7%
associate-*l*25.7%
Applied egg-rr25.7%
unpow1/225.7%
unpow225.7%
rem-sqrt-square35.6%
Simplified35.6%
Final simplification36.6%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t -3.8e-224) (pow (* (* 2.0 n) (* U t)) 0.5) (sqrt (fabs (* 2.0 (* U (* n t)))))))
l_m = fabs(l);
double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= -3.8e-224) {
tmp = pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = sqrt(fabs((2.0 * (U * (n * t)))));
}
return tmp;
}
l_m = abs(l)
real(8) function code(n, u, t, l_m, om, u_42)
real(8), intent (in) :: n
real(8), intent (in) :: u
real(8), intent (in) :: t
real(8), intent (in) :: l_m
real(8), intent (in) :: om
real(8), intent (in) :: u_42
real(8) :: tmp
if (t <= (-3.8d-224)) then
tmp = ((2.0d0 * n) * (u * t)) ** 0.5d0
else
tmp = sqrt(abs((2.0d0 * (u * (n * t)))))
end if
code = tmp
end function
l_m = Math.abs(l);
public static double code(double n, double U, double t, double l_m, double Om, double U_42_) {
double tmp;
if (t <= -3.8e-224) {
tmp = Math.pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = Math.sqrt(Math.abs((2.0 * (U * (n * t)))));
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= -3.8e-224: tmp = math.pow(((2.0 * n) * (U * t)), 0.5) else: tmp = math.sqrt(math.fabs((2.0 * (U * (n * t))))) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= -3.8e-224) tmp = Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5; else tmp = sqrt(abs(Float64(2.0 * Float64(U * Float64(n * t))))); end return tmp end
l_m = abs(l); function tmp_2 = code(n, U, t, l_m, Om, U_42_) tmp = 0.0; if (t <= -3.8e-224) tmp = ((2.0 * n) * (U * t)) ^ 0.5; else tmp = sqrt(abs((2.0 * (U * (n * t))))); end tmp_2 = tmp; end
l_m = N[Abs[l], $MachinePrecision] code[n_, U_, t_, l$95$m_, Om_, U$42$_] := If[LessEqual[t, -3.8e-224], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Sqrt[N[Abs[N[(2.0 * N[(U * N[(n * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq -3.8 \cdot 10^{-224}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left|2 \cdot \left(U \cdot \left(n \cdot t\right)\right)\right|}\\
\end{array}
\end{array}
if t < -3.80000000000000002e-224Initial program 45.9%
Simplified50.2%
Taylor expanded in t around inf 36.4%
pow1/237.3%
Applied egg-rr37.3%
if -3.80000000000000002e-224 < t Initial program 51.8%
Simplified54.2%
Taylor expanded in l around 0 34.0%
associate-*r*34.0%
Simplified34.0%
Taylor expanded in U around 0 34.0%
associate-*r*34.0%
associate-*r*30.5%
Simplified30.5%
pow130.5%
metadata-eval30.5%
pow-prod-up31.2%
pow-prod-down27.5%
pow227.5%
associate-*l*25.7%
associate-*l*25.7%
Applied egg-rr25.7%
unpow1/225.7%
unpow225.7%
rem-sqrt-square35.6%
Simplified35.6%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t -9.5e-226) (pow (* (* 2.0 n) (* U t)) 0.5) (pow (* (* n t) (* 2.0 U)) 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 (t <= -9.5e-226) {
tmp = pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = pow(((n * t) * (2.0 * U)), 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 (t <= (-9.5d-226)) then
tmp = ((2.0d0 * n) * (u * t)) ** 0.5d0
else
tmp = ((n * t) * (2.0d0 * u)) ** 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 (t <= -9.5e-226) {
tmp = Math.pow(((2.0 * n) * (U * t)), 0.5);
} else {
tmp = Math.pow(((n * t) * (2.0 * U)), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if t <= -9.5e-226: tmp = math.pow(((2.0 * n) * (U * t)), 0.5) else: tmp = math.pow(((n * t) * (2.0 * U)), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (t <= -9.5e-226) tmp = Float64(Float64(2.0 * n) * Float64(U * t)) ^ 0.5; else tmp = Float64(Float64(n * t) * Float64(2.0 * U)) ^ 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 (t <= -9.5e-226) tmp = ((2.0 * n) * (U * t)) ^ 0.5; else tmp = ((n * t) * (2.0 * U)) ^ 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[t, -9.5e-226], N[Power[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision], N[Power[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;t \leq -9.5 \cdot 10^{-226}:\\
\;\;\;\;{\left(\left(2 \cdot n\right) \cdot \left(U \cdot t\right)\right)}^{0.5}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(n \cdot t\right) \cdot \left(2 \cdot U\right)\right)}^{0.5}\\
\end{array}
\end{array}
if t < -9.5000000000000007e-226Initial program 45.9%
Simplified50.2%
Taylor expanded in t around inf 36.4%
pow1/237.3%
Applied egg-rr37.3%
if -9.5000000000000007e-226 < t Initial program 51.8%
Simplified54.2%
Taylor expanded in l around 0 34.0%
associate-*r*34.0%
Simplified34.0%
pow1/234.8%
Applied egg-rr34.8%
Final simplification36.0%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= Om -1.15e-51) (sqrt (* (* 2.0 n) (* U t))) (pow (* (* n t) (* 2.0 U)) 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 (Om <= -1.15e-51) {
tmp = sqrt(((2.0 * n) * (U * t)));
} else {
tmp = pow(((n * t) * (2.0 * U)), 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 (om <= (-1.15d-51)) then
tmp = sqrt(((2.0d0 * n) * (u * t)))
else
tmp = ((n * t) * (2.0d0 * u)) ** 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 (Om <= -1.15e-51) {
tmp = Math.sqrt(((2.0 * n) * (U * t)));
} else {
tmp = Math.pow(((n * t) * (2.0 * U)), 0.5);
}
return tmp;
}
l_m = math.fabs(l) def code(n, U, t, l_m, Om, U_42_): tmp = 0 if Om <= -1.15e-51: tmp = math.sqrt(((2.0 * n) * (U * t))) else: tmp = math.pow(((n * t) * (2.0 * U)), 0.5) return tmp
l_m = abs(l) function code(n, U, t, l_m, Om, U_42_) tmp = 0.0 if (Om <= -1.15e-51) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); else tmp = Float64(Float64(n * t) * Float64(2.0 * U)) ^ 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 (Om <= -1.15e-51) tmp = sqrt(((2.0 * n) * (U * t))); else tmp = ((n * t) * (2.0 * U)) ^ 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[Om, -1.15e-51], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Power[N[(N[(n * t), $MachinePrecision] * N[(2.0 * U), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]]
\begin{array}{l}
l_m = \left|\ell\right|
\\
\begin{array}{l}
\mathbf{if}\;Om \leq -1.15 \cdot 10^{-51}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;{\left(\left(n \cdot t\right) \cdot \left(2 \cdot U\right)\right)}^{0.5}\\
\end{array}
\end{array}
if Om < -1.15000000000000001e-51Initial program 48.0%
Simplified57.3%
Taylor expanded in t around inf 40.6%
if -1.15000000000000001e-51 < Om Initial program 49.5%
Simplified50.5%
Taylor expanded in l around 0 32.8%
associate-*r*32.8%
Simplified32.8%
pow1/233.9%
Applied egg-rr33.9%
Final simplification35.8%
l_m = (fabs.f64 l) (FPCore (n U t l_m Om U*) :precision binary64 (if (<= t -3.2e-225) (sqrt (* (* 2.0 n) (* U t))) (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 (t <= -3.2e-225) {
tmp = sqrt(((2.0 * n) * (U * t)));
} 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 (t <= (-3.2d-225)) then
tmp = sqrt(((2.0d0 * n) * (u * t)))
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 (t <= -3.2e-225) {
tmp = Math.sqrt(((2.0 * n) * (U * t)));
} 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 t <= -3.2e-225: tmp = math.sqrt(((2.0 * n) * (U * t))) 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 (t <= -3.2e-225) tmp = sqrt(Float64(Float64(2.0 * n) * Float64(U * t))); 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 (t <= -3.2e-225) tmp = sqrt(((2.0 * n) * (U * t))); 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[t, -3.2e-225], N[Sqrt[N[(N[(2.0 * n), $MachinePrecision] * N[(U * t), $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}\;t \leq -3.2 \cdot 10^{-225}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot t\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(n \cdot t\right) \cdot \left(2 \cdot U\right)}\\
\end{array}
\end{array}
if t < -3.19999999999999975e-225Initial program 45.9%
Simplified50.2%
Taylor expanded in t around inf 36.4%
if -3.19999999999999975e-225 < t Initial program 51.8%
Simplified54.2%
Taylor expanded in l around 0 34.0%
associate-*r*34.0%
Simplified34.0%
Final simplification35.1%
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 49.1%
Simplified52.4%
Taylor expanded in l around 0 32.8%
associate-*r*32.8%
Simplified32.8%
Final simplification32.8%
herbie shell --seed 2024157
(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*))))))