\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}
t_1 := \left(2 \cdot n\right) \cdot U\\
t_2 := t_1 \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)\\
t_3 := \mathsf{fma}\left(\ell, -2, \left(U* - U\right) \cdot \left(n \cdot \frac{\ell}{Om}\right)\right)\\
t_4 := \mathsf{fma}\left(\frac{\ell}{Om}, t_3, t\right)\\
\mathbf{if}\;t_2 \leq 2.3058447090224744 \cdot 10^{-263}:\\
\;\;\;\;\sqrt{2 \cdot n} \cdot \sqrt{U \cdot t_4}\\
\mathbf{elif}\;t_2 \leq \infty:\\
\;\;\;\;\sqrt{t_1 \cdot \left(t + \frac{\ell}{Om} \cdot t_3\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot \left(\left(\sqrt[3]{U} \cdot \sqrt[3]{U}\right) \cdot \left(t_4 \cdot \sqrt[3]{U}\right)\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
(let* ((t_1 (* (* 2.0 n) U))
(t_2
(*
t_1
(-
(- t (* 2.0 (/ (* l l) Om)))
(* (* n (pow (/ l Om) 2.0)) (- U U*)))))
(t_3 (fma l -2.0 (* (- U* U) (* n (/ l Om)))))
(t_4 (fma (/ l Om) t_3 t)))
(if (<= t_2 2.3058447090224744e-263)
(* (sqrt (* 2.0 n)) (sqrt (* U t_4)))
(if (<= t_2 INFINITY)
(sqrt (* t_1 (+ t (* (/ l Om) t_3))))
(sqrt (* (* 2.0 n) (* (* (cbrt U) (cbrt U)) (* t_4 (cbrt U)))))))))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 t_1 = (2.0 * n) * U;
double t_2 = t_1 * ((t - (2.0 * ((l * l) / Om))) - ((n * pow((l / Om), 2.0)) * (U - U_42_)));
double t_3 = fma(l, -2.0, ((U_42_ - U) * (n * (l / Om))));
double t_4 = fma((l / Om), t_3, t);
double tmp;
if (t_2 <= 2.3058447090224744e-263) {
tmp = sqrt(2.0 * n) * sqrt(U * t_4);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(t_1 * (t + ((l / Om) * t_3)));
} else {
tmp = sqrt((2.0 * n) * ((cbrt(U) * cbrt(U)) * (t_4 * cbrt(U))));
}
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 (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < 2.3058447090224744e-263Initial program 51.3
Simplified46.1
Applied associate-*l*_binary6434.3
Applied sqrt-prod_binary6439.7
Simplified39.7
Simplified39.7
if 2.3058447090224744e-263 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) < +inf.0Initial program 20.7
Simplified17.4
Applied *-commutative_binary6417.4
if +inf.0 < (*.f64 (*.f64 (*.f64 2 n) U) (-.f64 (-.f64 t (*.f64 2 (/.f64 (*.f64 l l) Om))) (*.f64 (*.f64 n (pow.f64 (/.f64 l Om) 2)) (-.f64 U U*)))) Initial program 64.0
Simplified43.9
Applied associate-*l*_binary6437.7
Applied add-cube-cbrt_binary6437.7
Applied associate-*l*_binary6437.7
Simplified37.7
Final simplification24.1
herbie shell --seed 2022067
(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*))))))