\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.7319271970927851 \cdot 10^{-292}:\\
\;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \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)}\\
\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 <= 2.731927197092785e-292)) {
VAR = sqrt((((2.0 * n) * U) * ((t - (2.0 * (l / (Om / l)))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)))));
} else {
VAR = (sqrt((2.0 * n)) * sqrt((U * ((t - (2.0 * (l * (l / Om)))) - ((n * pow((l / Om), 2.0)) * (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 < 2.731927197092785e-292Initial program 34.8
rmApplied associate-/l*32.1
if 2.731927197092785e-292 < n Initial program 34.1
rmApplied *-un-lft-identity34.1
Applied times-frac30.9
Simplified30.9
rmApplied associate-*l*31.3
rmApplied sqrt-prod23.7
Final simplification28.0
herbie shell --seed 2020106
(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*))))))