\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)}\begin{array}{l}
\mathbf{if}\;n \le 4.84783032232548084 \cdot 10^{-283}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(\left(n \cdot {\left(\sqrt[3]{\frac{\ell}{Om}} \cdot \sqrt[3]{\frac{\ell}{Om}}\right)}^{2}\right) \cdot {\left(\sqrt[3]{\frac{\ell}{Om}}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\
\end{array}double f(double n, double U, double t, double l, double Om, double U_) {
double r227939 = 2.0;
double r227940 = n;
double r227941 = r227939 * r227940;
double r227942 = U;
double r227943 = r227941 * r227942;
double r227944 = t;
double r227945 = l;
double r227946 = r227945 * r227945;
double r227947 = Om;
double r227948 = r227946 / r227947;
double r227949 = r227939 * r227948;
double r227950 = r227944 - r227949;
double r227951 = r227945 / r227947;
double r227952 = pow(r227951, r227939);
double r227953 = r227940 * r227952;
double r227954 = U_;
double r227955 = r227942 - r227954;
double r227956 = r227953 * r227955;
double r227957 = r227950 - r227956;
double r227958 = r227943 * r227957;
double r227959 = sqrt(r227958);
return r227959;
}
double f(double n, double U, double t, double l, double Om, double U_) {
double r227960 = n;
double r227961 = 4.847830322325481e-283;
bool r227962 = r227960 <= r227961;
double r227963 = 2.0;
double r227964 = r227963 * r227960;
double r227965 = U;
double r227966 = r227964 * r227965;
double r227967 = t;
double r227968 = l;
double r227969 = Om;
double r227970 = r227968 / r227969;
double r227971 = r227968 * r227970;
double r227972 = r227963 * r227971;
double r227973 = r227967 - r227972;
double r227974 = cbrt(r227970);
double r227975 = r227974 * r227974;
double r227976 = pow(r227975, r227963);
double r227977 = r227960 * r227976;
double r227978 = pow(r227974, r227963);
double r227979 = r227977 * r227978;
double r227980 = U_;
double r227981 = r227965 - r227980;
double r227982 = r227979 * r227981;
double r227983 = r227973 - r227982;
double r227984 = r227966 * r227983;
double r227985 = sqrt(r227984);
double r227986 = sqrt(r227964);
double r227987 = pow(r227970, r227963);
double r227988 = r227960 * r227987;
double r227989 = r227988 * r227981;
double r227990 = r227973 - r227989;
double r227991 = r227965 * r227990;
double r227992 = sqrt(r227991);
double r227993 = r227986 * r227992;
double r227994 = r227962 ? r227985 : r227993;
return r227994;
}



Bits error versus n



Bits error versus U



Bits error versus t



Bits error versus l



Bits error versus Om



Bits error versus U*
Results
if n < 4.847830322325481e-283Initial program 34.5
rmApplied *-un-lft-identity34.5
Applied times-frac32.0
Simplified32.0
rmApplied add-cube-cbrt32.1
Applied unpow-prod-down32.1
Applied associate-*r*31.3
if 4.847830322325481e-283 < n Initial program 33.7
rmApplied *-un-lft-identity33.7
Applied times-frac30.8
Simplified30.8
rmApplied associate-*l*31.2
rmApplied sqrt-prod24.3
Final simplification28.0
herbie shell --seed 2020065 +o rules:numerics
(FPCore (n U t l Om U*)
:name "Toniolo and Linder, Equation (13)"
:precision binary64
(sqrt (* (* (* 2 n) U) (- (- t (* 2 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2)) (- U U*))))))