\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 -9.1367971033042653 \cdot 10^{-211}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(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)\right)}\\
\mathbf{elif}\;n \le 6.7925692535222373 \cdot 10^{-300}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - 0\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 <= -9.136797103304265e-211)) {
VAR = ((double) sqrt(((double) (((double) (2.0 * n)) * ((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_))))))))))));
} else {
double VAR_1;
if ((n <= 6.792569253522237e-300)) {
VAR_1 = ((double) sqrt(((double) (((double) (((double) (2.0 * n)) * U)) * ((double) (((double) (t - ((double) (2.0 * ((double) (l * ((double) (l / Om)))))))) - 0.0))))));
} else {
VAR_1 = ((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_))))))))))));
}
VAR = VAR_1;
}
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 < -9.1367971033042653e-211Initial program 32.5
rmApplied *-un-lft-identity32.5
Applied times-frac29.7
Simplified29.7
rmApplied associate-*l*30.2
if -9.1367971033042653e-211 < n < 6.7925692535222373e-300Initial program 40.2
rmApplied *-un-lft-identity40.2
Applied times-frac37.2
Simplified37.2
Taylor expanded around 0 37.3
if 6.7925692535222373e-300 < n Initial program 35.6
rmApplied *-un-lft-identity35.6
Applied times-frac33.2
Simplified33.2
rmApplied associate-*l*31.6
rmApplied sqrt-prod24.0
Final simplification28.0
herbie shell --seed 2020161
(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*))))))