Octave 3.8, jcobi/2

Percentage Accurate: 62.6% → 97.5%

Time: 23.6s

Alternatives: 17

Speedup: 4.8×

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 4.5%

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

   3. Simplified 15.0%

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

   5. Taylor expanded in alpha around inf 91.4%

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

   6. Taylor expanded in i around 0 91.4%

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

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

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

Alternative 2: 97.5% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 4.5%

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

   3. Simplified 15.0%

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

   5. Taylor expanded in alpha around inf 91.4%

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

   6. Taylor expanded in i around 0 91.4%

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

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

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

Alternative 3: 97.5% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 4.5%

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

   3. Simplified 15.0%

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

   5. Taylor expanded in alpha around inf 91.4%

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

   6. Taylor expanded in i around 0 91.4%

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

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

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

      1. associate-/l* 100.0%

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

      2. associate-+l+ 100.0%

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

      3. associate-+l+ 100.0%

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

   3. Simplified 100.0%

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

Alternative 4: 96.8% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 4.5%

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

   3. Simplified 15.0%

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

   5. Taylor expanded in alpha around inf 91.4%

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

   6. Taylor expanded in i around 0 91.4%

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

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

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

      1. associate-/l* 100.0%

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

      2. associate-+l+ 100.0%

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

      3. associate-+l+ 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in beta around inf 99.6%

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

   6. Taylor expanded in alpha around 0 99.5%

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

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

Alternative 5: 89.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ beta (* 2.0 i))))
   (if (<= alpha 2.4e+100)
     (/
      (+
       1.0
       (/
        (/ beta (+ 1.0 (* 2.0 (/ i beta))))
        (+ (+ alpha beta) (+ 2.0 (* 2.0 i)))))
      2.0)
     (/ (/ (+ t_0 (+ 2.0 t_0)) alpha) 2.0))))

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = beta + (2.0d0 * i)
    if (alpha <= 2.4d+100) then
        tmp = (1.0d0 + ((beta / (1.0d0 + (2.0d0 * (i / beta)))) / ((alpha + beta) + (2.0d0 + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((t_0 + (2.0d0 + t_0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 2.40000000000000012e100

   1. Initial program 79.6%

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

      1. associate-/l* 95.4%

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

      2. associate-+l+ 95.4%

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

      3. associate-+l+ 95.4%

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

   3. Simplified 95.4%

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

   5. Taylor expanded in beta around inf 94.9%

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

   6. Taylor expanded in alpha around 0 94.9%

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

   if 2.40000000000000012e100 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

4. Final simplification 92.2%

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

Alternative 6: 89.2% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ beta (* 2.0 i))) (t_1 (+ 2.0 t_0)))
   (if (<= alpha 1.8e+99)
     (/ (+ 1.0 (/ beta (* (+ 1.0 (* 2.0 (/ i beta))) t_1))) 2.0)
     (/ (/ (+ t_0 t_1) alpha) 2.0))))

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = beta + (2.0d0 * i)
    t_1 = 2.0d0 + t_0
    if (alpha <= 1.8d+99) then
        tmp = (1.0d0 + (beta / ((1.0d0 + (2.0d0 * (i / beta))) * t_1))) / 2.0d0
    else
        tmp = ((t_0 + t_1) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta, i):
	t_0 = beta + (2.0 * i)
	t_1 = 2.0 + t_0
	tmp = 0
	if alpha <= 1.8e+99:
		tmp = (1.0 + (beta / ((1.0 + (2.0 * (i / beta))) * t_1))) / 2.0
	else:
		tmp = ((t_0 + t_1) / alpha) / 2.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = beta + (2.0 * i);
	t_1 = 2.0 + t_0;
	tmp = 0.0;
	if (alpha <= 1.8e+99)
		tmp = (1.0 + (beta / ((1.0 + (2.0 * (i / beta))) * t_1))) / 2.0;
	else
		tmp = ((t_0 + t_1) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.8000000000000001e99

   1. Initial program 79.6%

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

      1. associate-/l* 95.4%

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

      2. associate-+l+ 95.4%

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

      3. associate-+l+ 95.4%

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

   3. Simplified 95.4%

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

   5. Taylor expanded in beta around inf 94.9%

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

   6. Taylor expanded in alpha around 0 94.9%

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

   if 1.8000000000000001e99 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

4. Final simplification 92.2%

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

Alternative 7: 89.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \beta + 2 \cdot i\\ t_1 := 2 + t_0\\ \mathbf{if}\;\alpha \leq 3.5 \cdot 10^{+100}:\\ \;\;\;\;\frac{1 + \frac{\frac{\beta}{1 + 2 \cdot \frac{i}{\beta}}}{t_1}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{t_0 + t_1}{\alpha}}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ beta (* 2.0 i))) (t_1 (+ 2.0 t_0)))
   (if (<= alpha 3.5e+100)
     (/ (+ 1.0 (/ (/ beta (+ 1.0 (* 2.0 (/ i beta)))) t_1)) 2.0)
     (/ (/ (+ t_0 t_1) alpha) 2.0))))

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = beta + (2.0d0 * i)
    t_1 = 2.0d0 + t_0
    if (alpha <= 3.5d+100) then
        tmp = (1.0d0 + ((beta / (1.0d0 + (2.0d0 * (i / beta)))) / t_1)) / 2.0d0
    else
        tmp = ((t_0 + t_1) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta, i):
	t_0 = beta + (2.0 * i)
	t_1 = 2.0 + t_0
	tmp = 0
	if alpha <= 3.5e+100:
		tmp = (1.0 + ((beta / (1.0 + (2.0 * (i / beta)))) / t_1)) / 2.0
	else:
		tmp = ((t_0 + t_1) / alpha) / 2.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = beta + (2.0 * i);
	t_1 = 2.0 + t_0;
	tmp = 0.0;
	if (alpha <= 3.5e+100)
		tmp = (1.0 + ((beta / (1.0 + (2.0 * (i / beta)))) / t_1)) / 2.0;
	else
		tmp = ((t_0 + t_1) / alpha) / 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 3.49999999999999976e100

   1. Initial program 79.6%

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

      1. associate-/l* 95.4%

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

      2. associate-+l+ 95.4%

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

      3. associate-+l+ 95.4%

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

   3. Simplified 95.4%

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

   5. Taylor expanded in beta around inf 94.9%

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

   6. Taylor expanded in alpha around 0 94.9%

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

   7. Taylor expanded in alpha around 0 94.9%

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

   if 3.49999999999999976e100 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

4. Final simplification 92.2%

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

Alternative 8: 88.6% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ beta (* 2.0 i))))
   (if (<= alpha 1.45e+99)
     (/ (+ 1.0 (/ beta (+ 2.0 (+ (+ alpha beta) (* 2.0 i))))) 2.0)
     (/ (/ (+ t_0 (+ 2.0 t_0)) alpha) 2.0))))

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = beta + (2.0d0 * i)
    if (alpha <= 1.45d+99) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((t_0 + (2.0d0 + t_0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.4500000000000001e99

   1. Initial program 79.6%

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

   3. Taylor expanded in beta around inf 94.5%

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

   if 1.4500000000000001e99 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

4. Final simplification 91.8%

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

Alternative 9: 85.4% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.5d+101) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (((2.0d0 + (2.0d0 * i)) - (i * (-2.0d0))) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.49999999999999997e101

   1. Initial program 79.6%

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

   3. Taylor expanded in beta around inf 94.5%

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

   if 1.49999999999999997e101 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

   6. Taylor expanded in beta around 0 57.0%

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

4. Final simplification 88.4%

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

Alternative 10: 85.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.2d+98) then
        tmp = (1.0d0 + (beta / (2.0d0 + ((alpha + beta) + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((beta / alpha) + ((4.0d0 * (i / alpha)) + (2.0d0 / alpha))) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.1999999999999999e98

   1. Initial program 79.6%

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

   3. Taylor expanded in beta around inf 94.5%

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

   if 1.1999999999999999e98 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

   6. Taylor expanded in i around 0 78.1%

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

   7. Taylor expanded in beta around 0 60.1%

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

4. Final simplification 88.9%

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

Alternative 11: 82.7% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 5d+101) then
        tmp = (1.0d0 + (beta / (2.0d0 + (beta + (2.0d0 * i))))) / 2.0d0
    else
        tmp = ((2.0d0 + (beta * 2.0d0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 4.99999999999999989e101

   1. Initial program 79.6%

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

   3. Taylor expanded in beta around inf 94.5%

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

   4. Taylor expanded in alpha around 0 94.5%

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

   if 4.99999999999999989e101 < alpha

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

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

   5. Taylor expanded in i around 0 14.1%

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

      1. +-commutative 14.1%

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

   7. Simplified 14.1%

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

   8. Taylor expanded in alpha around inf 53.7%

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

4. Final simplification 87.8%

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

Alternative 12: 85.4% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.85d+102) then
        tmp = (1.0d0 + (beta / (2.0d0 + (beta + (2.0d0 * i))))) / 2.0d0
    else
        tmp = (((2.0d0 + (2.0d0 * i)) - (i * (-2.0d0))) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.85000000000000011e102

   1. Initial program 79.6%

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

   3. Taylor expanded in beta around inf 94.5%

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

   4. Taylor expanded in alpha around 0 94.5%

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

   if 1.85000000000000011e102 < alpha

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

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

   5. Taylor expanded in alpha around inf 78.1%

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

   6. Taylor expanded in beta around 0 57.0%

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

4. Final simplification 88.4%

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

Alternative 13: 74.1% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.26d+172) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((i * 4.0d0) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.2600000000000001e172

   1. Initial program 76.5%

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

   3. Simplified 92.4%

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

   5. Taylor expanded in i around 0 77.7%

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

      1. +-commutative 77.7%

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

   7. Simplified 77.7%

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

   8. Taylor expanded in alpha around 0 84.9%

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

   if 1.2600000000000001e172 < alpha

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

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

   5. Taylor expanded in alpha around inf 82.6%

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

   6. Taylor expanded in i around inf 38.1%

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

      1. *-commutative 38.1%

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

   8. Simplified 38.1%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.26 \cdot 10^{+172}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{i \cdot 4}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 77.4% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (alpha <= 1.8d+102) then
        tmp = (1.0d0 + (beta / (beta + 2.0d0))) / 2.0d0
    else
        tmp = ((2.0d0 + (beta * 2.0d0)) / alpha) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if alpha < 1.8000000000000001e102

   1. Initial program 79.6%

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

   3. Simplified 95.4%

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

   5. Taylor expanded in i around 0 81.3%

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

      1. +-commutative 81.3%

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

   7. Simplified 81.3%

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

   8. Taylor expanded in alpha around 0 87.9%

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

   if 1.8000000000000001e102 < alpha

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

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

   5. Taylor expanded in i around 0 14.1%

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

      1. +-commutative 14.1%

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

   7. Simplified 14.1%

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

   8. Taylor expanded in alpha around inf 53.7%

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

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\alpha \leq 1.8 \cdot 10^{+102}:\\ \;\;\;\;\frac{1 + \frac{\beta}{\beta + 2}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{2 + \beta \cdot 2}{\alpha}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 72.1% accurate, 2.4× speedup

Math

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

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 16500000000000.0) 0.5 (/ (- 2.0 (/ 2.0 beta)) 2.0)))

C

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

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 16500000000000.0d0) then
        tmp = 0.5d0
    else
        tmp = (2.0d0 - (2.0d0 / beta)) / 2.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 1.65e13

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

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

   5. Taylor expanded in i around inf 80.0%

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

   if 1.65e13 < beta

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

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

   5. Taylor expanded in i around 0 74.1%

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

      1. +-commutative 74.1%

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

   7. Simplified 74.1%

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

   8. Taylor expanded in alpha around 0 73.0%

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

   9. Taylor expanded in beta around inf 73.0%

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

       1. associate-*r/ 73.0%

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

       2. metadata-eval 73.0%

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

   11. Simplified 73.0%

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

4. Final simplification 77.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 16500000000000:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{2 - \frac{2}{\beta}}{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 72.1% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\beta \leq 17500000000000:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 17500000000000.0) 0.5 1.0))

C

double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 17500000000000.0) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(alpha, beta, i)
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: tmp
    if (beta <= 17500000000000.0d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(alpha, beta, i):
	tmp = 0
	if beta <= 17500000000000.0:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 17500000000000.0)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 17500000000000.0)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := If[LessEqual[beta, 17500000000000.0], 0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if beta < 1.75e13

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

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

   5. Taylor expanded in i around inf 80.0%

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

   if 1.75e13 < beta

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

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

   5. Taylor expanded in beta around inf 72.6%

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

4. Final simplification 77.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\beta \leq 17500000000000:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 61.1% 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 67.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 84.4%

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

5. Taylor expanded in i around inf 64.2%

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

6. Final simplification 64.2%

   \[\leadsto 0.5 \]
7. Add Preprocessing

Reproduce

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