\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}\;U \le -5.2001883542953 \cdot 10^{-311}:\\
\;\;\;\;\sqrt{\left(2 \cdot U\right) \cdot \left(n \cdot \left(t - \mathsf{fma}\left(\left(\frac{\ell}{Om}\right), \left(2 \cdot \ell\right), \left(\left(n \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right) \cdot \left(U - U*\right)\right)\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{2 \cdot U} \cdot \sqrt{n \cdot \left(t - \mathsf{fma}\left(\left(\frac{\ell}{Om}\right), \left(2 \cdot \ell\right), \left(\left(n \cdot \left(\frac{\ell}{Om} \cdot \frac{\ell}{Om}\right)\right) \cdot \left(U - U*\right)\right)\right)\right)}\\
\end{array}double f(double n, double U, double t, double l, double Om, double U_) {
double r1864070 = 2.0;
double r1864071 = n;
double r1864072 = r1864070 * r1864071;
double r1864073 = U;
double r1864074 = r1864072 * r1864073;
double r1864075 = t;
double r1864076 = l;
double r1864077 = r1864076 * r1864076;
double r1864078 = Om;
double r1864079 = r1864077 / r1864078;
double r1864080 = r1864070 * r1864079;
double r1864081 = r1864075 - r1864080;
double r1864082 = r1864076 / r1864078;
double r1864083 = pow(r1864082, r1864070);
double r1864084 = r1864071 * r1864083;
double r1864085 = U_;
double r1864086 = r1864073 - r1864085;
double r1864087 = r1864084 * r1864086;
double r1864088 = r1864081 - r1864087;
double r1864089 = r1864074 * r1864088;
double r1864090 = sqrt(r1864089);
return r1864090;
}
double f(double n, double U, double t, double l, double Om, double U_) {
double r1864091 = U;
double r1864092 = -5.2001883542953e-311;
bool r1864093 = r1864091 <= r1864092;
double r1864094 = 2.0;
double r1864095 = r1864094 * r1864091;
double r1864096 = n;
double r1864097 = t;
double r1864098 = l;
double r1864099 = Om;
double r1864100 = r1864098 / r1864099;
double r1864101 = r1864094 * r1864098;
double r1864102 = r1864100 * r1864100;
double r1864103 = r1864096 * r1864102;
double r1864104 = U_;
double r1864105 = r1864091 - r1864104;
double r1864106 = r1864103 * r1864105;
double r1864107 = fma(r1864100, r1864101, r1864106);
double r1864108 = r1864097 - r1864107;
double r1864109 = r1864096 * r1864108;
double r1864110 = r1864095 * r1864109;
double r1864111 = sqrt(r1864110);
double r1864112 = sqrt(r1864095);
double r1864113 = sqrt(r1864109);
double r1864114 = r1864112 * r1864113;
double r1864115 = r1864093 ? r1864111 : r1864114;
return r1864115;
}



Bits error versus n



Bits error versus U



Bits error versus t



Bits error versus l



Bits error versus Om



Bits error versus U*
if U < -5.2001883542953e-311Initial program 34.4
Simplified31.7
Taylor expanded around inf 37.2
Simplified31.7
if -5.2001883542953e-311 < U Initial program 33.0
Simplified30.0
rmApplied sqrt-prod23.6
Final simplification27.6
herbie shell --seed 2019133 +o rules:numerics
(FPCore (n U t l Om U*)
:name "Toniolo and Linder, Equation (13)"
(sqrt (* (* (* 2 n) U) (- (- t (* 2 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2)) (- U U*))))))