Average Error: 0.2 → 0.0
Time: 2.1s
Precision: binary64
\[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
↓
\[\left({\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + b \cdot \left(b \cdot 4\right)\right) + -1 \]
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
↓
\left({\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + b \cdot \left(b \cdot 4\right)\right) + -1

(FPCore (a b)
 :precision binary64
 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))
↓
(FPCore (a b)
 :precision binary64
 (+ (+ (pow (hypot a b) 4.0) (* b (* 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(hypot(a, b), 4.0) + (b * (b * 4.0))) + -1.0;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.2

    \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]

  2. Simplified0.0

    \[\leadsto \color{blue}{{\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + \mathsf{fma}\left(b, b \cdot 4, -1\right)} \]
  3. Using strategy rm

  4. Applied fma-udef_binary640.0

    \[\leadsto {\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + \color{blue}{\left(b \cdot \left(b \cdot 4\right) + -1\right)} \]

  5. Applied associate-+r+_binary640.0

    \[\leadsto \color{blue}{\left({\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + b \cdot \left(b \cdot 4\right)\right) + -1} \]

  6. Final simplification0.0

    \[\leadsto \left({\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + b \cdot \left(b \cdot 4\right)\right) + -1 \]

Reproduce

herbie shell --seed 2021211 
(FPCore (a b)
  :name "Bouland and Aaronson, Equation (26)"
  :precision binary64
  (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))