(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))
(FPCore (a b) :precision binary64 (- (+ (pow a 4.0) (+ (* 2.0 (* (pow a 2.0) (pow b 2.0))) (fma 4.0 (* b b) (pow b 4.0)))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
double code(double a, double b) {
return (pow(a, 4.0) + ((2.0 * (pow(a, 2.0) * pow(b, 2.0))) + fma(4.0, (b * b), pow(b, 4.0)))) - 1.0;
}
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0) end
function code(a, b) return Float64(Float64((a ^ 4.0) + Float64(Float64(2.0 * Float64((a ^ 2.0) * (b ^ 2.0))) + fma(4.0, Float64(b * b), (b ^ 4.0)))) - 1.0) end
code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
code[a_, b_] := N[(N[(N[Power[a, 4.0], $MachinePrecision] + N[(N[(2.0 * N[(N[Power[a, 2.0], $MachinePrecision] * N[Power[b, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision] + N[Power[b, 4.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
\left({a}^{4} + \left(2 \cdot \left({a}^{2} \cdot {b}^{2}\right) + \mathsf{fma}\left(4, b \cdot b, {b}^{4}\right)\right)\right) - 1



Bits error versus a



Bits error versus b
Initial program 0.2
Simplified0.0
Taylor expanded in a around 0 0.0
Applied add-cbrt-cube_binary648.4
Simplified8.4
Taylor expanded in b around 0 0.0
Simplified0.0
Final simplification0.0
herbie shell --seed 2022131
(FPCore (a b)
:name "Bouland and Aaronson, Equation (26)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))