
(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 22 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 (+ alpha (+ beta 2.0))))
(if (<= beta 7e+140)
(* (/ (+ 1.0 beta) t_0) (/ (+ alpha 1.0) (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (+ alpha 1.0) t_0) (+ (* alpha 2.0) (+ beta 4.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 7e+140) {
tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / ((alpha * 2.0) + (beta + 4.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 <= 7d+140) then
tmp = ((1.0d0 + beta) / t_0) * ((alpha + 1.0d0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha + 1.0d0) / t_0) / ((alpha * 2.0d0) + (beta + 4.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 <= 7e+140) {
tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / ((alpha * 2.0) + (beta + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 7e+140: tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha + 1.0) / t_0) / ((alpha * 2.0) + (beta + 4.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 <= 7e+140) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(Float64(alpha + 1.0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(Float64(alpha * 2.0) + Float64(beta + 4.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 <= 7e+140)
tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha + 1.0) / t_0) / ((alpha * 2.0) + (beta + 4.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, 7e+140], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta + 4.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 7 \cdot 10^{+140}:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{\alpha + 1}{t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{\alpha \cdot 2 + \left(\beta + 4\right)}\\
\end{array}
\end{array}
if beta < 6.99999999999999978e140Initial program 96.6%
associate-/l/96.4%
associate-/r*86.9%
+-commutative86.9%
associate-+l+86.9%
associate-+r+86.9%
*-commutative86.9%
distribute-rgt1-in86.9%
+-commutative86.9%
*-commutative86.9%
distribute-rgt1-in86.9%
+-commutative86.9%
times-frac98.8%
Simplified98.8%
if 6.99999999999999978e140 < beta Initial program 76.5%
associate-/l/75.8%
associate-/r*73.7%
+-commutative73.7%
associate-+l+73.7%
associate-+r+73.7%
*-commutative73.7%
distribute-rgt1-in73.7%
+-commutative73.7%
*-commutative73.7%
distribute-rgt1-in73.7%
+-commutative73.7%
times-frac91.5%
Simplified91.5%
clear-num91.5%
associate-/r*100.0%
associate-+r+100.0%
metadata-eval100.0%
associate-+l+100.0%
metadata-eval100.0%
frac-times98.4%
metadata-eval98.4%
times-frac98.4%
*-un-lft-identity98.4%
*-un-lft-identity98.4%
+-commutative98.4%
metadata-eval98.4%
associate-+l+98.4%
metadata-eval98.4%
Applied egg-rr98.4%
Taylor expanded in beta around inf 89.2%
associate-+r+89.2%
Simplified89.2%
Final simplification97.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))))
(/
(/ (+ alpha 1.0) t_0)
(* (/ 1.0 (/ (+ 1.0 beta) t_0)) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / t_0) / ((1.0 / ((1.0 + beta) / t_0)) * (alpha + (beta + 3.0)));
}
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
t_0 = alpha + (beta + 2.0d0)
code = ((alpha + 1.0d0) / t_0) / ((1.0d0 / ((1.0d0 + beta) / t_0)) * (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / t_0) / ((1.0 / ((1.0 + beta) / t_0)) * (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((alpha + 1.0) / t_0) / ((1.0 / ((1.0 + beta) / t_0)) * (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(Float64(1.0 / Float64(Float64(1.0 + beta) / t_0)) * Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((alpha + 1.0) / t_0) / ((1.0 / ((1.0 + beta) / t_0)) * (alpha + (beta + 3.0)));
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]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(1.0 / N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{t_0}}{\frac{1}{\frac{1 + \beta}{t_0}} \cdot \left(\alpha + \left(\beta + 3\right)\right)}
\end{array}
\end{array}
Initial program 93.3%
associate-/l/93.0%
associate-/r*84.7%
+-commutative84.7%
associate-+l+84.7%
associate-+r+84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
times-frac97.6%
Simplified97.6%
clear-num97.6%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.5%
metadata-eval99.5%
times-frac99.5%
*-un-lft-identity99.5%
*-un-lft-identity99.5%
+-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
Applied egg-rr99.5%
clear-num99.4%
+-commutative99.4%
inv-pow99.4%
+-commutative99.4%
Applied egg-rr99.4%
unpow-199.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
Final simplification99.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))))
(if (<= beta 1.95)
(/ t_0 (* (+ alpha 2.0) (+ alpha 3.0)))
(/ t_0 (* (+ alpha (+ beta 3.0)) (+ 1.0 (/ (+ alpha 1.0) beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 1.95) {
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = t_0 / ((alpha + (beta + 3.0)) * (1.0 + ((alpha + 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) :: t_0
real(8) :: tmp
t_0 = (alpha + 1.0d0) / (alpha + (beta + 2.0d0))
if (beta <= 1.95d0) then
tmp = t_0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = t_0 / ((alpha + (beta + 3.0d0)) * (1.0d0 + ((alpha + 1.0d0) / beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 1.95) {
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = t_0 / ((alpha + (beta + 3.0)) * (1.0 + ((alpha + 1.0) / beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 1.0) / (alpha + (beta + 2.0)) tmp = 0 if beta <= 1.95: tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = t_0 / ((alpha + (beta + 3.0)) * (1.0 + ((alpha + 1.0) / beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) tmp = 0.0 if (beta <= 1.95) tmp = Float64(t_0 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(t_0 / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(1.0 + Float64(Float64(alpha + 1.0) / beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
tmp = 0.0;
if (beta <= 1.95)
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = t_0 / ((alpha + (beta + 3.0)) * (1.0 + ((alpha + 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_] := Block[{t$95$0 = N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.95], N[(t$95$0 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}\\
\mathbf{if}\;\beta \leq 1.95:\\
\;\;\;\;\frac{t_0}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(1 + \frac{\alpha + 1}{\beta}\right)}\\
\end{array}
\end{array}
if beta < 1.94999999999999996Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
clear-num99.6%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.7%
metadata-eval99.7%
times-frac99.7%
*-un-lft-identity99.7%
*-un-lft-identity99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.8%
if 1.94999999999999996 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around -inf 98.4%
mul-1-neg98.4%
unsub-neg98.4%
distribute-lft-in98.4%
metadata-eval98.4%
associate-+r+98.4%
metadata-eval98.4%
metadata-eval98.4%
distribute-lft-in98.4%
mul-1-neg98.4%
Simplified98.4%
Final simplification98.0%
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)))) (* (/ (/ (+ 1.0 beta) t_0) t_0) (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / t_0) * ((alpha + 1.0) / (alpha + (beta + 3.0)));
}
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
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / t_0) * ((alpha + 1.0d0) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / t_0) * ((alpha + 1.0) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / t_0) * ((alpha + 1.0) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / t_0) * Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) / t_0) * ((alpha + 1.0) / (alpha + (beta + 3.0)));
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]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t_0}}{t_0} \cdot \frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 93.3%
associate-/l/93.0%
associate-/r*84.7%
+-commutative84.7%
associate-+r+84.7%
+-commutative84.7%
associate-+r+84.7%
associate-+r+84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
metadata-eval84.7%
associate-+l+84.7%
*-commutative84.7%
metadata-eval84.7%
associate-+l+84.7%
Simplified84.7%
*-commutative84.7%
frac-times97.6%
associate-*r/97.6%
associate-+r+97.6%
metadata-eval97.6%
associate-+l+97.6%
metadata-eval97.6%
times-frac99.8%
+-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Final simplification99.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)))) (/ (/ (+ alpha 1.0) t_0) (* (+ alpha (+ beta 3.0)) (/ t_0 (+ 1.0 beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / t_0) / ((alpha + (beta + 3.0)) * (t_0 / (1.0 + beta)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = ((alpha + 1.0d0) / t_0) / ((alpha + (beta + 3.0d0)) * (t_0 / (1.0d0 + beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / t_0) / ((alpha + (beta + 3.0)) * (t_0 / (1.0 + beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((alpha + 1.0) / t_0) / ((alpha + (beta + 3.0)) * (t_0 / (1.0 + beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(t_0 / Float64(1.0 + beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((alpha + 1.0) / t_0) / ((alpha + (beta + 3.0)) * (t_0 / (1.0 + beta)));
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]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{t_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \frac{t_0}{1 + \beta}}
\end{array}
\end{array}
Initial program 93.3%
associate-/l/93.0%
associate-/r*84.7%
+-commutative84.7%
associate-+l+84.7%
associate-+r+84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
times-frac97.6%
Simplified97.6%
clear-num97.6%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.5%
metadata-eval99.5%
times-frac99.5%
*-un-lft-identity99.5%
*-un-lft-identity99.5%
+-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Final simplification99.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 0.69) (* (/ 1.0 (+ alpha 2.0)) (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ alpha 3.0)))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 0.69) {
tmp = (1.0 / (alpha + 2.0)) * ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.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 <= 0.69d0) then
tmp = (1.0d0 / (alpha + 2.0d0)) * ((alpha + 1.0d0) / ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 0.69) {
tmp = (1.0 / (alpha + 2.0)) * ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 0.69: tmp = (1.0 / (alpha + 2.0)) * ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 3.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 0.69) tmp = Float64(Float64(1.0 / Float64(alpha + 2.0)) * Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 0.69)
tmp = (1.0 / (alpha + 2.0)) * ((alpha + 1.0) / ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.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, 0.69], N[(N[(1.0 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 0.69:\\
\;\;\;\;\frac{1}{\alpha + 2} \cdot \frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 0.68999999999999995Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 97.6%
if 0.68999999999999995 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in alpha around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in beta around inf 74.2%
+-commutative74.2%
Simplified74.2%
Final simplification90.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))))
(if (<= beta 2.7)
(/ t_0 (* (+ alpha 2.0) (+ alpha 3.0)))
(/ t_0 (+ beta 4.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 2.7) {
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = t_0 / (beta + 4.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 + 1.0d0) / (alpha + (beta + 2.0d0))
if (beta <= 2.7d0) then
tmp = t_0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = t_0 / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 2.7) {
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = t_0 / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 1.0) / (alpha + (beta + 2.0)) tmp = 0 if beta <= 2.7: tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = t_0 / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) tmp = 0.0 if (beta <= 2.7) tmp = Float64(t_0 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(t_0 / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
tmp = 0.0;
if (beta <= 2.7)
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = t_0 / (beta + 4.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[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.7], N[(t$95$0 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}\\
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;\frac{t_0}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{\beta + 4}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
clear-num99.6%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.7%
metadata-eval99.7%
times-frac99.7%
*-un-lft-identity99.7%
*-un-lft-identity99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.8%
if 2.7000000000000002 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in alpha around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in beta around inf 74.2%
+-commutative74.2%
Simplified74.2%
Final simplification90.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))))
(if (<= beta 3.55)
(/ t_0 (* (+ alpha 2.0) (+ alpha 3.0)))
(/ t_0 (+ (* alpha 2.0) (+ beta 4.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 3.55) {
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = t_0 / ((alpha * 2.0) + (beta + 4.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 + 1.0d0) / (alpha + (beta + 2.0d0))
if (beta <= 3.55d0) then
tmp = t_0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = t_0 / ((alpha * 2.0d0) + (beta + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 3.55) {
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = t_0 / ((alpha * 2.0) + (beta + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 1.0) / (alpha + (beta + 2.0)) tmp = 0 if beta <= 3.55: tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = t_0 / ((alpha * 2.0) + (beta + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) tmp = 0.0 if (beta <= 3.55) tmp = Float64(t_0 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(t_0 / Float64(Float64(alpha * 2.0) + Float64(beta + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
tmp = 0.0;
if (beta <= 3.55)
tmp = t_0 / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = t_0 / ((alpha * 2.0) + (beta + 4.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[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.55], N[(t$95$0 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}\\
\mathbf{if}\;\beta \leq 3.55:\\
\;\;\;\;\frac{t_0}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{\alpha \cdot 2 + \left(\beta + 4\right)}\\
\end{array}
\end{array}
if beta < 3.5499999999999998Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
clear-num99.6%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.7%
metadata-eval99.7%
times-frac99.7%
*-un-lft-identity99.7%
*-un-lft-identity99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.8%
if 3.5499999999999998 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.9%
associate-+r+74.9%
Simplified74.9%
Final simplification90.9%
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 0.55)
(*
(/ (+ 1.0 beta) t_0)
(+ 0.16666666666666666 (* beta -0.1388888888888889)))
(/ (/ (+ alpha 1.0) t_0) (+ beta 4.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 0.55) {
tmp = ((1.0 + beta) / t_0) * (0.16666666666666666 + (beta * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / t_0) / (beta + 4.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 <= 0.55d0) then
tmp = ((1.0d0 + beta) / t_0) * (0.16666666666666666d0 + (beta * (-0.1388888888888889d0)))
else
tmp = ((alpha + 1.0d0) / t_0) / (beta + 4.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 <= 0.55) {
tmp = ((1.0 + beta) / t_0) * (0.16666666666666666 + (beta * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / t_0) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 0.55: tmp = ((1.0 + beta) / t_0) * (0.16666666666666666 + (beta * -0.1388888888888889)) else: tmp = ((alpha + 1.0) / t_0) / (beta + 4.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 <= 0.55) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(beta + 4.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 <= 0.55)
tmp = ((1.0 + beta) / t_0) * (0.16666666666666666 + (beta * -0.1388888888888889));
else
tmp = ((alpha + 1.0) / t_0) / (beta + 4.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, 0.55], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + 4.0), $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 0.55:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \left(0.16666666666666666 + \beta \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 0.55000000000000004Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 64.5%
if 0.55000000000000004 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in alpha around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in beta around inf 74.2%
+-commutative74.2%
Simplified74.2%
Final simplification67.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.5) (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ 6.0 (* alpha 5.0)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.5d0) then
tmp = (alpha + 1.0d0) / ((alpha + 2.0d0) * (6.0d0 + (alpha * 5.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.5: tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.5) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.5)
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.5], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.5:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(6 + \alpha \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 8.5Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 64.3%
*-commutative64.3%
Simplified64.3%
Taylor expanded in beta around 0 80.8%
if 8.5 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.2%
expm1-log1p-u74.2%
expm1-udef62.3%
associate-/l/62.3%
Applied egg-rr62.3%
expm1-def81.9%
expm1-log1p81.9%
associate-/r*74.2%
+-commutative74.2%
Simplified74.2%
Final simplification78.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.4) (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ 6.0 (* alpha 5.0)))) (/ (/ (+ alpha 1.0) beta) (+ (* alpha 2.0) (+ beta 4.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
} else {
tmp = ((alpha + 1.0) / beta) / ((alpha * 2.0) + (beta + 4.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.4d0) then
tmp = (alpha + 1.0d0) / ((alpha + 2.0d0) * (6.0d0 + (alpha * 5.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / ((alpha * 2.0d0) + (beta + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
} else {
tmp = ((alpha + 1.0) / beta) / ((alpha * 2.0) + (beta + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4: tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0))) else: tmp = ((alpha + 1.0) / beta) / ((alpha * 2.0) + (beta + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha * 2.0) + Float64(beta + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.4)
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
else
tmp = ((alpha + 1.0) / beta) / ((alpha * 2.0) + (beta + 4.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.4], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha * 2.0), $MachinePrecision] + N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(6 + \alpha \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha \cdot 2 + \left(\beta + 4\right)}\\
\end{array}
\end{array}
if beta < 3.39999999999999991Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 64.3%
*-commutative64.3%
Simplified64.3%
Taylor expanded in beta around 0 80.8%
if 3.39999999999999991 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.9%
associate-+r+74.9%
Simplified74.9%
Taylor expanded in beta around inf 74.2%
Final simplification78.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ 6.0 (* alpha 5.0)))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.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.9d0) then
tmp = (alpha + 1.0d0) / ((alpha + 2.0d0) * (6.0d0 + (alpha * 5.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 5.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / (beta + 4.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.9], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(6 + \alpha \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 64.3%
*-commutative64.3%
Simplified64.3%
Taylor expanded in beta around 0 80.8%
if 2.89999999999999991 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in alpha around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in beta around inf 74.2%
+-commutative74.2%
Simplified74.2%
Final simplification78.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))))) (if (<= beta 1.0) (/ t_0 (- 6.0 beta)) (/ t_0 (+ beta 4.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 1.0) {
tmp = t_0 / (6.0 - beta);
} else {
tmp = t_0 / (beta + 4.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 + 1.0d0) / (alpha + (beta + 2.0d0))
if (beta <= 1.0d0) then
tmp = t_0 / (6.0d0 - beta)
else
tmp = t_0 / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 1.0) {
tmp = t_0 / (6.0 - beta);
} else {
tmp = t_0 / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 1.0) / (alpha + (beta + 2.0)) tmp = 0 if beta <= 1.0: tmp = t_0 / (6.0 - beta) else: tmp = t_0 / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) tmp = 0.0 if (beta <= 1.0) tmp = Float64(t_0 / Float64(6.0 - beta)); else tmp = Float64(t_0 / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
tmp = 0.0;
if (beta <= 1.0)
tmp = t_0 / (6.0 - beta);
else
tmp = t_0 / (beta + 4.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[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.0], N[(t$95$0 / N[(6.0 - beta), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}\\
\mathbf{if}\;\beta \leq 1:\\
\;\;\;\;\frac{t_0}{6 - \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{\beta + 4}\\
\end{array}
\end{array}
if beta < 1Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
clear-num99.6%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.7%
metadata-eval99.7%
times-frac99.7%
*-un-lft-identity99.7%
*-un-lft-identity99.7%
+-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 63.6%
+-commutative63.6%
+-commutative63.6%
Simplified63.6%
Taylor expanded in beta around 0 63.3%
mul-1-neg63.3%
unsub-neg63.3%
Simplified63.3%
if 1 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in alpha around 0 74.4%
+-commutative74.4%
+-commutative74.4%
Simplified74.4%
Taylor expanded in beta around inf 74.2%
+-commutative74.2%
Simplified74.2%
Final simplification66.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.95) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.95d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((alpha + 1.0d0) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.95: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.95) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.95)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.95], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.95:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.9500000000000002Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 63.7%
if 2.9500000000000002 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.2%
expm1-log1p-u74.2%
expm1-udef62.3%
associate-/l/62.3%
Applied egg-rr62.3%
expm1-def81.9%
expm1-log1p81.9%
associate-/r*74.2%
+-commutative74.2%
Simplified74.2%
Final simplification66.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.75) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.75) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.75d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (beta * (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.75) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.75: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.75) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.75)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.0 / (beta * (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.75], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.75:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.75Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 63.7%
if 2.75 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.2%
Taylor expanded in alpha around 0 74.5%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.05) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ beta 4.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.05) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 4.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.05d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (beta * (beta + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.05) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.05: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * (beta + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.05) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.05)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.0 / (beta * (beta + 4.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.05], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.05:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 4\right)}\\
\end{array}
\end{array}
if beta < 2.0499999999999998Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 63.7%
if 2.0499999999999998 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.9%
associate-+r+74.9%
Simplified74.9%
Taylor expanded in beta around inf 74.2%
Taylor expanded in alpha around 0 74.5%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.95) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ 1.0 beta) (+ beta 2.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 2.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.95d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (1.0d0 / beta) / (beta + 2.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 2.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.95: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (1.0 / beta) / (beta + 2.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.95) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 2.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.95)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (1.0 / beta) / (beta + 2.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.95], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.95:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 2}\\
\end{array}
\end{array}
if beta < 2.9500000000000002Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 63.7%
if 2.9500000000000002 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.2%
Taylor expanded in alpha around 0 74.5%
associate-/r*74.7%
+-commutative74.7%
Simplified74.7%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ 1.0 beta) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 4.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.1d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (1.0d0 / beta) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (1.0 / beta) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (1.0 / beta) / (beta + 4.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.1], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 63.7%
if 2.10000000000000009 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.9%
associate-+r+74.9%
Simplified74.9%
Taylor expanded in beta around inf 74.2%
Taylor expanded in alpha around 0 74.5%
associate-/r*74.7%
+-commutative74.7%
Simplified74.7%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.2d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.2)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.2], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in alpha around 0 64.8%
+-commutative64.8%
Simplified64.8%
Taylor expanded in beta around 0 63.7%
if 4.20000000000000018 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.2%
Taylor expanded in beta around inf 73.9%
Final simplification66.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) 0.08333333333333333 (/ 0.5 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.5 / 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 <= 6.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.5d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.5 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.08333333333333333 else: tmp = 0.5 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = 0.08333333333333333; else tmp = Float64(0.5 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = 0.08333333333333333;
else
tmp = 0.5 / 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, 6.0], 0.08333333333333333, N[(0.5 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
associate-/l/99.7%
associate-/r*92.5%
+-commutative92.5%
associate-+l+92.5%
associate-+r+92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
*-commutative92.5%
distribute-rgt1-in92.5%
+-commutative92.5%
times-frac99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 62.6%
associate-*r/62.6%
+-commutative62.6%
Simplified62.6%
Taylor expanded in beta around 0 62.6%
if 6 < beta Initial program 78.1%
associate-/l/77.6%
associate-/r*66.7%
+-commutative66.7%
associate-+l+66.7%
associate-+r+66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
*-commutative66.7%
distribute-rgt1-in66.7%
+-commutative66.7%
times-frac92.8%
Simplified92.8%
clear-num92.8%
associate-/r*99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
frac-times99.0%
metadata-eval99.0%
times-frac99.0%
*-un-lft-identity99.0%
*-un-lft-identity99.0%
+-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
Applied egg-rr99.0%
Taylor expanded in beta around inf 74.9%
associate-+r+74.9%
Simplified74.9%
Taylor expanded in beta around inf 74.2%
Taylor expanded in alpha around inf 6.5%
Final simplification45.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ alpha 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
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 / (alpha + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (alpha + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(alpha + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (alpha + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\alpha + 2}
\end{array}
Initial program 93.3%
associate-/l/93.0%
associate-/r*84.7%
+-commutative84.7%
associate-+l+84.7%
associate-+r+84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
times-frac97.6%
Simplified97.6%
Taylor expanded in alpha around 0 70.0%
+-commutative70.0%
Simplified70.0%
Taylor expanded in beta around 0 46.1%
Final simplification46.1%
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 93.3%
associate-/l/93.0%
associate-/r*84.7%
+-commutative84.7%
associate-+l+84.7%
associate-+r+84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
*-commutative84.7%
distribute-rgt1-in84.7%
+-commutative84.7%
times-frac97.6%
Simplified97.6%
Taylor expanded in beta around 0 76.2%
Taylor expanded in alpha around 0 44.9%
associate-*r/44.9%
+-commutative44.9%
Simplified44.9%
Taylor expanded in beta around 0 44.9%
Final simplification44.9%
herbie shell --seed 2023318
(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)))