Octave 3.8, jcobi/4

Percentage Accurate: 15.9% → 85.0%

Time: 14.4s

Alternatives: 9

Speedup: 115.0×

Specification

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 15.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.0% accurate, 2.1× speedup

Math

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

FPCore

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

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 5.1e+184) {
		tmp = fma(0.0625, ((2.0 * (beta + alpha)) / i), 0.0625) - (((beta + alpha) * 0.125) / i);
	} else {
		tmp = ((i + alpha) / beta) * (i * (1.0 / beta));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 5.1000000000000003e184

   1. Initial program 19.1%

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

   3. Taylor expanded in i around inf

      \[\leadsto \color{blue}{\frac{1}{16}} \]
   4. Step-by-step derivation

   5. Applied rewrites 86.7%

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

   6. Taylor expanded in i around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. distribute-lft-out N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower-+.f64 86.9

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

   8. Applied rewrites 86.9%

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

   if 5.1000000000000003e184 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 35.4

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

   5. Applied rewrites 35.4%

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

   7. Applied rewrites 85.9%

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

   9. Applied rewrites 86.0%

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

4. Final simplification 86.7%

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

Alternative 2: 85.1% accurate, 2.7× speedup

Math

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

FPCore

NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
 :precision binary64
 (if (<= beta 3.9e+180)
   (+ 0.0625 (/ 0.015625 (* i i)))
   (* (/ (+ i alpha) beta) (* i (/ 1.0 beta)))))

C

assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.9e+180) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = ((i + alpha) / beta) * (i * (1.0 / beta));
	}
	return tmp;
}

Fortran

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

Java

assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
	double tmp;
	if (beta <= 3.9e+180) {
		tmp = 0.0625 + (0.015625 / (i * i));
	} else {
		tmp = ((i + alpha) / beta) * (i * (1.0 / beta));
	}
	return tmp;
}

Python

[alpha, beta, i] = sort([alpha, beta, i])
def code(alpha, beta, i):
	tmp = 0
	if beta <= 3.9e+180:
		tmp = 0.0625 + (0.015625 / (i * i))
	else:
		tmp = ((i + alpha) / beta) * (i * (1.0 / beta))
	return tmp

Julia

alpha, beta, i = sort([alpha, beta, i])
function code(alpha, beta, i)
	tmp = 0.0
	if (beta <= 3.9e+180)
		tmp = Float64(0.0625 + Float64(0.015625 / Float64(i * i)));
	else
		tmp = Float64(Float64(Float64(i + alpha) / beta) * Float64(i * Float64(1.0 / beta)));
	end
	return tmp
end

MATLAB

alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
	tmp = 0.0;
	if (beta <= 3.9e+180)
		tmp = 0.0625 + (0.015625 / (i * i));
	else
		tmp = ((i + alpha) / beta) * (i * (1.0 / beta));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if beta < 3.9000000000000001e180

   1. Initial program 21.3%

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

   3. Taylor expanded in alpha around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-+.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. +-commutative N/A

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

      16. *-commutative N/A

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

      17. lower-fma.f64 N/A

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

      18. sub-neg N/A

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

      19. unpow2 N/A

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

      20. metadata-eval N/A

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

      21. lower-fma.f64 N/A

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

   5. Applied rewrites 18.3%

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

   6. Taylor expanded in beta around 0

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

   8. Applied rewrites 38.1%

      \[\leadsto \frac{0.25 \cdot \left(i \cdot i\right)}{\color{blue}{\mathsf{fma}\left(4, i \cdot i, -1\right)}} \]

   9. Taylor expanded in i around inf

      \[\leadsto \frac{1}{16} + \frac{1}{64} \cdot \color{blue}{\frac{1}{{i}^{2}}} \]
   10. Step-by-step derivation

   11. Applied rewrites 87.7%

       \[\leadsto 0.0625 + \frac{0.015625}{\color{blue}{i \cdot i}} \]

   if 3.9000000000000001e180 < beta

   1. Initial program 0.0%

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

   3. Taylor expanded in beta around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 28.0

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

   5. Applied rewrites 28.0%

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

   7. Applied rewrites 77.4%

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

   9. Applied rewrites 77.4%

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

4. Final simplification 85.1%

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

Reproduce

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