
(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 19 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))))
(if (<= beta 1.4e+23)
(*
(/ (+ beta 1.0) (+ alpha (+ beta 3.0)))
(/
(+ 1.0 alpha)
(+ (* beta beta) (* (+ alpha 2.0) (+ (+ alpha 2.0) (* beta 2.0))))))
(/
(/
(+
(/ 1.0 beta)
(+
(+ (+ 1.0 alpha) (/ 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 tmp;
if (beta <= 1.4e+23) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
} else {
tmp = (((1.0 / beta) + (((1.0 + alpha) + (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) :: tmp
t_0 = 2.0d0 + (beta + alpha)
if (beta <= 1.4d+23) then
tmp = ((beta + 1.0d0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / ((beta * beta) + ((alpha + 2.0d0) * ((alpha + 2.0d0) + (beta * 2.0d0)))))
else
tmp = (((1.0d0 / beta) + (((1.0d0 + alpha) + (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 tmp;
if (beta <= 1.4e+23) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
} else {
tmp = (((1.0 / beta) + (((1.0 + alpha) + (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) tmp = 0 if beta <= 1.4e+23: tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0))))) else: tmp = (((1.0 / beta) + (((1.0 + alpha) + (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)) tmp = 0.0 if (beta <= 1.4e+23) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / Float64(Float64(beta * beta) + Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 2.0) + Float64(beta * 2.0)))))); else tmp = Float64(Float64(Float64(Float64(1.0 / beta) + Float64(Float64(Float64(1.0 + alpha) + 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);
tmp = 0.0;
if (beta <= 1.4e+23)
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
else
tmp = (((1.0 / beta) + (((1.0 + alpha) + (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]}, If[LessEqual[beta, 1.4e+23], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] + N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - alpha), $MachinePrecision] / N[(beta / N[(alpha + 2.0), $MachinePrecision]), $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)\\
\mathbf{if}\;\beta \leq 1.4 \cdot 10^{+23}:\\
\;\;\;\;\frac{\beta + 1}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{\beta \cdot \beta + \left(\alpha + 2\right) \cdot \left(\left(\alpha + 2\right) + \beta \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1}{\beta} + \left(\left(\left(1 + \alpha\right) + \frac{\alpha}{\beta}\right) + \frac{-1 - \alpha}{\frac{\beta}{\alpha + 2}}\right)}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 1.4e23Initial program 99.8%
associate-/l/99.5%
associate-/l/90.9%
associate-+l+90.9%
+-commutative90.9%
associate-+r+90.9%
associate-+l+90.9%
distribute-rgt1-in90.9%
*-rgt-identity90.9%
distribute-lft-out90.9%
+-commutative90.9%
times-frac99.4%
Simplified99.4%
Taylor expanded in beta around -inf 99.4%
unpow299.4%
+-commutative99.4%
unpow299.4%
associate-*r*99.4%
distribute-rgt-out99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
if 1.4e23 < beta Initial program 84.8%
Taylor expanded in beta around inf 86.0%
associate--l+86.0%
+-commutative86.0%
associate-/l*90.7%
+-commutative90.7%
Simplified90.7%
Final simplification96.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))))
(if (<= beta 4e+153)
(*
(/ (+ beta 1.0) t_0)
(/
(+ 1.0 alpha)
(+ (* beta beta) (* (+ alpha 2.0) (+ (+ alpha 2.0) (* beta 2.0))))))
(*
(/
(+
(/ 1.0 beta)
(+
(+ (+ 1.0 alpha) (/ alpha beta))
(* (+ alpha 2.0) (/ (- -1.0 alpha) beta))))
(+ alpha (+ beta 2.0)))
(/ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 4e+153) {
tmp = ((beta + 1.0) / t_0) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
} else {
tmp = (((1.0 / beta) + (((1.0 + alpha) + (alpha / beta)) + ((alpha + 2.0) * ((-1.0 - alpha) / beta)))) / (alpha + (beta + 2.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) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 4d+153) then
tmp = ((beta + 1.0d0) / t_0) * ((1.0d0 + alpha) / ((beta * beta) + ((alpha + 2.0d0) * ((alpha + 2.0d0) + (beta * 2.0d0)))))
else
tmp = (((1.0d0 / beta) + (((1.0d0 + alpha) + (alpha / beta)) + ((alpha + 2.0d0) * (((-1.0d0) - alpha) / beta)))) / (alpha + (beta + 2.0d0))) * (1.0d0 / t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 4e+153) {
tmp = ((beta + 1.0) / t_0) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
} else {
tmp = (((1.0 / beta) + (((1.0 + alpha) + (alpha / beta)) + ((alpha + 2.0) * ((-1.0 - alpha) / beta)))) / (alpha + (beta + 2.0))) * (1.0 / t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 4e+153: tmp = ((beta + 1.0) / t_0) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0))))) else: tmp = (((1.0 / beta) + (((1.0 + alpha) + (alpha / beta)) + ((alpha + 2.0) * ((-1.0 - alpha) / beta)))) / (alpha + (beta + 2.0))) * (1.0 / t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 4e+153) tmp = Float64(Float64(Float64(beta + 1.0) / t_0) * Float64(Float64(1.0 + alpha) / Float64(Float64(beta * beta) + Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 2.0) + Float64(beta * 2.0)))))); else tmp = Float64(Float64(Float64(Float64(1.0 / beta) + Float64(Float64(Float64(1.0 + alpha) + Float64(alpha / beta)) + Float64(Float64(alpha + 2.0) * Float64(Float64(-1.0 - alpha) / beta)))) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 / t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 4e+153)
tmp = ((beta + 1.0) / t_0) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
else
tmp = (((1.0 / beta) + (((1.0 + alpha) + (alpha / beta)) + ((alpha + 2.0) * ((-1.0 - alpha) / beta)))) / (alpha + (beta + 2.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[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+153], N[(N[(N[(beta + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] + N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+153}:\\
\;\;\;\;\frac{\beta + 1}{t_0} \cdot \frac{1 + \alpha}{\beta \cdot \beta + \left(\alpha + 2\right) \cdot \left(\left(\alpha + 2\right) + \beta \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \left(\left(\left(1 + \alpha\right) + \frac{\alpha}{\beta}\right) + \left(\alpha + 2\right) \cdot \frac{-1 - \alpha}{\beta}\right)}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{t_0}\\
\end{array}
\end{array}
if beta < 4e153Initial program 98.8%
associate-/l/98.5%
associate-/l/84.2%
associate-+l+84.2%
+-commutative84.2%
associate-+r+84.2%
associate-+l+84.2%
distribute-rgt1-in84.2%
*-rgt-identity84.2%
distribute-lft-out84.2%
+-commutative84.2%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around -inf 99.2%
unpow299.2%
+-commutative99.2%
unpow299.2%
associate-*r*99.2%
distribute-rgt-out99.2%
+-commutative99.2%
+-commutative99.2%
Simplified99.2%
if 4e153 < beta Initial program 80.6%
Taylor expanded in beta around inf 87.7%
associate--l+87.7%
+-commutative87.7%
associate-/l*94.7%
+-commutative94.7%
Simplified94.7%
div-inv94.7%
+-commutative94.7%
associate-/r/94.7%
+-commutative94.7%
metadata-eval94.7%
associate-+r+94.7%
metadata-eval94.7%
associate-+l+94.7%
metadata-eval94.7%
associate-+r+94.7%
Applied egg-rr94.7%
Final simplification98.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55e+23)
(*
(/ (+ beta 1.0) (+ alpha (+ beta 3.0)))
(/
(+ 1.0 alpha)
(+ (* beta beta) (* (+ alpha 2.0) (+ (+ alpha 2.0) (* beta 2.0))))))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55e+23) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 1.55d+23) then
tmp = ((beta + 1.0d0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / ((beta * beta) + ((alpha + 2.0d0) * ((alpha + 2.0d0) + (beta * 2.0d0)))))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 1.55e+23) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55e+23: tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0))))) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55e+23) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / Float64(Float64(beta * beta) + Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 2.0) + Float64(beta * 2.0)))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 1.55e+23)
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / ((beta * beta) + ((alpha + 2.0) * ((alpha + 2.0) + (beta * 2.0)))));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 1.55e+23], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] + N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] + N[(beta * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 1.55 \cdot 10^{+23}:\\
\;\;\;\;\frac{\beta + 1}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{\beta \cdot \beta + \left(\alpha + 2\right) \cdot \left(\left(\alpha + 2\right) + \beta \cdot 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.54999999999999985e23Initial program 99.8%
associate-/l/99.5%
associate-/l/90.9%
associate-+l+90.9%
+-commutative90.9%
associate-+r+90.9%
associate-+l+90.9%
distribute-rgt1-in90.9%
*-rgt-identity90.9%
distribute-lft-out90.9%
+-commutative90.9%
times-frac99.4%
Simplified99.4%
Taylor expanded in beta around -inf 99.4%
unpow299.4%
+-commutative99.4%
unpow299.4%
associate-*r*99.4%
distribute-rgt-out99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
if 1.54999999999999985e23 < beta Initial program 84.8%
Taylor expanded in beta around inf 90.7%
Taylor expanded in alpha around 0 90.7%
Final simplification96.5%
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 1.8e+17)
(* (+ beta 1.0) (/ (/ (+ 1.0 alpha) t_0) (* (+ alpha (+ beta 3.0)) t_0)))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.8e+17) {
tmp = (beta + 1.0) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.8d+17) then
tmp = (beta + 1.0d0) * (((1.0d0 + alpha) / t_0) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1.8e+17) {
tmp = (beta + 1.0) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.8e+17: tmp = (beta + 1.0) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1.8e+17) tmp = Float64(Float64(beta + 1.0) * Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta + Float64(alpha + 3.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 <= 1.8e+17)
tmp = (beta + 1.0) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.8e+17], N[(N[(beta + 1.0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $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 1.8 \cdot 10^{+17}:\\
\;\;\;\;\left(\beta + 1\right) \cdot \frac{\frac{1 + \alpha}{t_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.8e17Initial program 99.8%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
associate-*r/99.5%
associate-*r/99.5%
Simplified99.5%
if 1.8e17 < beta Initial program 85.3%
Taylor expanded in beta around inf 89.9%
Taylor expanded in alpha around 0 89.9%
Final simplification96.2%
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 1.55e+23)
(* (/ (+ beta 1.0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) (* t_0 t_0)))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.55e+23) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.55d+23) then
tmp = ((beta + 1.0d0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / (t_0 * t_0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1.55e+23) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.55e+23: tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1.55e+23) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta + Float64(alpha + 3.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 <= 1.55e+23)
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.55e+23], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $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 1.55 \cdot 10^{+23}:\\
\;\;\;\;\frac{\beta + 1}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.54999999999999985e23Initial program 99.8%
associate-/l/99.5%
associate-/l/90.9%
associate-+l+90.9%
+-commutative90.9%
associate-+r+90.9%
associate-+l+90.9%
distribute-rgt1-in90.9%
*-rgt-identity90.9%
distribute-lft-out90.9%
+-commutative90.9%
times-frac99.4%
Simplified99.4%
if 1.54999999999999985e23 < beta Initial program 84.8%
Taylor expanded in beta around inf 90.7%
Taylor expanded in alpha around 0 90.7%
Final simplification96.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4e+42)
(*
(* (+ beta 1.0) (+ 1.0 alpha))
(/ (/ (/ 1.0 (+ beta 3.0)) (+ beta 2.0)) (+ alpha (+ beta 2.0))))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+42) {
tmp = ((beta + 1.0) * (1.0 + alpha)) * (((1.0 / (beta + 3.0)) / (beta + 2.0)) / (alpha + (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 4d+42) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) * (((1.0d0 / (beta + 3.0d0)) / (beta + 2.0d0)) / (alpha + (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 4e+42) {
tmp = ((beta + 1.0) * (1.0 + alpha)) * (((1.0 / (beta + 3.0)) / (beta + 2.0)) / (alpha + (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4e+42: tmp = ((beta + 1.0) * (1.0 + alpha)) * (((1.0 / (beta + 3.0)) / (beta + 2.0)) / (alpha + (beta + 2.0))) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4e+42) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) * Float64(Float64(Float64(1.0 / Float64(beta + 3.0)) / Float64(beta + 2.0)) / Float64(alpha + Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 4e+42)
tmp = ((beta + 1.0) * (1.0 + alpha)) * (((1.0 / (beta + 3.0)) / (beta + 2.0)) / (alpha + (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 4e+42], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 4 \cdot 10^{+42}:\\
\;\;\;\;\left(\left(\beta + 1\right) \cdot \left(1 + \alpha\right)\right) \cdot \frac{\frac{\frac{1}{\beta + 3}}{\beta + 2}}{\alpha + \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4.00000000000000018e42Initial program 99.8%
associate-/l/99.5%
associate-/r*91.1%
associate-+l+91.1%
+-commutative91.1%
associate-+r+91.1%
associate-+l+91.1%
distribute-rgt1-in91.1%
*-rgt-identity91.1%
distribute-lft-out91.1%
*-commutative91.1%
metadata-eval91.1%
associate-+l+91.1%
+-commutative91.1%
Simplified91.1%
Taylor expanded in alpha around 0 60.9%
div-inv60.9%
+-commutative60.9%
associate-+r+60.9%
metadata-eval60.9%
*-commutative60.9%
metadata-eval60.9%
associate-+r+60.9%
Applied egg-rr60.9%
+-commutative60.9%
+-commutative60.9%
*-commutative60.9%
+-commutative60.9%
associate-/r*60.4%
associate-/r*60.4%
+-commutative60.4%
+-commutative60.4%
Simplified60.4%
if 4.00000000000000018e42 < beta Initial program 84.1%
Taylor expanded in beta around inf 90.2%
Taylor expanded in alpha around 0 90.2%
Final simplification69.8%
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 1e+23)
(* (/ (+ 1.0 alpha) (* t_0 t_0)) (/ (+ beta 1.0) (+ beta 3.0)))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+23) {
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1d+23) then
tmp = ((1.0d0 + alpha) / (t_0 * t_0)) * ((beta + 1.0d0) / (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1e+23) {
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+23: tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1e+23) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0)) * Float64(Float64(beta + 1.0) / Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta + Float64(alpha + 3.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 <= 1e+23)
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+23], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $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 10^{+23}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot t_0} \cdot \frac{\beta + 1}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 9.9999999999999992e22Initial program 99.8%
associate-/l/99.5%
associate-/l/90.9%
associate-+l+90.9%
+-commutative90.9%
associate-+r+90.9%
associate-+l+90.9%
distribute-rgt1-in90.9%
*-rgt-identity90.9%
distribute-lft-out90.9%
+-commutative90.9%
times-frac99.4%
Simplified99.4%
Taylor expanded in alpha around 0 81.0%
if 9.9999999999999992e22 < beta Initial program 84.8%
Taylor expanded in beta around inf 90.7%
Taylor expanded in alpha around 0 90.7%
Final simplification84.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 7.9e+15)
(*
(+ beta 1.0)
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (* (+ beta 3.0) (+ beta 2.0))))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.9e+15) {
tmp = (beta + 1.0) * (((1.0 + alpha) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 7.9d+15) then
tmp = (beta + 1.0d0) * (((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) / ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 7.9e+15) {
tmp = (beta + 1.0) * (((1.0 + alpha) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.9e+15: tmp = (beta + 1.0) * (((1.0 + alpha) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.9e+15) tmp = Float64(Float64(beta + 1.0) * Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 7.9e+15)
tmp = (beta + 1.0) * (((1.0 + alpha) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 7.9e+15], N[(N[(beta + 1.0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $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[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 7.9 \cdot 10^{+15}:\\
\;\;\;\;\left(\beta + 1\right) \cdot \frac{\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 7.9e15Initial program 99.8%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
associate-*r/99.5%
associate-*r/99.5%
Simplified99.5%
Taylor expanded in alpha around 0 59.3%
if 7.9e15 < beta Initial program 85.3%
Taylor expanded in beta around inf 89.9%
Taylor expanded in alpha around 0 89.9%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ (+ 1.0 alpha) (* (+ 4.0 (* alpha 4.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 5.2d0) then
tmp = (1.0d0 + alpha) / ((4.0d0 + (alpha * 4.0d0)) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 5.2) {
tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(4.0 + Float64(alpha * 4.0)) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 5.2)
tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 5.2], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(4.0 + N[(alpha * 4.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 5.2:\\
\;\;\;\;\frac{1 + \alpha}{\left(4 + \alpha \cdot 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
associate-/l/99.5%
associate-/l/91.1%
associate-+l+91.1%
+-commutative91.1%
associate-+r+91.1%
associate-+l+91.1%
distribute-rgt1-in91.1%
*-rgt-identity91.1%
distribute-lft-out91.1%
+-commutative91.1%
times-frac99.4%
Simplified99.4%
Taylor expanded in beta around -inf 99.4%
unpow299.4%
+-commutative99.4%
unpow299.4%
associate-*r*99.4%
distribute-rgt-out99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
Taylor expanded in alpha around 0 61.8%
Taylor expanded in beta around 0 79.4%
+-commutative79.4%
Simplified79.4%
if 5.20000000000000018 < beta Initial program 85.8%
Taylor expanded in beta around inf 87.4%
Taylor expanded in alpha around 0 87.4%
Final simplification82.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (/ (+ 1.0 alpha) (* (+ 4.0 (* alpha 4.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / 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 <= 6.2d0) then
tmp = (1.0d0 + alpha) / ((4.0d0 + (alpha * 4.0d0)) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / 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 <= 6.2) {
tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(4.0 + Float64(alpha * 4.0)) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 6.2)
tmp = (1.0 + alpha) / ((4.0 + (alpha * 4.0)) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / 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, 6.2], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(4.0 + N[(alpha * 4.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 6.2:\\
\;\;\;\;\frac{1 + \alpha}{\left(4 + \alpha \cdot 4\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.8%
associate-/l/99.5%
associate-/l/91.1%
associate-+l+91.1%
+-commutative91.1%
associate-+r+91.1%
associate-+l+91.1%
distribute-rgt1-in91.1%
*-rgt-identity91.1%
distribute-lft-out91.1%
+-commutative91.1%
times-frac99.4%
Simplified99.4%
Taylor expanded in beta around -inf 99.4%
unpow299.4%
+-commutative99.4%
unpow299.4%
associate-*r*99.4%
distribute-rgt-out99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
Taylor expanded in alpha around 0 61.8%
Taylor expanded in beta around 0 79.4%
+-commutative79.4%
Simplified79.4%
if 6.20000000000000018 < beta Initial program 85.8%
Taylor expanded in beta around inf 82.9%
associate--l+82.9%
+-commutative82.9%
associate-/l*87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in beta around inf 87.0%
expm1-log1p-u87.0%
expm1-udef58.1%
associate-/l/58.1%
+-commutative58.1%
metadata-eval58.1%
associate-+l+58.1%
metadata-eval58.1%
associate-+r+58.1%
Applied egg-rr58.1%
expm1-def84.9%
expm1-log1p84.9%
+-commutative84.9%
*-lft-identity84.9%
times-frac86.9%
+-commutative86.9%
*-commutative86.9%
associate-*r/87.0%
*-rgt-identity87.0%
+-commutative87.0%
+-commutative87.0%
associate-+l+87.0%
+-commutative87.0%
Simplified87.0%
Final simplification82.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) (* 0.16666666666666666 (/ (+ 1.0 alpha) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / 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.3d0) then
tmp = 0.16666666666666666d0 * ((1.0d0 + alpha) / (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / 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.3) {
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = Float64(0.16666666666666666 * Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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.3)
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
else
tmp = ((1.0 + alpha) / 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.3], N[(0.16666666666666666 * N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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.3:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1 + \alpha}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
associate-/l/99.4%
associate-/r*91.1%
associate-+l+91.1%
+-commutative91.1%
associate-+r+91.1%
associate-+l+91.1%
distribute-rgt1-in91.1%
*-rgt-identity91.1%
distribute-lft-out91.1%
*-commutative91.1%
metadata-eval91.1%
associate-+l+91.1%
+-commutative91.1%
Simplified91.1%
Taylor expanded in alpha around 0 60.3%
Taylor expanded in beta around 0 57.9%
if 2.2999999999999998 < beta Initial program 85.8%
Taylor expanded in beta around inf 82.9%
associate--l+82.9%
+-commutative82.9%
associate-/l*87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in beta around inf 87.0%
expm1-log1p-u87.0%
expm1-udef58.1%
associate-/l/58.1%
+-commutative58.1%
metadata-eval58.1%
associate-+l+58.1%
metadata-eval58.1%
associate-+r+58.1%
Applied egg-rr58.1%
expm1-def84.9%
expm1-log1p84.9%
+-commutative84.9%
*-lft-identity84.9%
times-frac86.9%
+-commutative86.9%
*-commutative86.9%
associate-*r/87.0%
*-rgt-identity87.0%
+-commutative87.0%
+-commutative87.0%
associate-+l+87.0%
+-commutative87.0%
Simplified87.0%
Final simplification68.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) (* 0.16666666666666666 (/ (+ 1.0 alpha) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
} else {
tmp = ((1.0 + 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.6d0) then
tmp = 0.16666666666666666d0 * ((1.0d0 + alpha) / (alpha + 2.0d0))
else
tmp = ((1.0d0 + 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.6) {
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = Float64(0.16666666666666666 * Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + 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.6)
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
else
tmp = ((1.0 + 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.6], N[(0.16666666666666666 * N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1 + \alpha}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.8%
associate-/l/99.4%
associate-/r*91.1%
associate-+l+91.1%
+-commutative91.1%
associate-+r+91.1%
associate-+l+91.1%
distribute-rgt1-in91.1%
*-rgt-identity91.1%
distribute-lft-out91.1%
*-commutative91.1%
metadata-eval91.1%
associate-+l+91.1%
+-commutative91.1%
Simplified91.1%
Taylor expanded in alpha around 0 60.3%
Taylor expanded in beta around 0 57.9%
if 3.60000000000000009 < beta Initial program 85.8%
Taylor expanded in beta around inf 82.9%
associate--l+82.9%
+-commutative82.9%
associate-/l*87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in beta around inf 87.0%
Taylor expanded in beta around inf 86.9%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2) (+ 0.16666666666666666 (* beta -0.1388888888888889)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = (1.0 + 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 <= 1.2d0) then
tmp = 0.16666666666666666d0 + (beta * (-0.1388888888888889d0))
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2: tmp = 0.16666666666666666 + (beta * -0.1388888888888889) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2) tmp = Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2)
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
else
tmp = (1.0 + 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, 1.2], N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2:\\
\;\;\;\;0.16666666666666666 + \beta \cdot -0.1388888888888889\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.19999999999999996Initial program 99.8%
Taylor expanded in beta around inf 14.0%
Taylor expanded in alpha around 0 12.7%
associate-/r*12.7%
+-commutative12.7%
Simplified12.7%
Taylor expanded in beta around 0 12.8%
if 1.19999999999999996 < beta Initial program 85.8%
associate-/l/83.4%
associate-+l+83.4%
+-commutative83.4%
associate-+r+83.4%
associate-+l+83.4%
distribute-rgt1-in83.4%
*-rgt-identity83.4%
distribute-lft-out83.4%
+-commutative83.4%
associate-*r/92.0%
associate-*r/81.6%
Simplified81.6%
Taylor expanded in beta around inf 83.2%
unpow283.2%
Simplified83.2%
Final simplification37.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2) (+ 0.16666666666666666 (* beta -0.1388888888888889)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = ((1.0 + 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 <= 1.2d0) then
tmp = 0.16666666666666666d0 + (beta * (-0.1388888888888889d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2: tmp = 0.16666666666666666 + (beta * -0.1388888888888889) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2) tmp = Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2)
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
else
tmp = ((1.0 + 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, 1.2], N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2:\\
\;\;\;\;0.16666666666666666 + \beta \cdot -0.1388888888888889\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.19999999999999996Initial program 99.8%
Taylor expanded in beta around inf 14.0%
Taylor expanded in alpha around 0 12.7%
associate-/r*12.7%
+-commutative12.7%
Simplified12.7%
Taylor expanded in beta around 0 12.8%
if 1.19999999999999996 < beta Initial program 85.8%
Taylor expanded in beta around inf 82.9%
associate--l+82.9%
+-commutative82.9%
associate-/l*87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in beta around inf 87.0%
Taylor expanded in beta around inf 86.9%
Final simplification39.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.15) (+ 0.16666666666666666 (* beta -0.1388888888888889)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = 0.3333333333333333 / 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 <= 1.15d0) then
tmp = 0.16666666666666666d0 + (beta * (-0.1388888888888889d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.15: tmp = 0.16666666666666666 + (beta * -0.1388888888888889) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.15) tmp = Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.15)
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
else
tmp = 0.3333333333333333 / 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, 1.15], N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15:\\
\;\;\;\;0.16666666666666666 + \beta \cdot -0.1388888888888889\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 1.1499999999999999Initial program 99.8%
Taylor expanded in beta around inf 14.0%
Taylor expanded in alpha around 0 12.7%
associate-/r*12.7%
+-commutative12.7%
Simplified12.7%
Taylor expanded in beta around 0 12.8%
if 1.1499999999999999 < beta Initial program 85.8%
Taylor expanded in beta around inf 82.9%
associate--l+82.9%
+-commutative82.9%
associate-/l*87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 80.4%
Taylor expanded in beta around 0 7.0%
Final simplification10.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2) (+ 0.16666666666666666 (* beta -0.1388888888888889)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} 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 <= 1.2d0) then
tmp = 0.16666666666666666d0 + (beta * (-0.1388888888888889d0))
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 <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2: tmp = 0.16666666666666666 + (beta * -0.1388888888888889) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2) tmp = Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889)); 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 <= 1.2)
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
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, 1.2], N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $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 1.2:\\
\;\;\;\;0.16666666666666666 + \beta \cdot -0.1388888888888889\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.19999999999999996Initial program 99.8%
Taylor expanded in beta around inf 14.0%
Taylor expanded in alpha around 0 12.7%
associate-/r*12.7%
+-commutative12.7%
Simplified12.7%
Taylor expanded in beta around 0 12.8%
if 1.19999999999999996 < beta Initial program 85.8%
associate-/l/83.4%
associate-+l+83.4%
+-commutative83.4%
associate-+r+83.4%
associate-+l+83.4%
distribute-rgt1-in83.4%
*-rgt-identity83.4%
distribute-lft-out83.4%
+-commutative83.4%
associate-*r/92.0%
associate-*r/81.6%
Simplified81.6%
Taylor expanded in beta around inf 83.2%
unpow283.2%
Simplified83.2%
Taylor expanded in alpha around 0 80.3%
unpow280.3%
Simplified80.3%
Final simplification36.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2) (+ 0.16666666666666666 (* beta -0.1388888888888889)) (/ (/ 1.0 beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} 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 <= 1.2d0) then
tmp = 0.16666666666666666d0 + (beta * (-0.1388888888888889d0))
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 <= 1.2) {
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
} else {
tmp = (1.0 / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2: tmp = 0.16666666666666666 + (beta * -0.1388888888888889) else: tmp = (1.0 / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2) tmp = Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889)); 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 <= 1.2)
tmp = 0.16666666666666666 + (beta * -0.1388888888888889);
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, 1.2], N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $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 1.2:\\
\;\;\;\;0.16666666666666666 + \beta \cdot -0.1388888888888889\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.19999999999999996Initial program 99.8%
Taylor expanded in beta around inf 14.0%
Taylor expanded in alpha around 0 12.7%
associate-/r*12.7%
+-commutative12.7%
Simplified12.7%
Taylor expanded in beta around 0 12.8%
if 1.19999999999999996 < beta Initial program 85.8%
associate-/l/83.4%
associate-+l+83.4%
+-commutative83.4%
associate-+r+83.4%
associate-+l+83.4%
distribute-rgt1-in83.4%
*-rgt-identity83.4%
distribute-lft-out83.4%
+-commutative83.4%
associate-*r/92.0%
associate-*r/81.6%
Simplified81.6%
Taylor expanded in beta around inf 83.2%
unpow283.2%
Simplified83.2%
Taylor expanded in alpha around 0 80.3%
unpow280.3%
associate-/r*81.5%
Simplified81.5%
Final simplification37.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.16666666666666666 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.16666666666666666;
} else {
tmp = 0.3333333333333333 / 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.0d0) then
tmp = 0.16666666666666666d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.16666666666666666;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.16666666666666666 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.16666666666666666; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.16666666666666666;
else
tmp = 0.3333333333333333 / 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.0], 0.16666666666666666, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.16666666666666666\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.8%
Taylor expanded in beta around inf 14.0%
Taylor expanded in alpha around 0 12.7%
associate-/r*12.7%
+-commutative12.7%
Simplified12.7%
Taylor expanded in beta around 0 12.7%
if 2 < beta Initial program 85.8%
Taylor expanded in beta around inf 82.9%
associate--l+82.9%
+-commutative82.9%
associate-/l*87.3%
+-commutative87.3%
Simplified87.3%
Taylor expanded in beta around inf 87.0%
Taylor expanded in alpha around 0 80.4%
Taylor expanded in beta around 0 7.0%
Final simplification10.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.16666666666666666)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666;
}
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 = 0.16666666666666666d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.16666666666666666 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.16666666666666666
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 40.0%
Taylor expanded in alpha around 0 36.8%
associate-/r*37.2%
+-commutative37.2%
Simplified37.2%
Taylor expanded in beta around 0 9.6%
Final simplification9.6%
herbie shell --seed 2023196
(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)))