Average Error: 0.2 → 0.2
Time: 3.8s
Precision: 64
\[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1\]
↓
\[\begin{array}{l} \mathbf{if}\;a \cdot a \le 9.38131907157761641 \cdot 10^{-111}:\\ \;\;\;\;\left(\left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right) + 4 \cdot \left(b \cdot b\right)\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left({a}^{4} + \left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right)\right) - 1\\ \end{array}\]
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
↓
\begin{array}{l}
\mathbf{if}\;a \cdot a \le 9.38131907157761641 \cdot 10^{-111}:\\
\;\;\;\;\left(\left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right) + 4 \cdot \left(b \cdot b\right)\right) - 1\\

\mathbf{else}:\\
\;\;\;\;\left({a}^{4} + \left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right)\right) - 1\\

\end{array}
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) {
	double VAR;
	if (((a * a) <= 9.381319071577616e-111)) {
		VAR = (((pow(b, 4.0) + (2.0 * (pow(a, 2.0) * pow(b, 2.0)))) + (4.0 * (b * b))) - 1.0);
	} else {
		VAR = ((pow(a, 4.0) + (pow(b, 4.0) + (2.0 * (pow(a, 2.0) * pow(b, 2.0))))) - 1.0);
	}
	return VAR;
}

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. Split input into 2 regimes

  2. if (* a a) < 9.381319071577616e-111

    1. Initial program 0.1

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

    2. Taylor expanded around 0 0.0

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

    if 9.381319071577616e-111 < (* a a)

    1. Initial program 0.3

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

    2. Taylor expanded around inf 0.5

      \[\leadsto \color{blue}{\left({a}^{4} + \left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right)\right)} - 1\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.2

    \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot a \le 9.38131907157761641 \cdot 10^{-111}:\\ \;\;\;\;\left(\left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right) + 4 \cdot \left(b \cdot b\right)\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left({a}^{4} + \left({b}^{4} + 2 \cdot \left({a}^{2} \cdot {b}^{2}\right)\right)\right) - 1\\ \end{array}\]

Reproduce

herbie shell --seed 2020091 
(FPCore (a b)
  :name "Bouland and Aaronson, Equation (26)"
  :precision binary64
  (- (+ (pow (+ (* a a) (* b b)) 2) (* 4 (* b b))) 1))