\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.265664142565084 \cdot 10^{-310}:\\
\;\;\;\;\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(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)}\right) \cdot {\left(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)}\right) \cdot \left(U - U*\right)\right)}\\
\mathbf{elif}\;n \le 2.63701364272177806 \cdot 10^{-187}:\\
\;\;\;\;\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)}\\
\mathbf{elif}\;n \le 5.201006272295963 \cdot 10^{-135}:\\
\;\;\;\;\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 sqrt((((2.0 * n) * U) * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
}
double code(double n, double U, double t, double l, double Om, double U_42_) {
double VAR;
if ((n <= -4.2656641425651e-310)) {
VAR = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) - (((n * pow((l / Om), (2.0 / 2.0))) * pow((l / Om), (2.0 / 2.0))) * (U - U_42_)))));
} else {
double VAR_1;
if ((n <= 2.637013642721778e-187)) {
VAR_1 = (sqrt((2.0 * n)) * sqrt((U * ((t - (2.0 * (l * (l / Om)))) - ((n * pow((l / Om), 2.0)) * (U - U_42_))))));
} else {
double VAR_2;
if ((n <= 5.2010062722959627e-135)) {
VAR_2 = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l * (l / Om)))) - 0.0)));
} else {
VAR_2 = (sqrt((2.0 * n)) * sqrt((U * ((t - (2.0 * (l * (l / Om)))) - ((n * pow((l / Om), 2.0)) * (U - U_42_))))));
}
VAR_1 = VAR_2;
}
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 < -4.2656641425651e-310Initial program 34.5
rmApplied *-un-lft-identity34.5
Applied times-frac31.8
Simplified31.8
rmApplied sqr-pow31.8
Applied associate-*r*30.9
if -4.2656641425651e-310 < n < 2.637013642721778e-187 or 5.2010062722959627e-135 < n Initial program 34.6
rmApplied *-un-lft-identity34.6
Applied times-frac32.1
Simplified32.1
rmApplied associate-*l*33.0
rmApplied sqrt-prod25.3
if 2.637013642721778e-187 < n < 5.2010062722959627e-135Initial program 34.2
rmApplied *-un-lft-identity34.2
Applied times-frac32.2
Simplified32.2
Taylor expanded around 0 34.1
Final simplification28.5
herbie shell --seed 2020092
(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*))))))