Octave 3.8, jcobi/4

Percentage Accurate: 16.7% → 83.5%

Time: 21.6s

Alternatives: 9

Speedup: 53.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 16.7% 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.5% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 47.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/ 41.4%

         \[\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. times-frac 99.8%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in i around 0 99.7%

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

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   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} \]

   3. Simplified 3.6%

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

   5. Taylor expanded in i around inf 77.6%

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

   6. Taylor expanded in alpha around 0 71.2%

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

   7. Taylor expanded in i around 0 71.2%

      \[\leadsto \color{blue}{\frac{\left(0.0625 \cdot i + 0.125 \cdot \beta\right) - 0.125 \cdot \left(\alpha + \beta\right)}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq \infty:\\ \;\;\;\;\frac{i \cdot \left(\beta + \left(i + \alpha\right)\right)}{\left(i \cdot \left(i \cdot 4 + \left(\alpha + \beta\right) \cdot 4\right) + {\left(\alpha + \beta\right)}^{2}\right) + -1} \cdot \frac{\frac{\mathsf{fma}\left(i, \beta + \left(i + \alpha\right), \alpha \cdot \beta\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)}}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 83.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

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

   3. Taylor expanded in alpha around 0 42.8%

      \[\leadsto \frac{\color{blue}{\frac{{i}^{2} \cdot {\left(\beta + i\right)}^{2}}{{\left(\beta + 2 \cdot i\right)}^{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. associate-/l* 91.4%

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

   5. Simplified 91.4%

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

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   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} \]

   3. Simplified 3.6%

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

   5. Taylor expanded in i around inf 77.6%

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

   6. Taylor expanded in alpha around 0 71.2%

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

   7. Taylor expanded in i around 0 71.2%

      \[\leadsto \color{blue}{\frac{\left(0.0625 \cdot i + 0.125 \cdot \beta\right) - 0.125 \cdot \left(\alpha + \beta\right)}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq \infty:\\ \;\;\;\;\frac{{i}^{2} \cdot \frac{{\left(i + \beta\right)}^{2}}{{\left(\beta + i \cdot 2\right)}^{2}}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 82.9% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 47.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. Add Preprocessing
   3. Step-by-step derivation

      1. times-frac 99.6%

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

      2. +-commutative 99.6%

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

      3. associate-+r+ 99.6%

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

      4. +-commutative 99.6%

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

      5. +-commutative 99.6%

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

      6. *-commutative 99.6%

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

      7. fma-undefine 99.6%

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

      8. *-commutative 99.6%

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

      9. +-commutative 99.6%

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

      10. fma-undefine 99.6%

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

      11. associate-+r+ 99.6%

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

      12. +-commutative 99.6%

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

      13. +-commutative 99.6%

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

      14. *-commutative 99.6%

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

      15. fma-undefine 99.6%

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

   4. Applied egg-rr 99.6%

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

   5. Taylor expanded in alpha around 0 91.5%

      \[\leadsto \frac{\frac{i \cdot \left(\beta + \left(i + \alpha\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \color{blue}{\frac{i \cdot \left(\beta + i\right)}{\beta + 2 \cdot i}}}{\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 0 91.5%

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

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   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} \]

   3. Simplified 3.6%

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

   5. Taylor expanded in i around inf 77.6%

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

   6. Taylor expanded in alpha around 0 71.2%

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

   7. Taylor expanded in i around 0 71.2%

      \[\leadsto \color{blue}{\frac{\left(0.0625 \cdot i + 0.125 \cdot \beta\right) - 0.125 \cdot \left(\alpha + \beta\right)}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq \infty:\\ \;\;\;\;\frac{\frac{i \cdot \left(\beta + \left(i + \alpha\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{\left(i \cdot \left(i \cdot 4 + \left(\alpha + \beta\right) \cdot 4\right) + {\left(\alpha + \beta\right)}^{2}\right) + -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 82.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < +inf.0

   1. Initial program 47.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. Add Preprocessing
   3. Step-by-step derivation

      1. times-frac 99.6%

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

      2. +-commutative 99.6%

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

      3. associate-+r+ 99.6%

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

      4. +-commutative 99.6%

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

      5. +-commutative 99.6%

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

      6. *-commutative 99.6%

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

      7. fma-undefine 99.6%

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

      8. *-commutative 99.6%

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

      9. +-commutative 99.6%

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

      10. fma-undefine 99.6%

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

      11. associate-+r+ 99.6%

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

      12. +-commutative 99.6%

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

      13. +-commutative 99.6%

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

      14. *-commutative 99.6%

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

      15. fma-undefine 99.6%

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

   4. Applied egg-rr 99.6%

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

   5. Taylor expanded in alpha around 0 91.5%

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

   if +inf.0 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   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} \]

   3. Simplified 3.6%

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

   5. Taylor expanded in i around inf 77.6%

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

   6. Taylor expanded in alpha around 0 71.2%

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

   7. Taylor expanded in i around 0 71.2%

      \[\leadsto \color{blue}{\frac{\left(0.0625 \cdot i + 0.125 \cdot \beta\right) - 0.125 \cdot \left(\alpha + \beta\right)}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq \infty:\\ \;\;\;\;\frac{\frac{i \cdot \left(\beta + \left(i + \alpha\right)\right)}{\mathsf{fma}\left(i, 2, \alpha + \beta\right)} \cdot \frac{i \cdot \left(i + \beta\right)}{\beta + i \cdot 2}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 79.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64))) < 5.00000000000000024e-5

   1. Initial program 98.4%

      \[\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

   if 5.00000000000000024e-5 < (/.f64 (/.f64 (*.f64 (*.f64 i (+.f64 (+.f64 alpha beta) i)) (+.f64 (*.f64 beta alpha) (*.f64 i (+.f64 (+.f64 alpha beta) i)))) (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)))) (-.f64 (*.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) #s(literal 1 binary64)))

   1. Initial program 15.4%

      \[\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} \]

   3. Simplified 39.8%

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

   5. Taylor expanded in i around inf 83.6%

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

   6. Taylor expanded in alpha around 0 79.4%

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

   7. Taylor expanded in i around 0 79.4%

      \[\leadsto \color{blue}{\frac{\left(0.0625 \cdot i + 0.125 \cdot \beta\right) - 0.125 \cdot \left(\alpha + \beta\right)}{i}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1} \leq 5 \cdot 10^{-5}:\\ \;\;\;\;\frac{\frac{\left(i \cdot \left(i + \left(\alpha + \beta\right)\right)\right) \cdot \left(i \cdot \left(i + \left(\alpha + \beta\right)\right) + \alpha \cdot \beta\right)}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right)}}{\left(\left(\alpha + \beta\right) + i \cdot 2\right) \cdot \left(\left(\alpha + \beta\right) + i \cdot 2\right) + -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 77.0% accurate, 3.5× speedup

Math

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 19.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} \]

3. Simplified 42.5%

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

5. Taylor expanded in i around inf 80.0%

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

6. Taylor expanded in alpha around 0 75.8%

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

7. Taylor expanded in i around 0 75.9%

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

8. Final simplification 75.9%

   \[\leadsto \frac{\left(i \cdot 0.0625 + \beta \cdot 0.125\right) - \left(\alpha + \beta\right) \cdot 0.125}{i} \]
9. Add Preprocessing

Alternative 7: 77.0% accurate, 3.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 19.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} \]

3. Simplified 42.5%

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

5. Taylor expanded in i around inf 80.0%

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

6. Taylor expanded in alpha around 0 75.8%

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

7. Taylor expanded in i around inf 75.8%

   \[\leadsto \color{blue}{\left(0.0625 + 0.125 \cdot \frac{\beta}{i}\right) - 0.125 \cdot \frac{\alpha + \beta}{i}} \]
8. Add Preprocessing

Alternative 8: 73.7% accurate, 3.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 7.99999999999999968e217

   1. Initial program 20.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} \]

   3. Simplified 45.3%

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

   5. Taylor expanded in i around inf 80.1%

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

   if 7.99999999999999968e217 < 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} \]

   3. Simplified 5.6%

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

   5. Taylor expanded in i around inf 31.6%

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

   6. Taylor expanded in alpha around 0 32.0%

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

   7. Taylor expanded in i around 0 20.8%

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

      1. distribute-lft-out-- 20.8%

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

   9. Simplified 20.8%

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

Alternative 9: 70.7% accurate, 53.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 19.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} \]

3. Simplified 42.5%

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

5. Taylor expanded in i around inf 75.6%

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

Reproduce

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