
(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 10 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, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (+ beta (+ i alpha)))
(t_1 (fma i 2.0 (+ beta alpha)))
(t_2 (* beta (+ i alpha))))
(if (<= beta 1.15e+147)
0.0625
(if (<= beta 2e+157)
(*
(/ (/ (* i t_0) t_1) (+ t_1 1.0))
(/ (/ (fma i t_0 (* beta alpha)) t_1) (+ t_1 -1.0)))
(if (<= beta 5e+181)
(-
(+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
(* 0.125 (/ (+ beta alpha) i)))
(*
(/ i beta)
(/
1.0
(*
beta
(-
(+
(* 2.0 (/ alpha t_2))
(+ (* 4.0 (/ 1.0 beta)) (/ 1.0 (+ i alpha))))
(/ i t_2))))))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = beta + (i + alpha);
double t_1 = fma(i, 2.0, (beta + alpha));
double t_2 = beta * (i + alpha);
double tmp;
if (beta <= 1.15e+147) {
tmp = 0.0625;
} else if (beta <= 2e+157) {
tmp = (((i * t_0) / t_1) / (t_1 + 1.0)) * ((fma(i, t_0, (beta * alpha)) / t_1) / (t_1 + -1.0));
} else if (beta <= 5e+181) {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_2)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_2))));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(beta + Float64(i + alpha)) t_1 = fma(i, 2.0, Float64(beta + alpha)) t_2 = Float64(beta * Float64(i + alpha)) tmp = 0.0 if (beta <= 1.15e+147) tmp = 0.0625; elseif (beta <= 2e+157) tmp = Float64(Float64(Float64(Float64(i * t_0) / t_1) / Float64(t_1 + 1.0)) * Float64(Float64(fma(i, t_0, Float64(beta * alpha)) / t_1) / Float64(t_1 + -1.0))); elseif (beta <= 5e+181) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(1.0 / Float64(beta * Float64(Float64(Float64(2.0 * Float64(alpha / t_2)) + Float64(Float64(4.0 * Float64(1.0 / beta)) + Float64(1.0 / Float64(i + alpha)))) - Float64(i / t_2))))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(beta * N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.15e+147], 0.0625, If[LessEqual[beta, 2e+157], N[(N[(N[(N[(i * t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + 1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(i * t$95$0 + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5e+181], N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(1.0 / N[(beta * N[(N[(N[(2.0 * N[(alpha / t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(4.0 * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \beta + \left(i + \alpha\right)\\
t_1 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_2 := \beta \cdot \left(i + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+147}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 2 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{i \cdot t\_0}{t\_1}}{t\_1 + 1} \cdot \frac{\frac{\mathsf{fma}\left(i, t\_0, \beta \cdot \alpha\right)}{t\_1}}{t\_1 + -1}\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+181}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{1}{\beta \cdot \left(\left(2 \cdot \frac{\alpha}{t\_2} + \left(4 \cdot \frac{1}{\beta} + \frac{1}{i + \alpha}\right)\right) - \frac{i}{t\_2}\right)}\\
\end{array}
\end{array}
if beta < 1.15e147Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 1.15e147 < beta < 1.99999999999999997e157Initial program 0.5%
associate-/l/0.0%
+-commutative0.0%
*-commutative0.0%
distribute-rgt-in0.0%
+-commutative0.0%
distribute-rgt-in0.0%
fma-define0.0%
+-commutative0.0%
+-commutative0.0%
Simplified0.0%
Applied egg-rr41.1%
if 1.99999999999999997e157 < beta < 5.0000000000000003e181Initial program 0.0%
associate-/l/0.0%
times-frac8.7%
Simplified8.7%
Taylor expanded in i around inf 71.9%
if 5.0000000000000003e181 < beta Initial program 0.0%
associate-/l/0.0%
times-frac6.2%
Simplified6.2%
Taylor expanded in beta around inf 10.8%
clear-num10.8%
inv-pow10.8%
+-commutative10.8%
*-commutative10.8%
+-commutative10.8%
Applied egg-rr10.8%
unpow-110.8%
associate-/r/10.8%
+-commutative10.8%
associate-+r+10.8%
+-commutative10.8%
+-commutative10.8%
*-commutative10.8%
+-commutative10.8%
Simplified10.8%
Taylor expanded in beta around inf 80.3%
Taylor expanded in i around inf 80.7%
Final simplification77.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* beta (+ i alpha)))
(t_1 (fma i 2.0 (+ beta alpha)))
(t_2 (+ alpha (* i 2.0)))
(t_3 (* 2.0 (/ t_2 i))))
(if (<= beta 8.5e+146)
0.0625
(if (<= beta 1.75e+157)
(/
(/ (fma i (+ beta (+ i alpha)) (* beta alpha)) t_1)
(*
t_1
(*
beta
(+
(/
(+
(+
t_3
(/
(+
(/ (+ -1.0 (pow t_2 2.0)) i)
(* (+ i alpha) (- (+ 1.0 (/ alpha i)) t_3)))
beta))
(- -1.0 (/ alpha i)))
beta)
(/ 1.0 i)))))
(if (<= beta 3.4e+184)
(-
(+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
(* 0.125 (/ (+ beta alpha) i)))
(*
(/ i beta)
(/
1.0
(*
beta
(-
(+
(* 2.0 (/ alpha t_0))
(+ (* 4.0 (/ 1.0 beta)) (/ 1.0 (+ i alpha))))
(/ i t_0))))))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = beta * (i + alpha);
double t_1 = fma(i, 2.0, (beta + alpha));
double t_2 = alpha + (i * 2.0);
double t_3 = 2.0 * (t_2 / i);
double tmp;
if (beta <= 8.5e+146) {
tmp = 0.0625;
} else if (beta <= 1.75e+157) {
tmp = (fma(i, (beta + (i + alpha)), (beta * alpha)) / t_1) / (t_1 * (beta * ((((t_3 + ((((-1.0 + pow(t_2, 2.0)) / i) + ((i + alpha) * ((1.0 + (alpha / i)) - t_3))) / beta)) + (-1.0 - (alpha / i))) / beta) + (1.0 / i))));
} else if (beta <= 3.4e+184) {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_0)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_0))));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(beta * Float64(i + alpha)) t_1 = fma(i, 2.0, Float64(beta + alpha)) t_2 = Float64(alpha + Float64(i * 2.0)) t_3 = Float64(2.0 * Float64(t_2 / i)) tmp = 0.0 if (beta <= 8.5e+146) tmp = 0.0625; elseif (beta <= 1.75e+157) tmp = Float64(Float64(fma(i, Float64(beta + Float64(i + alpha)), Float64(beta * alpha)) / t_1) / Float64(t_1 * Float64(beta * Float64(Float64(Float64(Float64(t_3 + Float64(Float64(Float64(Float64(-1.0 + (t_2 ^ 2.0)) / i) + Float64(Float64(i + alpha) * Float64(Float64(1.0 + Float64(alpha / i)) - t_3))) / beta)) + Float64(-1.0 - Float64(alpha / i))) / beta) + Float64(1.0 / i))))); elseif (beta <= 3.4e+184) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(1.0 / Float64(beta * Float64(Float64(Float64(2.0 * Float64(alpha / t_0)) + Float64(Float64(4.0 * Float64(1.0 / beta)) + Float64(1.0 / Float64(i + alpha)))) - Float64(i / t_0))))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta * N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(alpha + N[(i * 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(t$95$2 / i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8.5e+146], 0.0625, If[LessEqual[beta, 1.75e+157], N[(N[(N[(i * N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * N[(beta * N[(N[(N[(N[(t$95$3 + N[(N[(N[(N[(-1.0 + N[Power[t$95$2, 2.0], $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision] + N[(N[(i + alpha), $MachinePrecision] * N[(N[(1.0 + N[(alpha / i), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] + N[(-1.0 - N[(alpha / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] + N[(1.0 / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 3.4e+184], N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(1.0 / N[(beta * N[(N[(N[(2.0 * N[(alpha / t$95$0), $MachinePrecision]), $MachinePrecision] + N[(N[(4.0 * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \beta \cdot \left(i + \alpha\right)\\
t_1 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_2 := \alpha + i \cdot 2\\
t_3 := 2 \cdot \frac{t\_2}{i}\\
\mathbf{if}\;\beta \leq 8.5 \cdot 10^{+146}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.75 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, \beta + \left(i + \alpha\right), \beta \cdot \alpha\right)}{t\_1}}{t\_1 \cdot \left(\beta \cdot \left(\frac{\left(t\_3 + \frac{\frac{-1 + {t\_2}^{2}}{i} + \left(i + \alpha\right) \cdot \left(\left(1 + \frac{\alpha}{i}\right) - t\_3\right)}{\beta}\right) + \left(-1 - \frac{\alpha}{i}\right)}{\beta} + \frac{1}{i}\right)\right)}\\
\mathbf{elif}\;\beta \leq 3.4 \cdot 10^{+184}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{1}{\beta \cdot \left(\left(2 \cdot \frac{\alpha}{t\_0} + \left(4 \cdot \frac{1}{\beta} + \frac{1}{i + \alpha}\right)\right) - \frac{i}{t\_0}\right)}\\
\end{array}
\end{array}
if beta < 8.5e146Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 8.5e146 < beta < 1.75000000000000001e157Initial program 0.5%
associate-/l/0.0%
times-frac20.6%
Simplified20.6%
clear-num20.6%
frac-times20.6%
*-un-lft-identity20.6%
*-commutative20.6%
+-commutative20.6%
fma-undefine20.6%
pow220.6%
+-commutative20.6%
Applied egg-rr20.6%
Taylor expanded in beta around -inf 39.7%
if 1.75000000000000001e157 < beta < 3.4000000000000002e184Initial program 0.0%
associate-/l/0.0%
times-frac8.7%
Simplified8.7%
Taylor expanded in i around inf 71.9%
if 3.4000000000000002e184 < beta Initial program 0.0%
associate-/l/0.0%
times-frac6.2%
Simplified6.2%
Taylor expanded in beta around inf 10.8%
clear-num10.8%
inv-pow10.8%
+-commutative10.8%
*-commutative10.8%
+-commutative10.8%
Applied egg-rr10.8%
unpow-110.8%
associate-/r/10.8%
+-commutative10.8%
associate-+r+10.8%
+-commutative10.8%
+-commutative10.8%
*-commutative10.8%
+-commutative10.8%
Simplified10.8%
Taylor expanded in beta around inf 80.3%
Taylor expanded in i around inf 80.7%
Final simplification77.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (fma i 2.0 (+ beta alpha)))
(t_1 (* beta (+ i alpha)))
(t_2 (/ beta (* i alpha))))
(if (<= beta 2.2e+145)
0.0625
(if (<= beta 1.75e+157)
(/
(/ (fma i (+ beta (+ i alpha)) (* beta alpha)) t_0)
(*
t_0
(*
alpha
(- (+ (* 2.0 t_2) (+ (/ 1.0 i) (* 3.0 (/ 1.0 alpha)))) t_2))))
(if (<= beta 5.2e+181)
(-
(+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
(* 0.125 (/ (+ beta alpha) i)))
(*
(/ i beta)
(/
1.0
(*
beta
(-
(+
(* 2.0 (/ alpha t_1))
(+ (* 4.0 (/ 1.0 beta)) (/ 1.0 (+ i alpha))))
(/ i t_1))))))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = fma(i, 2.0, (beta + alpha));
double t_1 = beta * (i + alpha);
double t_2 = beta / (i * alpha);
double tmp;
if (beta <= 2.2e+145) {
tmp = 0.0625;
} else if (beta <= 1.75e+157) {
tmp = (fma(i, (beta + (i + alpha)), (beta * alpha)) / t_0) / (t_0 * (alpha * (((2.0 * t_2) + ((1.0 / i) + (3.0 * (1.0 / alpha)))) - t_2)));
} else if (beta <= 5.2e+181) {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_1)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_1))));
}
return tmp;
}
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = fma(i, 2.0, Float64(beta + alpha)) t_1 = Float64(beta * Float64(i + alpha)) t_2 = Float64(beta / Float64(i * alpha)) tmp = 0.0 if (beta <= 2.2e+145) tmp = 0.0625; elseif (beta <= 1.75e+157) tmp = Float64(Float64(fma(i, Float64(beta + Float64(i + alpha)), Float64(beta * alpha)) / t_0) / Float64(t_0 * Float64(alpha * Float64(Float64(Float64(2.0 * t_2) + Float64(Float64(1.0 / i) + Float64(3.0 * Float64(1.0 / alpha)))) - t_2)))); elseif (beta <= 5.2e+181) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(1.0 / Float64(beta * Float64(Float64(Float64(2.0 * Float64(alpha / t_1)) + Float64(Float64(4.0 * Float64(1.0 / beta)) + Float64(1.0 / Float64(i + alpha)))) - Float64(i / t_1))))); end return tmp end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(i * 2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(beta * N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(beta / N[(i * alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.2e+145], 0.0625, If[LessEqual[beta, 1.75e+157], N[(N[(N[(i * N[(beta + N[(i + alpha), $MachinePrecision]), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha * N[(N[(N[(2.0 * t$95$2), $MachinePrecision] + N[(N[(1.0 / i), $MachinePrecision] + N[(3.0 * N[(1.0 / alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5.2e+181], N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(1.0 / N[(beta * N[(N[(N[(2.0 * N[(alpha / t$95$1), $MachinePrecision]), $MachinePrecision] + N[(N[(4.0 * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(i, 2, \beta + \alpha\right)\\
t_1 := \beta \cdot \left(i + \alpha\right)\\
t_2 := \frac{\beta}{i \cdot \alpha}\\
\mathbf{if}\;\beta \leq 2.2 \cdot 10^{+145}:\\
\;\;\;\;0.0625\\
\mathbf{elif}\;\beta \leq 1.75 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(i, \beta + \left(i + \alpha\right), \beta \cdot \alpha\right)}{t\_0}}{t\_0 \cdot \left(\alpha \cdot \left(\left(2 \cdot t\_2 + \left(\frac{1}{i} + 3 \cdot \frac{1}{\alpha}\right)\right) - t\_2\right)\right)}\\
\mathbf{elif}\;\beta \leq 5.2 \cdot 10^{+181}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{1}{\beta \cdot \left(\left(2 \cdot \frac{\alpha}{t\_1} + \left(4 \cdot \frac{1}{\beta} + \frac{1}{i + \alpha}\right)\right) - \frac{i}{t\_1}\right)}\\
\end{array}
\end{array}
if beta < 2.20000000000000009e145Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 2.20000000000000009e145 < beta < 1.75000000000000001e157Initial program 0.5%
associate-/l/0.0%
times-frac20.6%
Simplified20.6%
clear-num20.6%
frac-times20.6%
*-un-lft-identity20.6%
*-commutative20.6%
+-commutative20.6%
fma-undefine20.6%
pow220.6%
+-commutative20.6%
Applied egg-rr20.6%
Taylor expanded in alpha around inf 37.9%
if 1.75000000000000001e157 < beta < 5.2e181Initial program 0.0%
associate-/l/0.0%
times-frac8.7%
Simplified8.7%
Taylor expanded in i around inf 71.9%
if 5.2e181 < beta Initial program 0.0%
associate-/l/0.0%
times-frac6.2%
Simplified6.2%
Taylor expanded in beta around inf 10.8%
clear-num10.8%
inv-pow10.8%
+-commutative10.8%
*-commutative10.8%
+-commutative10.8%
Applied egg-rr10.8%
unpow-110.8%
associate-/r/10.8%
+-commutative10.8%
associate-+r+10.8%
+-commutative10.8%
+-commutative10.8%
*-commutative10.8%
+-commutative10.8%
Simplified10.8%
Taylor expanded in beta around inf 80.3%
Taylor expanded in i around inf 80.7%
Final simplification76.9%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(let* ((t_0 (* beta (+ i alpha))))
(if (<= beta 3.5e+146)
0.0625
(*
(/ i beta)
(/
1.0
(*
beta
(-
(+ (* 2.0 (/ alpha t_0)) (+ (* 4.0 (/ 1.0 beta)) (/ 1.0 (+ i alpha))))
(/ i t_0))))))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double t_0 = beta * (i + alpha);
double tmp;
if (beta <= 3.5e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_0)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_0))));
}
return tmp;
}
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) :: t_0
real(8) :: tmp
t_0 = beta * (i + alpha)
if (beta <= 3.5d+146) then
tmp = 0.0625d0
else
tmp = (i / beta) * (1.0d0 / (beta * (((2.0d0 * (alpha / t_0)) + ((4.0d0 * (1.0d0 / beta)) + (1.0d0 / (i + alpha)))) - (i / t_0))))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double t_0 = beta * (i + alpha);
double tmp;
if (beta <= 3.5e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_0)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_0))));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): t_0 = beta * (i + alpha) tmp = 0 if beta <= 3.5e+146: tmp = 0.0625 else: tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_0)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_0)))) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) t_0 = Float64(beta * Float64(i + alpha)) tmp = 0.0 if (beta <= 3.5e+146) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(1.0 / Float64(beta * Float64(Float64(Float64(2.0 * Float64(alpha / t_0)) + Float64(Float64(4.0 * Float64(1.0 / beta)) + Float64(1.0 / Float64(i + alpha)))) - Float64(i / t_0))))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
t_0 = beta * (i + alpha);
tmp = 0.0;
if (beta <= 3.5e+146)
tmp = 0.0625;
else
tmp = (i / beta) * (1.0 / (beta * (((2.0 * (alpha / t_0)) + ((4.0 * (1.0 / beta)) + (1.0 / (i + alpha)))) - (i / t_0))));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
code[alpha_, beta_, i_] := Block[{t$95$0 = N[(beta * N[(i + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.5e+146], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(1.0 / N[(beta * N[(N[(N[(2.0 * N[(alpha / t$95$0), $MachinePrecision]), $MachinePrecision] + N[(N[(4.0 * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(i + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
t_0 := \beta \cdot \left(i + \alpha\right)\\
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+146}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{1}{\beta \cdot \left(\left(2 \cdot \frac{\alpha}{t\_0} + \left(4 \cdot \frac{1}{\beta} + \frac{1}{i + \alpha}\right)\right) - \frac{i}{t\_0}\right)}\\
\end{array}
\end{array}
if beta < 3.5000000000000001e146Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 3.5000000000000001e146 < beta Initial program 0.1%
associate-/l/0.0%
times-frac8.2%
Simplified8.2%
Taylor expanded in beta around inf 18.1%
clear-num18.1%
inv-pow18.1%
+-commutative18.1%
*-commutative18.1%
+-commutative18.1%
Applied egg-rr18.1%
unpow-118.1%
associate-/r/18.2%
+-commutative18.2%
associate-+r+18.2%
+-commutative18.2%
+-commutative18.2%
*-commutative18.2%
+-commutative18.2%
Simplified18.2%
Taylor expanded in beta around inf 64.4%
Taylor expanded in i around inf 64.9%
Final simplification75.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function.
(FPCore (alpha beta i)
:precision binary64
(if (<= beta 2.1e+183)
(-
(+ 0.0625 (* 0.0625 (/ (+ (* alpha 2.0) (* beta 2.0)) i)))
(* 0.125 (/ (+ beta alpha) i)))
(* (/ i beta) (* (+ i alpha) (/ 1.0 beta)))))assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.1e+183) {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * ((i + alpha) * (1.0 / beta));
}
return tmp;
}
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 <= 2.1d+183) then
tmp = (0.0625d0 + (0.0625d0 * (((alpha * 2.0d0) + (beta * 2.0d0)) / i))) - (0.125d0 * ((beta + alpha) / i))
else
tmp = (i / beta) * ((i + alpha) * (1.0d0 / beta))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 2.1e+183) {
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i));
} else {
tmp = (i / beta) * ((i + alpha) * (1.0 / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 2.1e+183: tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i)) else: tmp = (i / beta) * ((i + alpha) * (1.0 / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 2.1e+183) tmp = Float64(Float64(0.0625 + Float64(0.0625 * Float64(Float64(Float64(alpha * 2.0) + Float64(beta * 2.0)) / i))) - Float64(0.125 * Float64(Float64(beta + alpha) / i))); else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) * Float64(1.0 / beta))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 2.1e+183)
tmp = (0.0625 + (0.0625 * (((alpha * 2.0) + (beta * 2.0)) / i))) - (0.125 * ((beta + alpha) / i));
else
tmp = (i / beta) * ((i + alpha) * (1.0 / beta));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 2.1e+183], N[(N[(0.0625 + N[(0.0625 * N[(N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.125 * N[(N[(beta + alpha), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1 \cdot 10^{+183}:\\
\;\;\;\;\left(0.0625 + 0.0625 \cdot \frac{\alpha \cdot 2 + \beta \cdot 2}{i}\right) - 0.125 \cdot \frac{\beta + \alpha}{i}\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \left(\left(i + \alpha\right) \cdot \frac{1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 2.1e183Initial program 17.6%
associate-/l/15.8%
times-frac37.5%
Simplified37.5%
Taylor expanded in i around inf 80.6%
if 2.1e183 < beta Initial program 0.0%
associate-/l/0.0%
times-frac6.2%
Simplified6.2%
Taylor expanded in beta around inf 10.8%
Taylor expanded in beta around inf 80.4%
+-commutative80.4%
Simplified80.4%
div-inv80.4%
+-commutative80.4%
Applied egg-rr80.4%
+-commutative80.4%
Simplified80.4%
Final simplification80.6%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 9.5e+145) 0.0625 (* (/ i beta) (* (+ i alpha) (/ 1.0 beta)))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.5e+145) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) * (1.0 / beta));
}
return tmp;
}
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 <= 9.5d+145) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((i + alpha) * (1.0d0 / beta))
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 9.5e+145) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) * (1.0 / beta));
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 9.5e+145: tmp = 0.0625 else: tmp = (i / beta) * ((i + alpha) * (1.0 / beta)) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 9.5e+145) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) * Float64(1.0 / beta))); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 9.5e+145)
tmp = 0.0625;
else
tmp = (i / beta) * ((i + alpha) * (1.0 / beta));
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 9.5e+145], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.5 \cdot 10^{+145}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \left(\left(i + \alpha\right) \cdot \frac{1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 9.49999999999999948e145Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 9.49999999999999948e145 < beta Initial program 0.1%
associate-/l/0.0%
times-frac8.2%
Simplified8.2%
Taylor expanded in beta around inf 18.1%
Taylor expanded in beta around inf 64.4%
+-commutative64.4%
Simplified64.4%
div-inv64.4%
+-commutative64.4%
Applied egg-rr64.4%
+-commutative64.4%
Simplified64.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 7.2e+146) 0.0625 (* (/ i beta) (/ (+ i alpha) beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.2e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
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 <= 7.2d+146) then
tmp = 0.0625d0
else
tmp = (i / beta) * ((i + alpha) / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 7.2e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * ((i + alpha) / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 7.2e+146: tmp = 0.0625 else: tmp = (i / beta) * ((i + alpha) / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 7.2e+146) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(Float64(i + alpha) / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 7.2e+146)
tmp = 0.0625;
else
tmp = (i / beta) * ((i + alpha) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 7.2e+146], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(N[(i + alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.2 \cdot 10^{+146}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i + \alpha}{\beta}\\
\end{array}
\end{array}
if beta < 7.1999999999999997e146Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 7.1999999999999997e146 < beta Initial program 0.1%
associate-/l/0.0%
times-frac8.2%
Simplified8.2%
Taylor expanded in beta around inf 18.1%
Taylor expanded in beta around inf 64.4%
+-commutative64.4%
Simplified64.4%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 1.25e+146) 0.0625 (* (/ i beta) (/ i beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.25e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
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 <= 1.25d+146) then
tmp = 0.0625d0
else
tmp = (i / beta) * (i / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 1.25e+146) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (i / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 1.25e+146: tmp = 0.0625 else: tmp = (i / beta) * (i / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 1.25e+146) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(i / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 1.25e+146)
tmp = 0.0625;
else
tmp = (i / beta) * (i / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 1.25e+146], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(i / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.25 \cdot 10^{+146}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{i}{\beta}\\
\end{array}
\end{array}
if beta < 1.25e146Initial program 19.2%
associate-/l/17.2%
times-frac39.8%
Simplified39.8%
Taylor expanded in i around inf 77.6%
if 1.25e146 < beta Initial program 0.1%
associate-/l/0.0%
times-frac8.2%
Simplified8.2%
Taylor expanded in beta around inf 18.1%
Taylor expanded in beta around inf 64.4%
+-commutative64.4%
Simplified64.4%
Taylor expanded in i around inf 62.5%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 (if (<= beta 3.6e+218) 0.0625 (* (/ i beta) (/ alpha beta))))
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+218) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
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.6d+218) then
tmp = 0.0625d0
else
tmp = (i / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
double tmp;
if (beta <= 3.6e+218) {
tmp = 0.0625;
} else {
tmp = (i / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): tmp = 0 if beta <= 3.6e+218: tmp = 0.0625 else: tmp = (i / beta) * (alpha / beta) return tmp
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) tmp = 0.0 if (beta <= 3.6e+218) tmp = 0.0625; else tmp = Float64(Float64(i / beta) * Float64(alpha / beta)); end return tmp end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp_2 = code(alpha, beta, i)
tmp = 0.0;
if (beta <= 3.6e+218)
tmp = 0.0625;
else
tmp = (i / beta) * (alpha / beta);
end
tmp_2 = tmp;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := If[LessEqual[beta, 3.6e+218], 0.0625, N[(N[(i / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+218}:\\
\;\;\;\;0.0625\\
\mathbf{else}:\\
\;\;\;\;\frac{i}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 3.59999999999999991e218Initial program 16.8%
associate-/l/15.1%
times-frac36.2%
Simplified36.2%
Taylor expanded in i around inf 73.5%
if 3.59999999999999991e218 < beta Initial program 0.0%
associate-/l/0.0%
times-frac4.3%
Simplified4.3%
Taylor expanded in beta around inf 6.3%
Taylor expanded in beta around inf 87.6%
+-commutative87.6%
Simplified87.6%
Taylor expanded in i around 0 45.0%
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. (FPCore (alpha beta i) :precision binary64 0.0625)
assert(alpha < beta && beta < i);
double code(double alpha, double beta, double i) {
return 0.0625;
}
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
code = 0.0625d0
end function
assert alpha < beta && beta < i;
public static double code(double alpha, double beta, double i) {
return 0.0625;
}
[alpha, beta, i] = sort([alpha, beta, i]) def code(alpha, beta, i): return 0.0625
alpha, beta, i = sort([alpha, beta, i]) function code(alpha, beta, i) return 0.0625 end
alpha, beta, i = num2cell(sort([alpha, beta, i])){:}
function tmp = code(alpha, beta, i)
tmp = 0.0625;
end
NOTE: alpha, beta, and i should be sorted in increasing order before calling this function. code[alpha_, beta_, i_] := 0.0625
\begin{array}{l}
[alpha, beta, i] = \mathsf{sort}([alpha, beta, i])\\
\\
0.0625
\end{array}
Initial program 15.3%
associate-/l/13.7%
times-frac33.3%
Simplified33.3%
Taylor expanded in i around inf 67.7%
herbie shell --seed 2024100
(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)))