\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 3.267507094638271513092036819515301596094 \cdot 10^{-308}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(U \cdot \left(\left(t - 2 \cdot \left(\ell \cdot \frac{\ell}{Om}\right)\right) - \left(\left({\left(\frac{\ell}{Om}\right)}^{\left(\frac{2}{2}\right)} \cdot n\right) \cdot {\left(\frac{\ell}{Om}\right)}^{\left(\frac{2 \cdot \frac{2}{2}}{2}\right)}\right) \cdot \left(U - U*\right)\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)}^{\left(2 \cdot \frac{2}{2}\right)}\right) \cdot \left(U - U*\right)\right)}\\
\end{array}double f(double n, double U, double t, double l, double Om, double U_) {
double r200206 = 2.0;
double r200207 = n;
double r200208 = r200206 * r200207;
double r200209 = U;
double r200210 = r200208 * r200209;
double r200211 = t;
double r200212 = l;
double r200213 = r200212 * r200212;
double r200214 = Om;
double r200215 = r200213 / r200214;
double r200216 = r200206 * r200215;
double r200217 = r200211 - r200216;
double r200218 = r200212 / r200214;
double r200219 = pow(r200218, r200206);
double r200220 = r200207 * r200219;
double r200221 = U_;
double r200222 = r200209 - r200221;
double r200223 = r200220 * r200222;
double r200224 = r200217 - r200223;
double r200225 = r200210 * r200224;
double r200226 = sqrt(r200225);
return r200226;
}
double f(double n, double U, double t, double l, double Om, double U_) {
double r200227 = n;
double r200228 = 3.2675070946382715e-308;
bool r200229 = r200227 <= r200228;
double r200230 = 2.0;
double r200231 = r200230 * r200227;
double r200232 = U;
double r200233 = t;
double r200234 = l;
double r200235 = Om;
double r200236 = r200234 / r200235;
double r200237 = r200234 * r200236;
double r200238 = r200230 * r200237;
double r200239 = r200233 - r200238;
double r200240 = 2.0;
double r200241 = r200230 / r200240;
double r200242 = pow(r200236, r200241);
double r200243 = r200242 * r200227;
double r200244 = r200240 * r200241;
double r200245 = r200244 / r200240;
double r200246 = pow(r200236, r200245);
double r200247 = r200243 * r200246;
double r200248 = U_;
double r200249 = r200232 - r200248;
double r200250 = r200247 * r200249;
double r200251 = r200239 - r200250;
double r200252 = r200232 * r200251;
double r200253 = r200231 * r200252;
double r200254 = sqrt(r200253);
double r200255 = sqrt(r200231);
double r200256 = pow(r200236, r200244);
double r200257 = r200227 * r200256;
double r200258 = r200257 * r200249;
double r200259 = r200239 - r200258;
double r200260 = r200232 * r200259;
double r200261 = sqrt(r200260);
double r200262 = r200255 * r200261;
double r200263 = r200229 ? r200254 : r200262;
return r200263;
}



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 < 3.2675070946382715e-308Initial program 35.0
rmApplied *-un-lft-identity35.0
Applied times-frac32.2
Simplified32.2
rmApplied sqr-pow32.2
Applied associate-*r*31.5
rmApplied associate-*l*30.9
Simplified31.8
rmApplied sqr-pow31.8
Applied associate-*r*30.9
Simplified30.9
if 3.2675070946382715e-308 < n Initial program 34.8
rmApplied *-un-lft-identity34.8
Applied times-frac31.8
Simplified31.8
rmApplied sqr-pow31.8
Applied associate-*r*31.0
rmApplied associate-*l*31.1
Simplified32.1
rmApplied sqrt-prod24.7
Final simplification27.8
herbie shell --seed 2019323
(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*))))))