Octave 3.8, jcobi/2

Percentage Accurate: 63.1% → 97.1%

Time: 9.6s

Alternatives: 14

Speedup: 9.5×

Specification

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

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.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
    t_0 = (alpha + beta) + (2.0d0 * i)
    code = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 63.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.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
    t_0 = (alpha + beta) + (2.0d0 * i)
    code = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.1% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t_0}}{2 + t_0} \leq -1:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\beta - \alpha}{\left(\alpha + \beta\right) + \mathsf{fma}\left(2, i, 2\right)} \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)} + 1}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (if (<= (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ 2.0 t_0)) -1.0)
     (/ (/ (+ (- beta beta) (+ (* i 4.0) (+ 2.0 (* beta 2.0)))) alpha) 2.0)
     (/
      (+
       (*
        (/ (- beta alpha) (+ (+ alpha beta) (fma 2.0 i 2.0)))
        (/ (+ alpha beta) (fma 2.0 i (+ alpha beta))))
       1.0)
      2.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= -1.0) {
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0;
	} else {
		tmp = ((((beta - alpha) / ((alpha + beta) + fma(2.0, i, 2.0))) * ((alpha + beta) / fma(2.0, i, (alpha + beta)))) + 1.0) / 2.0;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(2.0 + t_0)) <= -1.0)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(Float64(i * 4.0) + Float64(2.0 + Float64(beta * 2.0)))) / alpha) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(Float64(beta - alpha) / Float64(Float64(alpha + beta) + fma(2.0, i, 2.0))) * Float64(Float64(alpha + beta) / fma(2.0, i, Float64(alpha + beta)))) + 1.0) / 2.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < -1

   1. Initial program 1.6%

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

      1. associate-/l/ 0.8%

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

      2. *-commutative 0.8%

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

      3. times-frac 22.7%

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

      4. associate-+l+ 22.7%

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

      5. fma-def 22.7%

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

      6. +-commutative 22.7%

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

      7. fma-def 22.7%

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

   3. Simplified 22.7%

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

   4. Taylor expanded in alpha around inf 82.9%

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

   if -1 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2))

   1. Initial program 84.6%

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

      1. associate-/l/ 84.1%

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

      2. *-commutative 84.1%

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

      3. times-frac 100.0%

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

      4. associate-+l+ 100.0%

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

      5. fma-def 100.0%

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

      6. +-commutative 100.0%

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

      7. fma-def 100.0%

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

   3. Simplified 100.0%

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

4. Final simplification 96.8%

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

Alternative 2: 96.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := 2 + t_0\\ t_2 := \frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t_0}}{t_1}\\ \mathbf{if}\;t_2 \leq -1:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{elif}\;t_2 \leq 1:\\ \;\;\;\;\frac{t_2 + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{t_1}}{2}\\ \end{array} \end{array} \]

FPCore

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

C

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

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
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = 2.0d0 + t_0
    t_2 = (((alpha + beta) * (beta - alpha)) / t_0) / t_1
    if (t_2 <= (-1.0d0)) then
        tmp = (((beta - beta) + ((i * 4.0d0) + (2.0d0 + (beta * 2.0d0)))) / alpha) / 2.0d0
    else if (t_2 <= 1.0d0) then
        tmp = (t_2 + 1.0d0) / 2.0d0
    else
        tmp = (1.0d0 + (beta / t_1)) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = 2.0 + t_0
	t_2 = (((alpha + beta) * (beta - alpha)) / t_0) / t_1
	tmp = 0
	if t_2 <= -1.0:
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0
	elif t_2 <= 1.0:
		tmp = (t_2 + 1.0) / 2.0
	else:
		tmp = (1.0 + (beta / t_1)) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(2.0 + t_0)
	t_2 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / t_1)
	tmp = 0.0
	if (t_2 <= -1.0)
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(Float64(i * 4.0) + Float64(2.0 + Float64(beta * 2.0)))) / alpha) / 2.0);
	elseif (t_2 <= 1.0)
		tmp = Float64(Float64(t_2 + 1.0) / 2.0);
	else
		tmp = Float64(Float64(1.0 + Float64(beta / t_1)) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = 2.0 + t_0;
	t_2 = (((alpha + beta) * (beta - alpha)) / t_0) / t_1;
	tmp = 0.0;
	if (t_2 <= -1.0)
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0;
	elseif (t_2 <= 1.0)
		tmp = (t_2 + 1.0) / 2.0;
	else
		tmp = (1.0 + (beta / t_1)) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < -1

   1. Initial program 1.6%

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

      1. associate-/l/ 0.8%

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

      2. *-commutative 0.8%

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

      3. times-frac 22.7%

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

      4. associate-+l+ 22.7%

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

      5. fma-def 22.7%

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

      6. +-commutative 22.7%

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

      7. fma-def 22.7%

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

   3. Simplified 22.7%

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

   4. Taylor expanded in alpha around inf 82.9%

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

   if -1 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2)) < 1

   1. Initial program 100.0%

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

   if 1 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 2 i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 2 i)) 2))

   1. Initial program 8.7%

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

   2. Taylor expanded in beta around inf 98.4%

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

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq -1:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{elif}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} \leq 1:\\ \;\;\;\;\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)} + 1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{2}\\ \end{array} \]

Alternative 3: 89.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 3 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 3e+110)
   (/ (+ 1.0 (/ beta (+ 2.0 (+ (+ alpha beta) (* 2.0 i))))) 2.0)
   (/ (/ (+ (- beta beta) (+ (* i 4.0) (+ 2.0 (* beta 2.0)))) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 3e+110) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0;
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 3d+110) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (((beta - beta) + ((i * 4.0d0) + (2.0d0 + (beta * 2.0d0)))) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 3e+110) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 3e+110:
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0
	else:
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 3e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(2.0 + Float64(Float64(alpha + beta) + Float64(2.0 * i))))) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(beta - beta) + Float64(Float64(i * 4.0) + Float64(2.0 + Float64(beta * 2.0)))) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 3e+110)
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	else
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 3e+110], N[(N[(1.0 + N[(beta / N[(2.0 + N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(beta - beta), $MachinePrecision] + N[(N[(i * 4.0), $MachinePrecision] + N[(2.0 + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 3.00000000000000007e110

   1. Initial program 84.5%

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

   2. Taylor expanded in beta around inf 96.3%

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

   if 3.00000000000000007e110 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 30.1%

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

      4. associate-+l+ 30.1%

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

      5. fma-def 30.1%

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

      6. +-commutative 30.1%

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

      7. fma-def 30.1%

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

   3. Simplified 30.1%

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

   4. Taylor expanded in alpha around inf 75.7%

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

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 3 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \end{array} \]

Alternative 4: 89.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 2.8 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha} + 0.5 \cdot \frac{2 + i \cdot 4}{\alpha}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 2.8e+110)
   (/ (+ 1.0 (/ beta (+ 2.0 (+ (+ alpha beta) (* 2.0 i))))) 2.0)
   (+ (/ beta alpha) (* 0.5 (/ (+ 2.0 (* i 4.0)) alpha)))))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.8e+110) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 2.8d+110) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (beta / alpha) + (0.5d0 * ((2.0d0 + (i * 4.0d0)) / alpha))
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.8e+110) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 2.8e+110:
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0
	else:
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha))
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 2.8e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(2.0 + Float64(Float64(alpha + beta) + Float64(2.0 * i))))) / 2.0);
	else
		tmp = Float64(Float64(beta / alpha) + Float64(0.5 * Float64(Float64(2.0 + Float64(i * 4.0)) / alpha)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 2.8e+110)
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	else
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 2.8e+110], N[(N[(1.0 + N[(beta / N[(2.0 + N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(beta / alpha), $MachinePrecision] + N[(0.5 * N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 2.79999999999999987e110

   1. Initial program 84.5%

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

   2. Taylor expanded in beta around inf 96.3%

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

   if 2.79999999999999987e110 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 30.1%

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

      4. associate-+l+ 30.1%

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

      5. fma-def 30.1%

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

      6. +-commutative 30.1%

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

      7. fma-def 30.1%

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

   3. Simplified 30.1%

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

   4. Taylor expanded in alpha around inf 75.7%

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

   5. Taylor expanded in beta around 0 75.6%

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

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 2.8 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha} + 0.5 \cdot \frac{2 + i \cdot 4}{\alpha}\\ \end{array} \]

Alternative 5: 83.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 1.36 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + \left(\alpha + 2\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha} + 0.5 \cdot \frac{2 + i \cdot 4}{\alpha}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 1.36e+110)
   (/ (+ 1.0 (/ beta (+ beta (+ alpha 2.0)))) 2.0)
   (+ (/ beta alpha) (* 0.5 (/ (+ 2.0 (* i 4.0)) alpha)))))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.36e+110) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 1.36d+110) then
        tmp = (1.0d0 + (beta / (beta + (alpha + 2.0d0)))) / 2.0d0
    else
        tmp = (beta / alpha) + (0.5d0 * ((2.0d0 + (i * 4.0d0)) / alpha))
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.36e+110) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 1.36e+110:
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0
	else:
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha))
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 1.36e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + Float64(alpha + 2.0)))) / 2.0);
	else
		tmp = Float64(Float64(beta / alpha) + Float64(0.5 * Float64(Float64(2.0 + Float64(i * 4.0)) / alpha)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 1.36e+110)
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	else
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 1.36e+110], N[(N[(1.0 + N[(beta / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(beta / alpha), $MachinePrecision] + N[(0.5 * N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.36000000000000003e110

   1. Initial program 84.5%

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

   2. Taylor expanded in beta around inf 96.3%

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

   3. Taylor expanded in i around 0 89.1%

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

   if 1.36000000000000003e110 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 30.1%

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

      4. associate-+l+ 30.1%

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

      5. fma-def 30.1%

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

      6. +-commutative 30.1%

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

      7. fma-def 30.1%

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

   3. Simplified 30.1%

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

   4. Taylor expanded in alpha around inf 75.7%

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

   5. Taylor expanded in beta around 0 75.6%

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

4. Final simplification 86.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.36 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + \left(\alpha + 2\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha} + 0.5 \cdot \frac{2 + i \cdot 4}{\alpha}\\ \end{array} \]

Alternative 6: 89.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 3.2 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + \left(2 + 2 \cdot i\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha} + 0.5 \cdot \frac{2 + i \cdot 4}{\alpha}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 3.2e+110)
   (/ (+ 1.0 (/ beta (+ beta (+ 2.0 (* 2.0 i))))) 2.0)
   (+ (/ beta alpha) (* 0.5 (/ (+ 2.0 (* i 4.0)) alpha)))))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 3.2e+110) {
		tmp = (1.0 + (beta / (beta + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 3.2d+110) then
        tmp = (1.0d0 + (beta / (beta + (2.0d0 + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (beta / alpha) + (0.5d0 * ((2.0d0 + (i * 4.0d0)) / alpha))
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 3.2e+110) {
		tmp = (1.0 + (beta / (beta + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 3.2e+110:
		tmp = (1.0 + (beta / (beta + (2.0 + (2.0 * i))))) / 2.0
	else:
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha))
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 3.2e+110)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + Float64(2.0 + Float64(2.0 * i))))) / 2.0);
	else
		tmp = Float64(Float64(beta / alpha) + Float64(0.5 * Float64(Float64(2.0 + Float64(i * 4.0)) / alpha)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 3.2e+110)
		tmp = (1.0 + (beta / (beta + (2.0 + (2.0 * i))))) / 2.0;
	else
		tmp = (beta / alpha) + (0.5 * ((2.0 + (i * 4.0)) / alpha));
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 3.2e+110], N[(N[(1.0 + N[(beta / N[(beta + N[(2.0 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(beta / alpha), $MachinePrecision] + N[(0.5 * N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 3.19999999999999994e110

   1. Initial program 84.5%

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

   2. Taylor expanded in beta around inf 96.3%

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

   3. Taylor expanded in alpha around 0 96.3%

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

   if 3.19999999999999994e110 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 30.1%

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

      4. associate-+l+ 30.1%

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

      5. fma-def 30.1%

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

      6. +-commutative 30.1%

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

      7. fma-def 30.1%

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

   3. Simplified 30.1%

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

   4. Taylor expanded in alpha around inf 75.7%

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

   5. Taylor expanded in beta around 0 75.6%

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

4. Final simplification 92.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 3.2 \cdot 10^{+110}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + \left(2 + 2 \cdot i\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\beta}{\alpha} + 0.5 \cdot \frac{2 + i \cdot 4}{\alpha}\\ \end{array} \]

Alternative 7: 80.9% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 2.8 \cdot 10^{+117}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + \left(\alpha + 2\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 2.8e+117)
   (/ (+ 1.0 (/ beta (+ beta (+ alpha 2.0)))) 2.0)
   (/ (/ (+ 2.0 (* i 4.0)) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.8e+117) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 2.8d+117) then
        tmp = (1.0d0 + (beta / (beta + (alpha + 2.0d0)))) / 2.0d0
    else
        tmp = ((2.0d0 + (i * 4.0d0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.8e+117) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 2.8e+117:
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0
	else:
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 2.8e+117)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + Float64(alpha + 2.0)))) / 2.0);
	else
		tmp = Float64(Float64(Float64(2.0 + Float64(i * 4.0)) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 2.8e+117)
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	else
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 2.8e+117], N[(N[(1.0 + N[(beta / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 2.79999999999999997e117

   1. Initial program 83.8%

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

   2. Taylor expanded in beta around inf 95.9%

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

   3. Taylor expanded in i around 0 88.8%

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

   if 2.79999999999999997e117 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 29.2%

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

      4. associate-+l+ 29.2%

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

      5. fma-def 29.2%

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

      6. +-commutative 29.2%

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

      7. fma-def 29.2%

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

   3. Simplified 29.2%

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

   4. Taylor expanded in alpha around inf 76.6%

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

   5. Taylor expanded in beta around 0 60.8%

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

4. Final simplification 83.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 2.8 \cdot 10^{+117}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + \left(\alpha + 2\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \]

Alternative 8: 75.7% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq 2 \cdot 10^{+133}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= i 2e+133) (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0) 0.5))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (i <= 2e+133) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = 0.5;
	}
	return tmp;
}

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) :: tmp
    if (i <= 2d+133) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (i <= 2e+133) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if i <= 2e+133:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = 0.5
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (i <= 2e+133)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = 0.5;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (i <= 2e+133)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[i, 2e+133], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], 0.5]

Derivation

1. Split input into 2 regimes

2. if i < 2e133

   1. Initial program 66.6%

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

   2. Taylor expanded in beta around inf 79.6%

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

   3. Taylor expanded in i around 0 78.2%

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

   4. Taylor expanded in alpha around 0 78.2%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 2e133 < i

   1. Initial program 74.7%

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

      1. associate-/l/ 74.4%

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

      2. *-commutative 74.4%

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

      3. times-frac 93.8%

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

      4. associate-+l+ 93.8%

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

      5. fma-def 93.8%

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

      6. +-commutative 93.8%

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

      7. fma-def 93.8%

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

   3. Simplified 93.8%

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

   4. Taylor expanded in i around inf 91.2%

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

4. Final simplification 82.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq 2 \cdot 10^{+133}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]

Alternative 9: 80.6% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 6.9 \cdot 10^{+120}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 6.9e+120)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ (+ 2.0 (* i 4.0)) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 6.9e+120) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 6.9d+120) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((2.0d0 + (i * 4.0d0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 6.9e+120) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 6.9e+120:
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0
	else:
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 6.9e+120)
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(beta + 2.0))) / 2.0);
	else
		tmp = Float64(Float64(Float64(2.0 + Float64(i * 4.0)) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 6.9e+120)
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	else
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 6.9e+120], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 6.9000000000000001e120

   1. Initial program 83.8%

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

   2. Taylor expanded in beta around inf 95.9%

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

   3. Taylor expanded in i around 0 88.8%

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

   4. Taylor expanded in alpha around 0 88.8%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   if 6.9000000000000001e120 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 29.2%

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

      4. associate-+l+ 29.2%

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

      5. fma-def 29.2%

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

      6. +-commutative 29.2%

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

      7. fma-def 29.2%

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

   3. Simplified 29.2%

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

   4. Taylor expanded in alpha around inf 76.6%

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

   5. Taylor expanded in beta around 0 60.8%

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

4. Final simplification 83.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 6.9 \cdot 10^{+120}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + i \cdot 4}{\alpha}}{2}\\ \end{array} \]

Alternative 10: 71.8% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 2.0) (/ (+ 1.0 (* beta 0.5)) 2.0) 1.0))

C

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

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) :: tmp
    if (beta <= 2.0d0) then
        tmp = (1.0d0 + (beta * 0.5d0)) / 2.0d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta, i):
	tmp = 0
	if beta <= 2.0:
		tmp = (1.0 + (beta * 0.5)) / 2.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 2.0)
		tmp = Float64(Float64(1.0 + Float64(beta * 0.5)) / 2.0);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 2.0)
		tmp = (1.0 + (beta * 0.5)) / 2.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[beta, 2.0], N[(N[(1.0 + N[(beta * 0.5), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 2

   1. Initial program 79.3%

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

   2. Taylor expanded in beta around inf 82.8%

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

   3. Taylor expanded in i around 0 82.6%

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

   4. Taylor expanded in alpha around 0 82.6%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   5. Taylor expanded in beta around 0 81.7%

      \[\leadsto \frac{\color{blue}{0.5 \cdot \beta} + 1}{2} \]

   if 2 < beta

   1. Initial program 46.4%

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

      1. associate-/l/ 45.0%

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

      2. *-commutative 45.0%

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

      3. times-frac 88.1%

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

      4. associate-+l+ 88.1%

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

      5. fma-def 88.1%

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

      6. +-commutative 88.1%

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

      7. fma-def 88.1%

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

   3. Simplified 88.1%

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

   4. Taylor expanded in beta around inf 65.8%

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

4. Final simplification 76.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 2:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 11: 71.9% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.65:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 1.65) (/ (+ 1.0 (* beta 0.5)) 2.0) (/ (- 2.0 (/ 2.0 beta)) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.65) {
		tmp = (1.0 + (beta * 0.5)) / 2.0;
	} else {
		tmp = (2.0 - (2.0 / beta)) / 2.0;
	}
	return tmp;
}

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) :: tmp
    if (beta <= 1.65d0) then
        tmp = (1.0d0 + (beta * 0.5d0)) / 2.0d0
    else
        tmp = (2.0d0 - (2.0d0 / beta)) / 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.65) {
		tmp = (1.0 + (beta * 0.5)) / 2.0;
	} else {
		tmp = (2.0 - (2.0 / beta)) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.65:
		tmp = (1.0 + (beta * 0.5)) / 2.0
	else:
		tmp = (2.0 - (2.0 / beta)) / 2.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.65)
		tmp = Float64(Float64(1.0 + Float64(beta * 0.5)) / 2.0);
	else
		tmp = Float64(Float64(2.0 - Float64(2.0 / beta)) / 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.65)
		tmp = (1.0 + (beta * 0.5)) / 2.0;
	else
		tmp = (2.0 - (2.0 / beta)) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[beta, 1.65], N[(N[(1.0 + N[(beta * 0.5), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(2.0 - N[(2.0 / beta), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if beta < 1.6499999999999999

   1. Initial program 79.3%

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

   2. Taylor expanded in beta around inf 82.8%

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

   3. Taylor expanded in i around 0 82.6%

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

   4. Taylor expanded in alpha around 0 82.6%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   5. Taylor expanded in beta around 0 81.7%

      \[\leadsto \frac{\color{blue}{0.5 \cdot \beta} + 1}{2} \]

   if 1.6499999999999999 < beta

   1. Initial program 46.4%

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

   2. Taylor expanded in beta around inf 85.0%

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

   3. Taylor expanded in i around 0 67.0%

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

   4. Taylor expanded in alpha around 0 66.4%

      \[\leadsto \frac{\color{blue}{\frac{\beta}{\beta + 2}} + 1}{2} \]

   5. Taylor expanded in beta around inf 66.2%

      \[\leadsto \frac{\color{blue}{2 - 2 \cdot \frac{1}{\beta}}}{2} \]
   6. Step-by-step derivation

      1. associate-*r/ 66.2%

         \[\leadsto \frac{2 - \color{blue}{\frac{2 \cdot 1}{\beta}}}{2} \]

      2. metadata-eval 66.2%

         \[\leadsto \frac{2 - \frac{\color{blue}{2}}{\beta}}{2} \]

   7. Simplified 66.2%

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

4. Final simplification 76.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.65:\\ \;\;\;\;\frac{1 + \beta \cdot 0.5}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \]

Alternative 12: 65.1% accurate, 5.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\alpha \leq 6 \cdot 10^{+110}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\alpha}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 6e+110) 0.5 (/ 1.0 alpha)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 6e+110) {
		tmp = 0.5;
	} else {
		tmp = 1.0 / alpha;
	}
	return tmp;
}

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) :: tmp
    if (alpha <= 6d+110) then
        tmp = 0.5d0
    else
        tmp = 1.0d0 / alpha
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 6e+110) {
		tmp = 0.5;
	} else {
		tmp = 1.0 / alpha;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 6e+110:
		tmp = 0.5
	else:
		tmp = 1.0 / alpha
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 6e+110)
		tmp = 0.5;
	else
		tmp = Float64(1.0 / alpha);
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 6e+110)
		tmp = 0.5;
	else
		tmp = 1.0 / alpha;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 6e+110], 0.5, N[(1.0 / alpha), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 6.00000000000000014e110

   1. Initial program 84.5%

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

      1. associate-/l/ 84.1%

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

      2. *-commutative 84.1%

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

      3. times-frac 98.6%

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

      4. associate-+l+ 98.6%

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

      5. fma-def 98.6%

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

      6. +-commutative 98.6%

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

      7. fma-def 98.6%

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

   3. Simplified 98.6%

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

   4. Taylor expanded in i around inf 77.3%

      \[\leadsto \frac{\color{blue}{1}}{2} \]

   if 6.00000000000000014e110 < alpha

   1. Initial program 3.5%

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

      1. associate-/l/ 2.6%

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

      2. *-commutative 2.6%

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

      3. times-frac 30.1%

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

      4. associate-+l+ 30.1%

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

      5. fma-def 30.1%

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

      6. +-commutative 30.1%

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

      7. fma-def 30.1%

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

   3. Simplified 30.1%

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

   4. Taylor expanded in alpha around inf 75.7%

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

   5. Taylor expanded in beta around 0 60.5%

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

   6. Taylor expanded in i around 0 40.2%

      \[\leadsto \color{blue}{\frac{1}{\alpha}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 70.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 6 \cdot 10^{+110}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\alpha}\\ \end{array} \]

Alternative 13: 72.7% accurate, 9.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 1.06 \cdot 10^{+23}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i) :precision binary64 (if (<= beta 1.06e+23) 0.5 1.0))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.06e+23) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

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) :: tmp
    if (beta <= 1.06d+23) then
        tmp = 0.5d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.06e+23) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if beta <= 1.06e+23:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.06e+23)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 1.06e+23)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[beta, 1.06e+23], 0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 1.06e23

   1. Initial program 78.3%

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

      1. associate-/l/ 78.1%

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

      2. *-commutative 78.1%

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

      3. times-frac 83.2%

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

      4. associate-+l+ 83.2%

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

      5. fma-def 83.2%

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

      6. +-commutative 83.2%

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

      7. fma-def 83.2%

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

   3. Simplified 83.2%

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

   4. Taylor expanded in i around inf 79.6%

      \[\leadsto \frac{\color{blue}{1}}{2} \]

   if 1.06e23 < beta

   1. Initial program 46.8%

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

      1. associate-/l/ 45.3%

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

      2. *-commutative 45.3%

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

      3. times-frac 91.1%

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

      4. associate-+l+ 91.1%

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

      5. fma-def 91.1%

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

      6. +-commutative 91.1%

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

      7. fma-def 91.1%

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

   3. Simplified 91.1%

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

   4. Taylor expanded in beta around inf 69.0%

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

4. Final simplification 76.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 1.06 \cdot 10^{+23}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 14: 61.7% accurate, 29.0× speedup

Math

\[\begin{array}{l} \\ 0.5 \end{array} \]

FPCore

(FPCore (alpha beta i) :precision binary64 0.5)

C

double code(double alpha, double beta, double i) {
	return 0.5;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = 0.5d0
end function

Java

public static double code(double alpha, double beta, double i) {
	return 0.5;
}

Python

def code(alpha, beta, i):
	return 0.5

Julia

function code(alpha, beta, i)
	return 0.5
end

MATLAB

function tmp = code(alpha, beta, i)
	tmp = 0.5;
end

Wolfram

code[alpha_, beta_, i_] := 0.5

Derivation

1. Initial program 69.0%

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

   1. associate-/l/ 68.5%

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

   2. *-commutative 68.5%

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

   3. times-frac 85.5%

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

   4. associate-+l+ 85.5%

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

   5. fma-def 85.5%

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

   6. +-commutative 85.5%

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

   7. fma-def 85.5%

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

3. Simplified 85.5%

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

4. Taylor expanded in i around inf 67.2%

   \[\leadsto \frac{\color{blue}{1}}{2} \]

5. Final simplification 67.2%

   \[\leadsto 0.5 \]

Reproduce

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