Octave 3.8, jcobi/4

Percentage Accurate: 15.8% → 83.4%

Time: 17.9s

Alternatives: 3

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: 15.8% 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: 83.4% accurate, 3.5× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.05 \cdot 10^{+119}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 7.4 \cdot 10^{+245} \lor \neg \left(\beta \leq 9 \cdot 10^{+258}\right):\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.05e+119)
   0.0625
   (if (or (<= beta 7.4e+245) (not (<= beta 9e+258)))
     (* (/ i beta) (/ (+ i alpha) beta))
     0.0625)))

C

assert(alpha < beta);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.05e+119) {
		tmp = 0.0625;
	} else if ((beta <= 7.4e+245) || !(beta <= 9e+258)) {
		tmp = (i / beta) * ((i + alpha) / beta);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta 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.05d+119) then
        tmp = 0.0625d0
    else if ((beta <= 7.4d+245) .or. (.not. (beta <= 9d+258))) then
        tmp = (i / beta) * ((i + alpha) / beta)
    else
        tmp = 0.0625d0
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.05e+119) {
		tmp = 0.0625;
	} else if ((beta <= 7.4e+245) || !(beta <= 9e+258)) {
		tmp = (i / beta) * ((i + alpha) / beta);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.05e+119:
		tmp = 0.0625
	elif (beta <= 7.4e+245) or not (beta <= 9e+258):
		tmp = (i / beta) * ((i + alpha) / beta)
	else:
		tmp = 0.0625
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.05e+119)
		tmp = 0.0625;
	elseif ((beta <= 7.4e+245) || !(beta <= 9e+258))
		tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta));
	else
		tmp = 0.0625;
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.05e+119)
		tmp = 0.0625;
	elseif ((beta <= 7.4e+245) || ~((beta <= 9e+258)))
		tmp = (i / beta) * ((i + alpha) / beta);
	else
		tmp = 0.0625;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 1.05e+119], 0.0625, If[Or[LessEqual[beta, 7.4e+245], N[Not[LessEqual[beta, 9e+258]], $MachinePrecision]], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision], 0.0625]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.04999999999999991e119 or 7.4000000000000002e245 < beta < 9.0000000000000007e258

   1. Initial program 20.2%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Step-by-step derivation

      1. associate-/l/ 18.2%

         \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]

      2. associate-*l* 18.1%

         \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]

      3. times-frac 26.1%

         \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]

   3. Simplified 44.4%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]

   4. Taylor expanded in i around inf 78.7%

      \[\leadsto \color{blue}{0.0625} \]

   if 1.04999999999999991e119 < beta < 7.4000000000000002e245 or 9.0000000000000007e258 < beta

   1. Initial program 0.3%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Step-by-step derivation

      1. associate-/l/ 0.0%

         \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]

      2. associate-*l* 0.0%

         \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]

      3. times-frac 2.4%

         \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]

   3. Simplified 26.9%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]

   4. Taylor expanded in beta around inf 38.7%

      \[\leadsto \color{blue}{\frac{i \cdot \left(i + \alpha\right)}{{\beta}^{2}}} \]
   5. Step-by-step derivation

      1. associate-/l* 40.2%

         \[\leadsto \color{blue}{\frac{i}{\frac{{\beta}^{2}}{i + \alpha}}} \]

      2. unpow2 40.2%

         \[\leadsto \frac{i}{\frac{\color{blue}{\beta \cdot \beta}}{i + \alpha}} \]

      3. +-commutative 40.2%

         \[\leadsto \frac{i}{\frac{\beta \cdot \beta}{\color{blue}{\alpha + i}}} \]

   6. Simplified 40.2%

      \[\leadsto \color{blue}{\frac{i}{\frac{\beta \cdot \beta}{\alpha + i}}} \]
   7. Step-by-step derivation

      1. associate-/r/ 40.2%

         \[\leadsto \color{blue}{\frac{i}{\beta \cdot \beta} \cdot \left(\alpha + i\right)} \]

      2. +-commutative 40.2%

         \[\leadsto \frac{i}{\beta \cdot \beta} \cdot \color{blue}{\left(i + \alpha\right)} \]

   8. Applied egg-rr 40.2%

      \[\leadsto \color{blue}{\frac{i}{\beta \cdot \beta} \cdot \left(i + \alpha\right)} \]

   9. Taylor expanded in i around 0 38.7%

      \[\leadsto \color{blue}{\frac{i \cdot \alpha}{{\beta}^{2}} + \frac{{i}^{2}}{{\beta}^{2}}} \]
   10. Step-by-step derivation

       1. associate-*l/ 39.0%

          \[\leadsto \color{blue}{\frac{i}{{\beta}^{2}} \cdot \alpha} + \frac{{i}^{2}}{{\beta}^{2}} \]

       2. unpow2 39.0%

          \[\leadsto \frac{i}{\color{blue}{\beta \cdot \beta}} \cdot \alpha + \frac{{i}^{2}}{{\beta}^{2}} \]

       3. unpow2 39.0%

          \[\leadsto \frac{i}{\beta \cdot \beta} \cdot \alpha + \frac{\color{blue}{i \cdot i}}{{\beta}^{2}} \]

       4. associate-*r/ 40.2%

          \[\leadsto \frac{i}{\beta \cdot \beta} \cdot \alpha + \color{blue}{i \cdot \frac{i}{{\beta}^{2}}} \]

       5. unpow2 40.2%

          \[\leadsto \frac{i}{\beta \cdot \beta} \cdot \alpha + i \cdot \frac{i}{\color{blue}{\beta \cdot \beta}} \]

       6. *-commutative 40.2%

          \[\leadsto \frac{i}{\beta \cdot \beta} \cdot \alpha + \color{blue}{\frac{i}{\beta \cdot \beta} \cdot i} \]

       7. distribute-lft-out 40.2%

          \[\leadsto \color{blue}{\frac{i}{\beta \cdot \beta} \cdot \left(\alpha + i\right)} \]

       8. unpow2 40.2%

          \[\leadsto \frac{i}{\color{blue}{{\beta}^{2}}} \cdot \left(\alpha + i\right) \]

       9. +-commutative 40.2%

          \[\leadsto \frac{i}{{\beta}^{2}} \cdot \color{blue}{\left(i + \alpha\right)} \]

       10. associate-*l/ 38.7%

           \[\leadsto \color{blue}{\frac{i \cdot \left(i + \alpha\right)}{{\beta}^{2}}} \]

       11. unpow2 38.7%

           \[\leadsto \frac{i \cdot \left(i + \alpha\right)}{\color{blue}{\beta \cdot \beta}} \]

       12. times-frac 73.7%

           \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}} \]

   11. Simplified 73.7%

       \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.05 \cdot 10^{+119}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 7.4 \cdot 10^{+245} \lor \neg \left(\beta \leq 9 \cdot 10^{+258}\right):\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \]

Alternative 2: 81.1% accurate, 4.0× speedup

Math

\[\begin{array}{l} [alpha, beta] = \mathsf{sort}([alpha, beta])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 9.5 \cdot 10^{+118}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 7.4 \cdot 10^{+245} \lor \neg \left(\beta \leq 9 \cdot 10^{+258}\right):\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \end{array} \]

FPCore

NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 9.5e+118)
   0.0625
   (if (or (<= beta 7.4e+245) (not (<= beta 9e+258)))
     (* (/ i beta) (/ i beta))
     0.0625)))

C

assert(alpha < beta);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 9.5e+118) {
		tmp = 0.0625;
	} else if ((beta <= 7.4e+245) || !(beta <= 9e+258)) {
		tmp = (i / beta) * (i / beta);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Fortran

NOTE: alpha and beta 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 <= 9.5d+118) then
        tmp = 0.0625d0
    else if ((beta <= 7.4d+245) .or. (.not. (beta <= 9d+258))) then
        tmp = (i / beta) * (i / beta)
    else
        tmp = 0.0625d0
    end if
    code = tmp
end function

Java

assert alpha < beta;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 9.5e+118) {
		tmp = 0.0625;
	} else if ((beta <= 7.4e+245) || !(beta <= 9e+258)) {
		tmp = (i / beta) * (i / beta);
	} else {
		tmp = 0.0625;
	}
	return tmp;
}

Python

[alpha, beta] = sort([alpha, beta])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 9.5e+118:
		tmp = 0.0625
	elif (beta <= 7.4e+245) or not (beta <= 9e+258):
		tmp = (i / beta) * (i / beta)
	else:
		tmp = 0.0625
	return tmp

Julia

alpha, beta = sort([alpha, beta])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 9.5e+118)
		tmp = 0.0625;
	elseif ((beta <= 7.4e+245) || !(beta <= 9e+258))
		tmp = Float64(Float64(i / beta) * Float64(i / beta));
	else
		tmp = 0.0625;
	end
	return tmp
end

MATLAB

alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 9.5e+118)
		tmp = 0.0625;
	elseif ((beta <= 7.4e+245) || ~((beta <= 9e+258)))
		tmp = (i / beta) * (i / beta);
	else
		tmp = 0.0625;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := If[LessEqual[beta, 9.5e+118], 0.0625, If[Or[LessEqual[beta, 7.4e+245], N[Not[LessEqual[beta, 9e+258]], $MachinePrecision]], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision], 0.0625]]

Derivation

1. Split input into 2 regimes

2. if beta < 9.49999999999999974e118 or 7.4000000000000002e245 < beta < 9.0000000000000007e258

   1. Initial program 20.2%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Step-by-step derivation

      1. associate-/l/ 18.2%

         \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]

      2. associate-*l* 18.1%

         \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]

      3. times-frac 26.1%

         \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]

   3. Simplified 44.4%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]

   4. Taylor expanded in i around inf 78.7%

      \[\leadsto \color{blue}{0.0625} \]

   if 9.49999999999999974e118 < beta < 7.4000000000000002e245 or 9.0000000000000007e258 < beta

   1. Initial program 0.3%

      \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
   2. Step-by-step derivation

      1. associate-/l/ 0.0%

         \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]

      2. associate-*l* 0.0%

         \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]

      3. times-frac 2.4%

         \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]

   3. Simplified 26.9%

      \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]

   4. Taylor expanded in beta around inf 38.7%

      \[\leadsto \color{blue}{\frac{i \cdot \left(i + \alpha\right)}{{\beta}^{2}}} \]
   5. Step-by-step derivation

      1. associate-/l* 40.2%

         \[\leadsto \color{blue}{\frac{i}{\frac{{\beta}^{2}}{i + \alpha}}} \]

      2. unpow2 40.2%

         \[\leadsto \frac{i}{\frac{\color{blue}{\beta \cdot \beta}}{i + \alpha}} \]

      3. +-commutative 40.2%

         \[\leadsto \frac{i}{\frac{\beta \cdot \beta}{\color{blue}{\alpha + i}}} \]

   6. Simplified 40.2%

      \[\leadsto \color{blue}{\frac{i}{\frac{\beta \cdot \beta}{\alpha + i}}} \]

   7. Taylor expanded in alpha around 0 40.2%

      \[\leadsto \frac{i}{\color{blue}{\frac{{\beta}^{2}}{i}}} \]
   8. Step-by-step derivation

      1. unpow2 40.2%

         \[\leadsto \frac{i}{\frac{\color{blue}{\beta \cdot \beta}}{i}} \]

   9. Simplified 40.2%

      \[\leadsto \frac{i}{\color{blue}{\frac{\beta \cdot \beta}{i}}} \]
   10. Step-by-step derivation

       1. associate-/r/ 40.2%

          \[\leadsto \color{blue}{\frac{i}{\beta \cdot \beta} \cdot i} \]

   11. Applied egg-rr 40.2%

       \[\leadsto \color{blue}{\frac{i}{\beta \cdot \beta} \cdot i} \]

   12. Taylor expanded in i around 0 39.0%

       \[\leadsto \color{blue}{\frac{{i}^{2}}{{\beta}^{2}}} \]
   13. Step-by-step derivation

       1. unpow2 39.0%

          \[\leadsto \frac{\color{blue}{i \cdot i}}{{\beta}^{2}} \]

       2. unpow2 39.0%

          \[\leadsto \frac{i \cdot i}{\color{blue}{\beta \cdot \beta}} \]

       3. times-frac 69.1%

          \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{i}{\beta}} \]

   14. Simplified 69.1%

       \[\leadsto \color{blue}{\frac{i}{\beta} \cdot \frac{i}{\beta}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 9.5 \cdot 10^{+118}:\\ \;\;\;\;0.0625\\ \mathbf{elif}\;\beta \leq 7.4 \cdot 10^{+245} \lor \neg \left(\beta \leq 9 \cdot 10^{+258}\right):\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\ \mathbf{else}:\\ \;\;\;\;0.0625\\ \end{array} \]

Alternative 3: 70.3% accurate, 53.0× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: alpha and beta 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;
public static double code(double alpha, double beta, double i) {
	return 0.0625;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 16.5%

   \[\frac{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \]
2. Step-by-step derivation

   1. associate-/l/ 14.8%

      \[\leadsto \color{blue}{\frac{\left(i \cdot \left(\left(\alpha + \beta\right) + i\right)\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)}} \]

   2. associate-*l* 14.8%

      \[\leadsto \frac{\color{blue}{i \cdot \left(\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)\right)}}{\left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1\right) \cdot \left(\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)\right)} \]

   3. times-frac 21.8%

      \[\leadsto \color{blue}{\frac{i}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right) - 1} \cdot \frac{\left(\left(\alpha + \beta\right) + i\right) \cdot \left(\beta \cdot \alpha + i \cdot \left(\left(\alpha + \beta\right) + i\right)\right)}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) \cdot \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}} \]

3. Simplified 41.2%

   \[\leadsto \color{blue}{\frac{i}{\mathsf{fma}\left(\alpha + \mathsf{fma}\left(i, 2, \beta\right), \alpha + \mathsf{fma}\left(i, 2, \beta\right), -1\right)} \cdot \left(\frac{\mathsf{fma}\left(i, i + \left(\alpha + \beta\right), \alpha \cdot \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)} \cdot \frac{i + \left(\alpha + \beta\right)}{\alpha + \mathsf{fma}\left(i, 2, \beta\right)}\right)} \]

4. Taylor expanded in i around inf 67.8%

   \[\leadsto \color{blue}{0.0625} \]

5. Final simplification 67.8%

   \[\leadsto 0.0625 \]

Reproduce

herbie shell --seed 2023200 
(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)))