\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(1 - 3 \cdot a\right)\right)\right) - 1
\left(\mathsf{fma}\left(4, \mathsf{fma}\left(a, a, {a}^{3}\right), \mathsf{fma}\left(4, b \cdot b, {b}^{4}\right) + a \cdot \left(\left(b \cdot b\right) \cdot \mathsf{fma}\left(2, a, -12\right)\right)\right) + {a}^{4}\right) + -1
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a)))))) 1.0))
(FPCore (a b)
:precision binary64
(+
(+
(fma
4.0
(fma a a (pow a 3.0))
(+ (fma 4.0 (* b b) (pow b 4.0)) (* a (* (* b b) (fma 2.0 a -12.0)))))
(pow a 4.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) * (1.0 - (3.0 * a)))))) - 1.0;
}
double code(double a, double b) {
return (fma(4.0, fma(a, a, pow(a, 3.0)), (fma(4.0, (b * b), pow(b, 4.0)) + (a * ((b * b) * fma(2.0, a, -12.0))))) + pow(a, 4.0)) + -1.0;
}



Bits error versus a



Bits error versus b
Initial program 0.2
Simplified0.0
Taylor expanded in b around 0 0.0
Simplified0.1
Applied distribute-rgt-in_binary640.1
Simplified0.0
Simplified0.0
Final simplification0.0
herbie shell --seed 2021313
(FPCore (a b)
:name "Bouland and Aaronson, Equation (25)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a)))))) 1.0))