Bouland and Aaronson, Equation (26)

Percentage Accurate: 99.9% → 100.0%

Time: 5.4s

Alternatives: 9

Speedup: 1.0×

• 59.8% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) - 1.0d0
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 1.0;
end

Wolfram

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]

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) - 1.0d0
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 1.0;
end

Wolfram

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]

Alternative 1: 100.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ {\left(\mathsf{hypot}\left(a, b\right)\right)}^{4} + \mathsf{fma}\left(b, b \cdot 4, -1\right) \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (+ (pow (hypot a b) 4.0) (fma b (* b 4.0) -1.0)))

C

double code(double a, double b) {
	return pow(hypot(a, b), 4.0) + fma(b, (b * 4.0), -1.0);
}

Julia

function code(a, b)
	return Float64((hypot(a, b) ^ 4.0) + fma(b, Float64(b * 4.0), -1.0))
end

Wolfram

code[a_, b_] := N[(N[Power[N[Sqrt[a ^ 2 + b ^ 2], $MachinePrecision], 4.0], $MachinePrecision] + N[(b * N[(b * 4.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
2. Step-by-step derivation

   1. associate--l+ 99.8%

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

   2. unpow2 99.8%

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

   3. unpow1 99.8%

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

   4. sqr-pow 99.8%

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

   5. associate-*r* 99.9%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 97.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 2e+35)
   (+ (+ (* 4.0 (* b b)) (* b (pow b 3.0))) -1.0)
   (+ (+ (pow a 4.0) (* b (* 2.0 (* b (* a a))))) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 2e+35) {
		tmp = ((4.0 * (b * b)) + (b * pow(b, 3.0))) + -1.0;
	} else {
		tmp = (pow(a, 4.0) + (b * (2.0 * (b * (a * a))))) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((a * a) <= 2d+35) then
        tmp = ((4.0d0 * (b * b)) + (b * (b ** 3.0d0))) + (-1.0d0)
    else
        tmp = ((a ** 4.0d0) + (b * (2.0d0 * (b * (a * a))))) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((a * a) <= 2e+35) {
		tmp = ((4.0 * (b * b)) + (b * Math.pow(b, 3.0))) + -1.0;
	} else {
		tmp = (Math.pow(a, 4.0) + (b * (2.0 * (b * (a * a))))) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (a * a) <= 2e+35:
		tmp = ((4.0 * (b * b)) + (b * math.pow(b, 3.0))) + -1.0
	else:
		tmp = (math.pow(a, 4.0) + (b * (2.0 * (b * (a * a))))) + -1.0
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 2e+35)
		tmp = Float64(Float64(Float64(4.0 * Float64(b * b)) + Float64(b * (b ^ 3.0))) + -1.0);
	else
		tmp = Float64(Float64((a ^ 4.0) + Float64(b * Float64(2.0 * Float64(b * Float64(a * a))))) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((a * a) <= 2e+35)
		tmp = ((4.0 * (b * b)) + (b * (b ^ 3.0))) + -1.0;
	else
		tmp = ((a ^ 4.0) + (b * (2.0 * (b * (a * a))))) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 2e+35], N[(N[(N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[(b * N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[Power[a, 4.0], $MachinePrecision] + N[(b * N[(2.0 * N[(b * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 1.9999999999999999e35

   1. Initial program 99.8%

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

   2. Taylor expanded in a around 0 98.9%

      \[\leadsto \left({\color{blue}{\left({b}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 98.9%

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

   4. Simplified 98.9%

      \[\leadsto \left({\color{blue}{\left(b \cdot b\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 98.9%

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

      2. associate-*r* 99.0%

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

      3. pow3 99.0%

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

   6. Applied egg-rr 99.0%

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

   if 1.9999999999999999e35 < (*.f64 a a)

   1. Initial program 99.9%

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

   2. Taylor expanded in b around inf 84.7%

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

   3. Taylor expanded in a around 0 84.7%

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

      1. unpow2 84.7%

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

      2. unpow2 84.7%

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

      3. associate-*r* 84.7%

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

      4. *-commutative 84.7%

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

      5. unpow2 84.7%

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

      6. associate-+r+ 84.7%

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

      7. +-commutative 84.7%

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

      8. +-commutative 84.7%

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

      9. *-commutative 84.7%

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

      10. distribute-lft-in 84.7%

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

      11. fma-udef 84.7%

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

      12. metadata-eval 84.7%

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

      13. pow-sqr 84.7%

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

      14. unpow2 84.7%

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

      15. unpow2 84.7%

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

      16. distribute-lft-in 84.7%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in a around inf 98.0%

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

   8. Simplified 98.0%

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

4. Final simplification 98.6%

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

Alternative 3: 96.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 4 \cdot \left(b \cdot b\right)\\ \mathbf{if}\;a \cdot a \leq 2 \cdot 10^{+47}:\\ \;\;\;\;\left(t_0 + b \cdot {b}^{3}\right) + -1\\ \mathbf{else}:\\ \;\;\;\;\left(t_0 + \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right) + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* 4.0 (* b b))))
   (if (<= (* a a) 2e+47)
     (+ (+ t_0 (* b (pow b 3.0))) -1.0)
     (+ (+ t_0 (* (* a a) (* a a))) -1.0))))

C

double code(double a, double b) {
	double t_0 = 4.0 * (b * b);
	double tmp;
	if ((a * a) <= 2e+47) {
		tmp = (t_0 + (b * pow(b, 3.0))) + -1.0;
	} else {
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 4.0d0 * (b * b)
    if ((a * a) <= 2d+47) then
        tmp = (t_0 + (b * (b ** 3.0d0))) + (-1.0d0)
    else
        tmp = (t_0 + ((a * a) * (a * a))) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double t_0 = 4.0 * (b * b);
	double tmp;
	if ((a * a) <= 2e+47) {
		tmp = (t_0 + (b * Math.pow(b, 3.0))) + -1.0;
	} else {
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = 4.0 * (b * b)
	tmp = 0
	if (a * a) <= 2e+47:
		tmp = (t_0 + (b * math.pow(b, 3.0))) + -1.0
	else:
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0
	return tmp

Julia

function code(a, b)
	t_0 = Float64(4.0 * Float64(b * b))
	tmp = 0.0
	if (Float64(a * a) <= 2e+47)
		tmp = Float64(Float64(t_0 + Float64(b * (b ^ 3.0))) + -1.0);
	else
		tmp = Float64(Float64(t_0 + Float64(Float64(a * a) * Float64(a * a))) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = 4.0 * (b * b);
	tmp = 0.0;
	if ((a * a) <= 2e+47)
		tmp = (t_0 + (b * (b ^ 3.0))) + -1.0;
	else
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * a), $MachinePrecision], 2e+47], N[(N[(t$95$0 + N[(b * N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(t$95$0 + N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 2.0000000000000001e47

   1. Initial program 99.8%

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

   2. Taylor expanded in a around 0 98.9%

      \[\leadsto \left({\color{blue}{\left({b}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 98.9%

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

   4. Simplified 98.9%

      \[\leadsto \left({\color{blue}{\left(b \cdot b\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 98.9%

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

      2. associate-*r* 99.0%

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

      3. pow3 99.0%

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

   6. Applied egg-rr 99.0%

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

   if 2.0000000000000001e47 < (*.f64 a a)

   1. Initial program 99.9%

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

   2. Taylor expanded in a around inf 94.7%

      \[\leadsto \left({\color{blue}{\left({a}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 94.7%

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

   4. Simplified 94.7%

      \[\leadsto \left({\color{blue}{\left(a \cdot a\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 94.7%

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

   6. Applied egg-rr 94.7%

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

4. Final simplification 97.1%

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

Alternative 4: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (+ (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) -1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) + -1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) + (-1.0d0)
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) + -1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) + -1.0

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) + -1.0;
end

Wolfram

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]

Derivation

1. Initial program 99.8%

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

2. Final simplification 99.8%

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

Alternative 5: 96.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 2 \cdot 10^{+47}:\\ \;\;\;\;b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 4\right)\right) + -1\\ \mathbf{else}:\\ \;\;\;\;\left(4 \cdot \left(b \cdot b\right) + \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right) + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 2e+47)
   (+ (* b (* b (fma b b 4.0))) -1.0)
   (+ (+ (* 4.0 (* b b)) (* (* a a) (* a a))) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 2e+47) {
		tmp = (b * (b * fma(b, b, 4.0))) + -1.0;
	} else {
		tmp = ((4.0 * (b * b)) + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 2e+47)
		tmp = Float64(Float64(b * Float64(b * fma(b, b, 4.0))) + -1.0);
	else
		tmp = Float64(Float64(Float64(4.0 * Float64(b * b)) + Float64(Float64(a * a) * Float64(a * a))) + -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 2e+47], N[(N[(b * N[(b * N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 2.0000000000000001e47

   1. Initial program 99.8%

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

   2. Taylor expanded in a around 0 98.9%

      \[\leadsto \left({\color{blue}{\left({b}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 98.9%

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

   4. Simplified 98.9%

      \[\leadsto \left({\color{blue}{\left(b \cdot b\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 98.9%

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

      2. associate-*r* 99.0%

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

      3. pow3 99.0%

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

   6. Applied egg-rr 99.0%

      \[\leadsto \left(\color{blue}{{b}^{3} \cdot b} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   7. Step-by-step derivation

      1. associate-*r* 99.0%

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

      2. distribute-rgt-out 99.0%

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

      3. unpow3 99.0%

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

      4. distribute-rgt-in 99.0%

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

      5. *-commutative 99.0%

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

      6. fma-def 99.0%

         \[\leadsto \left(b \cdot \color{blue}{\mathsf{fma}\left(b, b, 4\right)}\right) \cdot b - 1 \]

   8. Applied egg-rr 99.0%

      \[\leadsto \color{blue}{\left(b \cdot \mathsf{fma}\left(b, b, 4\right)\right) \cdot b} - 1 \]

   if 2.0000000000000001e47 < (*.f64 a a)

   1. Initial program 99.9%

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

   2. Taylor expanded in a around inf 94.7%

      \[\leadsto \left({\color{blue}{\left({a}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 94.7%

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

   4. Simplified 94.7%

      \[\leadsto \left({\color{blue}{\left(a \cdot a\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 94.7%

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

   6. Applied egg-rr 94.7%

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

4. Final simplification 97.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot a \leq 2 \cdot 10^{+47}:\\ \;\;\;\;b \cdot \left(b \cdot \mathsf{fma}\left(b, b, 4\right)\right) + -1\\ \mathbf{else}:\\ \;\;\;\;\left(4 \cdot \left(b \cdot b\right) + \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right) + -1\\ \end{array} \]

Alternative 6: 96.7% accurate, 6.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot a \leq 2.25 \cdot 10^{+47}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \left(4 + b \cdot b\right) + -1\\ \mathbf{else}:\\ \;\;\;\;\left(4 \cdot \left(b \cdot b\right) + \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right) + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* a a) 2.25e+47)
   (+ (* (* b b) (+ 4.0 (* b b))) -1.0)
   (+ (+ (* 4.0 (* b b)) (* (* a a) (* a a))) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a * a) <= 2.25e+47) {
		tmp = ((b * b) * (4.0 + (b * b))) + -1.0;
	} else {
		tmp = ((4.0 * (b * b)) + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((a * a) <= 2.25d+47) then
        tmp = ((b * b) * (4.0d0 + (b * b))) + (-1.0d0)
    else
        tmp = ((4.0d0 * (b * b)) + ((a * a) * (a * a))) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((a * a) <= 2.25e+47) {
		tmp = ((b * b) * (4.0 + (b * b))) + -1.0;
	} else {
		tmp = ((4.0 * (b * b)) + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (a * a) <= 2.25e+47:
		tmp = ((b * b) * (4.0 + (b * b))) + -1.0
	else:
		tmp = ((4.0 * (b * b)) + ((a * a) * (a * a))) + -1.0
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(a * a) <= 2.25e+47)
		tmp = Float64(Float64(Float64(b * b) * Float64(4.0 + Float64(b * b))) + -1.0);
	else
		tmp = Float64(Float64(Float64(4.0 * Float64(b * b)) + Float64(Float64(a * a) * Float64(a * a))) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((a * a) <= 2.25e+47)
		tmp = ((b * b) * (4.0 + (b * b))) + -1.0;
	else
		tmp = ((4.0 * (b * b)) + ((a * a) * (a * a))) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 2.25e+47], N[(N[(N[(b * b), $MachinePrecision] * N[(4.0 + N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision] + N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 2.2499999999999999e47

   1. Initial program 99.8%

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

   2. Taylor expanded in a around 0 98.9%

      \[\leadsto \left({\color{blue}{\left({b}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 98.9%

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

   4. Simplified 98.9%

      \[\leadsto \left({\color{blue}{\left(b \cdot b\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 98.9%

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

      2. distribute-rgt-out 98.9%

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

   6. Applied egg-rr 98.9%

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

   if 2.2499999999999999e47 < (*.f64 a a)

   1. Initial program 99.9%

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

   2. Taylor expanded in a around inf 94.7%

      \[\leadsto \left({\color{blue}{\left({a}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 94.7%

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

   4. Simplified 94.7%

      \[\leadsto \left({\color{blue}{\left(a \cdot a\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 94.7%

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

   6. Applied egg-rr 94.7%

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

4. Final simplification 97.0%

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

Alternative 7: 96.7% accurate, 6.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 4 \cdot \left(b \cdot b\right)\\ \mathbf{if}\;a \cdot a \leq 2 \cdot 10^{+47}:\\ \;\;\;\;\left(t_0 + b \cdot \left(b \cdot \left(b \cdot b\right)\right)\right) + -1\\ \mathbf{else}:\\ \;\;\;\;\left(t_0 + \left(a \cdot a\right) \cdot \left(a \cdot a\right)\right) + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* 4.0 (* b b))))
   (if (<= (* a a) 2e+47)
     (+ (+ t_0 (* b (* b (* b b)))) -1.0)
     (+ (+ t_0 (* (* a a) (* a a))) -1.0))))

C

double code(double a, double b) {
	double t_0 = 4.0 * (b * b);
	double tmp;
	if ((a * a) <= 2e+47) {
		tmp = (t_0 + (b * (b * (b * b)))) + -1.0;
	} else {
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 4.0d0 * (b * b)
    if ((a * a) <= 2d+47) then
        tmp = (t_0 + (b * (b * (b * b)))) + (-1.0d0)
    else
        tmp = (t_0 + ((a * a) * (a * a))) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double t_0 = 4.0 * (b * b);
	double tmp;
	if ((a * a) <= 2e+47) {
		tmp = (t_0 + (b * (b * (b * b)))) + -1.0;
	} else {
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = 4.0 * (b * b)
	tmp = 0
	if (a * a) <= 2e+47:
		tmp = (t_0 + (b * (b * (b * b)))) + -1.0
	else:
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0
	return tmp

Julia

function code(a, b)
	t_0 = Float64(4.0 * Float64(b * b))
	tmp = 0.0
	if (Float64(a * a) <= 2e+47)
		tmp = Float64(Float64(t_0 + Float64(b * Float64(b * Float64(b * b)))) + -1.0);
	else
		tmp = Float64(Float64(t_0 + Float64(Float64(a * a) * Float64(a * a))) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = 4.0 * (b * b);
	tmp = 0.0;
	if ((a * a) <= 2e+47)
		tmp = (t_0 + (b * (b * (b * b)))) + -1.0;
	else
		tmp = (t_0 + ((a * a) * (a * a))) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * a), $MachinePrecision], 2e+47], N[(N[(t$95$0 + N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(t$95$0 + N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a a) < 2.0000000000000001e47

   1. Initial program 99.8%

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

   2. Taylor expanded in a around 0 98.9%

      \[\leadsto \left({\color{blue}{\left({b}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 98.9%

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

   4. Simplified 98.9%

      \[\leadsto \left({\color{blue}{\left(b \cdot b\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 98.9%

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

      2. associate-*r* 99.0%

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

      3. pow3 99.0%

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

   6. Applied egg-rr 99.0%

      \[\leadsto \left(\color{blue}{{b}^{3} \cdot b} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   7. Step-by-step derivation

      1. unpow3 99.0%

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

   8. Applied egg-rr 99.0%

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

   if 2.0000000000000001e47 < (*.f64 a a)

   1. Initial program 99.9%

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

   2. Taylor expanded in a around inf 94.7%

      \[\leadsto \left({\color{blue}{\left({a}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   3. Step-by-step derivation

      1. unpow2 94.7%

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

   4. Simplified 94.7%

      \[\leadsto \left({\color{blue}{\left(a \cdot a\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
   5. Step-by-step derivation

      1. unpow2 94.7%

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

   6. Applied egg-rr 94.7%

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

4. Final simplification 97.0%

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

Alternative 8: 70.6% accurate, 10.5× speedup

Math

\[\begin{array}{l} \\ \left(b \cdot b\right) \cdot \left(4 + b \cdot b\right) + -1 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (+ (* (* b b) (+ 4.0 (* b b))) -1.0))

C

double code(double a, double b) {
	return ((b * b) * (4.0 + (b * b))) + -1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((b * b) * (4.0d0 + (b * b))) + (-1.0d0)
end function

Java

public static double code(double a, double b) {
	return ((b * b) * (4.0 + (b * b))) + -1.0;
}

Python

def code(a, b):
	return ((b * b) * (4.0 + (b * b))) + -1.0

Julia

function code(a, b)
	return Float64(Float64(Float64(b * b) * Float64(4.0 + Float64(b * b))) + -1.0)
end

MATLAB

function tmp = code(a, b)
	tmp = ((b * b) * (4.0 + (b * b))) + -1.0;
end

Wolfram

code[a_, b_] := N[(N[(N[(b * b), $MachinePrecision] * N[(4.0 + N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

2. Taylor expanded in a around 0 72.9%

   \[\leadsto \left({\color{blue}{\left({b}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
3. Step-by-step derivation

   1. unpow2 72.9%

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

4. Simplified 72.9%

   \[\leadsto \left({\color{blue}{\left(b \cdot b\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
5. Step-by-step derivation

   1. unpow2 72.9%

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

   2. distribute-rgt-out 72.9%

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

6. Applied egg-rr 72.9%

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

7. Final simplification 72.9%

   \[\leadsto \left(b \cdot b\right) \cdot \left(4 + b \cdot b\right) + -1 \]

Alternative 9: 52.6% accurate, 16.6× speedup

Math

\[\begin{array}{l} \\ 4 \cdot \left(b \cdot b\right) + -1 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (+ (* 4.0 (* b b)) -1.0))

C

double code(double a, double b) {
	return (4.0 * (b * b)) + -1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (4.0d0 * (b * b)) + (-1.0d0)
end function

Java

public static double code(double a, double b) {
	return (4.0 * (b * b)) + -1.0;
}

Python

def code(a, b):
	return (4.0 * (b * b)) + -1.0

Julia

function code(a, b)
	return Float64(Float64(4.0 * Float64(b * b)) + -1.0)
end

MATLAB

function tmp = code(a, b)
	tmp = (4.0 * (b * b)) + -1.0;
end

Wolfram

code[a_, b_] := N[(N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

2. Taylor expanded in a around inf 83.8%

   \[\leadsto \left({\color{blue}{\left({a}^{2}\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
3. Step-by-step derivation

   1. unpow2 83.8%

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

4. Simplified 83.8%

   \[\leadsto \left({\color{blue}{\left(a \cdot a\right)}}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1 \]
5. Step-by-step derivation

   1. unpow2 83.8%

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

6. Applied egg-rr 83.8%

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

7. Taylor expanded in a around 0 52.6%

   \[\leadsto \color{blue}{4 \cdot {b}^{2}} - 1 \]

9. Simplified 52.6%

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

10. Final simplification 52.6%

    \[\leadsto 4 \cdot \left(b \cdot b\right) + -1 \]

Reproduce

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