Octave 3.8, jcobi/2

Percentage Accurate: 63.2% → 97.6%

Time: 12.5s

Alternatives: 10

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.2% 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.6% 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 -0.5:\\ \;\;\;\;\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)) -0.5)
     (/ (/ (+ (- 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)) <= -0.5) {
		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)) <= -0.5)
		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], -0.5], 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)) < -0.5

   1. Initial program 1.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/ 1.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 1.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 15.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+ 15.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 15.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 15.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 15.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 15.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 alpha around inf 90.3%

      \[\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 -0.5 < (/.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 79.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/ 78.9%

         \[\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.9%

         \[\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 97.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 -0.5:\\ \;\;\;\;\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.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := 2 + t_0\\ \mathbf{if}\;\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t_0}}{t_1} \leq -0.5:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{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)))
   (if (<= (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) t_1) -0.5)
     (/ (/ (+ (- beta beta) (+ (* i 4.0) (+ 2.0 (* beta 2.0)))) alpha) 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 tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / t_1) <= -0.5) {
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 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) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = 2.0d0 + t_0
    if (((((alpha + beta) * (beta - alpha)) / t_0) / t_1) <= (-0.5d0)) then
        tmp = (((beta - beta) + ((i * 4.0d0) + (2.0d0 + (beta * 2.0d0)))) / alpha) / 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 tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / t_1) <= -0.5) {
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 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
	tmp = 0
	if ((((alpha + beta) * (beta - alpha)) / t_0) / t_1) <= -0.5:
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 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)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / t_1) <= -0.5)
		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(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;
	tmp = 0.0;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / t_1) <= -0.5)
		tmp = (((beta - beta) + ((i * 4.0) + (2.0 + (beta * 2.0)))) / alpha) / 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]}, If[LessEqual[N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision], -0.5], 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[(1.0 + N[(beta / t$95$1), $MachinePrecision]), $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)) < -0.5

   1. Initial program 1.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/ 1.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 1.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 15.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+ 15.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 15.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 15.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 15.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 15.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 alpha around inf 90.3%

      \[\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 -0.5 < (/.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 79.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 98.6%

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

4. Final simplification 96.7%

   \[\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 -0.5:\\ \;\;\;\;\frac{\frac{\left(\beta - \beta\right) + \left(i \cdot 4 + \left(2 + \beta \cdot 2\right)\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{2 + \left(\left(\alpha + \beta\right) + 2 \cdot i\right)}}{2}\\ \end{array} \]

Alternative 3: 88.7% accurate, 1.5× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2e+45) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (((beta + (2.0 * i)) + (beta + (2.0 + (2.0 * i)))) / 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 <= 2d+45) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (((beta + (2.0d0 * i)) + (beta + (2.0d0 + (2.0d0 * i)))) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 2e+45)
		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 + Float64(2.0 * i)) + Float64(beta + Float64(2.0 + Float64(2.0 * i)))) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 2e+45], 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 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision] + N[(beta + N[(2.0 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.9999999999999999e45

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

   if 1.9999999999999999e45 < alpha

   1. Initial program 11.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/ 10.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 10.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 33.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. fma-def 33.5%

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

      5. associate-+l+ 33.5%

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

      6. fma-def 33.5%

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

      7. associate-+l+ 33.5%

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

      8. +-commutative 33.5%

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

      9. fma-def 33.5%

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

   3. Simplified 33.5%

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

   4. Taylor expanded in alpha around inf 72.4%

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

4. Final simplification 91.2%

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

Alternative 4: 83.0% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 1.7e+189)
   (/ (+ 1.0 (/ beta (+ 2.0 (+ (+ alpha beta) (* 2.0 i))))) 2.0)
   (/ (/ (- (+ beta beta) -2.0) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.7e+189) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (((beta + 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 <= 1.7d+189) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (((beta + 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 <= 1.7e+189) {
		tmp = (1.0 + (beta / (2.0 + ((alpha + beta) + (2.0 * i))))) / 2.0;
	} else {
		tmp = (((beta + beta) - -2.0) / alpha) / 2.0;
	}
	return tmp;
}

Python

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

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (alpha <= 1.7e+189)
		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) - -2.0) / alpha) / 2.0);
	end
	return tmp
end

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 1.7e+189], 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] - -2.0), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.69999999999999992e189

   1. Initial program 72.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 90.6%

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

   if 1.69999999999999992e189 < alpha

   1. Initial program 1.1%

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

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

      1. cancel-sign-sub-inv 7.9%

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

      2. mul-1-neg 7.9%

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

      3. sub-neg 7.9%

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

      4. metadata-eval 7.9%

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

   4. Simplified 7.9%

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

   5. Taylor expanded in alpha around -inf 56.8%

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

      1. associate-*r/ 56.8%

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

      2. mul-1-neg 56.8%

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

      3. associate--r+ 56.8%

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

      4. sub-neg 56.8%

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

      5. neg-mul-1 56.8%

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

      6. metadata-eval 56.8%

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

   7. Simplified 56.8%

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

4. Final simplification 85.7%

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

Alternative 5: 75.5% accurate, 2.2× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.3e+194) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = ((2.0 + (2.0 * i)) / 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.3d+194) then
        tmp = (1.0d0 + (beta / (beta + (alpha + 2.0d0)))) / 2.0d0
    else
        tmp = ((2.0d0 + (2.0d0 * i)) / 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.3e+194) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = ((2.0 + (2.0 * i)) / alpha) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 2.3e+194], 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[(2.0 * i), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 2.30000000000000005e194

   1. Initial program 72.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 90.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 86.8%

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

   if 2.30000000000000005e194 < alpha

   1. Initial program 1.1%

      \[\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 alpha around inf 16.6%

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

      1. mul-1-neg 16.6%

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

   4. Simplified 16.6%

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

   5. Taylor expanded in alpha around inf 50.6%

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

   6. Taylor expanded in beta around 0 48.4%

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

4. Final simplification 81.3%

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

Alternative 6: 77.1% accurate, 2.2× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 1.25e+193)
   (/ (+ 1.0 (/ beta (+ beta (+ alpha 2.0)))) 2.0)
   (/ (/ (- (+ beta beta) -2.0) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.25e+193) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = (((beta + 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 <= 1.25d+193) then
        tmp = (1.0d0 + (beta / (beta + (alpha + 2.0d0)))) / 2.0d0
    else
        tmp = (((beta + 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 <= 1.25e+193) {
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	} else {
		tmp = (((beta + beta) - -2.0) / alpha) / 2.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	tmp = 0
	if alpha <= 1.25e+193:
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0
	else:
		tmp = (((beta + beta) - -2.0) / alpha) / 2.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (alpha <= 1.25e+193)
		tmp = (1.0 + (beta / (beta + (alpha + 2.0)))) / 2.0;
	else
		tmp = (((beta + beta) - -2.0) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 1.25e+193], N[(N[(1.0 + N[(beta / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(N[(beta + beta), $MachinePrecision] - -2.0), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 1.24999999999999993e193

   1. Initial program 72.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 90.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 86.8%

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

   if 1.24999999999999993e193 < alpha

   1. Initial program 1.1%

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

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

      1. cancel-sign-sub-inv 7.9%

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

      2. mul-1-neg 7.9%

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

      3. sub-neg 7.9%

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

      4. metadata-eval 7.9%

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

   4. Simplified 7.9%

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

   5. Taylor expanded in alpha around -inf 56.8%

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

      1. associate-*r/ 56.8%

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

      2. mul-1-neg 56.8%

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

      3. associate--r+ 56.8%

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

      4. sub-neg 56.8%

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

      5. neg-mul-1 56.8%

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

      6. metadata-eval 56.8%

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

   7. Simplified 56.8%

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

4. Final simplification 82.5%

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

Alternative 7: 74.6% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= alpha 2.7e+190)
   (/ (+ 1.0 (/ beta (+ beta 2.0))) 2.0)
   (/ (/ (+ beta 2.0) alpha) 2.0)))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 2.7e+190) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((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 <= 2.7d+190) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((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 <= 2.7e+190) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((beta + 2.0) / alpha) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[alpha, 2.7e+190], N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(beta + 2.0), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if alpha < 2.70000000000000004e190

   1. Initial program 72.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 90.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 86.8%

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

   4. Taylor expanded in alpha around 0 86.4%

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

   if 2.70000000000000004e190 < alpha

   1. Initial program 1.1%

      \[\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 alpha around inf 16.6%

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

      1. mul-1-neg 16.6%

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

   4. Simplified 16.6%

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

   5. Taylor expanded in alpha around inf 50.6%

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

   6. Taylor expanded in i around 0 45.9%

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

4. Final simplification 80.6%

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

Alternative 8: 74.8% accurate, 2.6× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (alpha <= 1.16e+194) {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	} else {
		tmp = ((2.0 + (2.0 * i)) / 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 <= 1.16d+194) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((2.0d0 + (2.0d0 * i)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.16000000000000005e194

   1. Initial program 72.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 90.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 86.8%

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

   4. Taylor expanded in alpha around 0 86.4%

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

   if 1.16000000000000005e194 < alpha

   1. Initial program 1.1%

      \[\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 alpha around inf 16.6%

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

      1. mul-1-neg 16.6%

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

   4. Simplified 16.6%

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

   5. Taylor expanded in alpha around inf 50.6%

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

   6. Taylor expanded in beta around 0 48.4%

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

4. Final simplification 80.9%

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

Alternative 9: 72.4% accurate, 9.5× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 1.75e+34) {
		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.75d+34) 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.75e+34) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 1.75e+34)
		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.75e+34)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.74999999999999999e34

   1. Initial program 74.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/ 74.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 74.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 77.9%

         \[\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+ 77.9%

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

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

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

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

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

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

   if 1.74999999999999999e34 < beta

   1. Initial program 30.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/ 28.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 28.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 89.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+ 89.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 89.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 89.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 89.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 89.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 beta around inf 79.7%

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

4. Final simplification 76.9%

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

Alternative 10: 61.9% 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 62.2%

   \[\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/ 61.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 61.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 81.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+ 81.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 81.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 81.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 81.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 81.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 61.3%

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

5. Final simplification 61.3%

   \[\leadsto 0.5 \]

Reproduce

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