\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 \leq -4.0315242138187124 \cdot 10^{-213}:\\
\;\;\;\;\sqrt{\left(n \cdot 2\right) \cdot \left(U \cdot \mathsf{fma}\left(\frac{\ell}{Om}, \mathsf{fma}\left(\ell, -2, \left(U* - U\right) \cdot \frac{n}{\frac{Om}{\ell}}\right), t\right)\right)}\\
\mathbf{elif}\;n \leq -7.64843520413069 \cdot 10^{-276}:\\
\;\;\;\;\begin{array}{l}
t_1 := \sqrt{\left(2 \cdot \left(n \cdot U\right)\right) \cdot \mathsf{fma}\left(\frac{\ell}{Om}, \mathsf{fma}\left(\ell, -2, \left(U* - U\right) \cdot \frac{n \cdot \ell}{Om}\right), t\right)}\\
\sqrt{t_1 \cdot t_1}
\end{array}\\
\mathbf{elif}\;n \leq 3.0021606985224718 \cdot 10^{-307}:\\
\;\;\;\;\sqrt{n \cdot \mathsf{fma}\left(2, U \cdot t, -4 \cdot \frac{U \cdot \left(\ell \cdot \ell\right)}{Om}\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{n \cdot 2} \cdot \sqrt{U \cdot \mathsf{fma}\left(\frac{\ell}{Om}, \mathsf{fma}\left(\ell, -2, \left(U* - U\right) \cdot \left(n \cdot \frac{\ell}{Om}\right)\right), t\right)}\\
\end{array}
(FPCore (n U t l Om U*) :precision binary64 (sqrt (* (* (* 2.0 n) U) (- (- t (* 2.0 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2.0)) (- U U*))))))
(FPCore (n U t l Om U*)
:precision binary64
(if (<= n -4.0315242138187124e-213)
(sqrt
(*
(* n 2.0)
(* U (fma (/ l Om) (fma l -2.0 (* (- U* U) (/ n (/ Om l)))) t))))
(if (<= n -7.64843520413069e-276)
(let* ((t_1
(sqrt
(*
(* 2.0 (* n U))
(fma (/ l Om) (fma l -2.0 (* (- U* U) (/ (* n l) Om))) t)))))
(sqrt (* t_1 t_1)))
(if (<= n 3.0021606985224718e-307)
(sqrt (* n (fma 2.0 (* U t) (* -4.0 (/ (* U (* l l)) Om)))))
(*
(sqrt (* n 2.0))
(sqrt
(* U (fma (/ l Om) (fma l -2.0 (* (- U* U) (* n (/ l Om)))) t))))))))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 tmp;
if (n <= -4.0315242138187124e-213) {
tmp = sqrt((n * 2.0) * (U * fma((l / Om), fma(l, -2.0, ((U_42_ - U) * (n / (Om / l)))), t)));
} else if (n <= -7.64843520413069e-276) {
double t_1 = sqrt((2.0 * (n * U)) * fma((l / Om), fma(l, -2.0, ((U_42_ - U) * ((n * l) / Om))), t));
tmp = sqrt(t_1 * t_1);
} else if (n <= 3.0021606985224718e-307) {
tmp = sqrt(n * fma(2.0, (U * t), (-4.0 * ((U * (l * l)) / Om))));
} else {
tmp = sqrt(n * 2.0) * sqrt(U * fma((l / Om), fma(l, -2.0, ((U_42_ - U) * (n * (l / Om)))), t));
}
return tmp;
}



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 n < -4.03152421381871241e-213Initial program 33.2
Simplified29.2
Applied associate-*l*_binary6429.3
Simplified30.5
Applied associate-/l*_binary6429.3
if -4.03152421381871241e-213 < n < -7.64843520413069028e-276Initial program 39.1
Simplified35.1
Applied add-sqr-sqrt_binary6435.1
Simplified35.6
Simplified35.6
if -7.64843520413069028e-276 < n < 3.0021606985224718e-307Initial program 41.6
Simplified36.9
Taylor expanded in n around 0 43.9
Simplified43.9
if 3.0021606985224718e-307 < n Initial program 34.8
Simplified30.6
Applied associate-*l*_binary6430.2
Applied sqrt-prod_binary6422.7
Simplified22.7
Simplified22.7
Final simplification26.9
herbie shell --seed 2022088
(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*))))))