\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 2.065685912797435560702333178917541478473 \cdot 10^{-269}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right) - \left(\left(\sqrt[3]{n} \cdot \sqrt[3]{n}\right) \cdot \left(\sqrt[3]{n} \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right)\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\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 r184190 = 2.0;
double r184191 = n;
double r184192 = r184190 * r184191;
double r184193 = U;
double r184194 = r184192 * r184193;
double r184195 = t;
double r184196 = l;
double r184197 = r184196 * r184196;
double r184198 = Om;
double r184199 = r184197 / r184198;
double r184200 = r184190 * r184199;
double r184201 = r184195 - r184200;
double r184202 = r184196 / r184198;
double r184203 = pow(r184202, r184190);
double r184204 = r184191 * r184203;
double r184205 = U_;
double r184206 = r184193 - r184205;
double r184207 = r184204 * r184206;
double r184208 = r184201 - r184207;
double r184209 = r184194 * r184208;
double r184210 = sqrt(r184209);
return r184210;
}
double f(double n, double U, double t, double l, double Om, double U_) {
double r184211 = n;
double r184212 = 2.0656859127974356e-269;
bool r184213 = r184211 <= r184212;
double r184214 = 2.0;
double r184215 = r184214 * r184211;
double r184216 = U;
double r184217 = r184215 * r184216;
double r184218 = t;
double r184219 = l;
double r184220 = Om;
double r184221 = r184220 / r184219;
double r184222 = r184219 / r184221;
double r184223 = r184214 * r184222;
double r184224 = r184218 - r184223;
double r184225 = cbrt(r184211);
double r184226 = r184225 * r184225;
double r184227 = r184219 / r184220;
double r184228 = pow(r184227, r184214);
double r184229 = r184225 * r184228;
double r184230 = r184226 * r184229;
double r184231 = U_;
double r184232 = r184216 - r184231;
double r184233 = r184230 * r184232;
double r184234 = r184224 - r184233;
double r184235 = r184217 * r184234;
double r184236 = sqrt(r184235);
double r184237 = sqrt(r184215);
double r184238 = r184211 * r184228;
double r184239 = r184238 * r184232;
double r184240 = r184224 - r184239;
double r184241 = r184216 * r184240;
double r184242 = sqrt(r184241);
double r184243 = r184237 * r184242;
double r184244 = r184213 ? r184236 : r184243;
return r184244;
}



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 < 2.0656859127974356e-269Initial program 34.5
rmApplied associate-/l*31.6
rmApplied add-cube-cbrt31.6
Applied associate-*l*31.6
if 2.0656859127974356e-269 < n Initial program 32.9
rmApplied associate-/l*30.0
rmApplied associate-*l*30.5
rmApplied sqrt-prod23.8
Final simplification28.1
herbie shell --seed 2019209
(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*))))))