Bouland and Aaronson, Equation (24)

Percentage Accurate: 73.3% → 98.0%

Time: 9.5s

Alternatives: 6

Speedup: 1.2×

• 60.6% 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(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1 \end{array} \]

FPCore

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

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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 * (((a * a) * (1.0d0 - a)) + ((b * b) * (3.0d0 + a))))) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(3.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Initial Program: 73.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \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(3 + a\right)\right)\right) - 1 \end{array} \]

FPCore

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

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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 * (((a * a) * (1.0d0 - a)) + ((b * b) * (3.0d0 + a))))) - 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(3.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Alternative 1: 98.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(\mathsf{hypot}\left(a, b\right)\right)}^{2}\\ \mathbf{if}\;{\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(a + 3\right)\right) \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(t_0, t_0, 4 \cdot \mathsf{fma}\left({b}^{2}, a + 3, \left(1 - a\right) \cdot {a}^{2}\right)\right) + -1\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (pow (hypot a b) 2.0)))
   (if (<=
        (+
         (pow (+ (* a a) (* b b)) 2.0)
         (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ a 3.0)))))
        INFINITY)
     (+
      (fma
       t_0
       t_0
       (* 4.0 (fma (pow b 2.0) (+ a 3.0) (* (- 1.0 a) (pow a 2.0)))))
      -1.0)
     (pow a 4.0))))

C

double code(double a, double b) {
	double t_0 = pow(hypot(a, b), 2.0);
	double tmp;
	if ((pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))))) <= ((double) INFINITY)) {
		tmp = fma(t_0, t_0, (4.0 * fma(pow(b, 2.0), (a + 3.0), ((1.0 - a) * pow(a, 2.0))))) + -1.0;
	} else {
		tmp = pow(a, 4.0);
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = hypot(a, b) ^ 2.0
	tmp = 0.0
	if (Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 - a)) + Float64(Float64(b * b) * Float64(a + 3.0))))) <= Inf)
		tmp = Float64(fma(t_0, t_0, Float64(4.0 * fma((b ^ 2.0), Float64(a + 3.0), Float64(Float64(1.0 - a) * (a ^ 2.0))))) + -1.0);
	else
		tmp = a ^ 4.0;
	end
	return tmp
end

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 98.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\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(a + 3\right)\right)\\ \mathbf{if}\;t_0 \leq \infty:\\ \;\;\;\;t_0 + -1\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 57.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.4 \cdot 10^{-205}:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-153}:\\ \;\;\;\;-1\\ \mathbf{elif}\;b \leq 8 \cdot 10^{-45}:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;b \leq 1.05 \cdot 10^{-27}:\\ \;\;\;\;-1\\ \mathbf{elif}\;b \leq 7000000:\\ \;\;\;\;{a}^{4}\\ \mathbf{else}:\\ \;\;\;\;{b}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 6.4e-205)
   (pow a 4.0)
   (if (<= b 2.6e-153)
     -1.0
     (if (<= b 8e-45)
       (pow a 4.0)
       (if (<= b 1.05e-27)
         -1.0
         (if (<= b 7000000.0) (pow a 4.0) (pow b 4.0)))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 6.4e-205) {
		tmp = pow(a, 4.0);
	} else if (b <= 2.6e-153) {
		tmp = -1.0;
	} else if (b <= 8e-45) {
		tmp = pow(a, 4.0);
	} else if (b <= 1.05e-27) {
		tmp = -1.0;
	} else if (b <= 7000000.0) {
		tmp = pow(a, 4.0);
	} else {
		tmp = pow(b, 4.0);
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 6.4d-205) then
        tmp = a ** 4.0d0
    else if (b <= 2.6d-153) then
        tmp = -1.0d0
    else if (b <= 8d-45) then
        tmp = a ** 4.0d0
    else if (b <= 1.05d-27) then
        tmp = -1.0d0
    else if (b <= 7000000.0d0) then
        tmp = a ** 4.0d0
    else
        tmp = b ** 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 6.4e-205) {
		tmp = Math.pow(a, 4.0);
	} else if (b <= 2.6e-153) {
		tmp = -1.0;
	} else if (b <= 8e-45) {
		tmp = Math.pow(a, 4.0);
	} else if (b <= 1.05e-27) {
		tmp = -1.0;
	} else if (b <= 7000000.0) {
		tmp = Math.pow(a, 4.0);
	} else {
		tmp = Math.pow(b, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 6.4e-205:
		tmp = math.pow(a, 4.0)
	elif b <= 2.6e-153:
		tmp = -1.0
	elif b <= 8e-45:
		tmp = math.pow(a, 4.0)
	elif b <= 1.05e-27:
		tmp = -1.0
	elif b <= 7000000.0:
		tmp = math.pow(a, 4.0)
	else:
		tmp = math.pow(b, 4.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 6.4e-205)
		tmp = a ^ 4.0;
	elseif (b <= 2.6e-153)
		tmp = -1.0;
	elseif (b <= 8e-45)
		tmp = a ^ 4.0;
	elseif (b <= 1.05e-27)
		tmp = -1.0;
	elseif (b <= 7000000.0)
		tmp = a ^ 4.0;
	else
		tmp = b ^ 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 6.4e-205)
		tmp = a ^ 4.0;
	elseif (b <= 2.6e-153)
		tmp = -1.0;
	elseif (b <= 8e-45)
		tmp = a ^ 4.0;
	elseif (b <= 1.05e-27)
		tmp = -1.0;
	elseif (b <= 7000000.0)
		tmp = a ^ 4.0;
	else
		tmp = b ^ 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 6.4e-205], N[Power[a, 4.0], $MachinePrecision], If[LessEqual[b, 2.6e-153], -1.0, If[LessEqual[b, 8e-45], N[Power[a, 4.0], $MachinePrecision], If[LessEqual[b, 1.05e-27], -1.0, If[LessEqual[b, 7000000.0], N[Power[a, 4.0], $MachinePrecision], N[Power[b, 4.0], $MachinePrecision]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 93.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.4 \cdot 10^{+29} \lor \neg \left(a \leq 1.7 \cdot 10^{+23}\right):\\ \;\;\;\;{a}^{4}\\ \mathbf{else}:\\ \;\;\;\;{b}^{4} + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -4.4e+29) (not (<= a 1.7e+23)))
   (pow a 4.0)
   (+ (pow b 4.0) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -4.4e+29) || !(a <= 1.7e+23)) {
		tmp = pow(a, 4.0);
	} else {
		tmp = pow(b, 4.0) + -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 <= (-4.4d+29)) .or. (.not. (a <= 1.7d+23))) then
        tmp = a ** 4.0d0
    else
        tmp = (b ** 4.0d0) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((a <= -4.4e+29) || !(a <= 1.7e+23)) {
		tmp = Math.pow(a, 4.0);
	} else {
		tmp = Math.pow(b, 4.0) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (a <= -4.4e+29) or not (a <= 1.7e+23):
		tmp = math.pow(a, 4.0)
	else:
		tmp = math.pow(b, 4.0) + -1.0
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -4.4e+29) || !(a <= 1.7e+23))
		tmp = a ^ 4.0;
	else
		tmp = Float64((b ^ 4.0) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((a <= -4.4e+29) || ~((a <= 1.7e+23)))
		tmp = a ^ 4.0;
	else
		tmp = (b ^ 4.0) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -4.4e+29], N[Not[LessEqual[a, 1.7e+23]], $MachinePrecision]], N[Power[a, 4.0], $MachinePrecision], N[(N[Power[b, 4.0], $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 69.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -6 \cdot 10^{-8} \lor \neg \left(a \leq 2.4\right):\\ \;\;\;\;{a}^{4}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -6e-8) (not (<= a 2.4))) (pow a 4.0) -1.0))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -6e-8) || !(a <= 2.4)) {
		tmp = pow(a, 4.0);
	} else {
		tmp = -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 <= (-6d-8)) .or. (.not. (a <= 2.4d0))) then
        tmp = a ** 4.0d0
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((a <= -6e-8) || !(a <= 2.4)) {
		tmp = Math.pow(a, 4.0);
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (a <= -6e-8) or not (a <= 2.4):
		tmp = math.pow(a, 4.0)
	else:
		tmp = -1.0
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -6e-8) || !(a <= 2.4))
		tmp = a ^ 4.0;
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((a <= -6e-8) || ~((a <= 2.4)))
		tmp = a ^ 4.0;
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -6e-8], N[Not[LessEqual[a, 2.4]], $MachinePrecision]], N[Power[a, 4.0], $MachinePrecision], -1.0]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 25.5% accurate, 128.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(a, b):
	return -1.0

Julia

function code(a, b)
	return -1.0
end

MATLAB

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

Wolfram

code[a_, b_] := -1.0

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Reproduce

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