Octave 3.8, jcobi/3

Percentage Accurate: 94.5% → 99.5%

Time: 16.4s

Alternatives: 15

Speedup: 3.2×

Specification

\[\alpha > -1 \land \beta > -1\]

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0))))
   (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0))))
   (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := \alpha + \left(\beta + 2\right)\\ \mathbf{if}\;\beta \leq 3.5 \cdot 10^{+115}:\\ \;\;\;\;\frac{1 + \alpha}{t_0} \cdot \frac{1 + \beta}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{2 + \left(\beta + \alpha\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ alpha (+ beta 2.0))))
   (if (<= beta 3.5e+115)
     (* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) (* (+ alpha (+ beta 3.0)) t_0)))
     (/ (/ (+ 1.0 alpha) beta) (+ 2.0 (+ beta alpha))))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	double tmp;
	if (beta <= 3.5e+115) {
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
	} else {
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = alpha + (beta + 2.0);
	double tmp;
	if (beta <= 3.5e+115) {
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
	} else {
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = alpha + (beta + 2.0)
	tmp = 0
	if beta <= 3.5e+115:
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0))
	else:
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(alpha + Float64(beta + 2.0))
	tmp = 0.0
	if (beta <= 3.5e+115)
		tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0)));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(2.0 + Float64(beta + alpha)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = alpha + (beta + 2.0);
	tmp = 0.0;
	if (beta <= 3.5e+115)
		tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
	else
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 2: 98.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.8:\\ \;\;\;\;\frac{0.25}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.8)
   (/ 0.25 (+ 1.0 (+ 2.0 (+ beta alpha))))
   (*
    (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
    (/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ alpha (+ beta 3.0))))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.8) {
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	} else {
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.8) {
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	} else {
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.8:
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)))
	else:
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.8)
		tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(beta + alpha))));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / Float64(alpha + Float64(beta + 3.0))));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.8)
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	else
		tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.25 / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 3: 99.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := 2 + \left(\beta + \alpha\right)\\ \frac{\frac{1 + \beta}{t_0}}{t_0} \cdot \frac{1 + \alpha}{\alpha + \left(\beta + 3\right)} \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (let* ((t_0 (+ 2.0 (+ beta alpha))))
   (* (/ (/ (+ 1.0 beta) t_0) t_0) (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = 2.0 + (beta + alpha);
	return (((1.0 + beta) / t_0) / t_0) * ((1.0 + alpha) / (alpha + (beta + 3.0)));
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = 2.0 + (beta + alpha);
	return (((1.0 + beta) / t_0) / t_0) * ((1.0 + alpha) / (alpha + (beta + 3.0)));
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = 2.0 + (beta + alpha)
	return (((1.0 + beta) / t_0) / t_0) * ((1.0 + alpha) / (alpha + (beta + 3.0)))

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(2.0 + Float64(beta + alpha))
	return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / t_0) * Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))))
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
	t_0 = 2.0 + (beta + alpha);
	tmp = (((1.0 + beta) / t_0) / t_0) * ((1.0 + alpha) / (alpha + (beta + 3.0)));
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 4: 98.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.3 \cdot 10^{+15}:\\ \;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \frac{\beta + 2}{1 + \beta}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{2 + \left(\beta + \alpha\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.3e+15)
   (/ 1.0 (* (+ beta 2.0) (* (+ beta 3.0) (/ (+ beta 2.0) (+ 1.0 beta)))))
   (/ (/ (+ 1.0 alpha) beta) (+ 2.0 (+ beta alpha)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.3e+15) {
		tmp = 1.0 / ((beta + 2.0) * ((beta + 3.0) * ((beta + 2.0) / (1.0 + beta))));
	} else {
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.3d+15) then
        tmp = 1.0d0 / ((beta + 2.0d0) * ((beta + 3.0d0) * ((beta + 2.0d0) / (1.0d0 + beta))))
    else
        tmp = ((1.0d0 + alpha) / beta) / (2.0d0 + (beta + alpha))
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.3e+15) {
		tmp = 1.0 / ((beta + 2.0) * ((beta + 3.0) * ((beta + 2.0) / (1.0 + beta))));
	} else {
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.3e+15:
		tmp = 1.0 / ((beta + 2.0) * ((beta + 3.0) * ((beta + 2.0) / (1.0 + beta))))
	else:
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.3e+15)
		tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(Float64(beta + 2.0) / Float64(1.0 + beta)))));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(2.0 + Float64(beta + alpha)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.3e+15)
		tmp = 1.0 / ((beta + 2.0) * ((beta + 3.0) * ((beta + 2.0) / (1.0 + beta))));
	else
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 2.3e+15], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 5: 98.6% accurate, 2.1× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.1 \cdot 10^{+15}:\\ \;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{2 + \left(\beta + \alpha\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 1.1e+15)
   (/ (+ 1.0 beta) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0))))
   (/ (/ (+ 1.0 alpha) beta) (+ 2.0 (+ beta alpha)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 1.1e+15) {
		tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
	} else {
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 1.1d+15) then
        tmp = (1.0d0 + beta) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0)))
    else
        tmp = ((1.0d0 + alpha) / beta) / (2.0d0 + (beta + alpha))
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 1.1e+15) {
		tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
	} else {
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 1.1e+15:
		tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)))
	else:
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 1.1e+15)
		tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0))));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(2.0 + Float64(beta + alpha)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 1.1e+15)
		tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
	else
		tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 1.1e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 6: 97.7% accurate, 2.7× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} t_0 := 2 + \left(\beta + \alpha\right)\\ \mathbf{if}\;\beta \leq 5:\\ \;\;\;\;\frac{0.25}{1 + t_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t_0}\\ \end{array} \end{array} \]

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double t_0 = 2.0 + (beta + alpha);
	double tmp;
	if (beta <= 5.0) {
		tmp = 0.25 / (1.0 + t_0);
	} else {
		tmp = ((1.0 + alpha) / beta) / t_0;
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double t_0 = 2.0 + (beta + alpha);
	double tmp;
	if (beta <= 5.0) {
		tmp = 0.25 / (1.0 + t_0);
	} else {
		tmp = ((1.0 + alpha) / beta) / t_0;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	t_0 = 2.0 + (beta + alpha)
	tmp = 0
	if beta <= 5.0:
		tmp = 0.25 / (1.0 + t_0)
	else:
		tmp = ((1.0 + alpha) / beta) / t_0
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	t_0 = Float64(2.0 + Float64(beta + alpha))
	tmp = 0.0
	if (beta <= 5.0)
		tmp = Float64(0.25 / Float64(1.0 + t_0));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / t_0);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	t_0 = 2.0 + (beta + alpha);
	tmp = 0.0;
	if (beta <= 5.0)
		tmp = 0.25 / (1.0 + t_0);
	else
		tmp = ((1.0 + alpha) / beta) / t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 7: 97.2% accurate, 3.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 3.9:\\ \;\;\;\;\frac{0.25}{\alpha + 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 3.9)
   (/ 0.25 (+ alpha 3.0))
   (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 3.9) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 3.9d0) then
        tmp = 0.25d0 / (alpha + 3.0d0)
    else
        tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 3.9) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 3.9:
		tmp = 0.25 / (alpha + 3.0)
	else:
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 3.9)
		tmp = Float64(0.25 / Float64(alpha + 3.0));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 3.9)
		tmp = 0.25 / (alpha + 3.0);
	else
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 3.9], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 8: 97.6% accurate, 3.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 6.6:\\ \;\;\;\;\frac{0.25}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 6.6)
   (/ 0.25 (+ 1.0 (+ 2.0 (+ beta alpha))))
   (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.6) {
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	} else {
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 6.6) {
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	} else {
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 6.6:
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)))
	else:
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 6.6)
		tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(beta + alpha))));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 6.6)
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	else
		tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 6.6], N[(0.25 / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 9: 97.7% accurate, 3.2× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 4.8:\\ \;\;\;\;\frac{0.25}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 4.8)
   (/ 0.25 (+ 1.0 (+ 2.0 (+ beta alpha))))
   (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 4.8) {
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	} else {
		tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 4.8d0) then
        tmp = 0.25d0 / (1.0d0 + (2.0d0 + (beta + alpha)))
    else
        tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 4.8) {
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	} else {
		tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 4.8:
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)))
	else:
		tmp = ((1.0 + alpha) / beta) / (beta + 3.0)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 4.8)
		tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(beta + alpha))));
	else
		tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 4.8)
		tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
	else
		tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 4.8], N[(0.25 / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 10: 91.5% accurate, 3.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.4:\\ \;\;\;\;\frac{0.25}{\alpha + 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.4) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (+ beta 3.0)))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.4) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = 1.0 / (beta * (beta + 3.0));
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.4d0) then
        tmp = 0.25d0 / (alpha + 3.0d0)
    else
        tmp = 1.0d0 / (beta * (beta + 3.0d0))
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.4) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = 1.0 / (beta * (beta + 3.0));
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.4:
		tmp = 0.25 / (alpha + 3.0)
	else:
		tmp = 1.0 / (beta * (beta + 3.0))
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.4)
		tmp = Float64(0.25 / Float64(alpha + 3.0));
	else
		tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0)));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.4)
		tmp = 0.25 / (alpha + 3.0);
	else
		tmp = 1.0 / (beta * (beta + 3.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 2.4], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 11: 91.9% accurate, 3.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.6:\\ \;\;\;\;\frac{0.25}{\alpha + 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1}{\beta}}{\beta + 2}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.6) (/ 0.25 (+ alpha 3.0)) (/ (/ 1.0 beta) (+ beta 2.0))))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.6) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = (1.0 / beta) / (beta + 2.0);
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.6d0) then
        tmp = 0.25d0 / (alpha + 3.0d0)
    else
        tmp = (1.0d0 / beta) / (beta + 2.0d0)
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.6) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = (1.0 / beta) / (beta + 2.0);
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.6:
		tmp = 0.25 / (alpha + 3.0)
	else:
		tmp = (1.0 / beta) / (beta + 2.0)
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.6)
		tmp = Float64(0.25 / Float64(alpha + 3.0));
	else
		tmp = Float64(Float64(1.0 / beta) / Float64(beta + 2.0));
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.6)
		tmp = 0.25 / (alpha + 3.0);
	else
		tmp = (1.0 / beta) / (beta + 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 2.6], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 12: 47.5% accurate, 5.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.9:\\ \;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 2.9)
   (+ 0.08333333333333333 (* beta -0.027777777777777776))
   (/ 1.0 beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.9) {
		tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 2.9d0) then
        tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
    else
        tmp = 1.0d0 / beta
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 2.9) {
		tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 2.9:
		tmp = 0.08333333333333333 + (beta * -0.027777777777777776)
	else:
		tmp = 1.0 / beta
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 2.9)
		tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776));
	else
		tmp = Float64(1.0 / beta);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 2.9)
		tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
	else
		tmp = 1.0 / beta;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]

Derivation

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

Alternative 13: 47.5% accurate, 5.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 15.5:\\ \;\;\;\;\frac{0.25}{\alpha + 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 15.5) (/ 0.25 (+ alpha 3.0)) (/ 1.0 beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 15.5) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 15.5d0) then
        tmp = 0.25d0 / (alpha + 3.0d0)
    else
        tmp = 1.0d0 / beta
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 15.5) {
		tmp = 0.25 / (alpha + 3.0);
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 15.5:
		tmp = 0.25 / (alpha + 3.0)
	else:
		tmp = 1.0 / beta
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 15.5)
		tmp = Float64(0.25 / Float64(alpha + 3.0));
	else
		tmp = Float64(1.0 / beta);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 15.5)
		tmp = 0.25 / (alpha + 3.0);
	else
		tmp = 1.0 / beta;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 15.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]

Derivation

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

Alternative 14: 47.1% accurate, 6.9× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 12:\\ \;\;\;\;0.08333333333333333\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
 :precision binary64
 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))

C

assert(alpha < beta);
double code(double alpha, double beta) {
	double tmp;
	if (beta <= 12.0) {
		tmp = 0.08333333333333333;
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8) :: tmp
    if (beta <= 12.0d0) then
        tmp = 0.08333333333333333d0
    else
        tmp = 1.0d0 / beta
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	double tmp;
	if (beta <= 12.0) {
		tmp = 0.08333333333333333;
	} else {
		tmp = 1.0 / beta;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta):
	tmp = 0
	if beta <= 12.0:
		tmp = 0.08333333333333333
	else:
		tmp = 1.0 / beta
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta)
	tmp = 0.0
	if (beta <= 12.0)
		tmp = 0.08333333333333333;
	else
		tmp = Float64(1.0 / beta);
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
	tmp = 0.0;
	if (beta <= 12.0)
		tmp = 0.08333333333333333;
	else
		tmp = 1.0 / beta;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]

Derivation

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

Alternative 15: 45.4% accurate, 35.0× speedup

Math

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

FPCore

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

C

assert(alpha < beta);
double code(double alpha, double beta) {
	return 0.08333333333333333;
}

Fortran

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

Java

assert alpha < beta;
public static double code(double alpha, double beta) {
	return 0.08333333333333333;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Reproduce

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