
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 4e+34)
(/
(+ alpha (- 1.0 (* beta (- -1.0 alpha))))
(* (+ alpha (+ beta 3.0)) (* t_1 t_1)))
(/
(/
(+
(+ (+ alpha 1.0) (+ (/ 1.0 beta) (/ alpha beta)))
(/ (- -1.0 alpha) (/ beta (+ alpha 2.0))))
t_0)
(+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+34) {
tmp = (alpha + (1.0 - (beta * (-1.0 - alpha)))) / ((alpha + (beta + 3.0)) * (t_1 * t_1));
} else {
tmp = ((((alpha + 1.0) + ((1.0 / beta) + (alpha / beta))) + ((-1.0 - alpha) / (beta / (alpha + 2.0)))) / t_0) / (1.0 + t_0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 4d+34) then
tmp = (alpha + (1.0d0 - (beta * ((-1.0d0) - alpha)))) / ((alpha + (beta + 3.0d0)) * (t_1 * t_1))
else
tmp = ((((alpha + 1.0d0) + ((1.0d0 / beta) + (alpha / beta))) + (((-1.0d0) - alpha) / (beta / (alpha + 2.0d0)))) / t_0) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+34) {
tmp = (alpha + (1.0 - (beta * (-1.0 - alpha)))) / ((alpha + (beta + 3.0)) * (t_1 * t_1));
} else {
tmp = ((((alpha + 1.0) + ((1.0 / beta) + (alpha / beta))) + ((-1.0 - alpha) / (beta / (alpha + 2.0)))) / t_0) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 4e+34: tmp = (alpha + (1.0 - (beta * (-1.0 - alpha)))) / ((alpha + (beta + 3.0)) * (t_1 * t_1)) else: tmp = ((((alpha + 1.0) + ((1.0 / beta) + (alpha / beta))) + ((-1.0 - alpha) / (beta / (alpha + 2.0)))) / t_0) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4e+34) tmp = Float64(Float64(alpha + Float64(1.0 - Float64(beta * Float64(-1.0 - alpha)))) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(t_1 * t_1))); else tmp = Float64(Float64(Float64(Float64(Float64(alpha + 1.0) + Float64(Float64(1.0 / beta) + Float64(alpha / beta))) + Float64(Float64(-1.0 - alpha) / Float64(beta / Float64(alpha + 2.0)))) / t_0) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 4e+34)
tmp = (alpha + (1.0 - (beta * (-1.0 - alpha)))) / ((alpha + (beta + 3.0)) * (t_1 * t_1));
else
tmp = ((((alpha + 1.0) + ((1.0 / beta) + (alpha / beta))) + ((-1.0 - alpha) / (beta / (alpha + 2.0)))) / t_0) / (1.0 + t_0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+34], N[(N[(alpha + N[(1.0 - N[(beta * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] + N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - alpha), $MachinePrecision] / N[(beta / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+34}:\\
\;\;\;\;\frac{\alpha + \left(1 - \beta \cdot \left(-1 - \alpha\right)\right)}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(t_1 \cdot t_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(\alpha + 1\right) + \left(\frac{1}{\beta} + \frac{\alpha}{\beta}\right)\right) + \frac{-1 - \alpha}{\frac{\beta}{\alpha + 2}}}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 3.99999999999999978e34Initial program 99.8%
associate-/l/99.1%
associate-/l/95.9%
associate-+l+95.9%
associate-+l+95.9%
*-commutative95.9%
fma-def95.9%
metadata-eval95.9%
associate-+l+95.9%
associate-+l+95.9%
metadata-eval95.9%
metadata-eval95.9%
associate-+l+95.9%
metadata-eval95.9%
associate-+l+95.9%
Simplified95.9%
Taylor expanded in beta around 0 95.9%
if 3.99999999999999978e34 < beta Initial program 71.7%
Taylor expanded in beta around inf 70.0%
associate-+r+70.0%
associate-/l*75.5%
Simplified75.5%
Final simplification91.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 1e+141)
(/ (/ (/ (+ 1.0 (+ (+ beta alpha) (* beta alpha))) t_0) t_0) (+ 1.0 t_0))
(*
(/ (+ alpha 1.0) (+ beta (+ alpha 3.0)))
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ beta (+ alpha 2.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1e+141) {
tmp = (((1.0 + ((beta + alpha) + (beta * alpha))) / t_0) / t_0) / (1.0 + t_0);
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
if (beta <= 1d+141) then
tmp = (((1.0d0 + ((beta + alpha) + (beta * alpha))) / t_0) / t_0) / (1.0d0 + t_0)
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 3.0d0))) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (beta + (alpha + 2.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1e+141) {
tmp = (((1.0 + ((beta + alpha) + (beta * alpha))) / t_0) / t_0) / (1.0 + t_0);
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 1e+141: tmp = (((1.0 + ((beta + alpha) + (beta * alpha))) / t_0) / t_0) / (1.0 + t_0) else: tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 1e+141) tmp = Float64(Float64(Float64(Float64(1.0 + Float64(Float64(beta + alpha) + Float64(beta * alpha))) / t_0) / t_0) / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / Float64(beta + Float64(alpha + 2.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 1e+141)
tmp = (((1.0 + ((beta + alpha) + (beta * alpha))) / t_0) / t_0) / (1.0 + t_0);
else
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+141], N[(N[(N[(N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 10^{+141}:\\
\;\;\;\;\frac{\frac{\frac{1 + \left(\left(\beta + \alpha\right) + \beta \cdot \alpha\right)}{t_0}}{t_0}}{1 + t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 1.00000000000000002e141Initial program 98.5%
if 1.00000000000000002e141 < beta Initial program 63.4%
associate-/l/61.6%
associate-+l+61.6%
+-commutative61.6%
associate-+r+61.6%
associate-+l+61.6%
distribute-rgt1-in61.6%
*-rgt-identity61.6%
distribute-lft-out61.6%
+-commutative61.6%
associate-*l/90.8%
*-commutative90.8%
associate-*r/90.8%
Simplified90.8%
Taylor expanded in beta around inf 90.8%
mul-1-neg90.8%
unsub-neg90.8%
Simplified90.8%
expm1-log1p-u90.8%
expm1-udef88.3%
+-commutative88.3%
*-commutative88.3%
+-commutative88.3%
+-commutative88.3%
Applied egg-rr88.3%
expm1-def90.8%
expm1-log1p90.8%
associate-*r/76.7%
times-frac81.0%
associate-+l+81.0%
sub-neg81.0%
distribute-neg-frac81.0%
distribute-neg-in81.0%
metadata-eval81.0%
sub-neg81.0%
associate-+l+81.0%
Simplified81.0%
Final simplification96.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5e+139)
(* (+ alpha 1.0) (/ (/ (+ beta 1.0) t_0) (* (+ alpha (+ beta 3.0)) t_0)))
(*
(/ (+ alpha 1.0) (+ beta (+ alpha 3.0)))
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ beta (+ alpha 2.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+139) {
tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5d+139) then
tmp = (alpha + 1.0d0) * (((beta + 1.0d0) / t_0) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 3.0d0))) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (beta + (alpha + 2.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+139) {
tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+139: tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+139) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(beta + 1.0) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / Float64(beta + Float64(alpha + 2.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5e+139)
tmp = (alpha + 1.0) * (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+139], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+139}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{\beta + 1}{t_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 5.0000000000000003e139Initial program 98.5%
associate-/l/96.5%
associate-+l+96.5%
+-commutative96.5%
associate-+r+96.5%
associate-+l+96.5%
distribute-rgt1-in96.5%
*-rgt-identity96.5%
distribute-lft-out96.5%
+-commutative96.5%
associate-*l/97.9%
*-commutative97.9%
associate-*r/94.9%
Simplified94.9%
if 5.0000000000000003e139 < beta Initial program 63.4%
associate-/l/61.6%
associate-+l+61.6%
+-commutative61.6%
associate-+r+61.6%
associate-+l+61.6%
distribute-rgt1-in61.6%
*-rgt-identity61.6%
distribute-lft-out61.6%
+-commutative61.6%
associate-*l/90.8%
*-commutative90.8%
associate-*r/90.8%
Simplified90.8%
Taylor expanded in beta around inf 90.8%
mul-1-neg90.8%
unsub-neg90.8%
Simplified90.8%
expm1-log1p-u90.8%
expm1-udef88.3%
+-commutative88.3%
*-commutative88.3%
+-commutative88.3%
+-commutative88.3%
Applied egg-rr88.3%
expm1-def90.8%
expm1-log1p90.8%
associate-*r/76.7%
times-frac81.0%
associate-+l+81.0%
sub-neg81.0%
distribute-neg-frac81.0%
distribute-neg-in81.0%
metadata-eval81.0%
sub-neg81.0%
associate-+l+81.0%
Simplified81.0%
Final simplification93.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.8e+140)
(*
(+ alpha 1.0)
(/ (/ (+ beta 1.0) (+ alpha (+ beta 2.0))) (* (+ beta 3.0) (+ beta 2.0))))
(*
(/ (+ alpha 1.0) (+ beta (+ alpha 3.0)))
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ beta (+ alpha 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8e+140) {
tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.8d+140) then
tmp = (alpha + 1.0d0) * (((beta + 1.0d0) / (alpha + (beta + 2.0d0))) / ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 3.0d0))) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (beta + (alpha + 2.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8e+140) {
tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.8e+140: tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.8e+140) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / Float64(beta + Float64(alpha + 2.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.8e+140)
tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.8e+140], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+140}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{\beta + 1}{\alpha + \left(\beta + 2\right)}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 3.8000000000000001e140Initial program 98.5%
associate-/l/96.5%
associate-+l+96.5%
+-commutative96.5%
associate-+r+96.5%
associate-+l+96.5%
distribute-rgt1-in96.5%
*-rgt-identity96.5%
distribute-lft-out96.5%
+-commutative96.5%
associate-*l/97.9%
*-commutative97.9%
associate-*r/94.9%
Simplified94.9%
Taylor expanded in alpha around 0 66.6%
if 3.8000000000000001e140 < beta Initial program 63.4%
associate-/l/61.6%
associate-+l+61.6%
+-commutative61.6%
associate-+r+61.6%
associate-+l+61.6%
distribute-rgt1-in61.6%
*-rgt-identity61.6%
distribute-lft-out61.6%
+-commutative61.6%
associate-*l/90.8%
*-commutative90.8%
associate-*r/90.8%
Simplified90.8%
Taylor expanded in beta around inf 90.8%
mul-1-neg90.8%
unsub-neg90.8%
Simplified90.8%
expm1-log1p-u90.8%
expm1-udef88.3%
+-commutative88.3%
*-commutative88.3%
+-commutative88.3%
+-commutative88.3%
Applied egg-rr88.3%
expm1-def90.8%
expm1-log1p90.8%
associate-*r/76.7%
times-frac81.0%
associate-+l+81.0%
sub-neg81.0%
distribute-neg-frac81.0%
distribute-neg-in81.0%
metadata-eval81.0%
sub-neg81.0%
associate-+l+81.0%
Simplified81.0%
Final simplification68.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 3.4e+36)
(/ (+ alpha (+ beta 1.0)) (* (+ alpha (+ beta 3.0)) (* t_0 t_0)))
(*
(/ (+ alpha 1.0) (+ beta (+ alpha 3.0)))
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ beta (+ alpha 2.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.4e+36) {
tmp = (alpha + (beta + 1.0)) / ((alpha + (beta + 3.0)) * (t_0 * t_0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3.4d+36) then
tmp = (alpha + (beta + 1.0d0)) / ((alpha + (beta + 3.0d0)) * (t_0 * t_0))
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 3.0d0))) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (beta + (alpha + 2.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.4e+36) {
tmp = (alpha + (beta + 1.0)) / ((alpha + (beta + 3.0)) * (t_0 * t_0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.4e+36: tmp = (alpha + (beta + 1.0)) / ((alpha + (beta + 3.0)) * (t_0 * t_0)) else: tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.4e+36) tmp = Float64(Float64(alpha + Float64(beta + 1.0)) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(t_0 * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / Float64(beta + Float64(alpha + 2.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3.4e+36)
tmp = (alpha + (beta + 1.0)) / ((alpha + (beta + 3.0)) * (t_0 * t_0));
else
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 2.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.4e+36], N[(N[(alpha + N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+36}:\\
\;\;\;\;\frac{\alpha + \left(\beta + 1\right)}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(t_0 \cdot t_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 3.3999999999999998e36Initial program 99.8%
associate-/l/99.1%
associate-/l/95.9%
associate-+l+95.9%
associate-+l+95.9%
*-commutative95.9%
fma-def95.9%
metadata-eval95.9%
associate-+l+95.9%
associate-+l+95.9%
metadata-eval95.9%
metadata-eval95.9%
associate-+l+95.9%
metadata-eval95.9%
associate-+l+95.9%
Simplified95.9%
Taylor expanded in beta around 0 95.9%
Taylor expanded in alpha around 0 95.3%
if 3.3999999999999998e36 < beta Initial program 71.7%
associate-/l/65.6%
associate-+l+65.6%
+-commutative65.6%
associate-+r+65.6%
associate-+l+65.6%
distribute-rgt1-in65.6%
*-rgt-identity65.6%
distribute-lft-out65.6%
+-commutative65.6%
associate-*l/89.2%
*-commutative89.2%
associate-*r/89.2%
Simplified89.2%
Taylor expanded in beta around inf 89.2%
mul-1-neg89.2%
unsub-neg89.2%
Simplified89.2%
expm1-log1p-u89.2%
expm1-udef64.1%
+-commutative64.1%
*-commutative64.1%
+-commutative64.1%
+-commutative64.1%
Applied egg-rr64.1%
expm1-def89.2%
expm1-log1p89.2%
associate-*r/73.2%
times-frac75.8%
associate-+l+75.8%
sub-neg75.8%
distribute-neg-frac75.8%
distribute-neg-in75.8%
metadata-eval75.8%
sub-neg75.8%
associate-+l+75.8%
Simplified75.8%
Final simplification91.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1e+49)
(*
(+ alpha 1.0)
(/ (/ (+ beta 1.0) (+ alpha (+ beta 2.0))) (* (+ beta 3.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+49) {
tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1d+49) then
tmp = (alpha + 1.0d0) * (((beta + 1.0d0) / (alpha + (beta + 2.0d0))) / ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+49) {
tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+49: tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+49) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1e+49)
tmp = (alpha + 1.0) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1e+49], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+49}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{\beta + 1}{\alpha + \left(\beta + 2\right)}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 9.99999999999999946e48Initial program 99.3%
associate-/l/98.2%
associate-+l+98.2%
+-commutative98.2%
associate-+r+98.2%
associate-+l+98.2%
distribute-rgt1-in98.2%
*-rgt-identity98.2%
distribute-lft-out98.2%
+-commutative98.2%
associate-*l/98.6%
*-commutative98.6%
associate-*r/95.4%
Simplified95.4%
Taylor expanded in alpha around 0 65.1%
if 9.99999999999999946e48 < beta Initial program 72.0%
Taylor expanded in beta around -inf 79.0%
Taylor expanded in beta around inf 78.4%
associate-*r/78.4%
neg-mul-178.4%
sub-neg78.4%
metadata-eval78.4%
metadata-eval78.4%
distribute-lft-in78.4%
+-commutative78.4%
distribute-lft-in78.4%
metadata-eval78.4%
neg-mul-178.4%
unsub-neg78.4%
Simplified78.4%
expm1-log1p-u78.4%
expm1-udef65.6%
metadata-eval65.6%
associate-+l+65.6%
metadata-eval65.6%
associate-+r+65.6%
+-commutative65.6%
Applied egg-rr65.6%
expm1-def78.4%
expm1-log1p78.4%
distribute-frac-neg78.4%
distribute-frac-neg78.4%
associate-+l+78.4%
Simplified78.4%
Final simplification67.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2e+35)
(*
(+ alpha 1.0)
(/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0)))))
(/ (/ (+ alpha 1.0) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+35) {
tmp = (alpha + 1.0) * ((beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2d+35) then
tmp = (alpha + 1.0d0) * ((beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0))))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+35) {
tmp = (alpha + 1.0) * ((beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+35: tmp = (alpha + 1.0) * ((beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)))) else: tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+35) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2e+35)
tmp = (alpha + 1.0) * ((beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))));
else
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2e+35], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+35}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.9999999999999999e35Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.1%
*-commutative99.1%
associate-*r/95.8%
Simplified95.8%
Taylor expanded in alpha around 0 65.1%
Taylor expanded in alpha around 0 64.7%
*-un-lft-identity64.7%
associate-/l/64.7%
+-commutative64.7%
*-commutative64.7%
Applied egg-rr64.7%
*-lft-identity64.7%
+-commutative64.7%
associate-*l*64.7%
Simplified64.7%
if 1.9999999999999999e35 < beta Initial program 71.7%
Taylor expanded in beta around -inf 76.9%
Taylor expanded in beta around inf 76.1%
associate-*r/76.1%
neg-mul-176.1%
sub-neg76.1%
metadata-eval76.1%
metadata-eval76.1%
distribute-lft-in76.1%
+-commutative76.1%
distribute-lft-in76.1%
metadata-eval76.1%
neg-mul-176.1%
unsub-neg76.1%
Simplified76.1%
expm1-log1p-u76.1%
expm1-udef64.1%
metadata-eval64.1%
associate-+l+64.1%
metadata-eval64.1%
associate-+r+64.1%
+-commutative64.1%
Applied egg-rr64.1%
expm1-def76.1%
expm1-log1p76.1%
distribute-frac-neg76.1%
distribute-frac-neg76.1%
associate-+l+76.1%
Simplified76.1%
Final simplification67.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (* (+ alpha 1.0) (+ 0.08333333333333333 (* beta -0.027777777777777776))) (/ (/ (+ alpha 1.0) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = (alpha + 1.0d0) * (0.08333333333333333d0 + (beta * (-0.027777777777777776d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(Float64(alpha + 1.0) * Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(N[(alpha + 1.0), $MachinePrecision] * N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \left(0.08333333333333333 + \beta \cdot -0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 63.2%
*-commutative63.2%
Simplified63.2%
if 2.5 < beta Initial program 77.6%
Taylor expanded in beta around -inf 74.8%
Taylor expanded in beta around inf 74.0%
associate-*r/74.0%
neg-mul-174.0%
sub-neg74.0%
metadata-eval74.0%
metadata-eval74.0%
distribute-lft-in74.0%
+-commutative74.0%
distribute-lft-in74.0%
metadata-eval74.0%
neg-mul-174.0%
unsub-neg74.0%
Simplified74.0%
expm1-log1p-u74.0%
expm1-udef54.0%
metadata-eval54.0%
associate-+l+54.0%
metadata-eval54.0%
associate-+r+54.0%
+-commutative54.0%
Applied egg-rr54.0%
expm1-def74.0%
expm1-log1p74.0%
distribute-frac-neg74.0%
distribute-frac-neg74.0%
associate-+l+74.0%
Simplified74.0%
Final simplification66.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.4)
(* (+ alpha 1.0) 0.08333333333333333)
(if (<= beta 5e+154)
(/ (+ alpha 1.0) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else if (beta <= 5e+154) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.4d0) then
tmp = (alpha + 1.0d0) * 0.08333333333333333d0
else if (beta <= 5d+154) then
tmp = (alpha + 1.0d0) / (beta * beta)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else if (beta <= 5e+154) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4: tmp = (alpha + 1.0) * 0.08333333333333333 elif beta <= 5e+154: tmp = (alpha + 1.0) / (beta * beta) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = Float64(Float64(alpha + 1.0) * 0.08333333333333333); elseif (beta <= 5e+154) tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.4)
tmp = (alpha + 1.0) * 0.08333333333333333;
elseif (beta <= 5e+154)
tmp = (alpha + 1.0) / (beta * beta);
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.4], N[(N[(alpha + 1.0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision], If[LessEqual[beta, 5e+154], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;\left(\alpha + 1\right) \cdot 0.08333333333333333\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+154}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 62.4%
if 3.39999999999999991 < beta < 5.00000000000000004e154Initial program 91.6%
associate-/l/83.9%
associate-+l+83.9%
+-commutative83.9%
associate-+r+83.9%
associate-+l+83.9%
distribute-rgt1-in83.9%
*-rgt-identity83.9%
distribute-lft-out83.9%
+-commutative83.9%
associate-*l/92.0%
*-commutative92.0%
associate-*r/92.0%
Simplified92.0%
Taylor expanded in beta around inf 67.2%
unpow267.2%
Simplified67.2%
if 5.00000000000000004e154 < beta Initial program 62.4%
associate-/l/60.5%
associate-+l+60.5%
+-commutative60.5%
associate-+r+60.5%
associate-+l+60.5%
distribute-rgt1-in60.5%
*-rgt-identity60.5%
distribute-lft-out60.5%
+-commutative60.5%
associate-*l/90.6%
*-commutative90.6%
associate-*r/90.6%
Simplified90.6%
Taylor expanded in beta around inf 90.6%
unpow290.6%
Simplified90.6%
clear-num90.6%
inv-pow90.6%
+-commutative90.6%
Applied egg-rr90.6%
unpow-190.6%
associate-/l*79.3%
+-commutative79.3%
Simplified79.3%
*-un-lft-identity79.3%
associate-/r/80.4%
+-commutative80.4%
Applied egg-rr80.4%
*-lft-identity80.4%
associate-*l/80.5%
*-lft-identity80.5%
+-commutative80.5%
Simplified80.5%
Taylor expanded in alpha around inf 79.3%
Final simplification65.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (* (+ alpha 1.0) (+ 0.08333333333333333 (* beta -0.027777777777777776))) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = (alpha + 1.0d0) * (0.08333333333333333d0 + (beta * (-0.027777777777777776d0)))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(Float64(alpha + 1.0) * Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = (alpha + 1.0) * (0.08333333333333333 + (beta * -0.027777777777777776));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(N[(alpha + 1.0), $MachinePrecision] * N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \left(0.08333333333333333 + \beta \cdot -0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 63.2%
*-commutative63.2%
Simplified63.2%
if 2.7999999999999998 < beta Initial program 77.6%
associate-/l/72.7%
associate-+l+72.7%
+-commutative72.7%
associate-+r+72.7%
associate-+l+72.7%
distribute-rgt1-in72.7%
*-rgt-identity72.7%
distribute-lft-out72.7%
+-commutative72.7%
associate-*l/91.3%
*-commutative91.3%
associate-*r/91.3%
Simplified91.3%
Taylor expanded in beta around inf 78.4%
unpow278.4%
Simplified78.4%
clear-num78.4%
inv-pow78.4%
+-commutative78.4%
Applied egg-rr78.4%
unpow-178.4%
associate-/l*73.0%
+-commutative73.0%
Simplified73.0%
*-un-lft-identity73.0%
associate-/r/73.4%
+-commutative73.4%
Applied egg-rr73.4%
*-lft-identity73.4%
associate-*l/73.6%
*-lft-identity73.6%
+-commutative73.6%
Simplified73.6%
Final simplification66.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (* (+ alpha 1.0) 0.08333333333333333) (if (<= beta 1.15e+160) (/ (/ 1.0 beta) beta) (/ (/ alpha beta) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else if (beta <= 1.15e+160) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.3d0) then
tmp = (alpha + 1.0d0) * 0.08333333333333333d0
else if (beta <= 1.15d+160) then
tmp = (1.0d0 / beta) / beta
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else if (beta <= 1.15e+160) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = (alpha + 1.0) * 0.08333333333333333 elif beta <= 1.15e+160: tmp = (1.0 / beta) / beta else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(Float64(alpha + 1.0) * 0.08333333333333333); elseif (beta <= 1.15e+160) tmp = Float64(Float64(1.0 / beta) / beta); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = (alpha + 1.0) * 0.08333333333333333;
elseif (beta <= 1.15e+160)
tmp = (1.0 / beta) / beta;
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(N[(alpha + 1.0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision], If[LessEqual[beta, 1.15e+160], N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\left(\alpha + 1\right) \cdot 0.08333333333333333\\
\mathbf{elif}\;\beta \leq 1.15 \cdot 10^{+160}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 62.4%
if 3.2999999999999998 < beta < 1.14999999999999994e160Initial program 91.8%
associate-/l/83.3%
associate-+l+83.3%
+-commutative83.3%
associate-+r+83.3%
associate-+l+83.3%
distribute-rgt1-in83.3%
*-rgt-identity83.3%
distribute-lft-out83.3%
+-commutative83.3%
associate-*l/91.2%
*-commutative91.2%
associate-*r/91.2%
Simplified91.2%
Taylor expanded in beta around inf 67.0%
unpow267.0%
Simplified67.0%
clear-num67.0%
inv-pow67.0%
+-commutative67.0%
Applied egg-rr67.0%
unpow-167.0%
associate-/l*67.0%
+-commutative67.0%
Simplified67.0%
*-un-lft-identity67.0%
associate-/r/67.9%
+-commutative67.9%
Applied egg-rr67.9%
*-lft-identity67.9%
associate-*l/68.1%
*-lft-identity68.1%
+-commutative68.1%
Simplified68.1%
Taylor expanded in alpha around 0 65.1%
if 1.14999999999999994e160 < beta Initial program 61.2%
associate-/l/60.6%
associate-+l+60.6%
+-commutative60.6%
associate-+r+60.6%
associate-+l+60.6%
distribute-rgt1-in60.6%
*-rgt-identity60.6%
distribute-lft-out60.6%
+-commutative60.6%
associate-*l/91.6%
*-commutative91.6%
associate-*r/91.6%
Simplified91.6%
Taylor expanded in beta around inf 91.6%
unpow291.6%
Simplified91.6%
clear-num91.6%
inv-pow91.6%
+-commutative91.6%
Applied egg-rr91.6%
unpow-191.6%
associate-/l*79.9%
+-commutative79.9%
Simplified79.9%
*-un-lft-identity79.9%
associate-/r/79.9%
+-commutative79.9%
Applied egg-rr79.9%
*-lft-identity79.9%
associate-*l/79.9%
*-lft-identity79.9%
+-commutative79.9%
Simplified79.9%
Taylor expanded in alpha around inf 79.9%
Final simplification65.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.4) (* (+ alpha 1.0) 0.08333333333333333) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.4d0) then
tmp = (alpha + 1.0d0) * 0.08333333333333333d0
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4: tmp = (alpha + 1.0) * 0.08333333333333333 else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = Float64(Float64(alpha + 1.0) * 0.08333333333333333); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.4)
tmp = (alpha + 1.0) * 0.08333333333333333;
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.4], N[(N[(alpha + 1.0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;\left(\alpha + 1\right) \cdot 0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 62.4%
if 3.39999999999999991 < beta Initial program 77.6%
associate-/l/72.7%
associate-+l+72.7%
+-commutative72.7%
associate-+r+72.7%
associate-+l+72.7%
distribute-rgt1-in72.7%
*-rgt-identity72.7%
distribute-lft-out72.7%
+-commutative72.7%
associate-*l/91.3%
*-commutative91.3%
associate-*r/91.3%
Simplified91.3%
Taylor expanded in beta around inf 78.4%
unpow278.4%
Simplified78.4%
clear-num78.4%
inv-pow78.4%
+-commutative78.4%
Applied egg-rr78.4%
unpow-178.4%
associate-/l*73.0%
+-commutative73.0%
Simplified73.0%
*-un-lft-identity73.0%
associate-/r/73.4%
+-commutative73.4%
Applied egg-rr73.4%
*-lft-identity73.4%
associate-*l/73.6%
*-lft-identity73.6%
+-commutative73.6%
Simplified73.6%
Final simplification65.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.2) (* (+ alpha 1.0) 0.08333333333333333) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.2) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 9.2d0) then
tmp = (alpha + 1.0d0) * 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.2) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.2: tmp = (alpha + 1.0) * 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.2) tmp = Float64(Float64(alpha + 1.0) * 0.08333333333333333); else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.2)
tmp = (alpha + 1.0) * 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 9.2], N[(N[(alpha + 1.0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.2:\\
\;\;\;\;\left(\alpha + 1\right) \cdot 0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 9.1999999999999993Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 62.4%
if 9.1999999999999993 < beta Initial program 77.6%
Taylor expanded in beta around -inf 74.0%
Taylor expanded in alpha around inf 6.8%
Final simplification47.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (* (+ alpha 1.0) 0.08333333333333333) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.3d0) then
tmp = (alpha + 1.0d0) * 0.08333333333333333d0
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = (alpha + 1.0) * 0.08333333333333333 else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(Float64(alpha + 1.0) * 0.08333333333333333); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = (alpha + 1.0) * 0.08333333333333333;
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(N[(alpha + 1.0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\left(\alpha + 1\right) \cdot 0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 62.4%
if 3.2999999999999998 < beta Initial program 77.6%
associate-/l/72.7%
associate-+l+72.7%
+-commutative72.7%
associate-+r+72.7%
associate-+l+72.7%
distribute-rgt1-in72.7%
*-rgt-identity72.7%
distribute-lft-out72.7%
+-commutative72.7%
associate-*l/91.3%
*-commutative91.3%
associate-*r/91.3%
Simplified91.3%
Taylor expanded in beta around inf 78.4%
unpow278.4%
Simplified78.4%
clear-num78.4%
inv-pow78.4%
+-commutative78.4%
Applied egg-rr78.4%
unpow-178.4%
associate-/l*73.0%
+-commutative73.0%
Simplified73.0%
Taylor expanded in alpha around 0 76.8%
unpow276.8%
Simplified76.8%
Final simplification66.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.2) (* (+ alpha 1.0) 0.08333333333333333) (/ (/ 1.0 beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = (1.0 / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.2d0) then
tmp = (alpha + 1.0d0) * 0.08333333333333333d0
else
tmp = (1.0d0 / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = (alpha + 1.0) * 0.08333333333333333;
} else {
tmp = (1.0 / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = (alpha + 1.0) * 0.08333333333333333 else: tmp = (1.0 / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(Float64(alpha + 1.0) * 0.08333333333333333); else tmp = Float64(Float64(1.0 / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.2)
tmp = (alpha + 1.0) * 0.08333333333333333;
else
tmp = (1.0 / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.2], N[(N[(alpha + 1.0), $MachinePrecision] * 0.08333333333333333), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\left(\alpha + 1\right) \cdot 0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.8%
associate-/l/99.1%
associate-+l+99.1%
+-commutative99.1%
associate-+r+99.1%
associate-+l+99.1%
distribute-rgt1-in99.1%
*-rgt-identity99.1%
distribute-lft-out99.1%
+-commutative99.1%
associate-*l/99.0%
*-commutative99.0%
associate-*r/95.5%
Simplified95.5%
Taylor expanded in alpha around 0 64.3%
Taylor expanded in alpha around 0 63.8%
Taylor expanded in beta around 0 62.4%
if 3.2000000000000002 < beta Initial program 77.6%
associate-/l/72.7%
associate-+l+72.7%
+-commutative72.7%
associate-+r+72.7%
associate-+l+72.7%
distribute-rgt1-in72.7%
*-rgt-identity72.7%
distribute-lft-out72.7%
+-commutative72.7%
associate-*l/91.3%
*-commutative91.3%
associate-*r/91.3%
Simplified91.3%
Taylor expanded in beta around inf 78.4%
unpow278.4%
Simplified78.4%
clear-num78.4%
inv-pow78.4%
+-commutative78.4%
Applied egg-rr78.4%
unpow-178.4%
associate-/l*73.0%
+-commutative73.0%
Simplified73.0%
*-un-lft-identity73.0%
associate-/r/73.4%
+-commutative73.4%
Applied egg-rr73.4%
*-lft-identity73.4%
associate-*l/73.6%
*-lft-identity73.6%
+-commutative73.6%
Simplified73.6%
Taylor expanded in alpha around 0 77.4%
Final simplification66.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ -1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return -1.0 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (-1.0d0) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return -1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return -1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(-1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = -1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(-1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{-1}{\beta}
\end{array}
Initial program 93.7%
associate-/l/91.8%
associate-+l+91.8%
+-commutative91.8%
associate-+r+91.8%
associate-+l+91.8%
distribute-rgt1-in91.8%
*-rgt-identity91.8%
distribute-lft-out91.8%
+-commutative91.8%
associate-*l/96.9%
*-commutative96.9%
associate-*r/94.4%
Simplified94.4%
Taylor expanded in beta around inf 28.7%
mul-1-neg28.7%
unsub-neg28.7%
Simplified28.7%
Taylor expanded in alpha around inf 3.4%
Final simplification3.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta}
\end{array}
Initial program 93.7%
Taylor expanded in beta around -inf 22.6%
Taylor expanded in alpha around inf 4.0%
Final simplification4.0%
herbie shell --seed 2023193
(FPCore (alpha beta)
:name "Octave 3.8, jcobi/3"
:precision binary64
:pre (and (> alpha -1.0) (> beta -1.0))
(/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ (+ alpha beta) (* 2.0 1.0)) 1.0)))