\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 -6.92067589096601 \cdot 10^{-311}:\\
\;\;\;\;\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 code(double n, double U, double t, double l, double Om, double U_42_) {
return ((double) sqrt(((double) (((double) (((double) (2.0 * n)) * U)) * ((double) (((double) (t - ((double) (2.0 * ((double) (((double) (l * l)) / Om)))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))));
}
double code(double n, double U, double t, double l, double Om, double U_42_) {
double VAR;
if ((n <= -6.920675890966e-311)) {
VAR = ((double) sqrt(((double) (((double) (((double) (2.0 * n)) * U)) * ((double) (((double) (t - ((double) (2.0 * ((double) (l * ((double) (l / Om)))))))) - ((double) (((double) (((double) (n * ((double) pow(((double) (((double) cbrt(((double) (l / Om)))) * ((double) cbrt(((double) (l / Om)))))), 2.0)))) * ((double) pow(((double) cbrt(((double) (l / Om)))), 2.0)))) * ((double) (U - U_42_))))))))));
} else {
VAR = ((double) (((double) sqrt(((double) (2.0 * n)))) * ((double) sqrt(((double) (U * ((double) (((double) (t - ((double) (2.0 * ((double) (l * ((double) (l / Om)))))))) - ((double) (((double) (n * ((double) pow(((double) (l / Om)), 2.0)))) * ((double) (U - U_42_))))))))))));
}
return VAR;
}



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 < -6.920675890966e-311Initial program 34.2
rmApplied *-un-lft-identity34.2
Applied times-frac31.4
Simplified31.4
rmApplied add-cube-cbrt31.4
Applied unpow-prod-down31.4
Applied associate-*r*30.7
if -6.920675890966e-311 < n Initial program 34.8
rmApplied *-un-lft-identity34.8
Applied times-frac32.0
Simplified32.0
rmApplied associate-*l*32.2
rmApplied sqrt-prod24.5
Final simplification27.6
herbie shell --seed 2020120
(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*))))))