Octave 3.8, jcobi/4

Percentage Accurate: 16.6% → 83.6%

Time: 14.2s

Alternatives: 6

Speedup: 115.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.6% 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.6% accurate, 3.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 4.6 \cdot 10^{+209}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \mathbf{else}:\\ \;\;\;\;\frac{i + \alpha}{\beta} \cdot \frac{i}{\beta}\\ \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 4.6e+209)
   (+ 0.0625 (/ 0.015625 (* i i)))
   (* (/ (+ i alpha) beta) (/ i beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 4.6e+209) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = ((i + alpha) / beta) * (i / beta);
	}
	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 <= 4.6d+209) then
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    else
        tmp = ((i + alpha) / beta) * (i / beta)
    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 <= 4.6e+209) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = ((i + alpha) / beta) * (i / beta);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 4.6e+209:
		tmp = 0.0625 + (0.015625 / (i * i))
	else:
		tmp = ((i + alpha) / beta) * (i / beta)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 4.6e+209)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	else
		tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i / beta));
	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 <= 4.6e+209)
		tmp = 0.0625 + (0.015625 / (i * i));
	else
		tmp = ((i + alpha) / beta) * (i / beta);
	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, 4.6e+209], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 4.60000000000000019e209

   1. Initial program 13.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in i around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 30.4

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

   5. Simplified 30.4%

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

   6. Taylor expanded in i around inf

      \[\leadsto \frac{\left(i \cdot i\right) \cdot \frac{1}{4}}{\color{blue}{4 \cdot {i}^{2}} - 1} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 26.8

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

   8. Simplified 26.8%

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

   9. Taylor expanded in i around inf

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

       1. +-lowering-+.f64 N/A

          \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

       2. associate-*r/ N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

       3. metadata-eval N/A

          \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

       4. /-lowering-/.f64 N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

       5. unpow2 N/A

          \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

       6. *-lowering-*.f64 79.9

          \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   11. Simplified 79.9%

       \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{i \cdot i}} \]

   if 4.60000000000000019e209 < beta

   1. Initial program 0.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 34.4

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

   5. Simplified 34.4%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-commutative N/A

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

      6. +-lowering-+.f64 N/A

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

      7. /-lowering-/.f64 78.8

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

   7. Applied egg-rr 78.8%

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

Alternative 2: 82.1% accurate, 3.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.15 \cdot 10^{+210}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \mathbf{else}:\\ \;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\ \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.15e+210)
   (+ 0.0625 (/ 0.015625 (* i i)))
   (* (/ i beta) (/ i beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.15e+210) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = (i / beta) * (i / beta);
	}
	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.15d+210) then
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    else
        tmp = (i / beta) * (i / beta)
    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.15e+210) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = (i / beta) * (i / beta);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.15e+210:
		tmp = 0.0625 + (0.015625 / (i * i))
	else:
		tmp = (i / beta) * (i / beta)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.15e+210)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	else
		tmp = Float64(Float64(i / beta) * Float64(i / beta));
	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.15e+210)
		tmp = 0.0625 + (0.015625 / (i * i));
	else
		tmp = (i / beta) * (i / beta);
	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.15e+210], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.1499999999999999e210

   1. Initial program 13.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in i around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 30.4

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

   5. Simplified 30.4%

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

   6. Taylor expanded in i around inf

      \[\leadsto \frac{\left(i \cdot i\right) \cdot \frac{1}{4}}{\color{blue}{4 \cdot {i}^{2}} - 1} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 26.8

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

   8. Simplified 26.8%

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

   9. Taylor expanded in i around inf

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

       1. +-lowering-+.f64 N/A

          \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

       2. associate-*r/ N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

       3. metadata-eval N/A

          \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

       4. /-lowering-/.f64 N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

       5. unpow2 N/A

          \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

       6. *-lowering-*.f64 79.9

          \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   11. Simplified 79.9%

       \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{i \cdot i}} \]

   if 1.1499999999999999e210 < beta

   1. Initial program 0.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 34.4

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

   5. Simplified 34.4%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-commutative N/A

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

      6. +-lowering-+.f64 N/A

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

      7. /-lowering-/.f64 78.8

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

   7. Applied egg-rr 78.8%

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

   8. Taylor expanded in i around inf

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

      1. /-lowering-/.f64 71.8

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

   10. Simplified 71.8%

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

Alternative 3: 77.0% accurate, 3.4× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.2 \cdot 10^{+205}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \mathbf{else}:\\ \;\;\;\;i \cdot \frac{\frac{i}{\beta}}{\beta}\\ \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 2.2e+205)
   (+ 0.0625 (/ 0.015625 (* i i)))
   (* i (/ (/ i beta) beta))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 2.2e+205) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = i * ((i / beta) / beta);
	}
	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 <= 2.2d+205) then
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    else
        tmp = i * ((i / beta) / beta)
    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 <= 2.2e+205) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = i * ((i / beta) / beta);
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 2.2e+205:
		tmp = 0.0625 + (0.015625 / (i * i))
	else:
		tmp = i * ((i / beta) / beta)
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 2.2e+205)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	else
		tmp = Float64(i * Float64(Float64(i / beta) / beta));
	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 <= 2.2e+205)
		tmp = 0.0625 + (0.015625 / (i * i));
	else
		tmp = i * ((i / beta) / beta);
	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, 2.2e+205], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(i * N[(N[(i / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.1999999999999998e205

   1. Initial program 13.8%

      \[\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. Add Preprocessing

   3. Taylor expanded in i around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 30.5

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

   5. Simplified 30.5%

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

   6. Taylor expanded in i around inf

      \[\leadsto \frac{\left(i \cdot i\right) \cdot \frac{1}{4}}{\color{blue}{4 \cdot {i}^{2}} - 1} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 26.9

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

   8. Simplified 26.9%

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

   9. Taylor expanded in i around inf

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

       1. +-lowering-+.f64 N/A

          \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

       2. associate-*r/ N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

       3. metadata-eval N/A

          \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

       4. /-lowering-/.f64 N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

       5. unpow2 N/A

          \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

       6. *-lowering-*.f64 80.3

          \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   11. Simplified 80.3%

       \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{i \cdot i}} \]

   if 2.1999999999999998e205 < beta

   1. Initial program 0.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 33.5

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

   5. Simplified 33.5%

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

      1. *-commutative N/A

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

      2. times-frac N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. +-commutative N/A

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

      6. +-lowering-+.f64 N/A

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

      7. /-lowering-/.f64 76.8

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

   7. Applied egg-rr 76.8%

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

      1. associate-*l/ N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. +-lowering-+.f64 N/A

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

      5. /-lowering-/.f64 N/A

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

      6. /-lowering-/.f64 51.8

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

   9. Applied egg-rr 51.8%

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

   10. Taylor expanded in i around inf

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

   12. Simplified 51.3%

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

Alternative 4: 74.1% accurate, 4.1× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2.8 \cdot 10^{+222}:\\ \;\;\;\;0.0625 + \frac{0.015625}{i \cdot i}\\ \mathbf{else}:\\ \;\;\;\;\alpha \cdot \frac{i}{\beta \cdot \beta}\\ \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 2.8e+222)
   (+ 0.0625 (/ 0.015625 (* i i)))
   (* alpha (/ i (* beta beta)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 2.8e+222) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = alpha * (i / (beta * beta));
	}
	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 <= 2.8d+222) then
        tmp = 0.0625d0 + (0.015625d0 / (i * i))
    else
        tmp = alpha * (i / (beta * beta))
    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 <= 2.8e+222) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = alpha * (i / (beta * beta));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 2.8e+222:
		tmp = 0.0625 + (0.015625 / (i * i))
	else:
		tmp = alpha * (i / (beta * beta))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 2.8e+222)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	else
		tmp = Float64(alpha * Float64(i / Float64(beta * beta)));
	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 <= 2.8e+222)
		tmp = 0.0625 + (0.015625 / (i * i));
	else
		tmp = alpha * (i / (beta * beta));
	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, 2.8e+222], N[(0.0625 + N[(0.015625 / N[(i * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(alpha * N[(i / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 2.8000000000000001e222

   1. Initial program 13.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. Add Preprocessing

   3. Taylor expanded in i around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 29.6

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

   5. Simplified 29.6%

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

   6. Taylor expanded in i around inf

      \[\leadsto \frac{\left(i \cdot i\right) \cdot \frac{1}{4}}{\color{blue}{4 \cdot {i}^{2}} - 1} \]
   7. Step-by-step derivation

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. unpow2 N/A

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

      4. *-lowering-*.f64 26.1

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

   8. Simplified 26.1%

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

   9. Taylor expanded in i around inf

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

       1. +-lowering-+.f64 N/A

          \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

       2. associate-*r/ N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

       3. metadata-eval N/A

          \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

       4. /-lowering-/.f64 N/A

          \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

       5. unpow2 N/A

          \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

       6. *-lowering-*.f64 79.2

          \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   11. Simplified 79.2%

       \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{i \cdot i}} \]

   if 2.8000000000000001e222 < beta

   1. Initial program 0.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in beta around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 N/A

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

      3. +-lowering-+.f64 N/A

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

      4. unpow2 N/A

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

      5. *-lowering-*.f64 41.1

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

   5. Simplified 41.1%

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

   6. Taylor expanded in alpha around inf

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

   8. Simplified 42.4%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. *-lowering-*.f64 43.2

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

   10. Applied egg-rr 43.2%

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

Alternative 5: 71.1% accurate, 5.8× speedup

Math

\[\begin{array}{l} [alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\ \\ 0.0625 + \frac{0.015625}{i \cdot 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.015625 (* i i))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	return 0.0625 + (0.015625 / (i * 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.015625d0 / (i * i))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 11.8%

   \[\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. Add Preprocessing

3. Taylor expanded in i around inf

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

   1. *-commutative N/A

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

   2. *-lowering-*.f64 N/A

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

   3. unpow2 N/A

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

   4. *-lowering-*.f64 31.0

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

5. Simplified 31.0%

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

6. Taylor expanded in i around inf

   \[\leadsto \frac{\left(i \cdot i\right) \cdot \frac{1}{4}}{\color{blue}{4 \cdot {i}^{2}} - 1} \]
7. Step-by-step derivation

   1. *-commutative N/A

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

   2. *-lowering-*.f64 N/A

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

   3. unpow2 N/A

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

   4. *-lowering-*.f64 23.3

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

8. Simplified 23.3%

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

9. Taylor expanded in i around inf

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

    1. +-lowering-+.f64 N/A

       \[\leadsto \color{blue}{\frac{1}{16} + \frac{1}{64} \cdot \frac{1}{{i}^{2}}} \]

    2. associate-*r/ N/A

       \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64} \cdot 1}{{i}^{2}}} \]

    3. metadata-eval N/A

       \[\leadsto \frac{1}{16} + \frac{\color{blue}{\frac{1}{64}}}{{i}^{2}} \]

    4. /-lowering-/.f64 N/A

       \[\leadsto \frac{1}{16} + \color{blue}{\frac{\frac{1}{64}}{{i}^{2}}} \]

    5. unpow2 N/A

       \[\leadsto \frac{1}{16} + \frac{\frac{1}{64}}{\color{blue}{i \cdot i}} \]

    6. *-lowering-*.f64 70.8

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

11. Simplified 70.8%

    \[\leadsto \color{blue}{0.0625 + \frac{0.015625}{i \cdot i}} \]
12. Add Preprocessing

Alternative 6: 70.8% accurate, 115.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

1. Initial program 11.8%

   \[\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. Add Preprocessing

3. Taylor expanded in i around inf

   \[\leadsto \color{blue}{\frac{1}{16}} \]
4. Step-by-step derivation

5. Simplified 70.7%

   \[\leadsto \color{blue}{0.0625} \]
6. Add Preprocessing

Reproduce

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