
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) 2.0)))
(if (<= alpha 8.2e+71)
(/ (/ (/ (+ (+ (+ alpha beta) (* alpha beta)) 1.0) t_0) t_0) (+ 1.0 t_0))
(* (/ (+ alpha 1.0) beta) (/ 1.0 beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
double tmp;
if (alpha <= 8.2e+71) {
tmp = (((((alpha + beta) + (alpha * beta)) + 1.0) / t_0) / t_0) / (1.0 + t_0);
} else {
tmp = ((alpha + 1.0) / beta) * (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 + beta) + 2.0d0
if (alpha <= 8.2d+71) then
tmp = (((((alpha + beta) + (alpha * beta)) + 1.0d0) / t_0) / t_0) / (1.0d0 + t_0)
else
tmp = ((alpha + 1.0d0) / beta) * (1.0d0 / beta)
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 (alpha <= 8.2e+71) {
tmp = (((((alpha + beta) + (alpha * beta)) + 1.0) / t_0) / t_0) / (1.0 + t_0);
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 tmp = 0 if alpha <= 8.2e+71: tmp = (((((alpha + beta) + (alpha * beta)) + 1.0) / t_0) / t_0) / (1.0 + t_0) else: tmp = ((alpha + 1.0) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) tmp = 0.0 if (alpha <= 8.2e+71) tmp = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(alpha * beta)) + 1.0) / t_0) / t_0) / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) * Float64(1.0 / beta)); 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 (alpha <= 8.2e+71)
tmp = (((((alpha + beta) + (alpha * beta)) + 1.0) / t_0) / t_0) / (1.0 + t_0);
else
tmp = ((alpha + 1.0) / beta) * (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 + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[alpha, 8.2e+71], N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(alpha * beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
\mathbf{if}\;\alpha \leq 8.2 \cdot 10^{+71}:\\
\;\;\;\;\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \alpha \cdot \beta\right) + 1}{t\_0}}{t\_0}}{1 + t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if alpha < 8.2000000000000004e71Initial program 99.9%
if 8.2000000000000004e71 < alpha Initial program 78.5%
Taylor expanded in beta around inf 20.2%
div-inv20.3%
metadata-eval20.3%
associate-+l+20.3%
metadata-eval20.3%
associate-+r+20.3%
Applied egg-rr20.3%
Taylor expanded in beta around inf 19.7%
mul-1-neg19.7%
unsub-neg19.7%
Simplified19.7%
Taylor expanded in beta around inf 20.0%
Final simplification81.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) 2.0)))
(if (<= beta 4.5e+77)
(/
1.0
(*
t_0
(/ (+ (+ alpha beta) 3.0) (/ (* (+ alpha 1.0) (+ beta 1.0)) t_0))))
(/ (/ (+ alpha 1.0) beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
double tmp;
if (beta <= 4.5e+77) {
tmp = 1.0 / (t_0 * (((alpha + beta) + 3.0) / (((alpha + 1.0) * (beta + 1.0)) / t_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) :: t_0
real(8) :: tmp
t_0 = (alpha + beta) + 2.0d0
if (beta <= 4.5d+77) then
tmp = 1.0d0 / (t_0 * (((alpha + beta) + 3.0d0) / (((alpha + 1.0d0) * (beta + 1.0d0)) / t_0)))
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 t_0 = (alpha + beta) + 2.0;
double tmp;
if (beta <= 4.5e+77) {
tmp = 1.0 / (t_0 * (((alpha + beta) + 3.0) / (((alpha + 1.0) * (beta + 1.0)) / t_0)));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 tmp = 0 if beta <= 4.5e+77: tmp = 1.0 / (t_0 * (((alpha + beta) + 3.0) / (((alpha + 1.0) * (beta + 1.0)) / t_0))) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) tmp = 0.0 if (beta <= 4.5e+77) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(Float64(alpha + beta) + 3.0) / Float64(Float64(Float64(alpha + 1.0) * Float64(beta + 1.0)) / t_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)
t_0 = (alpha + beta) + 2.0;
tmp = 0.0;
if (beta <= 4.5e+77)
tmp = 1.0 / (t_0 * (((alpha + beta) + 3.0) / (((alpha + 1.0) * (beta + 1.0)) / t_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_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 4.5e+77], N[(1.0 / N[(t$95$0 * N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] / N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+77}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\left(\alpha + \beta\right) + 3}{\frac{\left(\alpha + 1\right) \cdot \left(\beta + 1\right)}{t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.50000000000000024e77Initial program 99.9%
associate-/l/99.0%
+-commutative99.0%
associate-+l+99.0%
*-commutative99.0%
metadata-eval99.0%
associate-+l+99.0%
metadata-eval99.0%
+-commutative99.0%
+-commutative99.0%
+-commutative99.0%
metadata-eval99.0%
metadata-eval99.0%
associate-+l+99.0%
Simplified99.0%
clear-num99.1%
inv-pow99.1%
*-commutative99.1%
associate-+r+99.1%
+-commutative99.1%
distribute-rgt1-in99.1%
fma-define99.1%
Applied egg-rr99.1%
unpow-199.1%
associate-/l*99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
fma-undefine99.5%
+-commutative99.5%
*-commutative99.5%
+-commutative99.5%
associate-+r+99.5%
distribute-lft1-in99.5%
+-commutative99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
if 4.50000000000000024e77 < beta Initial program 80.6%
Taylor expanded in beta around inf 91.2%
Taylor expanded in alpha around 0 91.1%
+-commutative91.1%
Simplified91.1%
Taylor expanded in beta around inf 91.1%
Final simplification97.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2e+72)
(* (+ alpha 1.0) (/ (+ beta 1.0) (* (* t_0 t_0) (+ alpha (+ beta 3.0)))))
(/ (/ (+ alpha 1.0) beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+72) {
tmp = (alpha + 1.0) * ((beta + 1.0) / ((t_0 * t_0) * (alpha + (beta + 3.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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2d+72) then
tmp = (alpha + 1.0d0) * ((beta + 1.0d0) / ((t_0 * t_0) * (alpha + (beta + 3.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 t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+72) {
tmp = (alpha + 1.0) * ((beta + 1.0) / ((t_0 * t_0) * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2e+72: tmp = (alpha + 1.0) * ((beta + 1.0) / ((t_0 * t_0) * (alpha + (beta + 3.0)))) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2e+72) tmp = Float64(Float64(alpha + 1.0) * Float64(Float64(beta + 1.0) / Float64(Float64(t_0 * t_0) * Float64(alpha + Float64(beta + 3.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)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2e+72)
tmp = (alpha + 1.0) * ((beta + 1.0) / ((t_0 * t_0) * (alpha + (beta + 3.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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+72], N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(t$95$0 * t$95$0), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+72}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{\beta + 1}{\left(t\_0 \cdot t\_0\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.99999999999999989e72Initial program 99.9%
Simplified96.0%
associate-/l*96.0%
+-commutative96.0%
associate-+r+96.0%
associate-*r*96.0%
pow296.0%
associate-+r+96.0%
Applied egg-rr96.0%
unpow296.0%
Applied egg-rr96.0%
if 1.99999999999999989e72 < beta Initial program 81.4%
Taylor expanded in beta around inf 90.2%
Taylor expanded in alpha around 0 90.1%
+-commutative90.1%
Simplified90.1%
Taylor expanded in beta around inf 90.1%
Final simplification94.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.2e+15)
(/
(/ (+ beta 1.0) (+ beta 2.0))
(+ (* 2.0 (+ alpha 3.0)) (* beta (+ (+ alpha beta) 5.0))))
(/ (/ (+ alpha 1.0) beta) (+ (+ alpha beta) 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((2.0 * (alpha + 3.0)) + (beta * ((alpha + 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 <= 4.2d+15) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((2.0d0 * (alpha + 3.0d0)) + (beta * ((alpha + 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 <= 4.2e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((2.0 * (alpha + 3.0)) + (beta * ((alpha + 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 <= 4.2e+15: tmp = ((beta + 1.0) / (beta + 2.0)) / ((2.0 * (alpha + 3.0)) + (beta * ((alpha + 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 <= 4.2e+15) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(2.0 * Float64(alpha + 3.0)) + Float64(beta * Float64(Float64(alpha + beta) + 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha + 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.2e+15)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((2.0 * (alpha + 3.0)) + (beta * ((alpha + 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, 4.2e+15], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision] + N[(beta * N[(N[(alpha + beta), $MachinePrecision] + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{2 \cdot \left(\alpha + 3\right) + \beta \cdot \left(\left(\alpha + \beta\right) + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 4.2e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
metadata-eval99.5%
metadata-eval99.5%
associate-+l+99.5%
Simplified99.5%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
Simplified69.2%
Taylor expanded in beta around 0 69.3%
if 4.2e15 < beta Initial program 84.3%
Taylor expanded in beta around inf 88.3%
Taylor expanded in alpha around 0 88.3%
+-commutative88.3%
Simplified88.3%
Final simplification75.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.6e+15)
(/
1.0
(/ (* (+ beta 2.0) (+ beta (+ alpha 3.0))) (/ (+ beta 1.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) beta) (+ (+ alpha beta) 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6e+15) {
tmp = 1.0 / (((beta + 2.0) * (beta + (alpha + 3.0))) / ((beta + 1.0) / (beta + 2.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 <= 2.6d+15) then
tmp = 1.0d0 / (((beta + 2.0d0) * (beta + (alpha + 3.0d0))) / ((beta + 1.0d0) / (beta + 2.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 <= 2.6e+15) {
tmp = 1.0 / (((beta + 2.0) * (beta + (alpha + 3.0))) / ((beta + 1.0) / (beta + 2.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 <= 2.6e+15: tmp = 1.0 / (((beta + 2.0) * (beta + (alpha + 3.0))) / ((beta + 1.0) / (beta + 2.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 <= 2.6e+15) tmp = Float64(1.0 / Float64(Float64(Float64(beta + 2.0) * Float64(beta + Float64(alpha + 3.0))) / Float64(Float64(beta + 1.0) / Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha + 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.6e+15)
tmp = 1.0 / (((beta + 2.0) * (beta + (alpha + 3.0))) / ((beta + 1.0) / (beta + 2.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, 2.6e+15], N[(1.0 / N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+15}:\\
\;\;\;\;\frac{1}{\frac{\left(\beta + 2\right) \cdot \left(\beta + \left(\alpha + 3\right)\right)}{\frac{\beta + 1}{\beta + 2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 2.6e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
metadata-eval99.5%
metadata-eval99.5%
associate-+l+99.5%
Simplified99.5%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
Simplified69.2%
clear-num69.2%
inv-pow69.2%
associate-+r+69.2%
*-commutative69.2%
Applied egg-rr69.2%
unpow-169.2%
associate-+r+69.2%
+-commutative69.2%
+-commutative69.2%
+-commutative69.2%
associate-+r+69.2%
+-commutative69.2%
Simplified69.2%
if 2.6e15 < beta Initial program 84.3%
Taylor expanded in beta around inf 88.3%
Taylor expanded in alpha around 0 88.3%
+-commutative88.3%
Simplified88.3%
Final simplification75.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9e+14) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta (+ alpha 3.0)))) (/ (/ (+ alpha 1.0) beta) (+ (+ alpha beta) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9e+14) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.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 <= 9d+14) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + (alpha + 3.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 <= 9e+14) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.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 <= 9e+14: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.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 <= 9e+14) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9e+14)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + (alpha + 3.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, 9e+14], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 9e14Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
metadata-eval99.5%
metadata-eval99.5%
associate-+l+99.5%
Simplified99.5%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
Simplified69.2%
*-un-lft-identity69.2%
associate-/l/69.2%
associate-+r+69.2%
*-commutative69.2%
Applied egg-rr69.2%
associate-*r/69.2%
times-frac69.2%
*-commutative69.2%
associate-*r/69.2%
*-rgt-identity69.2%
+-commutative69.2%
associate-+r+69.2%
+-commutative69.2%
+-commutative69.2%
+-commutative69.2%
associate-+r+69.2%
Simplified69.2%
if 9e14 < beta Initial program 84.3%
Taylor expanded in beta around inf 88.3%
Taylor expanded in alpha around 0 88.3%
+-commutative88.3%
Simplified88.3%
Final simplification75.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ alpha beta) 3.0)))
(if (<= beta 5.6e+15)
(/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) t_0))
(/ (/ (+ alpha 1.0) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 3.0;
double tmp;
if (beta <= 5.6e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * t_0);
} else {
tmp = ((alpha + 1.0) / 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 (beta <= 5.6d+15) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * t_0)
else
tmp = ((alpha + 1.0d0) / 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 (beta <= 5.6e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * t_0);
} else {
tmp = ((alpha + 1.0) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 3.0 tmp = 0 if beta <= 5.6e+15: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * t_0) else: tmp = ((alpha + 1.0) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 3.0) tmp = 0.0 if (beta <= 5.6e+15) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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 (beta <= 5.6e+15)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * t_0);
else
tmp = ((alpha + 1.0) / 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[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]}, If[LessEqual[beta, 5.6e+15], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 3\\
\mathbf{if}\;\beta \leq 5.6 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 5.6e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
metadata-eval99.5%
metadata-eval99.5%
associate-+l+99.5%
Simplified99.5%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
Simplified69.2%
if 5.6e15 < beta Initial program 84.3%
Taylor expanded in beta around inf 88.3%
Taylor expanded in alpha around 0 88.3%
+-commutative88.3%
Simplified88.3%
Final simplification75.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.5e+15) (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ 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 <= 9.5e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / (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 <= 9.5d+15) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / (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 <= 9.5e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / (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 <= 9.5e+15: tmp = ((beta + 1.0) / (beta + 2.0)) / (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 <= 9.5e+15) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(6.0 + Float64(beta * Float64(beta + 5.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.5e+15)
tmp = ((beta + 1.0) / (beta + 2.0)) / (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, 9.5e+15], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{6 + \beta \cdot \left(\beta + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 9.5e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
metadata-eval99.5%
metadata-eval99.5%
associate-+l+99.5%
Simplified99.5%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
Simplified69.2%
Taylor expanded in beta around 0 69.3%
Taylor expanded in alpha around 0 67.8%
associate-/r*67.8%
+-commutative67.8%
+-commutative67.8%
+-commutative67.8%
Simplified67.8%
if 9.5e15 < beta Initial program 84.3%
Taylor expanded in beta around inf 88.3%
Taylor expanded in alpha around 0 88.3%
+-commutative88.3%
Simplified88.3%
Final simplification74.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.5e+15) (/ (+ beta 1.0) (* (+ beta 2.0) (+ 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 <= 5.5e+15) {
tmp = (beta + 1.0) / ((beta + 2.0) * (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 <= 5.5d+15) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * (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 <= 5.5e+15) {
tmp = (beta + 1.0) / ((beta + 2.0) * (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 <= 5.5e+15: tmp = (beta + 1.0) / ((beta + 2.0) * (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 <= 5.5e+15) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * Float64(beta + 5.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.5e+15)
tmp = (beta + 1.0) / ((beta + 2.0) * (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, 5.5e+15], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 5.5e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
metadata-eval99.5%
metadata-eval99.5%
associate-+l+99.5%
Simplified99.5%
Taylor expanded in alpha around 0 84.2%
+-commutative84.2%
Simplified84.2%
Taylor expanded in alpha around 0 69.2%
+-commutative69.2%
Simplified69.2%
Taylor expanded in beta around 0 69.3%
Taylor expanded in alpha around 0 67.8%
if 5.5e15 < beta Initial program 84.3%
Taylor expanded in beta around inf 88.3%
Taylor expanded in alpha around 0 88.3%
+-commutative88.3%
Simplified88.3%
Final simplification74.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (/ 1.0 (* (+ (+ alpha beta) 2.0) (- 6.0 beta))) (/ (/ (+ alpha 1.0) beta) (+ (+ alpha beta) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta));
} 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.8d0) then
tmp = 1.0d0 / (((alpha + beta) + 2.0d0) * (6.0d0 - beta))
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.8) {
tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta));
} 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.8: tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta)) 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.8) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + beta) + 2.0) * Float64(6.0 - beta))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta));
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.8], N[(1.0 / N[(N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision] * N[(6.0 - beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;\frac{1}{\left(\left(\alpha + \beta\right) + 2\right) \cdot \left(6 - \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/l*99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
fma-undefine99.9%
+-commutative99.9%
*-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
distribute-lft1-in99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.9%
Taylor expanded in beta around 0 68.3%
mul-1-neg68.3%
unsub-neg68.3%
Simplified68.3%
if 2.7999999999999998 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 87.1%
+-commutative87.1%
Simplified87.1%
Final simplification74.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (/ 1.0 (* (+ (+ alpha beta) 2.0) (- 6.0 beta))) (/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta));
} else {
tmp = ((alpha + 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.8d0) then
tmp = 1.0d0 / (((alpha + beta) + 2.0d0) * (6.0d0 - beta))
else
tmp = ((alpha + 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.8) {
tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta)) else: tmp = ((alpha + 1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + beta) + 2.0) * Float64(6.0 - beta))); else tmp = Float64(Float64(Float64(alpha + 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.8)
tmp = 1.0 / (((alpha + beta) + 2.0) * (6.0 - beta));
else
tmp = ((alpha + 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.8], N[(1.0 / N[(N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision] * N[(6.0 - beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;\frac{1}{\left(\left(\alpha + \beta\right) + 2\right) \cdot \left(6 - \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/l*99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
fma-undefine99.9%
+-commutative99.9%
*-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
distribute-lft1-in99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.9%
Taylor expanded in beta around 0 68.3%
mul-1-neg68.3%
unsub-neg68.3%
Simplified68.3%
if 2.7999999999999998 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 86.9%
+-commutative86.9%
Simplified86.9%
Final simplification74.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (/ 0.25 (+ alpha 3.0)) (/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((alpha + 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.9d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = ((alpha + 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.9) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.25 / (alpha + 3.0) else: tmp = ((alpha + 1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(alpha + 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.9)
tmp = 0.25 / (alpha + 3.0);
else
tmp = ((alpha + 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.9], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
Simplified84.3%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
if 2.89999999999999991 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 86.9%
+-commutative86.9%
Simplified86.9%
Final simplification74.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.8) (/ 0.25 (+ alpha 3.0)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8) {
tmp = 0.25 / (alpha + 3.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 <= 3.8d0) then
tmp = 0.25d0 / (alpha + 3.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 <= 3.8) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.8: tmp = 0.25 / (alpha + 3.0) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.8) tmp = Float64(0.25 / Float64(alpha + 3.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 <= 3.8)
tmp = 0.25 / (alpha + 3.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, 3.8], N[(0.25 / N[(alpha + 3.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 3.8:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.7999999999999998Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
Simplified84.3%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
if 3.7999999999999998 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 86.9%
+-commutative86.9%
Simplified86.9%
Taylor expanded in beta around inf 86.9%
Final simplification74.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.25 (+ alpha 3.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.25 / (alpha + 3.0);
} 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.25d0 / (alpha + 3.0d0)
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.25 / (alpha + 3.0);
} 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.25 / (alpha + 3.0) 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 = Float64(0.25 / Float64(alpha + 3.0)); 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.25 / (alpha + 3.0);
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], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], 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:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
Simplified84.3%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
if 2.2999999999999998 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 77.7%
associate-/r*78.4%
Simplified78.4%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
Simplified84.3%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
if 2.5 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 77.7%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.5d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.5)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
Simplified84.3%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
if 3.5 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 77.7%
Taylor expanded in beta around inf 77.7%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.0) (/ 0.25 (+ alpha 3.0)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = 0.25 / (alpha + 3.0);
} 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 <= 5.0d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
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 <= 5.0) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.0: tmp = 0.25 / (alpha + 3.0) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.0) tmp = Float64(0.25 / Float64(alpha + 3.0)); 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 <= 5.0)
tmp = 0.25 / (alpha + 3.0);
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, 5.0], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 5Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 84.3%
+-commutative84.3%
Simplified84.3%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
if 5 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 77.7%
Taylor expanded in beta around 0 7.0%
Final simplification48.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} 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.4d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
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.4) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); 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.4)
tmp = 0.16666666666666666 / (alpha + 2.0);
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.4], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
clear-num99.9%
inv-pow99.9%
*-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
distribute-rgt1-in99.9%
fma-define99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/l*99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
fma-undefine99.9%
+-commutative99.9%
*-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
distribute-lft1-in99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.9%
Taylor expanded in beta around 0 67.9%
+-commutative67.9%
Simplified67.9%
if 4.4000000000000004 < beta Initial program 84.6%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around 0 77.7%
Taylor expanded in beta around 0 7.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 94.9%
Taylor expanded in beta around inf 30.4%
Taylor expanded in alpha around 0 27.4%
Taylor expanded in beta around 0 4.1%
herbie shell --seed 2024117
(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)))