
(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 9.5e+28)
(/
(* (+ beta 1.0) (+ 1.0 alpha))
(*
(+ alpha (+ beta 2.0))
(+
(+ (* beta beta) (* beta (+ 5.0 (* alpha 2.0))))
(* (+ alpha 3.0) (+ alpha 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 <= 9.5e+28) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 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 <= 9.5d+28) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) / ((alpha + (beta + 2.0d0)) * (((beta * beta) + (beta * (5.0d0 + (alpha * 2.0d0)))) + ((alpha + 3.0d0) * (alpha + 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 <= 9.5e+28) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 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 <= 9.5e+28: tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 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 <= 9.5e+28) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(Float64(beta * beta) + Float64(beta * Float64(5.0 + Float64(alpha * 2.0)))) + Float64(Float64(alpha + 3.0) * Float64(alpha + 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 <= 9.5e+28)
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 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, 9.5e+28], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(beta * beta), $MachinePrecision] + N[(beta * N[(5.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $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 9.5 \cdot 10^{+28}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta \cdot \beta + \beta \cdot \left(5 + \alpha \cdot 2\right)\right) + \left(\alpha + 3\right) \cdot \left(\alpha + 2\right)\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 < 9.49999999999999927e28Initial program 99.8%
associate-/l/99.9%
associate-/r*92.1%
associate-+l+92.1%
+-commutative92.1%
associate-+r+92.1%
associate-+l+92.1%
distribute-rgt1-in92.1%
*-rgt-identity92.1%
distribute-lft-out92.1%
*-commutative92.1%
metadata-eval92.1%
associate-+l+92.1%
+-commutative92.1%
Simplified92.1%
distribute-lft-in92.1%
associate-+r+92.1%
+-commutative92.1%
associate-+r+92.1%
+-commutative92.1%
Applied egg-rr92.1%
Taylor expanded in beta around 0 92.2%
associate-+r+92.2%
+-commutative92.2%
unpow292.2%
distribute-lft-out92.2%
*-commutative92.2%
*-commutative92.2%
distribute-rgt-in92.2%
*-commutative92.2%
+-commutative92.2%
Simplified92.2%
distribute-rgt-in92.2%
Applied egg-rr92.2%
if 9.49999999999999927e28 < beta Initial program 82.0%
Taylor expanded in beta around inf 84.5%
associate--l+84.5%
+-commutative84.5%
associate-/l*90.2%
Simplified90.2%
Final simplification91.6%
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 7e+27)
(/
(* (+ beta 1.0) (+ 1.0 alpha))
(*
(+ alpha (+ beta 2.0))
(+
(+ (* beta beta) (* beta (+ 5.0 (* alpha 2.0))))
(* (+ alpha 3.0) (+ alpha 2.0)))))
(/ (/ (+ 1.0 alpha) 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 <= 7e+27) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 2.0))));
} else {
tmp = ((1.0 + alpha) / 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 <= 7d+27) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) / ((alpha + (beta + 2.0d0)) * (((beta * beta) + (beta * (5.0d0 + (alpha * 2.0d0)))) + ((alpha + 3.0d0) * (alpha + 2.0d0))))
else
tmp = ((1.0d0 + alpha) / 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 <= 7e+27) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 2.0))));
} else {
tmp = ((1.0 + alpha) / 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 <= 7e+27: tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 2.0)))) else: tmp = ((1.0 + alpha) / 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 <= 7e+27) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(Float64(beta * beta) + Float64(beta * Float64(5.0 + Float64(alpha * 2.0)))) + Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 7e+27)
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((beta * beta) + (beta * (5.0 + (alpha * 2.0)))) + ((alpha + 3.0) * (alpha + 2.0))));
else
tmp = ((1.0 + alpha) / 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, 7e+27], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(beta * beta), $MachinePrecision] + N[(beta * N[(5.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 7 \cdot 10^{+27}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta \cdot \beta + \beta \cdot \left(5 + \alpha \cdot 2\right)\right) + \left(\alpha + 3\right) \cdot \left(\alpha + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 7.0000000000000004e27Initial program 99.8%
associate-/l/99.9%
associate-/r*92.6%
associate-+l+92.6%
+-commutative92.6%
associate-+r+92.6%
associate-+l+92.6%
distribute-rgt1-in92.6%
*-rgt-identity92.6%
distribute-lft-out92.6%
*-commutative92.6%
metadata-eval92.6%
associate-+l+92.6%
+-commutative92.6%
Simplified92.6%
distribute-lft-in92.6%
associate-+r+92.6%
+-commutative92.6%
associate-+r+92.6%
+-commutative92.6%
Applied egg-rr92.6%
Taylor expanded in beta around 0 92.7%
associate-+r+92.6%
+-commutative92.6%
unpow292.6%
distribute-lft-out92.6%
*-commutative92.6%
*-commutative92.6%
distribute-rgt-in92.6%
*-commutative92.6%
+-commutative92.6%
Simplified92.6%
distribute-rgt-in92.6%
Applied egg-rr92.6%
if 7.0000000000000004e27 < beta Initial program 82.2%
Taylor expanded in beta around inf 89.5%
Final simplification91.7%
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.25e+30)
(/
(* (+ beta 1.0) (+ 1.0 alpha))
(*
(+ alpha (+ beta 2.0))
(+
(* (+ alpha 3.0) (+ alpha 2.0))
(* beta (+ beta (+ 5.0 (* alpha 2.0)))))))
(/ (/ (+ 1.0 alpha) 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.25e+30) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((alpha + 3.0) * (alpha + 2.0)) + (beta * (beta + (5.0 + (alpha * 2.0))))));
} else {
tmp = ((1.0 + alpha) / 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.25d+30) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) / ((alpha + (beta + 2.0d0)) * (((alpha + 3.0d0) * (alpha + 2.0d0)) + (beta * (beta + (5.0d0 + (alpha * 2.0d0))))))
else
tmp = ((1.0d0 + alpha) / 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.25e+30) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((alpha + 3.0) * (alpha + 2.0)) + (beta * (beta + (5.0 + (alpha * 2.0))))));
} else {
tmp = ((1.0 + alpha) / 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.25e+30: tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((alpha + 3.0) * (alpha + 2.0)) + (beta * (beta + (5.0 + (alpha * 2.0)))))) else: tmp = ((1.0 + alpha) / 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.25e+30) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0)) + Float64(beta * Float64(beta + Float64(5.0 + Float64(alpha * 2.0))))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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.25e+30)
tmp = ((beta + 1.0) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * (((alpha + 3.0) * (alpha + 2.0)) + (beta * (beta + (5.0 + (alpha * 2.0))))));
else
tmp = ((1.0 + alpha) / 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.25e+30], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] + N[(beta * N[(beta + N[(5.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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.25 \cdot 10^{+30}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(\alpha + 2\right) + \beta \cdot \left(\beta + \left(5 + \alpha \cdot 2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 1.25e30Initial program 99.3%
associate-/l/99.3%
associate-/r*91.7%
associate-+l+91.7%
+-commutative91.7%
associate-+r+91.7%
associate-+l+91.7%
distribute-rgt1-in91.7%
*-rgt-identity91.7%
distribute-lft-out91.7%
*-commutative91.7%
metadata-eval91.7%
associate-+l+91.7%
+-commutative91.7%
Simplified91.7%
distribute-lft-in91.7%
associate-+r+91.7%
+-commutative91.7%
associate-+r+91.7%
+-commutative91.7%
Applied egg-rr91.7%
Taylor expanded in beta around 0 91.7%
associate-+r+91.7%
+-commutative91.7%
unpow291.7%
distribute-lft-out91.7%
*-commutative91.7%
*-commutative91.7%
distribute-rgt-in91.7%
*-commutative91.7%
+-commutative91.7%
Simplified91.7%
if 1.25e30 < beta Initial program 82.8%
Taylor expanded in beta around inf 92.8%
Final simplification92.0%
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 5e+153)
(* (+ 1.0 alpha) (/ (/ (+ beta 1.0) t_1) (* t_1 (+ alpha (+ beta 3.0)))))
(/ (/ (+ 1.0 alpha) 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 <= 5e+153) {
tmp = (1.0 + alpha) * (((beta + 1.0) / t_1) / (t_1 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / 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 <= 5d+153) then
tmp = (1.0d0 + alpha) * (((beta + 1.0d0) / t_1) / (t_1 * (alpha + (beta + 3.0d0))))
else
tmp = ((1.0d0 + alpha) / 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 <= 5e+153) {
tmp = (1.0 + alpha) * (((beta + 1.0) / t_1) / (t_1 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / 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 <= 5e+153: tmp = (1.0 + alpha) * (((beta + 1.0) / t_1) / (t_1 * (alpha + (beta + 3.0)))) else: tmp = ((1.0 + alpha) / 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 <= 5e+153) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(beta + 1.0) / t_1) / Float64(t_1 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 5e+153)
tmp = (1.0 + alpha) * (((beta + 1.0) / t_1) / (t_1 * (alpha + (beta + 3.0))));
else
tmp = ((1.0 + alpha) / 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, 5e+153], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 5 \cdot 10^{+153}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{\beta + 1}{t_1}}{t_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 5.00000000000000018e153Initial program 98.9%
associate-/l/98.5%
associate-+l+98.5%
+-commutative98.5%
associate-+r+98.5%
associate-+l+98.5%
distribute-rgt1-in98.5%
*-rgt-identity98.5%
distribute-lft-out98.5%
+-commutative98.5%
associate-*l/99.4%
*-commutative99.4%
associate-*r/93.4%
Simplified93.3%
if 5.00000000000000018e153 < beta Initial program 71.2%
Taylor expanded in beta around inf 93.8%
Final simplification93.4%
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))) (t_1 (+ 2.0 (+ beta alpha))))
(if (<= beta 7.5e+102)
(* (/ (+ beta 1.0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) (* t_0 t_0)))
(/ (/ (+ 1.0 alpha) t_1) (+ 1.0 t_1)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 7.5e+102) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = ((1.0 + alpha) / t_1) / (1.0 + t_1);
}
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 = alpha + (beta + 2.0d0)
t_1 = 2.0d0 + (beta + alpha)
if (beta <= 7.5d+102) then
tmp = ((beta + 1.0d0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / (t_0 * t_0))
else
tmp = ((1.0d0 + alpha) / t_1) / (1.0d0 + t_1)
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 t_1 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 7.5e+102) {
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = ((1.0 + alpha) / t_1) / (1.0 + t_1);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) t_1 = 2.0 + (beta + alpha) tmp = 0 if beta <= 7.5e+102: tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0)) else: tmp = ((1.0 + alpha) / t_1) / (1.0 + t_1) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) t_1 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 7.5e+102) 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) / t_1) / Float64(1.0 + t_1)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
t_1 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 7.5e+102)
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
else
tmp = ((1.0 + alpha) / t_1) / (1.0 + t_1);
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]}, Block[{t$95$1 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 7.5e+102], 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] / t$95$1), $MachinePrecision] / N[(1.0 + t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
t_1 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 7.5 \cdot 10^{+102}:\\
\;\;\;\;\frac{\beta + 1}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_1}}{1 + t_1}\\
\end{array}
\end{array}
if beta < 7.5e102Initial program 98.8%
associate-/l/98.8%
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%
times-frac99.8%
Simplified99.8%
if 7.5e102 < beta Initial program 79.9%
Taylor expanded in beta around inf 94.1%
Final simplification98.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.05e+16) (/ (+ beta 1.0) (* (+ beta 2.0) (+ (+ (* beta beta) (* beta 5.0)) 6.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.05e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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.05d+16) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * (((beta * beta) + (beta * 5.0d0)) + 6.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.05e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.05e+16: tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.05e+16) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(Float64(beta * beta) + Float64(beta * 5.0)) + 6.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.05e+16)
tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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.05e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(N[(beta * beta), $MachinePrecision] + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision] + 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.05 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta \cdot \beta + \beta \cdot 5\right) + 6\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.05e16Initial program 99.8%
associate-/l/99.9%
associate-/r*92.6%
associate-+l+92.6%
+-commutative92.6%
associate-+r+92.6%
associate-+l+92.6%
distribute-rgt1-in92.6%
*-rgt-identity92.6%
distribute-lft-out92.6%
*-commutative92.6%
metadata-eval92.6%
associate-+l+92.6%
+-commutative92.6%
Simplified92.6%
distribute-lft-in92.6%
associate-+r+92.6%
+-commutative92.6%
associate-+r+92.6%
+-commutative92.6%
Applied egg-rr92.6%
Taylor expanded in beta around 0 92.6%
associate-+r+92.6%
+-commutative92.6%
unpow292.6%
distribute-lft-out92.6%
*-commutative92.6%
*-commutative92.6%
distribute-rgt-in92.6%
*-commutative92.6%
+-commutative92.6%
Simplified92.6%
Taylor expanded in alpha around 0 66.9%
distribute-lft-in66.9%
Applied egg-rr66.9%
if 1.05e16 < beta Initial program 82.4%
Taylor expanded in beta around inf 89.3%
Taylor expanded in alpha around 0 89.3%
associate-+r+89.3%
Simplified89.3%
Final simplification73.8%
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.15e+21)
(/ (+ beta 1.0) (* (+ beta 2.0) (+ (+ (* beta beta) (* beta 5.0)) 6.0)))
(/ (/ (+ 1.0 alpha) 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.15e+21) {
tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0));
} else {
tmp = ((1.0 + alpha) / 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.15d+21) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * (((beta * beta) + (beta * 5.0d0)) + 6.0d0))
else
tmp = ((1.0d0 + alpha) / 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.15e+21) {
tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0));
} else {
tmp = ((1.0 + alpha) / 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.15e+21: tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0)) else: tmp = ((1.0 + alpha) / 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.15e+21) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(Float64(beta * beta) + Float64(beta * 5.0)) + 6.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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.15e+21)
tmp = (beta + 1.0) / ((beta + 2.0) * (((beta * beta) + (beta * 5.0)) + 6.0));
else
tmp = ((1.0 + alpha) / 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.15e+21], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(N[(beta * beta), $MachinePrecision] + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision] + 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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.15 \cdot 10^{+21}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta \cdot \beta + \beta \cdot 5\right) + 6\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 1.15e21Initial program 99.8%
associate-/l/99.9%
associate-/r*92.6%
associate-+l+92.6%
+-commutative92.6%
associate-+r+92.6%
associate-+l+92.6%
distribute-rgt1-in92.6%
*-rgt-identity92.6%
distribute-lft-out92.6%
*-commutative92.6%
metadata-eval92.6%
associate-+l+92.6%
+-commutative92.6%
Simplified92.6%
distribute-lft-in92.6%
associate-+r+92.6%
+-commutative92.6%
associate-+r+92.6%
+-commutative92.6%
Applied egg-rr92.6%
Taylor expanded in beta around 0 92.7%
associate-+r+92.6%
+-commutative92.6%
unpow292.6%
distribute-lft-out92.6%
*-commutative92.6%
*-commutative92.6%
distribute-rgt-in92.6%
*-commutative92.6%
+-commutative92.6%
Simplified92.6%
Taylor expanded in alpha around 0 67.1%
distribute-lft-in67.1%
Applied egg-rr67.1%
if 1.15e21 < beta Initial program 82.2%
Taylor expanded in beta around inf 89.5%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ (+ 1.0 alpha) (* (+ alpha 2.0) (* (+ alpha 3.0) (+ alpha 2.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 3.0) * (alpha + 2.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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.0d0) then
tmp = (1.0d0 + alpha) / ((alpha + 2.0d0) * ((alpha + 3.0d0) * (alpha + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 3.0) * (alpha + 2.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 3.0) * (alpha + 2.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) * Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = (1.0 + alpha) / ((alpha + 2.0) * ((alpha + 3.0) * (alpha + 2.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + 2\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 91.6%
+-commutative91.6%
*-commutative91.6%
+-commutative91.6%
*-commutative91.6%
distribute-rgt-in91.6%
*-commutative91.6%
+-commutative91.6%
Simplified91.6%
if 6 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.3%
Taylor expanded in alpha around 0 87.3%
associate-+r+87.3%
Simplified87.3%
Final simplification90.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.8e+16) (/ (+ beta 1.0) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0))))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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.8d+16) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.8e+16: tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.8e+16) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.8e+16)
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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.8e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.8e16Initial program 99.8%
associate-/l/99.9%
associate-/r*92.6%
associate-+l+92.6%
+-commutative92.6%
associate-+r+92.6%
associate-+l+92.6%
distribute-rgt1-in92.6%
*-rgt-identity92.6%
distribute-lft-out92.6%
*-commutative92.6%
metadata-eval92.6%
associate-+l+92.6%
+-commutative92.6%
Simplified92.6%
distribute-lft-in92.6%
associate-+r+92.6%
+-commutative92.6%
associate-+r+92.6%
+-commutative92.6%
Applied egg-rr92.6%
Taylor expanded in beta around 0 92.6%
associate-+r+92.6%
+-commutative92.6%
unpow292.6%
distribute-lft-out92.6%
*-commutative92.6%
*-commutative92.6%
distribute-rgt-in92.6%
*-commutative92.6%
+-commutative92.6%
Simplified92.6%
Taylor expanded in alpha around 0 66.9%
if 1.8e16 < beta Initial program 82.4%
Taylor expanded in beta around inf 89.3%
Taylor expanded in alpha around 0 89.3%
associate-+r+89.3%
Simplified89.3%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.8)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 1.35e+154)
(/ (+ 1.0 alpha) (* beta beta))
(/ (/ alpha beta) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / (alpha + (beta + 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.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 1.35d+154) then
tmp = (1.0d0 + alpha) / (beta * beta)
else
tmp = (alpha / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 1.35e+154: tmp = (1.0 + alpha) / (beta * beta) else: tmp = (alpha / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 1.35e+154) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 1.35e+154)
tmp = (1.0 + alpha) / (beta * beta);
else
tmp = (alpha / beta) / (alpha + (beta + 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.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.7999999999999998 < beta < 1.35000000000000003e154Initial program 95.0%
associate-/l/92.8%
associate-+l+92.8%
+-commutative92.8%
associate-+r+92.8%
associate-+l+92.8%
distribute-rgt1-in92.8%
*-rgt-identity92.8%
distribute-lft-out92.8%
+-commutative92.8%
associate-*l/97.5%
*-commutative97.5%
associate-*r/97.4%
Simplified97.4%
Taylor expanded in beta around inf 80.9%
unpow280.9%
Simplified80.9%
if 1.35000000000000003e154 < beta Initial program 71.2%
Taylor expanded in beta around inf 93.7%
Taylor expanded in alpha around 0 93.7%
associate-+r+93.7%
Simplified93.7%
Taylor expanded in alpha around inf 92.6%
Final simplification72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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 = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 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 = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 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 = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 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[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.5 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.3%
Taylor expanded in alpha around 0 87.3%
associate-+r+87.3%
Simplified87.3%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.8)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 1.35e+154)
(/ (+ 1.0 alpha) (* beta beta))
(/ (/ alpha beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / (beta + 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.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 1.35d+154) then
tmp = (1.0d0 + alpha) / (beta * beta)
else
tmp = (alpha / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.35e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 1.35e+154: tmp = (1.0 + alpha) / (beta * beta) else: tmp = (alpha / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 1.35e+154) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 1.35e+154)
tmp = (1.0 + alpha) / (beta * beta);
else
tmp = (alpha / beta) / (beta + 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.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.7999999999999998 < beta < 1.35000000000000003e154Initial program 95.0%
associate-/l/92.8%
associate-+l+92.8%
+-commutative92.8%
associate-+r+92.8%
associate-+l+92.8%
distribute-rgt1-in92.8%
*-rgt-identity92.8%
distribute-lft-out92.8%
+-commutative92.8%
associate-*l/97.5%
*-commutative97.5%
associate-*r/97.4%
Simplified97.4%
Taylor expanded in beta around inf 80.9%
unpow280.9%
Simplified80.9%
if 1.35000000000000003e154 < beta Initial program 71.2%
Taylor expanded in beta around inf 93.7%
Taylor expanded in alpha around 0 93.6%
Taylor expanded in alpha around inf 92.5%
Final simplification72.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 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 = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 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 = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 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 = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) / (beta + 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[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.5 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.3%
Taylor expanded in alpha around 0 87.2%
Final simplification73.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 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 = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 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 = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 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 = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 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[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.5 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.3%
Taylor expanded in alpha around 0 79.7%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} 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 <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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 <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); 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 <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $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 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.7999999999999998 < beta Initial program 83.4%
associate-/l/80.2%
associate-+l+80.2%
+-commutative80.2%
associate-+r+80.2%
associate-+l+80.2%
distribute-rgt1-in80.2%
*-rgt-identity80.2%
distribute-lft-out80.2%
+-commutative80.2%
associate-*l/92.4%
*-commutative92.4%
associate-*r/92.4%
Simplified92.4%
Taylor expanded in beta around inf 84.0%
unpow284.0%
Simplified84.0%
Final simplification72.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} 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 <= 2.9d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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 <= 2.9) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); 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 <= 2.9)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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, 2.9], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.89999999999999991 < beta Initial program 83.4%
Taylor expanded in beta around inf 87.3%
Taylor expanded in alpha around inf 6.6%
Final simplification46.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 3.45) 0.08333333333333333 (/ 1.0 (* alpha alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 3.45) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (alpha * alpha);
}
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 (alpha <= 3.45d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / (alpha * alpha)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 3.45) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (alpha * alpha);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 3.45: tmp = 0.08333333333333333 else: tmp = 1.0 / (alpha * alpha) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 3.45) tmp = 0.08333333333333333; else tmp = Float64(1.0 / Float64(alpha * alpha)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 3.45)
tmp = 0.08333333333333333;
else
tmp = 1.0 / (alpha * alpha);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, 3.45], 0.08333333333333333, N[(1.0 / N[(alpha * alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 3.45:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\alpha \cdot \alpha}\\
\end{array}
\end{array}
if alpha < 3.4500000000000002Initial program 99.9%
associate-/l/99.8%
associate-/r*92.3%
associate-+l+92.3%
+-commutative92.3%
associate-+r+92.3%
associate-+l+92.3%
distribute-rgt1-in92.3%
*-rgt-identity92.3%
distribute-lft-out92.3%
*-commutative92.3%
metadata-eval92.3%
associate-+l+92.3%
+-commutative92.3%
Simplified92.3%
distribute-lft-in92.3%
associate-+r+92.3%
+-commutative92.3%
associate-+r+92.3%
+-commutative92.3%
Applied egg-rr92.3%
Taylor expanded in beta around 0 92.3%
associate-+r+92.3%
+-commutative92.3%
unpow292.3%
distribute-lft-out92.3%
*-commutative92.3%
*-commutative92.3%
distribute-rgt-in92.3%
*-commutative92.3%
+-commutative92.3%
Simplified92.3%
Taylor expanded in alpha around 0 91.2%
Taylor expanded in beta around 0 65.7%
if 3.4500000000000002 < alpha Initial program 83.4%
associate-/l/80.3%
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%
times-frac92.5%
Simplified92.5%
Taylor expanded in beta around 0 87.0%
Taylor expanded in alpha around inf 81.2%
unpow281.2%
Simplified81.2%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} 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 <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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 <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); 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 <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $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 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
associate-/l/99.9%
associate-/r*92.4%
associate-+l+92.4%
+-commutative92.4%
associate-+r+92.4%
associate-+l+92.4%
distribute-rgt1-in92.4%
*-rgt-identity92.4%
distribute-lft-out92.4%
*-commutative92.4%
metadata-eval92.4%
associate-+l+92.4%
+-commutative92.4%
Simplified92.4%
distribute-lft-in92.4%
associate-+r+92.4%
+-commutative92.4%
associate-+r+92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 92.4%
associate-+r+92.4%
+-commutative92.4%
unpow292.4%
distribute-lft-out92.4%
*-commutative92.4%
*-commutative92.4%
distribute-rgt-in92.4%
*-commutative92.4%
+-commutative92.4%
Simplified92.4%
Taylor expanded in alpha around 0 66.5%
Taylor expanded in beta around 0 66.1%
if 2.7999999999999998 < beta Initial program 83.4%
associate-/l/80.2%
associate-+l+80.2%
+-commutative80.2%
associate-+r+80.2%
associate-+l+80.2%
distribute-rgt1-in80.2%
*-rgt-identity80.2%
distribute-lft-out80.2%
+-commutative80.2%
associate-*l/92.4%
*-commutative92.4%
associate-*r/92.4%
Simplified92.4%
Taylor expanded in beta around inf 84.0%
unpow284.0%
Simplified84.0%
Taylor expanded in alpha around 0 79.6%
unpow279.6%
Simplified79.6%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
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.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.5%
associate-/l/93.4%
associate-/r*81.9%
associate-+l+81.9%
+-commutative81.9%
associate-+r+81.9%
associate-+l+81.9%
distribute-rgt1-in81.9%
*-rgt-identity81.9%
distribute-lft-out81.9%
*-commutative81.9%
metadata-eval81.9%
associate-+l+81.9%
+-commutative81.9%
Simplified81.9%
distribute-lft-in81.9%
associate-+r+81.9%
+-commutative81.9%
associate-+r+81.9%
+-commutative81.9%
Applied egg-rr81.9%
Taylor expanded in beta around 0 81.9%
associate-+r+81.9%
+-commutative81.9%
unpow281.9%
distribute-lft-out81.9%
*-commutative81.9%
*-commutative81.9%
distribute-rgt-in81.9%
*-commutative81.9%
+-commutative81.9%
Simplified81.9%
Taylor expanded in alpha around 0 66.3%
Taylor expanded in beta around 0 45.4%
Final simplification45.4%
herbie shell --seed 2023222
(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)))