
(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))))
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);
}
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
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);
}
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)
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
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
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]]]]
\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}
Sampling outcomes in binary64 precision:
Herbie found 5 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(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))))
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);
}
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
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);
}
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)
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
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
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]]]]
\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}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 9e+184)
(-
(+ 0.0625 (* 0.0625 (/ (+ alpha (* beta 2.0)) i)))
(* 0.00390625 (/ (+ (* 2.0 (* (+ beta alpha) 12.0)) (* beta 8.0)) i)))
(/ (/ (+ alpha i) beta) (/ beta i))))assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9e+184) {
tmp = (0.0625 + (0.0625 * ((alpha + (beta * 2.0)) / i))) - (0.00390625 * (((2.0 * ((beta + alpha) * 12.0)) + (beta * 8.0)) / i));
} else {
tmp = ((alpha + i) / beta) / (beta / i);
}
return tmp;
}
NOTE: alpha and beta 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 <= 9d+184) then
tmp = (0.0625d0 + (0.0625d0 * ((alpha + (beta * 2.0d0)) / i))) - (0.00390625d0 * (((2.0d0 * ((beta + alpha) * 12.0d0)) + (beta * 8.0d0)) / i))
else
tmp = ((alpha + i) / beta) / (beta / i)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9e+184) {
tmp = (0.0625 + (0.0625 * ((alpha + (beta * 2.0)) / i))) - (0.00390625 * (((2.0 * ((beta + alpha) * 12.0)) + (beta * 8.0)) / i));
} else {
tmp = ((alpha + i) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 9e+184: tmp = (0.0625 + (0.0625 * ((alpha + (beta * 2.0)) / i))) - (0.00390625 * (((2.0 * ((beta + alpha) * 12.0)) + (beta * 8.0)) / i)) else: tmp = ((alpha + i) / beta) / (beta / i) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 9e+184) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(alpha + Float64(beta * 2.0)) / i))) - Float64(0.00390625 * Float64(Float64(Float64(2.0 * Float64(Float64(beta + alpha) * 12.0)) + Float64(beta * 8.0)) / i))); else tmp = Float64(Float64(Float64(alpha + i) / beta) / Float64(beta / i)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 9e+184)
tmp = (0.0625 + (0.0625 * ((alpha + (beta * 2.0)) / i))) - (0.00390625 * (((2.0 * ((beta + alpha) * 12.0)) + (beta * 8.0)) / i));
else
tmp = ((alpha + i) / beta) / (beta / i);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 9e+184], N[(N[(0.0625 + N[(0.0625 * N[(N[(alpha + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.00390625 * N[(N[(N[(2.0 * N[(N[(beta + alpha), $MachinePrecision] * 12.0), $MachinePrecision]), $MachinePrecision] + N[(beta * 8.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9 \cdot 10^{+184}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha + \beta \cdot 2}{i}\right) - 0.00390625 \cdot \frac{2 \cdot \left(\left(\beta + \alpha\right) \cdot 12\right) + \beta \cdot 8}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + i}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 9.00000000000000072e184Initial program 17.2%
times-frac37.8%
+-commutative37.8%
+-commutative37.8%
*-commutative37.8%
fma-def37.8%
+-commutative37.8%
+-commutative37.8%
*-commutative37.8%
fma-udef37.8%
+-commutative37.8%
*-commutative37.8%
fma-def37.8%
Applied egg-rr37.8%
*-commutative37.8%
+-commutative37.8%
+-commutative37.8%
*-commutative37.8%
+-commutative37.8%
associate-/l*37.8%
+-commutative37.8%
+-commutative37.8%
+-commutative37.8%
Simplified37.8%
Taylor expanded in alpha around 0 37.5%
Taylor expanded in i around inf 82.7%
Taylor expanded in beta around 0 82.7%
+-commutative82.7%
+-commutative82.7%
*-commutative82.7%
metadata-eval82.7%
distribute-rgt-out82.7%
associate-+r+82.7%
distribute-lft-in82.7%
associate-+r+82.7%
+-commutative82.7%
distribute-lft-in82.7%
distribute-rgt-out82.7%
metadata-eval82.7%
Simplified82.7%
if 9.00000000000000072e184 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified5.3%
Taylor expanded in beta around inf 28.8%
*-commutative28.8%
associate-/l*30.8%
+-commutative30.8%
unpow230.8%
Simplified30.8%
div-inv30.8%
+-commutative30.8%
associate-/l*42.0%
Applied egg-rr42.0%
add-log-exp31.4%
un-div-inv31.4%
Applied egg-rr31.4%
add-log-exp42.0%
+-commutative42.0%
associate-/r/41.9%
un-div-inv41.9%
*-commutative41.9%
associate-/r*76.5%
un-div-inv76.7%
Applied egg-rr76.7%
Final simplification81.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7e+184) 0.0625 (/ (/ (+ alpha i) beta) (/ beta i))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7e+184) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) / (beta / i);
}
return tmp;
}
NOTE: alpha and beta 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 <= 7d+184) then
tmp = 0.0625d0
else
tmp = ((alpha + i) / beta) / (beta / i)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7e+184) {
tmp = 0.0625;
} else {
tmp = ((alpha + i) / beta) / (beta / i);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 7e+184: tmp = 0.0625 else: tmp = ((alpha + i) / beta) / (beta / i) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7e+184) tmp = 0.0625; else tmp = Float64(Float64(Float64(alpha + i) / beta) / Float64(beta / i)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7e+184)
tmp = 0.0625;
else
tmp = ((alpha + i) / beta) / (beta / i);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 7e+184], 0.0625, N[(N[(N[(alpha + i), $MachinePrecision] / beta), $MachinePrecision] / N[(beta / i), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7 \cdot 10^{+184}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + i}{\beta}}{\frac{\beta}{i}}\\
\end{array}
\end{array}
if beta < 6.99999999999999956e184Initial program 17.2%
associate-/l/16.1%
associate-*l*16.1%
times-frac22.9%
Simplified37.8%
Taylor expanded in i around inf 83.5%
if 6.99999999999999956e184 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified5.3%
Taylor expanded in beta around inf 28.8%
*-commutative28.8%
associate-/l*30.8%
+-commutative30.8%
unpow230.8%
Simplified30.8%
div-inv30.8%
+-commutative30.8%
associate-/l*42.0%
Applied egg-rr42.0%
add-log-exp31.4%
un-div-inv31.4%
Applied egg-rr31.4%
add-log-exp42.0%
+-commutative42.0%
associate-/r/41.9%
un-div-inv41.9%
*-commutative41.9%
associate-/r*76.5%
un-div-inv76.7%
Applied egg-rr76.7%
Final simplification82.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 2.15e+269) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.15e+269) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
NOTE: alpha and beta 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 <= 2.15d+269) then
tmp = 0.0625d0
else
tmp = (i / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.15e+269) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 2.15e+269: tmp = 0.0625 else: tmp = (i / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.15e+269) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(alpha / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.15e+269)
tmp = 0.0625;
else
tmp = (i / beta) * (alpha / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.15e+269], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.15 \cdot 10^{+269}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 2.14999999999999992e269Initial program 15.6%
associate-/l/14.7%
associate-*l*14.6%
times-frac20.9%
Simplified35.3%
Taylor expanded in i around inf 78.5%
if 2.14999999999999992e269 < beta Initial program 0.0%
associate-/l/0.0%
associate-*l*0.0%
times-frac0.0%
Simplified0.0%
Taylor expanded in beta around inf 48.2%
*-commutative48.2%
associate-/l*50.0%
+-commutative50.0%
unpow250.0%
Simplified50.0%
div-inv50.0%
+-commutative50.0%
associate-/l*50.4%
Applied egg-rr50.4%
Taylor expanded in i around 0 49.3%
*-commutative49.3%
unpow249.3%
times-frac59.3%
Simplified59.3%
Final simplification77.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 4.5e+185) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.5e+185) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
NOTE: alpha and beta 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 <= 4.5d+185) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 4.5e+185) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): tmp = 0 if beta <= 4.5e+185: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 4.5e+185) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 4.5e+185)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 4.5e+185], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+185}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 4.5000000000000002e185Initial program 17.2%
associate-/l/16.1%
associate-*l*16.1%
times-frac22.9%
Simplified37.8%
Taylor expanded in i around inf 83.5%
if 4.5000000000000002e185 < beta Initial program 0.0%
times-frac5.3%
+-commutative5.3%
+-commutative5.3%
*-commutative5.3%
fma-def5.3%
+-commutative5.3%
+-commutative5.3%
*-commutative5.3%
fma-udef5.3%
+-commutative5.3%
*-commutative5.3%
fma-def5.3%
Applied egg-rr5.3%
*-commutative5.3%
+-commutative5.3%
+-commutative5.3%
*-commutative5.3%
+-commutative5.3%
associate-/l*5.3%
+-commutative5.3%
+-commutative5.3%
+-commutative5.3%
Simplified5.3%
Taylor expanded in alpha around 0 7.9%
Taylor expanded in beta around inf 28.9%
unpow228.9%
unpow228.9%
times-frac66.8%
Simplified66.8%
Final simplification81.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta, double i) {
return 0.0625;
}
NOTE: alpha and beta 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
code = 0.0625d0
end function
assert alpha < beta;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta, i): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta, i) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 14.5%
associate-/l/13.7%
associate-*l*13.6%
times-frac19.4%
Simplified32.8%
Taylor expanded in i around inf 73.6%
Final simplification73.6%
herbie shell --seed 2023196
(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)))