Octave 3.8, jcobi/4

Percentage Accurate: 16.1% → 84.3%

Time: 21.0s

Alternatives: 11

Speedup: 53.0×

Specification

\[\left(\alpha > -1 \land \beta > -1\right) \land i > 1\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_2 := t_1 \cdot t_1\\ \frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* i (+ (+ alpha beta) i)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (* t_1 t_1)))
   (/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Python

def code(alpha, beta, i):
	t_0 = i * ((alpha + beta) + i)
	t_1 = (alpha + beta) + (2.0 * i)
	t_2 = t_1 * t_1
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)

Julia

function code(alpha, beta, i)
	t_0 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0))
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = i * ((alpha + beta) + i);
	t_1 = (alpha + beta) + (2.0 * i);
	t_2 = t_1 * t_1;
	tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]

Initial Program: 16.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := i \cdot \left(\left(\alpha + \beta\right) + i\right)\\ t_1 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_2 := t_1 \cdot t_1\\ \frac{\frac{t_0 \cdot \left(\beta \cdot \alpha + t_0\right)}{t_2}}{t_2 - 1} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (* i (+ (+ alpha beta) i)))
        (t_1 (+ (+ alpha beta) (* 2.0 i)))
        (t_2 (* t_1 t_1)))
   (/ (/ (* t_0 (+ (* beta alpha) t_0)) t_2) (- t_2 1.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = i * ((alpha + beta) + i)
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = t_1 * t_1
    code = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0d0)
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = i * ((alpha + beta) + i);
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = t_1 * t_1;
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
}

Python

def code(alpha, beta, i):
	t_0 = i * ((alpha + beta) + i)
	t_1 = (alpha + beta) + (2.0 * i)
	t_2 = t_1 * t_1
	return ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0)

Julia

function code(alpha, beta, i)
	t_0 = Float64(i * Float64(Float64(alpha + beta) + i))
	t_1 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(Float64(t_0 * Float64(Float64(beta * alpha) + t_0)) / t_2) / Float64(t_2 - 1.0))
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = i * ((alpha + beta) + i);
	t_1 = (alpha + beta) + (2.0 * i);
	t_2 = t_1 * t_1;
	tmp = ((t_0 * ((beta * alpha) + t_0)) / t_2) / (t_2 - 1.0);
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * N[(N[(alpha + beta), $MachinePrecision] + i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(N[(t$95$0 * N[(N[(beta * alpha), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision] / N[(t$95$2 - 1.0), $MachinePrecision]), $MachinePrecision]]]]

Alternative 1: 84.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t_0 \cdot t_0\\ t_2 := t_1 + -1\\ t_3 := i + \left(\alpha + \beta\right)\\ t_4 := i \cdot t_3\\ t_5 := \mathsf{fma}\left(i, 2, \alpha + \beta\right)\\ \mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\ \;\;\;\;\frac{\frac{\mathsf{fma}\left(i, t_3, \alpha \cdot \beta\right)}{t_5} \cdot \frac{i}{\frac{t_5}{t_3}}}{t_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (+ i (+ alpha beta)))
        (t_4 (* i t_3))
        (t_5 (fma i 2.0 (+ alpha beta))))
   (if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
     (/ (* (/ (fma i t_3 (* alpha beta)) t_5) (/ i (/ t_5 t_3))) t_2)
     (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 + -1.0;
	double t_3 = i + (alpha + beta);
	double t_4 = i * t_3;
	double t_5 = fma(i, 2.0, (alpha + beta));
	double tmp;
	if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = ((fma(i, t_3, (alpha * beta)) / t_5) * (i / (t_5 / t_3))) / t_2;
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 + -1.0)
	t_3 = Float64(i + Float64(alpha + beta))
	t_4 = Float64(i * t_3)
	t_5 = fma(i, 2.0, Float64(alpha + beta))
	tmp = 0.0
	if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(Float64(fma(i, t_3, Float64(alpha * beta)) / t_5) * Float64(i / Float64(t_5 / t_3))) / t_2);
	else
		tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(i * 2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision] * N[(i / N[(t$95$5 / t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

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

Alternative 2: 84.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t_0 \cdot t_0\\ t_2 := t_1 + -1\\ t_3 := i + \left(\alpha + \beta\right)\\ t_4 := i \cdot t_3\\ \mathbf{if}\;\frac{\frac{t_4 \cdot \left(t_4 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\ \;\;\;\;\frac{i \cdot \left(\mathsf{fma}\left(i, t_3, \alpha \cdot \beta\right) \cdot \frac{i + \beta}{{\left(\beta + i \cdot 2\right)}^{2}}\right)}{t_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (+ i (+ alpha beta)))
        (t_4 (* i t_3)))
   (if (<= (/ (/ (* t_4 (+ t_4 (* alpha beta))) t_1) t_2) INFINITY)
     (/
      (*
       i
       (*
        (fma i t_3 (* alpha beta))
        (/ (+ i beta) (pow (+ beta (* i 2.0)) 2.0))))
      t_2)
     (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 + -1.0;
	double t_3 = i + (alpha + beta);
	double t_4 = i * t_3;
	double tmp;
	if ((((t_4 * (t_4 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = (i * (fma(i, t_3, (alpha * beta)) * ((i + beta) / pow((beta + (i * 2.0)), 2.0)))) / t_2;
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 + -1.0)
	t_3 = Float64(i + Float64(alpha + beta))
	t_4 = Float64(i * t_3)
	tmp = 0.0
	if (Float64(Float64(Float64(t_4 * Float64(t_4 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(i * Float64(fma(i, t_3, Float64(alpha * beta)) * Float64(Float64(i + beta) / (Float64(beta + Float64(i * 2.0)) ^ 2.0)))) / t_2);
	else
		tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	end
	return tmp
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(i * t$95$3), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$4 * N[(t$95$4 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(N[(i * t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] * N[(N[(i + beta), $MachinePrecision] / N[Power[N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

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

Alternative 3: 83.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t_0 \cdot t_0\\ t_2 := t_1 + -1\\ t_3 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ \mathbf{if}\;\frac{\frac{t_3 \cdot \left(t_3 + \alpha \cdot \beta\right)}{t_1}}{t_2} \leq \infty:\\ \;\;\;\;\frac{i \cdot \frac{i}{\frac{4 \cdot \left(i \cdot \left(i + \beta\right)\right) + {\beta}^{2}}{{\left(i + \beta\right)}^{2}}}}{t_2}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (+ t_1 -1.0))
        (t_3 (* i (+ i (+ alpha beta)))))
   (if (<= (/ (/ (* t_3 (+ t_3 (* alpha beta))) t_1) t_2) INFINITY)
     (/
      (*
       i
       (/
        i
        (/ (+ (* 4.0 (* i (+ i beta))) (pow beta 2.0)) (pow (+ i beta) 2.0))))
      t_2)
     (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= ((double) INFINITY)) {
		tmp = (i * (i / (((4.0 * (i * (i + beta))) + pow(beta, 2.0)) / pow((i + beta), 2.0)))) / t_2;
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = t_1 + -1.0;
	double t_3 = i * (i + (alpha + beta));
	double tmp;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Double.POSITIVE_INFINITY) {
		tmp = (i * (i / (((4.0 * (i * (i + beta))) + Math.pow(beta, 2.0)) / Math.pow((i + beta), 2.0)))) / t_2;
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	t_1 = t_0 * t_0
	t_2 = t_1 + -1.0
	t_3 = i * (i + (alpha + beta))
	tmp = 0
	if (((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= math.inf:
		tmp = (i * (i / (((4.0 * (i * (i + beta))) + math.pow(beta, 2.0)) / math.pow((i + beta), 2.0)))) / t_2
	else:
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(t_1 + -1.0)
	t_3 = Float64(i * Float64(i + Float64(alpha + beta)))
	tmp = 0.0
	if (Float64(Float64(Float64(t_3 * Float64(t_3 + Float64(alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = Float64(Float64(i * Float64(i / Float64(Float64(Float64(4.0 * Float64(i * Float64(i + beta))) + (beta ^ 2.0)) / (Float64(i + beta) ^ 2.0)))) / t_2);
	else
		tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	t_1 = t_0 * t_0;
	t_2 = t_1 + -1.0;
	t_3 = i * (i + (alpha + beta));
	tmp = 0.0;
	if ((((t_3 * (t_3 + (alpha * beta))) / t_1) / t_2) <= Inf)
		tmp = (i * (i / (((4.0 * (i * (i + beta))) + (beta ^ 2.0)) / ((i + beta) ^ 2.0)))) / t_2;
	else
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + -1.0), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$3 * N[(t$95$3 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision], Infinity], N[(N[(i * N[(i / N[(N[(N[(4.0 * N[(i * N[(i + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Power[beta, 2.0], $MachinePrecision]), $MachinePrecision] / N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 4: 83.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t_0 \cdot t_0\\ t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := \beta + i \cdot 2\\ \mathbf{if}\;\frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1} \leq \infty:\\ \;\;\;\;\frac{i \cdot \frac{i}{\frac{{t_3}^{2}}{{\left(i + \beta\right)}^{2}}}}{t_0 \cdot t_3 + -1}\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (* i (+ i (+ alpha beta))))
        (t_3 (+ beta (* i 2.0))))
   (if (<= (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0)) INFINITY)
     (/
      (* i (/ i (/ (pow t_3 2.0) (pow (+ i beta) 2.0))))
      (+ (* t_0 t_3) -1.0))
     (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = beta + (i * 2.0);
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= ((double) INFINITY)) {
		tmp = (i * (i / (pow(t_3, 2.0) / pow((i + beta), 2.0)))) / ((t_0 * t_3) + -1.0);
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = beta + (i * 2.0);
	double tmp;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Double.POSITIVE_INFINITY) {
		tmp = (i * (i / (Math.pow(t_3, 2.0) / Math.pow((i + beta), 2.0)))) / ((t_0 * t_3) + -1.0);
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	t_1 = t_0 * t_0
	t_2 = i * (i + (alpha + beta))
	t_3 = beta + (i * 2.0)
	tmp = 0
	if (((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= math.inf:
		tmp = (i * (i / (math.pow(t_3, 2.0) / math.pow((i + beta), 2.0)))) / ((t_0 * t_3) + -1.0)
	else:
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(i * Float64(i + Float64(alpha + beta)))
	t_3 = Float64(beta + Float64(i * 2.0))
	tmp = 0.0
	if (Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0)) <= Inf)
		tmp = Float64(Float64(i * Float64(i / Float64((t_3 ^ 2.0) / (Float64(i + beta) ^ 2.0)))) / Float64(Float64(t_0 * t_3) + -1.0));
	else
		tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	t_1 = t_0 * t_0;
	t_2 = i * (i + (alpha + beta));
	t_3 = beta + (i * 2.0);
	tmp = 0.0;
	if ((((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)) <= Inf)
		tmp = (i * (i / ((t_3 ^ 2.0) / ((i + beta) ^ 2.0)))) / ((t_0 * t_3) + -1.0);
	else
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(beta + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(i * N[(i / N[(N[Power[t$95$3, 2.0], $MachinePrecision] / N[Power[N[(i + beta), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$3), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 5: 80.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ t_1 := t_0 \cdot t_0\\ t_2 := i \cdot \left(i + \left(\alpha + \beta\right)\right)\\ t_3 := \frac{\frac{t_2 \cdot \left(t_2 + \alpha \cdot \beta\right)}{t_1}}{t_1 + -1}\\ \mathbf{if}\;t_3 \leq 0.1:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0)))
        (t_1 (* t_0 t_0))
        (t_2 (* i (+ i (+ alpha beta))))
        (t_3 (/ (/ (* t_2 (+ t_2 (* alpha beta))) t_1) (+ t_1 -1.0))))
   (if (<= t_3 0.1)
     t_3
     (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (alpha + beta) + (i * 2.0d0)
    t_1 = t_0 * t_0
    t_2 = i * (i + (alpha + beta))
    t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + (-1.0d0))
    if (t_3 <= 0.1d0) then
        tmp = t_3
    else
        tmp = (0.0625d0 + (0.125d0 * (beta / i))) - (0.125d0 * ((alpha + beta) / i))
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double t_1 = t_0 * t_0;
	double t_2 = i * (i + (alpha + beta));
	double t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	double tmp;
	if (t_3 <= 0.1) {
		tmp = t_3;
	} else {
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	t_1 = t_0 * t_0
	t_2 = i * (i + (alpha + beta))
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0)
	tmp = 0
	if t_3 <= 0.1:
		tmp = t_3
	else:
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	t_1 = Float64(t_0 * t_0)
	t_2 = Float64(i * Float64(i + Float64(alpha + beta)))
	t_3 = Float64(Float64(Float64(t_2 * Float64(t_2 + Float64(alpha * beta))) / t_1) / Float64(t_1 + -1.0))
	tmp = 0.0
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	t_1 = t_0 * t_0;
	t_2 = i * (i + (alpha + beta));
	t_3 = ((t_2 * (t_2 + (alpha * beta))) / t_1) / (t_1 + -1.0);
	tmp = 0.0;
	if (t_3 <= 0.1)
		tmp = t_3;
	else
		tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 * N[(t$95$2 + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.1], t$95$3, N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 6: 78.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ \mathbf{if}\;i \leq 1.45 \cdot 10^{+134}:\\ \;\;\;\;\frac{\left(i \cdot 0.25\right) \cdot \left(i + \alpha\right)}{t_0 \cdot t_0 + -1}\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0))))
   (if (<= i 1.45e+134)
     (/ (* (* i 0.25) (+ i alpha)) (+ (* t_0 t_0) -1.0))
     0.0625)))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double tmp;
	if (i <= 1.45e+134) {
		tmp = ((i * 0.25) * (i + alpha)) / ((t_0 * t_0) + -1.0);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (i * 2.0d0)
    if (i <= 1.45d+134) then
        tmp = ((i * 0.25d0) * (i + alpha)) / ((t_0 * t_0) + (-1.0d0))
    else
        tmp = 0.0625d0
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double tmp;
	if (i <= 1.45e+134) {
		tmp = ((i * 0.25) * (i + alpha)) / ((t_0 * t_0) + -1.0);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	tmp = 0
	if i <= 1.45e+134:
		tmp = ((i * 0.25) * (i + alpha)) / ((t_0 * t_0) + -1.0)
	else:
		tmp = 0.0625
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	tmp = 0.0
	if (i <= 1.45e+134)
		tmp = Float64(Float64(Float64(i * 0.25) * Float64(i + alpha)) / Float64(Float64(t_0 * t_0) + -1.0));
	else
		tmp = 0.0625;
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	tmp = 0.0;
	if (i <= 1.45e+134)
		tmp = ((i * 0.25) * (i + alpha)) / ((t_0 * t_0) + -1.0);
	else
		tmp = 0.0625;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 1.45e+134], N[(N[(N[(i * 0.25), $MachinePrecision] * N[(i + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]

Derivation

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

Alternative 7: 78.1% accurate, 2.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + i \cdot 2\\ \mathbf{if}\;i \leq 3.6 \cdot 10^{+134}:\\ \;\;\;\;\frac{i \cdot \left(i \cdot 0.25\right)}{t_0 \cdot t_0 + -1}\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* i 2.0))))
   (if (<= i 3.6e+134) (/ (* i (* i 0.25)) (+ (* t_0 t_0) -1.0)) 0.0625)))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double tmp;
	if (i <= 3.6e+134) {
		tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (i * 2.0d0)
    if (i <= 3.6d+134) then
        tmp = (i * (i * 0.25d0)) / ((t_0 * t_0) + (-1.0d0))
    else
        tmp = 0.0625d0
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (i * 2.0);
	double tmp;
	if (i <= 3.6e+134) {
		tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	t_0 = (alpha + beta) + (i * 2.0)
	tmp = 0
	if i <= 3.6e+134:
		tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0)
	else:
		tmp = 0.0625
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(i * 2.0))
	tmp = 0.0
	if (i <= 3.6e+134)
		tmp = Float64(Float64(i * Float64(i * 0.25)) / Float64(Float64(t_0 * t_0) + -1.0));
	else
		tmp = 0.0625;
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (i * 2.0);
	tmp = 0.0;
	if (i <= 3.6e+134)
		tmp = (i * (i * 0.25)) / ((t_0 * t_0) + -1.0);
	else
		tmp = 0.0625;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, 3.6e+134], N[(N[(i * N[(i * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision], 0.0625]]

Derivation

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

Alternative 8: 77.2% accurate, 2.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (-
  (+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
  (* 0.125 (/ (+ alpha beta) i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i));
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = (0.0625d0 + (0.0625d0 * (((alpha * 2.0d0) + (beta * 2.0d0)) / i))) - (0.125d0 * ((alpha + beta) / i))
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i));
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i))

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)))
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((alpha + beta) / i));
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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

Alternative 9: 77.2% accurate, 3.5× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (- (+ 0.0625 (* 0.125 (/ beta i))) (* 0.125 (/ (+ alpha beta) i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = (0.0625d0 + (0.125d0 * (beta / i))) - (0.125d0 * ((alpha + beta) / i))
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i))

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return Float64(Float64(0.0625 + Float64(0.125 * Float64(beta / i))) - Float64(0.125 * Float64(Float64(alpha + beta) / i)))
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = (0.0625 + (0.125 * (beta / i))) - (0.125 * ((alpha + beta) / i));
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := N[(N[(0.0625 + N[(0.125 * N[(beta / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(alpha + beta), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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

Alternative 10: 73.9% accurate, 4.8× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.85 \cdot 10^{+230}:\\ \;\;\;\;0.0625\\ \mathbf{else}:\\ \;\;\;\;\frac{0.125 \cdot \left(\beta - \left(\alpha + \beta\right)\right)}{i}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.85e+230) 0.0625 (/ (* 0.125 (- beta (+ alpha beta))) i)))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.85e+230) {
		tmp = 0.0625;
	} else {
		tmp = (0.125 * (beta - (alpha + beta))) / i;
	}
	return tmp;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 1.85d+230) then
        tmp = 0.0625d0
    else
        tmp = (0.125d0 * (beta - (alpha + beta))) / i
    end if
    code = tmp
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.85e+230) {
		tmp = 0.0625;
	} else {
		tmp = (0.125 * (beta - (alpha + beta))) / i;
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.85e+230:
		tmp = 0.0625
	else:
		tmp = (0.125 * (beta - (alpha + beta))) / i
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.85e+230)
		tmp = 0.0625;
	else
		tmp = Float64(Float64(0.125 * Float64(beta - Float64(alpha + beta))) / i);
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.85e+230)
		tmp = 0.0625;
	else
		tmp = (0.125 * (beta - (alpha + beta))) / i;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.85e+230], 0.0625, N[(N[(0.125 * N[(beta - N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]]

Derivation

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

Alternative 11: 70.7% accurate, 53.0× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ 0.0625 \end{array} \]

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i) :precision binary64 0.0625)

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return 0.0625;
}

Fortran

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = 0.0625d0
end function

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	return 0.0625;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	return 0.0625

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	return 0.0625
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
	tmp = 0.0625;
end

Wolfram

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := 0.0625

Derivation

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

Reproduce

herbie shell --seed 2023343 
(FPCore (alpha beta i)
  :name "Octave 3.8, jcobi/4"
  :precision binary64
  :pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 1.0))
  (/ (/ (* (* i (+ (+ alpha beta) i)) (+ (* beta alpha) (* i (+ (+ alpha beta) i)))) (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i)))) (- (* (+ (+ alpha beta) (* 2.0 i)) (+ (+ alpha beta) (* 2.0 i))) 1.0)))