\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1
\begin{array}{l}
t_0 := \sqrt[3]{\left(b \cdot b\right) \cdot \left(a + 3\right)}\\
{\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + \mathsf{fma}\left(4, \mathsf{fma}\left(a \cdot a, 1 - a, t_0 \cdot \left(t_0 \cdot t_0\right)\right), -1\right)
\end{array}
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))
(FPCore (a b)
:precision binary64
(let* ((t_0 (cbrt (* (* b b) (+ a 3.0)))))
(+
(pow (hypot a b) 4.0)
(fma 4.0 (fma (* a a) (- 1.0 a) (* t_0 (* t_0 t_0))) -1.0))))double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
double code(double a, double b) {
double t_0 = cbrt((b * b) * (a + 3.0));
return pow(hypot(a, b), 4.0) + fma(4.0, fma((a * a), (1.0 - a), (t_0 * (t_0 * t_0))), -1.0);
}



Bits error versus a



Bits error versus b
Initial program 0.2
Simplified0.0
Applied add-cube-cbrt_binary640.0
Final simplification0.0
herbie shell --seed 2021273
(FPCore (a b)
:name "Bouland and Aaronson, Equation (24)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))