
(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 15 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 3.0))))
(if (<= alpha 1.3e-26)
(*
(+ alpha 1.0)
(* (pow (+ alpha (+ 2.0 beta)) -2.0) (/ (+ 1.0 beta) t_0)))
(/
(/
(+
(+ 1.0 (+ alpha (+ (/ 1.0 beta) (/ alpha beta))))
(* (/ (+ 4.0 (* alpha 2.0)) beta) (- -1.0 alpha)))
beta)
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (alpha <= 1.3e-26) {
tmp = (alpha + 1.0) * (pow((alpha + (2.0 + beta)), -2.0) * ((1.0 + beta) / t_0));
} else {
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (alpha <= 1.3d-26) then
tmp = (alpha + 1.0d0) * (((alpha + (2.0d0 + beta)) ** (-2.0d0)) * ((1.0d0 + beta) / t_0))
else
tmp = (((1.0d0 + (alpha + ((1.0d0 / beta) + (alpha / beta)))) + (((4.0d0 + (alpha * 2.0d0)) / beta) * ((-1.0d0) - alpha))) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (alpha <= 1.3e-26) {
tmp = (alpha + 1.0) * (Math.pow((alpha + (2.0 + beta)), -2.0) * ((1.0 + beta) / t_0));
} else {
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if alpha <= 1.3e-26: tmp = (alpha + 1.0) * (math.pow((alpha + (2.0 + beta)), -2.0) * ((1.0 + beta) / t_0)) else: tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (alpha <= 1.3e-26) tmp = Float64(Float64(alpha + 1.0) * Float64((Float64(alpha + Float64(2.0 + beta)) ^ -2.0) * Float64(Float64(1.0 + beta) / t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + Float64(alpha + Float64(Float64(1.0 / beta) + Float64(alpha / beta)))) + Float64(Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta) * Float64(-1.0 - alpha))) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (alpha <= 1.3e-26)
tmp = (alpha + 1.0) * (((alpha + (2.0 + beta)) ^ -2.0) * ((1.0 + beta) / t_0));
else
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 1.3e-26], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[Power[N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + N[(alpha + N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\alpha \leq 1.3 \cdot 10^{-26}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \left({\left(\alpha + \left(2 + \beta\right)\right)}^{-2} \cdot \frac{1 + \beta}{t\_0}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \left(\alpha + \left(\frac{1}{\beta} + \frac{\alpha}{\beta}\right)\right)\right) + \frac{4 + \alpha \cdot 2}{\beta} \cdot \left(-1 - \alpha\right)}{\beta}}{t\_0}\\
\end{array}
\end{array}
if alpha < 1.30000000000000005e-26Initial program 99.8%
Simplified95.9%
*-un-lft-identity95.9%
associate-/l*95.9%
+-commutative95.9%
associate-+r+95.9%
associate-*r*95.9%
pow295.9%
associate-+r+95.9%
Applied egg-rr95.9%
*-lft-identity95.9%
+-commutative95.9%
associate-/r*99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
associate-*r/99.5%
div-inv99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
pow-flip99.9%
metadata-eval99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
*-un-lft-identity99.9%
associate-/l*99.9%
+-commutative99.9%
*-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
*-lft-identity99.9%
associate-/l*99.9%
+-commutative99.9%
Simplified99.9%
if 1.30000000000000005e-26 < alpha Initial program 83.8%
Simplified69.7%
*-un-lft-identity69.7%
associate-/l*80.6%
+-commutative80.6%
associate-+r+80.6%
associate-*r*80.5%
pow280.5%
associate-+r+80.5%
Applied egg-rr80.5%
*-lft-identity80.5%
+-commutative80.5%
associate-/r*83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
Simplified83.2%
associate-*r/92.6%
div-inv92.6%
associate-+r+92.6%
+-commutative92.6%
+-commutative92.6%
pow-flip94.4%
metadata-eval94.4%
associate-+r+94.4%
+-commutative94.4%
+-commutative94.4%
Applied egg-rr94.4%
Taylor expanded in beta around inf 14.9%
associate-/l*17.5%
Simplified17.5%
Final simplification66.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.2e+56)
(/
(* (+ alpha 1.0) (+ 1.0 beta))
(*
(+ alpha (+ 2.0 beta))
(+
(* beta (+ 5.0 (+ beta (* alpha 2.0))))
(* (+ alpha 2.0) (+ alpha 3.0)))))
(/
(/
(+
1.0
(-
(* alpha (+ 1.0 (- (* -2.0 (/ alpha beta)) (/ 5.0 beta))))
(/ 3.0 beta)))
beta)
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+56) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0))));
} else {
tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / 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.2d+56) then
tmp = ((alpha + 1.0d0) * (1.0d0 + beta)) / ((alpha + (2.0d0 + beta)) * ((beta * (5.0d0 + (beta + (alpha * 2.0d0)))) + ((alpha + 2.0d0) * (alpha + 3.0d0))))
else
tmp = ((1.0d0 + ((alpha * (1.0d0 + (((-2.0d0) * (alpha / beta)) - (5.0d0 / beta)))) - (3.0d0 / beta))) / 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.2e+56) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0))));
} else {
tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2e+56: tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0)))) else: tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2e+56) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(1.0 + beta)) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(beta * Float64(5.0 + Float64(beta + Float64(alpha * 2.0)))) + Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(alpha * Float64(1.0 + Float64(Float64(-2.0 * Float64(alpha / beta)) - Float64(5.0 / beta)))) - Float64(3.0 / beta))) / 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.2e+56)
tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0))));
else
tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / 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.2e+56], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(beta * N[(5.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(N[(alpha * N[(1.0 + N[(N[(-2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(5.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $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.2 \cdot 10^{+56}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(1 + \beta\right)}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\beta \cdot \left(5 + \left(\beta + \alpha \cdot 2\right)\right) + \left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha \cdot \left(1 + \left(-2 \cdot \frac{\alpha}{\beta} - \frac{5}{\beta}\right)\right) - \frac{3}{\beta}\right)}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.20000000000000007e56Initial program 98.7%
Simplified92.7%
Taylor expanded in beta around 0 92.8%
if 1.20000000000000007e56 < beta Initial program 75.7%
Simplified60.8%
*-un-lft-identity60.8%
associate-/l*76.3%
+-commutative76.3%
associate-+r+76.3%
associate-*r*76.3%
pow276.3%
associate-+r+76.3%
Applied egg-rr76.3%
*-lft-identity76.3%
+-commutative76.3%
associate-/r*88.4%
associate-+r+88.4%
+-commutative88.4%
+-commutative88.4%
associate-+r+88.4%
+-commutative88.4%
+-commutative88.4%
Simplified88.4%
associate-*r/88.4%
div-inv88.3%
associate-+r+88.3%
+-commutative88.3%
+-commutative88.3%
pow-flip90.6%
metadata-eval90.6%
associate-+r+90.6%
+-commutative90.6%
+-commutative90.6%
Applied egg-rr90.6%
Taylor expanded in beta around inf 83.7%
associate-/l*88.2%
Simplified88.2%
Taylor expanded in alpha around 0 88.2%
associate--l+88.2%
associate--l+88.2%
associate-*r/88.2%
metadata-eval88.2%
associate-*r/88.2%
metadata-eval88.2%
Simplified88.2%
Final simplification91.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.25e+55)
(/
(* (+ alpha 1.0) (+ 1.0 beta))
(*
(+ alpha (+ 2.0 beta))
(+
(* beta (+ 5.0 (+ beta (* alpha 2.0))))
(* (+ alpha 2.0) (+ alpha 3.0)))))
(/
(/
(+
(+ 1.0 (+ alpha (+ (/ 1.0 beta) (/ alpha beta))))
(* (/ (+ 4.0 (* alpha 2.0)) beta) (- -1.0 alpha)))
beta)
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.25e+55) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0))));
} else {
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-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.25d+55) then
tmp = ((alpha + 1.0d0) * (1.0d0 + beta)) / ((alpha + (2.0d0 + beta)) * ((beta * (5.0d0 + (beta + (alpha * 2.0d0)))) + ((alpha + 2.0d0) * (alpha + 3.0d0))))
else
tmp = (((1.0d0 + (alpha + ((1.0d0 / beta) + (alpha / beta)))) + (((4.0d0 + (alpha * 2.0d0)) / beta) * ((-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.25e+55) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0))));
} else {
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.25e+55: tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0)))) else: tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-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.25e+55) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(1.0 + beta)) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(beta * Float64(5.0 + Float64(beta + Float64(alpha * 2.0)))) + Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(Float64(1.0 + Float64(alpha + Float64(Float64(1.0 / beta) + Float64(alpha / beta)))) + Float64(Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta) * 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.25e+55)
tmp = ((alpha + 1.0) * (1.0 + beta)) / ((alpha + (2.0 + beta)) * ((beta * (5.0 + (beta + (alpha * 2.0)))) + ((alpha + 2.0) * (alpha + 3.0))));
else
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-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.25e+55], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(beta * N[(5.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + N[(alpha + N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $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.25 \cdot 10^{+55}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(1 + \beta\right)}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\beta \cdot \left(5 + \left(\beta + \alpha \cdot 2\right)\right) + \left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \left(\alpha + \left(\frac{1}{\beta} + \frac{\alpha}{\beta}\right)\right)\right) + \frac{4 + \alpha \cdot 2}{\beta} \cdot \left(-1 - \alpha\right)}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.25000000000000011e55Initial program 98.7%
Simplified92.7%
Taylor expanded in beta around 0 92.8%
if 1.25000000000000011e55 < beta Initial program 75.7%
Simplified60.8%
*-un-lft-identity60.8%
associate-/l*76.3%
+-commutative76.3%
associate-+r+76.3%
associate-*r*76.3%
pow276.3%
associate-+r+76.3%
Applied egg-rr76.3%
*-lft-identity76.3%
+-commutative76.3%
associate-/r*88.4%
associate-+r+88.4%
+-commutative88.4%
+-commutative88.4%
associate-+r+88.4%
+-commutative88.4%
+-commutative88.4%
Simplified88.4%
associate-*r/88.4%
div-inv88.3%
associate-+r+88.3%
+-commutative88.3%
+-commutative88.3%
pow-flip90.6%
metadata-eval90.6%
associate-+r+90.6%
+-commutative90.6%
+-commutative90.6%
Applied egg-rr90.6%
Taylor expanded in beta around inf 83.7%
associate-/l*88.2%
Simplified88.2%
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 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 5e+55)
(/ (* (+ alpha 1.0) (+ 1.0 beta)) (* t_1 (* t_0 t_1)))
(/
(/
(+
1.0
(-
(* alpha (+ 1.0 (- (* -2.0 (/ alpha beta)) (/ 5.0 beta))))
(/ 3.0 beta)))
beta)
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 5e+55) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1));
} else {
tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / beta) / 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 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 5d+55) then
tmp = ((alpha + 1.0d0) * (1.0d0 + beta)) / (t_1 * (t_0 * t_1))
else
tmp = ((1.0d0 + ((alpha * (1.0d0 + (((-2.0d0) * (alpha / beta)) - (5.0d0 / beta)))) - (3.0d0 / beta))) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 5e+55) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1));
} else {
tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 5e+55: tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1)) else: tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 5e+55) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(1.0 + beta)) / Float64(t_1 * Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(alpha * Float64(1.0 + Float64(Float64(-2.0 * Float64(alpha / beta)) - Float64(5.0 / beta)))) - Float64(3.0 / beta))) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 5e+55)
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1));
else
tmp = ((1.0 + ((alpha * (1.0 + ((-2.0 * (alpha / beta)) - (5.0 / beta)))) - (3.0 / beta))) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+55], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(N[(alpha * N[(1.0 + N[(N[(-2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision] - N[(5.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+55}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(1 + \beta\right)}{t\_1 \cdot \left(t\_0 \cdot t\_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha \cdot \left(1 + \left(-2 \cdot \frac{\alpha}{\beta} - \frac{5}{\beta}\right)\right) - \frac{3}{\beta}\right)}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 5.00000000000000046e55Initial program 98.7%
Simplified92.7%
if 5.00000000000000046e55 < beta Initial program 75.7%
Simplified60.8%
*-un-lft-identity60.8%
associate-/l*76.3%
+-commutative76.3%
associate-+r+76.3%
associate-*r*76.3%
pow276.3%
associate-+r+76.3%
Applied egg-rr76.3%
*-lft-identity76.3%
+-commutative76.3%
associate-/r*88.4%
associate-+r+88.4%
+-commutative88.4%
+-commutative88.4%
associate-+r+88.4%
+-commutative88.4%
+-commutative88.4%
Simplified88.4%
associate-*r/88.4%
div-inv88.3%
associate-+r+88.3%
+-commutative88.3%
+-commutative88.3%
pow-flip90.6%
metadata-eval90.6%
associate-+r+90.6%
+-commutative90.6%
+-commutative90.6%
Applied egg-rr90.6%
Taylor expanded in beta around inf 83.7%
associate-/l*88.2%
Simplified88.2%
Taylor expanded in alpha around 0 88.2%
associate--l+88.2%
associate--l+88.2%
associate-*r/88.2%
metadata-eval88.2%
associate-*r/88.2%
metadata-eval88.2%
Simplified88.2%
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 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 255000000.0)
(* (/ (+ alpha 1.0) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(/
(* (+ alpha 1.0) (/ (- 1.0 (/ (+ 3.0 (* alpha 2.0)) beta)) beta))
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 255000000.0) {
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / 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 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 255000000.0d0) then
tmp = ((alpha + 1.0d0) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = ((alpha + 1.0d0) * ((1.0d0 - ((3.0d0 + (alpha * 2.0d0)) / beta)) / beta)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 255000000.0) {
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 255000000.0: tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 255000000.0) tmp = Float64(Float64(Float64(alpha + 1.0) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(1.0 - Float64(Float64(3.0 + Float64(alpha * 2.0)) / beta)) / beta)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 255000000.0)
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 255000000.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(1.0 - N[(N[(3.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 255000000:\\
\;\;\;\;\frac{\alpha + 1}{t\_1} \cdot \frac{1 + \beta}{t\_0 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \frac{1 - \frac{3 + \alpha \cdot 2}{\beta}}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 2.55e8Initial program 99.8%
Simplified93.2%
times-frac99.3%
+-commutative99.3%
Applied egg-rr99.3%
if 2.55e8 < beta Initial program 78.6%
Simplified67.1%
*-un-lft-identity67.1%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.9%
associate-+r+90.9%
+-commutative90.9%
+-commutative90.9%
associate-+r+90.9%
+-commutative90.9%
+-commutative90.9%
Simplified90.9%
associate-*r/90.9%
div-inv90.8%
associate-+r+90.8%
+-commutative90.8%
+-commutative90.8%
pow-flip92.7%
metadata-eval92.7%
associate-+r+92.7%
+-commutative92.7%
+-commutative92.7%
Applied egg-rr92.7%
Taylor expanded in beta around inf 84.5%
mul-1-neg84.5%
+-commutative84.5%
Simplified84.5%
Final simplification94.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 1.65e+91)
(/ (* (+ alpha 1.0) (+ 1.0 beta)) (* t_1 (* t_0 t_1)))
(/
(* (+ alpha 1.0) (/ (- 1.0 (/ (+ 3.0 (* alpha 2.0)) beta)) beta))
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1.65e+91) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / 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 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 1.65d+91) then
tmp = ((alpha + 1.0d0) * (1.0d0 + beta)) / (t_1 * (t_0 * t_1))
else
tmp = ((alpha + 1.0d0) * ((1.0d0 - ((3.0d0 + (alpha * 2.0d0)) / beta)) / beta)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1.65e+91) {
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 1.65e+91: tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1)) else: tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 1.65e+91) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(1.0 + beta)) / Float64(t_1 * Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(1.0 - Float64(Float64(3.0 + Float64(alpha * 2.0)) / beta)) / beta)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 1.65e+91)
tmp = ((alpha + 1.0) * (1.0 + beta)) / (t_1 * (t_0 * t_1));
else
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.65e+91], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(1.0 - N[(N[(3.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 1.65 \cdot 10^{+91}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(1 + \beta\right)}{t\_1 \cdot \left(t\_0 \cdot t\_1\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \frac{1 - \frac{3 + \alpha \cdot 2}{\beta}}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.65000000000000009e91Initial program 97.8%
Simplified92.0%
if 1.65000000000000009e91 < beta Initial program 75.8%
Simplified58.7%
*-un-lft-identity58.7%
associate-/l*72.8%
+-commutative72.8%
associate-+r+72.8%
associate-*r*72.8%
pow272.8%
associate-+r+72.8%
Applied egg-rr72.8%
*-lft-identity72.8%
+-commutative72.8%
associate-/r*86.8%
associate-+r+86.8%
+-commutative86.8%
+-commutative86.8%
associate-+r+86.8%
+-commutative86.8%
+-commutative86.8%
Simplified86.8%
associate-*r/86.7%
div-inv86.7%
associate-+r+86.7%
+-commutative86.7%
+-commutative86.7%
pow-flip89.3%
metadata-eval89.3%
associate-+r+89.3%
+-commutative89.3%
+-commutative89.3%
Applied egg-rr89.3%
Taylor expanded in beta around inf 90.2%
mul-1-neg90.2%
+-commutative90.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
(if (<= beta 3e+16)
(/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 6.0 (* beta (+ beta 5.0)))))
(/
(* (+ alpha 1.0) (/ (- 1.0 (/ (+ 3.0 (* alpha 2.0)) beta)) beta))
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+16) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / 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 <= 3d+16) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((alpha + 1.0d0) * ((1.0d0 - ((3.0d0 + (alpha * 2.0d0)) / beta)) / 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 <= 3e+16) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3e+16: tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / beta)) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(1.0 - Float64(Float64(3.0 + Float64(alpha * 2.0)) / beta)) / 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 <= 3e+16)
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((alpha + 1.0) * ((1.0 - ((3.0 + (alpha * 2.0)) / beta)) / 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, 3e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(1.0 - N[(N[(3.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $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 3 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \frac{1 - \frac{3 + \alpha \cdot 2}{\beta}}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3e16Initial program 99.8%
Simplified93.3%
Taylor expanded in beta around 0 93.3%
Taylor expanded in alpha around 0 61.9%
+-commutative61.9%
Simplified61.9%
if 3e16 < beta Initial program 78.0%
Simplified66.2%
*-un-lft-identity66.2%
associate-/l*81.1%
+-commutative81.1%
associate-+r+81.1%
associate-*r*81.1%
pow281.1%
associate-+r+81.1%
Applied egg-rr81.1%
*-lft-identity81.1%
+-commutative81.1%
associate-/r*90.7%
associate-+r+90.7%
+-commutative90.7%
+-commutative90.7%
associate-+r+90.7%
+-commutative90.7%
+-commutative90.7%
Simplified90.7%
associate-*r/90.6%
div-inv90.6%
associate-+r+90.6%
+-commutative90.6%
+-commutative90.6%
pow-flip92.5%
metadata-eval92.5%
associate-+r+92.5%
+-commutative92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around inf 84.1%
mul-1-neg84.1%
+-commutative84.1%
Simplified84.1%
Final simplification68.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.4e+16) (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 6.0 (* beta (+ beta 5.0))))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.4e+16) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((alpha + 1.0) / 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.4d+16) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * (6.0d0 + (beta * (beta + 5.0d0))))
else
tmp = ((alpha + 1.0d0) / 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.4e+16) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.4e+16: tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0)))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.4e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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.4e+16)
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * (beta + 5.0))));
else
tmp = ((alpha + 1.0) / 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.4e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $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.4 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.4e16Initial program 99.8%
Simplified93.3%
Taylor expanded in beta around 0 93.3%
Taylor expanded in alpha around 0 61.9%
+-commutative61.9%
Simplified61.9%
if 1.4e16 < beta Initial program 78.0%
Simplified66.2%
*-un-lft-identity66.2%
associate-/l*81.1%
+-commutative81.1%
associate-+r+81.1%
associate-*r*81.1%
pow281.1%
associate-+r+81.1%
Applied egg-rr81.1%
*-lft-identity81.1%
+-commutative81.1%
associate-/r*90.7%
associate-+r+90.7%
+-commutative90.7%
+-commutative90.7%
associate-+r+90.7%
+-commutative90.7%
+-commutative90.7%
Simplified90.7%
associate-*r/90.6%
div-inv90.6%
associate-+r+90.6%
+-commutative90.6%
+-commutative90.6%
pow-flip92.5%
metadata-eval92.5%
associate-+r+92.5%
+-commutative92.5%
+-commutative92.5%
Applied egg-rr92.5%
Taylor expanded in beta around inf 83.7%
Final simplification68.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) 0.08333333333333333 (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.08333333333333333;
} else {
tmp = ((alpha + 1.0) / 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.3d0) then
tmp = 0.08333333333333333d0
else
tmp = ((alpha + 1.0d0) / 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.3) {
tmp = 0.08333333333333333;
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.08333333333333333 else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = 0.08333333333333333; else tmp = Float64(Float64(Float64(alpha + 1.0) / 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.3)
tmp = 0.08333333333333333;
else
tmp = ((alpha + 1.0) / 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.3], 0.08333333333333333, N[(N[(N[(alpha + 1.0), $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.3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
Simplified93.5%
Taylor expanded in beta around 0 92.4%
Taylor expanded in alpha around 0 60.8%
associate-*r/60.8%
Simplified60.8%
Taylor expanded in beta around 0 60.9%
if 2.2999999999999998 < beta Initial program 79.8%
Simplified67.9%
*-un-lft-identity67.9%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
Simplified90.3%
associate-*r/91.4%
div-inv91.3%
associate-+r+91.3%
+-commutative91.3%
+-commutative91.3%
pow-flip93.0%
metadata-eval93.0%
associate-+r+93.0%
+-commutative93.0%
+-commutative93.0%
Applied egg-rr93.0%
Taylor expanded in beta around inf 79.9%
Final simplification67.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.9) 0.08333333333333333 (* (+ alpha 1.0) (/ (/ 1.0 beta) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9) {
tmp = 0.08333333333333333;
} else {
tmp = (alpha + 1.0) * ((1.0 / beta) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.9d0) then
tmp = 0.08333333333333333d0
else
tmp = (alpha + 1.0d0) * ((1.0d0 / beta) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9) {
tmp = 0.08333333333333333;
} else {
tmp = (alpha + 1.0) * ((1.0 / beta) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.9: tmp = 0.08333333333333333 else: tmp = (alpha + 1.0) * ((1.0 / beta) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.9) tmp = 0.08333333333333333; else tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(1.0 / beta) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.9)
tmp = 0.08333333333333333;
else
tmp = (alpha + 1.0) * ((1.0 / beta) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.9], 0.08333333333333333, N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.9:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\frac{1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.89999999999999991Initial program 99.8%
Simplified93.5%
Taylor expanded in beta around 0 92.4%
Taylor expanded in alpha around 0 60.8%
associate-*r/60.8%
Simplified60.8%
Taylor expanded in beta around 0 60.9%
if 3.89999999999999991 < beta Initial program 79.8%
Simplified67.9%
*-un-lft-identity67.9%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in beta around inf 84.4%
Taylor expanded in beta around inf 79.6%
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.3) 0.08333333333333333 (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.08333333333333333;
} 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.3d0) then
tmp = 0.08333333333333333d0
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.3) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.08333333333333333 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.3) tmp = 0.08333333333333333; 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.3)
tmp = 0.08333333333333333;
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.3], 0.08333333333333333, 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.3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
Simplified93.5%
Taylor expanded in beta around 0 92.4%
Taylor expanded in alpha around 0 60.8%
associate-*r/60.8%
Simplified60.8%
Taylor expanded in beta around 0 60.9%
if 2.2999999999999998 < beta Initial program 79.8%
Simplified67.9%
*-un-lft-identity67.9%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in beta around inf 84.4%
Taylor expanded in alpha around 0 72.4%
Final simplification64.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) 0.08333333333333333 (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.08333333333333333;
} 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.3d0) then
tmp = 0.08333333333333333d0
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.3) {
tmp = 0.08333333333333333;
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.08333333333333333 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.3) tmp = 0.08333333333333333; else tmp = Float64(Float64(1.0 / 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.3)
tmp = 0.08333333333333333;
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.3], 0.08333333333333333, N[(N[(1.0 / 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.3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
Simplified93.5%
Taylor expanded in beta around 0 92.4%
Taylor expanded in alpha around 0 60.8%
associate-*r/60.8%
Simplified60.8%
Taylor expanded in beta around 0 60.9%
if 2.2999999999999998 < beta Initial program 79.8%
Simplified67.9%
*-un-lft-identity67.9%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in beta around inf 84.4%
Taylor expanded in alpha around 0 72.4%
associate-/r*73.0%
+-commutative73.0%
Simplified73.0%
Final simplification64.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 1.0 (* beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (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 <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / (beta * 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (beta * 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 1.0 / (beta * 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / 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 <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / (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, 4.0], 0.08333333333333333, N[(1.0 / N[(beta * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot 3}\\
\end{array}
\end{array}
if beta < 4Initial program 99.8%
Simplified93.5%
Taylor expanded in beta around 0 92.4%
Taylor expanded in alpha around 0 60.8%
associate-*r/60.8%
Simplified60.8%
Taylor expanded in beta around 0 60.9%
if 4 < beta Initial program 79.8%
Simplified67.9%
*-un-lft-identity67.9%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in beta around inf 84.4%
Taylor expanded in alpha around 0 72.4%
Taylor expanded in beta around 0 7.0%
*-commutative7.0%
Simplified7.0%
Final simplification43.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.8%
Simplified93.5%
Taylor expanded in beta around 0 92.4%
Taylor expanded in alpha around 0 60.8%
associate-*r/60.8%
Simplified60.8%
Taylor expanded in beta around 0 60.9%
if 4 < beta Initial program 79.8%
Simplified67.9%
*-un-lft-identity67.9%
associate-/l*81.6%
+-commutative81.6%
associate-+r+81.6%
associate-*r*81.5%
pow281.5%
associate-+r+81.5%
Applied egg-rr81.5%
*-lft-identity81.5%
+-commutative81.5%
associate-/r*90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
associate-+r+90.3%
+-commutative90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in beta around inf 84.4%
Taylor expanded in alpha around 0 72.4%
Taylor expanded in beta around 0 7.0%
Final simplification43.2%
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%
Simplified85.1%
Taylor expanded in beta around 0 65.1%
Taylor expanded in alpha around 0 42.3%
associate-*r/42.3%
Simplified42.3%
Taylor expanded in beta around 0 42.3%
Final simplification42.3%
herbie shell --seed 2024110
(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)))