Octave 3.8, jcobi/2

Percentage Accurate: 63.2% → 97.9%

Time: 20.6s

Alternatives: 17

Speedup: 1.0×

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.9% 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.99999999:\\ \;\;\;\;\frac{\frac{2 + \left(\beta \cdot 2 + i \cdot 4\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\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.99999999)
     (/ (/ (+ 2.0 (+ (* beta 2.0) (* i 4.0))) alpha) 2.0)
     (/
      (+
       (/
        (* (- beta alpha) (/ (+ alpha beta) (fma 2.0 i (+ alpha beta))))
        (+ alpha (+ beta (fma 2.0 i 2.0))))
       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.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else {
		tmp = ((((beta - alpha) * ((alpha + beta) / fma(2.0, i, (alpha + beta)))) / (alpha + (beta + fma(2.0, i, 2.0)))) + 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.99999999)
		tmp = Float64(Float64(Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0))) / alpha) / 2.0);
	else
		tmp = Float64(Float64(Float64(Float64(Float64(beta - alpha) * Float64(Float64(alpha + beta) / fma(2.0, i, Float64(alpha + beta)))) / Float64(alpha + Float64(beta + fma(2.0, i, 2.0)))) + 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.99999999], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $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 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + N[(2.0 * i + 2.0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99999998999999995

   1. Initial program 2.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

   3. Simplified 11.1%

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

   5. Taylor expanded in beta around 0 11.1%

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

   6. Taylor expanded in alpha around inf 94.7%

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

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

   1. Initial program 80.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

   3. Simplified 99.4%

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

4. Final simplification 98.4%

   \[\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.99999999:\\ \;\;\;\;\frac{\frac{2 + \left(\beta \cdot 2 + i \cdot 4\right)}{\alpha}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{\alpha + \left(\beta + \mathsf{fma}\left(2, i, 2\right)\right)} + 1}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 96.1% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(2.0 + t_0))
	t_2 = Float64(Float64(alpha + beta) + 2.0)
	tmp = 0.0
	if (t_1 <= -0.99999999)
		tmp = Float64(Float64(Float64(2.0 + Float64(Float64(beta * 2.0) + Float64(i * 4.0))) / alpha) / 2.0);
	elseif (t_1 <= 0.0001)
		tmp = Float64(Float64(1.0 + Float64(Float64(Float64(beta - alpha) * Float64(Float64(alpha + beta) / fma(2.0, i, Float64(alpha + beta)))) / Float64(i * Float64(2.0 + Float64(Float64(2.0 / i) + Float64(Float64(beta / i) + Float64(alpha / i))))))) / 2.0);
	else
		tmp = Float64(Float64(Float64(1.0 + Float64(beta / t_2)) - Float64(alpha / t_2)) / 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]}, Block[{t$95$1 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, -0.99999999], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0001], N[(N[(1.0 + N[(N[(N[(beta - alpha), $MachinePrecision] * N[(N[(alpha + beta), $MachinePrecision] / N[(2.0 * i + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(i * N[(2.0 + N[(N[(2.0 / i), $MachinePrecision] + N[(N[(beta / i), $MachinePrecision] + N[(alpha / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(1.0 + N[(beta / t$95$2), $MachinePrecision]), $MachinePrecision] - N[(alpha / t$95$2), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99999998999999995

   1. Initial program 2.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

   3. Simplified 11.1%

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

   5. Taylor expanded in beta around 0 11.1%

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

   6. Taylor expanded in alpha around inf 94.7%

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

   if -0.99999998999999995 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   1. Initial program 99.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

   3. Simplified 99.2%

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

   5. Taylor expanded in i around inf 99.2%

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

      1. associate-*r/ 99.2%

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

      2. metadata-eval 99.2%

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

      3. +-commutative 99.2%

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

   7. Simplified 99.2%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.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 -0.99999999:\\ \;\;\;\;\frac{\frac{2 + \left(\beta \cdot 2 + i \cdot 4\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 0.0001:\\ \;\;\;\;\frac{1 + \frac{\left(\beta - \alpha\right) \cdot \frac{\alpha + \beta}{\mathsf{fma}\left(2, i, \alpha + \beta\right)}}{i \cdot \left(2 + \left(\frac{2}{i} + \left(\frac{\beta}{i} + \frac{\alpha}{i}\right)\right)\right)}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 + \frac{\beta}{\left(\alpha + \beta\right) + 2}\right) - \frac{\alpha}{\left(\alpha + \beta\right) + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + 2.0;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (t_2 + 1.0) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 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
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0d0 + t_1)
    if (t_2 <= (-0.99999999d0)) then
        tmp = ((2.0d0 + ((beta * 2.0d0) + (i * 4.0d0))) / alpha) / 2.0d0
    else if (t_2 <= 0.0001d0) then
        tmp = (t_2 + 1.0d0) / 2.0d0
    else
        tmp = ((1.0d0 + (beta / t_0)) - (alpha / t_0)) / 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;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (t_2 + 1.0) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.99999999], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$2, 0.0001], N[(N[(t$95$2 + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(1.0 + N[(beta / t$95$0), $MachinePrecision]), $MachinePrecision] - N[(alpha / t$95$0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99999998999999995

   1. Initial program 2.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

   3. Simplified 11.1%

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

   5. Taylor expanded in beta around 0 11.1%

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

   6. Taylor expanded in alpha around inf 94.7%

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

   if -0.99999998999999995 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.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 -0.99999999:\\ \;\;\;\;\frac{\frac{2 + \left(\beta \cdot 2 + i \cdot 4\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 0.0001:\\ \;\;\;\;\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{\left(1 + \frac{\beta}{\left(\alpha + \beta\right) + 2}\right) - \frac{\alpha}{\left(\alpha + \beta\right) + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 95.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = ((alpha + beta) * (beta - alpha)) / t_0;
	double t_2 = t_1 / (2.0 + t_0);
	double t_3 = (alpha + beta) + 2.0;
	double tmp;
	if (t_2 <= -0.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 + (t_1 / (2.0 + (alpha + (2.0 * i))))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_3)) - (alpha / t_3)) / 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) :: t_3
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = ((alpha + beta) * (beta - alpha)) / t_0
    t_2 = t_1 / (2.0d0 + t_0)
    t_3 = (alpha + beta) + 2.0d0
    if (t_2 <= (-0.99999999d0)) then
        tmp = ((2.0d0 + ((beta * 2.0d0) + (i * 4.0d0))) / alpha) / 2.0d0
    else if (t_2 <= 0.0001d0) then
        tmp = (1.0d0 + (t_1 / (2.0d0 + (alpha + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((1.0d0 + (beta / t_3)) - (alpha / t_3)) / 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 = ((alpha + beta) * (beta - alpha)) / t_0;
	double t_2 = t_1 / (2.0 + t_0);
	double t_3 = (alpha + beta) + 2.0;
	double tmp;
	if (t_2 <= -0.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 + (t_1 / (2.0 + (alpha + (2.0 * i))))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_3)) - (alpha / t_3)) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = ((alpha + beta) * (beta - alpha)) / t_0;
	t_2 = t_1 / (2.0 + t_0);
	t_3 = (alpha + beta) + 2.0;
	tmp = 0.0;
	if (t_2 <= -0.99999999)
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	elseif (t_2 <= 0.0001)
		tmp = (1.0 + (t_1 / (2.0 + (alpha + (2.0 * i))))) / 2.0;
	else
		tmp = ((1.0 + (beta / t_3)) - (alpha / t_3)) / 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[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[t$95$2, -0.99999999], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$2, 0.0001], N[(N[(1.0 + N[(t$95$1 / N[(2.0 + N[(alpha + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(1.0 + N[(beta / t$95$3), $MachinePrecision]), $MachinePrecision] - N[(alpha / t$95$3), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99999998999999995

   1. Initial program 2.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

   3. Simplified 11.1%

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

   5. Taylor expanded in beta around 0 11.1%

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

   6. Taylor expanded in alpha around inf 94.7%

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

   if -0.99999998999999995 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

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

   3. Taylor expanded in alpha around inf 98.9%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.4%

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

Alternative 5: 95.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + 2.0;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 + (((beta - alpha) * (alpha / (alpha + (2.0 * i)))) / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 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
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0d0 + t_1)
    if (t_2 <= (-0.99999999d0)) then
        tmp = ((2.0d0 + ((beta * 2.0d0) + (i * 4.0d0))) / alpha) / 2.0d0
    else if (t_2 <= 0.0001d0) then
        tmp = (1.0d0 + (((beta - alpha) * (alpha / (alpha + (2.0d0 * i)))) / (alpha + (2.0d0 + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((1.0d0 + (beta / t_0)) - (alpha / t_0)) / 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;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.99999999) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 + (((beta - alpha) * (alpha / (alpha + (2.0 * i)))) / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.99999999], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$2, 0.0001], N[(N[(1.0 + N[(N[(N[(beta - alpha), $MachinePrecision] * N[(alpha / N[(alpha + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(2.0 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(1.0 + N[(beta / t$95$0), $MachinePrecision]), $MachinePrecision] - N[(alpha / t$95$0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99999998999999995

   1. Initial program 2.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

   3. Simplified 11.1%

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

   5. Taylor expanded in beta around 0 11.1%

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

   6. Taylor expanded in alpha around inf 94.7%

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

   if -0.99999998999999995 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   1. Initial program 99.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

   3. Simplified 99.2%

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

   5. Taylor expanded in beta around 0 98.8%

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

   6. Taylor expanded in beta around 0 98.8%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.4%

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

Alternative 6: 95.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + 2.0;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.9995) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 + (((beta - alpha) * (alpha / (alpha + (2.0 * i)))) / (alpha + (beta + 2.0)))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 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
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0d0 + t_1)
    if (t_2 <= (-0.9995d0)) then
        tmp = ((2.0d0 + ((beta * 2.0d0) + (i * 4.0d0))) / alpha) / 2.0d0
    else if (t_2 <= 0.0001d0) then
        tmp = (1.0d0 + (((beta - alpha) * (alpha / (alpha + (2.0d0 * i)))) / (alpha + (beta + 2.0d0)))) / 2.0d0
    else
        tmp = ((1.0d0 + (beta / t_0)) - (alpha / t_0)) / 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;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.9995) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 + (((beta - alpha) * (alpha / (alpha + (2.0 * i)))) / (alpha + (beta + 2.0)))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.9995], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$2, 0.0001], N[(N[(1.0 + N[(N[(N[(beta - alpha), $MachinePrecision] * N[(alpha / N[(alpha + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(1.0 + N[(beta / t$95$0), $MachinePrecision]), $MachinePrecision] - N[(alpha / t$95$0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99950000000000006

   1. Initial program 6.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. Step-by-step derivation

   3. Simplified 14.1%

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

   5. Taylor expanded in beta around 0 14.1%

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

   6. Taylor expanded in alpha around inf 92.5%

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

   if -0.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   1. Initial program 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in beta around 0 99.5%

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

   6. Taylor expanded in i around 0 99.3%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.1%

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

Alternative 7: 95.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + 2.0;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.9995) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 - (alpha / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 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
    t_1 = (alpha + beta) + (2.0d0 * i)
    t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0d0 + t_1)
    if (t_2 <= (-0.9995d0)) then
        tmp = ((2.0d0 + ((beta * 2.0d0) + (i * 4.0d0))) / alpha) / 2.0d0
    else if (t_2 <= 0.0001d0) then
        tmp = (1.0d0 - (alpha / (alpha + (2.0d0 + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((1.0d0 + (beta / t_0)) - (alpha / t_0)) / 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;
	double t_1 = (alpha + beta) + (2.0 * i);
	double t_2 = (((alpha + beta) * (beta - alpha)) / t_1) / (2.0 + t_1);
	double tmp;
	if (t_2 <= -0.9995) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_2 <= 0.0001) {
		tmp = (1.0 - (alpha / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = ((1.0 + (beta / t_0)) - (alpha / t_0)) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(2.0 + t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -0.9995], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$2, 0.0001], N[(N[(1.0 - N[(alpha / N[(alpha + N[(2.0 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(1.0 + N[(beta / t$95$0), $MachinePrecision]), $MachinePrecision] - N[(alpha / t$95$0), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99950000000000006

   1. Initial program 6.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. Step-by-step derivation

   3. Simplified 14.1%

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

   5. Taylor expanded in beta around 0 14.1%

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

   6. Taylor expanded in alpha around inf 92.5%

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

   if -0.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   1. Initial program 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in beta around 0 99.5%

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

   6. Taylor expanded in beta around 0 99.5%

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

   7. Taylor expanded in alpha around inf 99.1%

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

      1. mul-1-neg 99.1%

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

   9. Simplified 99.1%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.0%

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

Alternative 8: 95.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_1 <= 0.0001) {
		tmp = (1.0 - (alpha / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = (1.0 + ((beta - alpha) / ((alpha + beta) + 2.0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.9995d0)) then
        tmp = ((2.0d0 + ((beta * 2.0d0) + (i * 4.0d0))) / alpha) / 2.0d0
    else if (t_1 <= 0.0001d0) then
        tmp = (1.0d0 - (alpha / (alpha + (2.0d0 + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (1.0d0 + ((beta - alpha) / ((alpha + beta) + 2.0d0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	} else if (t_1 <= 0.0001) {
		tmp = (1.0 - (alpha / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	} else {
		tmp = (1.0 + ((beta - alpha) / ((alpha + beta) + 2.0))) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.9995)
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	elseif (t_1 <= 0.0001)
		tmp = (1.0 - (alpha / (alpha + (2.0 + (2.0 * i))))) / 2.0;
	else
		tmp = (1.0 + ((beta - alpha) / ((alpha + beta) + 2.0))) / 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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.9995], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0001], N[(N[(1.0 - N[(alpha / N[(alpha + N[(2.0 + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(1.0 + N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99950000000000006

   1. Initial program 6.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. Step-by-step derivation

   3. Simplified 14.1%

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

   5. Taylor expanded in beta around 0 14.1%

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

   6. Taylor expanded in alpha around inf 92.5%

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

   if -0.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   1. Initial program 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in beta around 0 99.5%

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

   6. Taylor expanded in beta around 0 99.5%

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

   7. Taylor expanded in alpha around inf 99.1%

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

      1. mul-1-neg 99.1%

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

   9. Simplified 99.1%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in i around 0 87.6%

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

4. Final simplification 95.0%

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

Alternative 9: 95.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.5)
		tmp = ((2.0 + ((beta * 2.0) + (i * 4.0))) / alpha) / 2.0;
	elseif (t_1 <= 4e-18)
		tmp = 0.5;
	else
		tmp = (1.0 + ((beta - alpha) / ((alpha + beta) + 2.0))) / 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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(2.0 + N[(N[(beta * 2.0), $MachinePrecision] + N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 4e-18], 0.5, N[(N[(1.0 + N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.5

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

   3. Simplified 15.3%

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

   5. Taylor expanded in beta around 0 15.3%

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

   6. Taylor expanded in alpha around inf 91.5%

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

   if -0.5 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 4.0000000000000003e-18

   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} \]
   2. Step-by-step derivation

   3. Simplified 100.0%

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

   5. Taylor expanded in i around inf 99.8%

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

   if 4.0000000000000003e-18 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 39.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. Step-by-step derivation

   3. Simplified 100.0%

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

   5. Taylor expanded in i around 0 87.1%

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

4. Final simplification 94.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{2 + \left(\beta \cdot 2 + i \cdot 4\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 4 \cdot 10^{-18}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 92.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.5)
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	elseif (t_1 <= 4e-18)
		tmp = 0.5;
	else
		tmp = (1.0 + ((beta - alpha) / ((alpha + beta) + 2.0))) / 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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 4e-18], 0.5, N[(N[(1.0 + N[(N[(beta - alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.5

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

   3. Simplified 15.3%

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

   5. Taylor expanded in beta around 0 15.3%

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

   6. Taylor expanded in alpha around inf 91.5%

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

   7. Taylor expanded in beta around 0 82.5%

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

   if -0.5 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 4.0000000000000003e-18

   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} \]
   2. Step-by-step derivation

   3. Simplified 100.0%

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

   5. Taylor expanded in i around inf 99.8%

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

   if 4.0000000000000003e-18 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 39.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. Step-by-step derivation

   3. Simplified 100.0%

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

   5. Taylor expanded in i around 0 87.1%

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

4. Final simplification 92.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{2 + i \cdot 4}{\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 4 \cdot 10^{-18}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta - \alpha}{\left(\alpha + \beta\right) + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 91.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	} else if (t_1 <= 0.0001) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.5d0)) then
        tmp = ((2.0d0 + (i * 4.0d0)) / alpha) / 2.0d0
    else if (t_1 <= 0.0001d0) then
        tmp = 0.5d0
    else
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	} else if (t_1 <= 0.0001) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.5)
		tmp = ((2.0 + (i * 4.0)) / alpha) / 2.0;
	elseif (t_1 <= 0.0001)
		tmp = 0.5;
	else
		tmp = (1.0 + (beta / (beta + 2.0))) / 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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(2.0 + N[(i * 4.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0001], 0.5, N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.5

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

   3. Simplified 15.3%

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

   5. Taylor expanded in beta around 0 15.3%

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

   6. Taylor expanded in alpha around inf 91.5%

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

   7. Taylor expanded in beta around 0 82.5%

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

   if -0.5 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   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} \]
   2. Step-by-step derivation

   3. Simplified 100.0%

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

   5. Taylor expanded in i around inf 99.1%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

   6. Taylor expanded in alpha around 0 87.3%

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

4. Final simplification 92.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{2 + i \cdot 4}{\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 0.0001:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 88.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	} else if (t_1 <= 0.0001) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.5d0)) then
        tmp = ((2.0d0 + (beta * 2.0d0)) / alpha) / 2.0d0
    else if (t_1 <= 0.0001d0) then
        tmp = 0.5d0
    else
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.5) {
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	} else if (t_1 <= 0.0001) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.5)
		tmp = ((2.0 + (beta * 2.0)) / alpha) / 2.0;
	elseif (t_1 <= 0.0001)
		tmp = 0.5;
	else
		tmp = (1.0 + (beta / (beta + 2.0))) / 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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.5], N[(N[(N[(2.0 + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / alpha), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0001], 0.5, N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.5

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

   3. Simplified 13.5%

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

   5. Taylor expanded in i around 0 6.5%

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

   6. Taylor expanded in alpha around inf 59.4%

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

   if -0.5 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   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} \]
   2. Step-by-step derivation

   3. Simplified 100.0%

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

   5. Taylor expanded in i around inf 99.1%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

   6. Taylor expanded in alpha around 0 87.3%

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

4. Final simplification 87.4%

   \[\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{2 + \beta \cdot 2}{\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 0.0001:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 81.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.0001) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.9995d0)) then
        tmp = 2.0d0 * (i / alpha)
    else if (t_1 <= 0.0001d0) then
        tmp = 0.5d0
    else
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.0001) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (beta + 2.0))) / 2.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.9995)
		tmp = 2.0 * (i / alpha);
	elseif (t_1 <= 0.0001)
		tmp = 0.5;
	else
		tmp = (1.0 + (beta / (beta + 2.0))) / 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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.9995], N[(2.0 * N[(i / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0001], 0.5, N[(N[(1.0 + N[(beta / N[(beta + 2.0), $MachinePrecision]), $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 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < -0.99950000000000006

   1. Initial program 6.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. Step-by-step derivation

   3. Simplified 14.1%

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

   5. Taylor expanded in beta around 0 14.1%

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

   6. Taylor expanded in alpha around inf 92.5%

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

   7. Taylor expanded in i around inf 36.4%

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

   if -0.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 1.00000000000000005e-4

   1. Initial program 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in i around inf 98.5%

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

   if 1.00000000000000005e-4 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64)))

   1. Initial program 34.9%

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

   3. Simplified 57.9%

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

   5. Taylor expanded in i around 0 87.6%

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

   6. Taylor expanded in alpha around 0 87.3%

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

4. Final simplification 82.1%

   \[\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.9995:\\ \;\;\;\;2 \cdot \frac{i}{\alpha}\\ \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 0.0001:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 80.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = 1.0 + (-0.5 * ((alpha * 2.0) / beta));
	}
	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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.9995d0)) then
        tmp = 2.0d0 * (i / alpha)
    else if (t_1 <= 0.5d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0 + ((-0.5d0) * ((alpha * 2.0d0) / beta))
    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 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = 1.0 + (-0.5 * ((alpha * 2.0) / beta));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.9995)
		tmp = 2.0 * (i / alpha);
	elseif (t_1 <= 0.5)
		tmp = 0.5;
	else
		tmp = 1.0 + (-0.5 * ((alpha * 2.0) / beta));
	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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.9995], N[(2.0 * N[(i / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.5], 0.5, N[(1.0 + N[(-0.5 * N[(N[(alpha * 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 6.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. Step-by-step derivation

   3. Simplified 14.1%

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

   5. Taylor expanded in beta around 0 14.1%

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

   6. Taylor expanded in alpha around inf 92.5%

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

   7. Taylor expanded in i around inf 36.4%

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

   if -0.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 0.5

   1. Initial program 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in i around inf 96.4%

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

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

   1. Initial program 30.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

   3. Simplified 54.8%

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

   5. Taylor expanded in i around 0 86.7%

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

   6. Taylor expanded in beta around inf 86.4%

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

   7. Taylor expanded in alpha around inf 86.4%

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

      1. associate-*r/ 86.4%

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

      2. *-commutative 86.4%

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

   9. Simplified 86.4%

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

4. Final simplification 80.9%

   \[\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.9995:\\ \;\;\;\;2 \cdot \frac{i}{\alpha}\\ \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 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1 + -0.5 \cdot \frac{\alpha \cdot 2}{\beta}\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 80.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.5) {
		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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)
    if (t_1 <= (-0.9995d0)) then
        tmp = 2.0d0 * (i / alpha)
    else if (t_1 <= 0.5d0) 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 t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	double tmp;
	if (t_1 <= -0.9995) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0);
	tmp = 0.0;
	if (t_1 <= -0.9995)
		tmp = 2.0 * (i / alpha);
	elseif (t_1 <= 0.5)
		tmp = 0.5;
	else
		tmp = 1.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[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(2.0 + t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -0.9995], N[(2.0 * N[(i / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.5], 0.5, 1.0]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 6.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. Step-by-step derivation

   3. Simplified 14.1%

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

   5. Taylor expanded in beta around 0 14.1%

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

   6. Taylor expanded in alpha around inf 92.5%

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

   7. Taylor expanded in i around inf 36.4%

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

   if -0.99950000000000006 < (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) < 0.5

   1. Initial program 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in i around inf 96.4%

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

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

   1. Initial program 30.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

   3. Simplified 100.0%

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

   5. Taylor expanded in i around inf 74.4%

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

      1. associate-*r/ 74.4%

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

      2. metadata-eval 74.4%

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

      3. +-commutative 74.4%

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

   7. Simplified 74.4%

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

      1. times-frac 68.5%

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

      2. fma-define 68.5%

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

      3. +-commutative 68.5%

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

      4. +-commutative 68.5%

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

   9. Applied egg-rr 68.5%

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

   10. Taylor expanded in beta around inf 86.3%

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

4. Final simplification 80.9%

   \[\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.9995:\\ \;\;\;\;2 \cdot \frac{i}{\alpha}\\ \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 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 76.7% accurate, 1.0× 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:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \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)
     0.5
     1.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 = 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) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0d0 + t_0)) <= 0.5d0) 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 t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	tmp = 0
	if ((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= 0.5:
		tmp = 0.5
	else:
		tmp = 1.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 = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	tmp = 0.0;
	if (((((alpha + beta) * (beta - alpha)) / t_0) / (2.0 + t_0)) <= 0.5)
		tmp = 0.5;
	else
		tmp = 1.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]}, 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], 0.5, 1.0]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 73.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

   3. Simplified 75.1%

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

   5. Taylor expanded in i around inf 71.9%

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

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

   1. Initial program 30.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

   3. Simplified 100.0%

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

   5. Taylor expanded in i around inf 74.4%

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

      1. associate-*r/ 74.4%

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

      2. metadata-eval 74.4%

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

      3. +-commutative 74.4%

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

   7. Simplified 74.4%

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

      1. times-frac 68.5%

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

      2. fma-define 68.5%

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

      3. +-commutative 68.5%

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

      4. +-commutative 68.5%

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

   9. Applied egg-rr 68.5%

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

   10. Taylor expanded in beta around inf 86.3%

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

4. Final simplification 75.0%

   \[\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:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 61.6% 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 64.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

3. Simplified 70.9%

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

5. Taylor expanded in i around inf 63.6%

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

Reproduce

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