
(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 17 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 5.2e-22)
(/
(/ (+ (+ beta (+ alpha (* alpha beta))) 1.0) t_0)
(* t_0 (+ (+ alpha beta) 3.0)))
(*
(/ (+ alpha 1.0) t_0)
(- (/ 1.0 beta) (* (/ (+ alpha 2.0) beta) (/ 2.0 beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 5.2e-22) {
tmp = (((beta + (alpha + (alpha * beta))) + 1.0) / t_0) / (t_0 * ((alpha + beta) + 3.0));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.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 <= 5.2d-22) then
tmp = (((beta + (alpha + (alpha * beta))) + 1.0d0) / t_0) / (t_0 * ((alpha + beta) + 3.0d0))
else
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 / beta) - (((alpha + 2.0d0) / beta) * (2.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 <= 5.2e-22) {
tmp = (((beta + (alpha + (alpha * beta))) + 1.0) / t_0) / (t_0 * ((alpha + beta) + 3.0));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if alpha <= 5.2e-22: tmp = (((beta + (alpha + (alpha * beta))) + 1.0) / t_0) / (t_0 * ((alpha + beta) + 3.0)) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (alpha <= 5.2e-22) tmp = Float64(Float64(Float64(Float64(beta + Float64(alpha + Float64(alpha * beta))) + 1.0) / t_0) / Float64(t_0 * Float64(Float64(alpha + beta) + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 / beta) - Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(2.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 <= 5.2e-22)
tmp = (((beta + (alpha + (alpha * beta))) + 1.0) / t_0) / (t_0 * ((alpha + beta) + 3.0));
else
tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 5.2e-22], N[(N[(N[(N[(beta + N[(alpha + N[(alpha * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 / beta), $MachinePrecision] - N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(2.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\alpha \leq 5.2 \cdot 10^{-22}:\\
\;\;\;\;\frac{\frac{\left(\beta + \left(\alpha + \alpha \cdot \beta\right)\right) + 1}{t_0}}{t_0 \cdot \left(\left(\alpha + \beta\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t_0} \cdot \left(\frac{1}{\beta} - \frac{\alpha + 2}{\beta} \cdot \frac{2}{\beta}\right)\\
\end{array}
\end{array}
if alpha < 5.2e-22Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
if 5.2e-22 < alpha Initial program 87.5%
associate-/l/83.3%
associate-/r*69.0%
+-commutative69.0%
associate-+r+69.0%
+-commutative69.0%
associate-+r+69.0%
associate-+r+69.0%
distribute-rgt1-in68.9%
+-commutative68.9%
*-commutative68.9%
distribute-rgt1-in68.9%
+-commutative68.9%
times-frac92.2%
Simplified92.2%
Taylor expanded in beta around inf 21.6%
+-commutative21.6%
mul-1-neg21.6%
unsub-neg21.6%
metadata-eval21.6%
distribute-lft-in21.6%
*-commutative21.6%
unpow221.6%
times-frac21.5%
Simplified21.5%
Final simplification72.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))) (t_1 (/ (+ alpha 1.0) t_0)))
(if (<= beta 2.6e+101)
(* t_1 (/ (+ beta 1.0) (* t_0 (+ beta (+ alpha 3.0)))))
(* t_1 (- (/ 1.0 beta) (* (/ (+ alpha 2.0) beta) (/ 2.0 beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + 1.0) / t_0;
double tmp;
if (beta <= 2.6e+101) {
tmp = t_1 * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = t_1 * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.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) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
t_1 = (alpha + 1.0d0) / t_0
if (beta <= 2.6d+101) then
tmp = t_1 * ((beta + 1.0d0) / (t_0 * (beta + (alpha + 3.0d0))))
else
tmp = t_1 * ((1.0d0 / beta) - (((alpha + 2.0d0) / beta) * (2.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 t_1 = (alpha + 1.0) / t_0;
double tmp;
if (beta <= 2.6e+101) {
tmp = t_1 * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = t_1 * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) t_1 = (alpha + 1.0) / t_0 tmp = 0 if beta <= 2.6e+101: tmp = t_1 * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0)))) else: tmp = t_1 * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) t_1 = Float64(Float64(alpha + 1.0) / t_0) tmp = 0.0 if (beta <= 2.6e+101) tmp = Float64(t_1 * Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(t_1 * Float64(Float64(1.0 / beta) - Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(2.0 / beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
t_1 = (alpha + 1.0) / t_0;
tmp = 0.0;
if (beta <= 2.6e+101)
tmp = t_1 * ((beta + 1.0) / (t_0 * (beta + (alpha + 3.0))));
else
tmp = t_1 * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 2.6e+101], N[(t$95$1 * N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 / beta), $MachinePrecision] - N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(2.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
t_1 := \frac{\alpha + 1}{t_0}\\
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+101}:\\
\;\;\;\;t_1 \cdot \frac{\beta + 1}{t_0 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t_1 \cdot \left(\frac{1}{\beta} - \frac{\alpha + 2}{\beta} \cdot \frac{2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 2.6e101Initial program 98.4%
associate-/l/97.9%
associate-/r*92.2%
+-commutative92.2%
associate-+r+92.2%
+-commutative92.2%
associate-+r+92.2%
associate-+r+92.2%
distribute-rgt1-in92.2%
+-commutative92.2%
*-commutative92.2%
distribute-rgt1-in92.2%
+-commutative92.2%
times-frac99.4%
Simplified99.4%
if 2.6e101 < beta Initial program 84.2%
associate-/l/78.5%
associate-/r*61.8%
+-commutative61.8%
associate-+r+61.8%
+-commutative61.8%
associate-+r+61.8%
associate-+r+61.8%
distribute-rgt1-in61.8%
+-commutative61.8%
*-commutative61.8%
distribute-rgt1-in61.8%
+-commutative61.8%
times-frac88.3%
Simplified88.3%
Taylor expanded in beta around inf 94.2%
+-commutative94.2%
mul-1-neg94.2%
unsub-neg94.2%
metadata-eval94.2%
distribute-lft-in94.2%
*-commutative94.2%
unpow294.2%
times-frac94.1%
Simplified94.1%
Final simplification98.3%
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 2.6e+101)
(/ (* (+ beta 1.0) (+ alpha 1.0)) (* t_0 (* t_0 (+ beta (+ alpha 3.0)))))
(*
(/ (+ alpha 1.0) t_0)
(- (/ 1.0 beta) (* (/ (+ alpha 2.0) beta) (/ 2.0 beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.6e+101) {
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.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 (beta <= 2.6d+101) then
tmp = ((beta + 1.0d0) * (alpha + 1.0d0)) / (t_0 * (t_0 * (beta + (alpha + 3.0d0))))
else
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 / beta) - (((alpha + 2.0d0) / beta) * (2.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 (beta <= 2.6e+101) {
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2.6e+101: tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0)))) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / 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 <= 2.6e+101) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(alpha + 1.0)) / Float64(t_0 * Float64(t_0 * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 / beta) - Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(2.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 (beta <= 2.6e+101)
tmp = ((beta + 1.0) * (alpha + 1.0)) / (t_0 * (t_0 * (beta + (alpha + 3.0))));
else
tmp = ((alpha + 1.0) / t_0) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.6e+101], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 / beta), $MachinePrecision] - N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(2.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2.6 \cdot 10^{+101}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(\alpha + 1\right)}{t_0 \cdot \left(t_0 \cdot \left(\beta + \left(\alpha + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t_0} \cdot \left(\frac{1}{\beta} - \frac{\alpha + 2}{\beta} \cdot \frac{2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 2.6e101Initial program 98.4%
associate-/l/97.9%
associate-/r*92.2%
+-commutative92.2%
associate-+r+92.2%
+-commutative92.2%
associate-+r+92.2%
associate-+r+92.2%
distribute-rgt1-in92.2%
+-commutative92.2%
*-commutative92.2%
distribute-rgt1-in92.2%
+-commutative92.2%
metadata-eval92.2%
associate-+l+92.2%
*-commutative92.2%
metadata-eval92.2%
Simplified92.2%
if 2.6e101 < beta Initial program 84.2%
associate-/l/78.5%
associate-/r*61.8%
+-commutative61.8%
associate-+r+61.8%
+-commutative61.8%
associate-+r+61.8%
associate-+r+61.8%
distribute-rgt1-in61.8%
+-commutative61.8%
*-commutative61.8%
distribute-rgt1-in61.8%
+-commutative61.8%
times-frac88.3%
Simplified88.3%
Taylor expanded in beta around inf 94.2%
+-commutative94.2%
mul-1-neg94.2%
unsub-neg94.2%
metadata-eval94.2%
distribute-lft-in94.2%
*-commutative94.2%
unpow294.2%
times-frac94.1%
Simplified94.1%
Final simplification92.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.6e+32)
(* (/ 1.0 (+ beta 2.0)) (/ (+ beta 1.0) (* (+ beta 2.0) (+ beta 3.0))))
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(- (/ 1.0 beta) (* (/ (+ alpha 2.0) beta) (/ 2.0 beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6e+32) {
tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.6d+32) then
tmp = (1.0d0 / (beta + 2.0d0)) * ((beta + 1.0d0) / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * ((1.0d0 / beta) - (((alpha + 2.0d0) / beta) * (2.0d0 / beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6e+32) {
tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.6e+32: tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.6e+32) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) * Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 / beta) - Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(2.0 / beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.6e+32)
tmp = (1.0 / (beta + 2.0)) * ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 / beta) - (((alpha + 2.0) / beta) * (2.0 / beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.6e+32], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / beta), $MachinePrecision] - N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(2.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6 \cdot 10^{+32}:\\
\;\;\;\;\frac{1}{\beta + 2} \cdot \frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \left(\frac{1}{\beta} - \frac{\alpha + 2}{\beta} \cdot \frac{2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.5999999999999999e32Initial program 99.9%
associate-/l/99.3%
associate-/r*93.6%
+-commutative93.6%
associate-+r+93.6%
+-commutative93.6%
associate-+r+93.6%
associate-+r+93.6%
distribute-rgt1-in93.6%
+-commutative93.6%
*-commutative93.6%
distribute-rgt1-in93.6%
+-commutative93.6%
times-frac99.3%
Simplified99.3%
Taylor expanded in alpha around 0 68.9%
Taylor expanded in alpha around 0 68.9%
if 1.5999999999999999e32 < beta Initial program 86.5%
associate-/l/83.1%
associate-/r*70.6%
+-commutative70.6%
associate-+r+70.6%
+-commutative70.6%
associate-+r+70.6%
associate-+r+70.6%
distribute-rgt1-in70.6%
+-commutative70.6%
*-commutative70.6%
distribute-rgt1-in70.6%
+-commutative70.6%
times-frac92.7%
Simplified92.7%
Taylor expanded in beta around inf 85.6%
+-commutative85.6%
mul-1-neg85.6%
unsub-neg85.6%
metadata-eval85.6%
distribute-lft-in85.6%
*-commutative85.6%
unpow285.6%
times-frac85.5%
Simplified85.5%
Final simplification74.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.15e+16) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (- alpha -1.0) beta) (+ (+ alpha beta) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 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 <= 1.15d+16) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + 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 <= 1.15e+16) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 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 <= 1.15e+16: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 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 <= 1.15e+16) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + 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 <= 1.15e+16)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 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, 1.15e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 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 1.15 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 1.15e16Initial program 99.9%
associate-/l/99.9%
associate-/r*94.0%
+-commutative94.0%
associate-+r+94.0%
+-commutative94.0%
associate-+r+94.0%
associate-+r+94.0%
distribute-rgt1-in94.0%
+-commutative94.0%
*-commutative94.0%
distribute-rgt1-in94.0%
+-commutative94.0%
times-frac99.9%
Simplified99.9%
Taylor expanded in alpha around 0 68.5%
Taylor expanded in alpha around 0 68.6%
frac-times68.6%
*-un-lft-identity68.6%
+-commutative68.6%
+-commutative68.6%
+-commutative68.6%
+-commutative68.6%
Applied egg-rr68.6%
if 1.15e16 < beta Initial program 87.3%
Taylor expanded in beta around -inf 85.7%
associate-*r/85.7%
mul-1-neg85.7%
sub-neg85.7%
mul-1-neg85.7%
distribute-neg-in85.7%
+-commutative85.7%
mul-1-neg85.7%
distribute-lft-in85.7%
metadata-eval85.7%
mul-1-neg85.7%
unsub-neg85.7%
Simplified85.7%
Taylor expanded in alpha around 0 85.7%
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.3) (/ (+ alpha 1.0) (* (+ alpha 2.0) (+ 6.0 (* alpha 5.0)))) (/ (/ (- alpha -1.0) beta) (+ (+ alpha beta) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 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 <= 2.3d0) then
tmp = (alpha + 1.0d0) / ((alpha + 2.0d0) * (6.0d0 + (alpha * 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 <= 2.3) {
tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 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 <= 2.3: tmp = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 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 <= 2.3) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 2.0) * Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(Float64(alpha + 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 = (alpha + 1.0) / ((alpha + 2.0) * (6.0 + (alpha * 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, 2.3], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + 2\right) \cdot \left(6 + \alpha \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.9%
associate-/l/99.9%
associate-/r*93.9%
+-commutative93.9%
associate-+r+93.9%
+-commutative93.9%
associate-+r+93.9%
associate-+r+93.9%
distribute-rgt1-in93.9%
+-commutative93.9%
*-commutative93.9%
distribute-rgt1-in93.9%
+-commutative93.9%
times-frac99.9%
Simplified99.9%
Taylor expanded in alpha around 0 70.3%
Taylor expanded in beta around 0 83.7%
*-commutative83.7%
+-commutative83.7%
Simplified83.7%
if 2.2999999999999998 < beta Initial program 87.7%
Taylor expanded in beta around -inf 83.7%
associate-*r/83.7%
mul-1-neg83.7%
sub-neg83.7%
mul-1-neg83.7%
distribute-neg-in83.7%
+-commutative83.7%
mul-1-neg83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
Simplified83.7%
Taylor expanded in alpha around 0 83.7%
Final simplification83.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.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (- alpha -1.0) beta) (+ (+ alpha beta) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((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.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} 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.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) 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.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); 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.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $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.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.5 < beta Initial program 87.7%
Taylor expanded in beta around -inf 83.7%
associate-*r/83.7%
mul-1-neg83.7%
sub-neg83.7%
mul-1-neg83.7%
distribute-neg-in83.7%
+-commutative83.7%
mul-1-neg83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
Simplified83.7%
Taylor expanded in alpha around 0 83.7%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.4)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 1.4e+154)
(/ 1.0 (* beta (+ beta 3.0)))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.4e+154) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.4d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 1.4d+154) then
tmp = 1.0d0 / (beta * (beta + 3.0d0))
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.4e+154) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 1.4e+154: tmp = 1.0 / (beta * (beta + 3.0)) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.4) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 1.4e+154) tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.4)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 1.4e+154)
tmp = 1.0 / (beta * (beta + 3.0));
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.4], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.4e+154], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.4 \cdot 10^{+154}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.39999999999999991 < beta < 1.4e154Initial program 93.7%
Taylor expanded in beta around -inf 76.8%
associate-*r/76.8%
mul-1-neg76.8%
sub-neg76.8%
mul-1-neg76.8%
distribute-neg-in76.8%
+-commutative76.8%
mul-1-neg76.8%
distribute-lft-in76.8%
metadata-eval76.8%
mul-1-neg76.8%
unsub-neg76.8%
Simplified76.8%
Taylor expanded in alpha around 0 66.6%
+-commutative66.6%
Simplified66.6%
if 1.4e154 < beta Initial program 79.8%
Taylor expanded in beta around -inf 92.8%
associate-*r/92.8%
mul-1-neg92.8%
sub-neg92.8%
mul-1-neg92.8%
distribute-neg-in92.8%
+-commutative92.8%
mul-1-neg92.8%
distribute-lft-in92.8%
metadata-eval92.8%
mul-1-neg92.8%
unsub-neg92.8%
Simplified92.8%
Taylor expanded in beta around inf 92.7%
Taylor expanded in alpha around inf 92.7%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.8)
(+ 0.08333333333333333 (* beta -0.027777777777777776))
(if (<= beta 1.5e+154)
(/ (+ alpha 1.0) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.5e+154) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 1.5d+154) then
tmp = (alpha + 1.0d0) / (beta * beta)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 1.5e+154) {
tmp = (alpha + 1.0) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 1.5e+154: tmp = (alpha + 1.0) / (beta * beta) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 1.5e+154) tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 1.5e+154)
tmp = (alpha + 1.0) / (beta * beta);
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.5e+154], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.5 \cdot 10^{+154}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.7999999999999998 < beta < 1.50000000000000013e154Initial program 93.7%
associate-/l/91.9%
associate-/r*71.9%
+-commutative71.9%
associate-+r+71.9%
+-commutative71.9%
associate-+r+71.9%
associate-+r+71.9%
distribute-rgt1-in71.9%
+-commutative71.9%
*-commutative71.9%
distribute-rgt1-in71.8%
+-commutative71.8%
times-frac97.7%
Simplified97.7%
Taylor expanded in beta around inf 76.5%
unpow276.5%
Simplified76.5%
if 1.50000000000000013e154 < beta Initial program 79.8%
Taylor expanded in beta around -inf 92.8%
associate-*r/92.8%
mul-1-neg92.8%
sub-neg92.8%
mul-1-neg92.8%
distribute-neg-in92.8%
+-commutative92.8%
mul-1-neg92.8%
distribute-lft-in92.8%
metadata-eval92.8%
mul-1-neg92.8%
unsub-neg92.8%
Simplified92.8%
Taylor expanded in beta around inf 92.7%
Taylor expanded in alpha around inf 92.7%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (if (<= beta 5.1e+154) (/ (/ 1.0 beta) beta) (/ (/ alpha beta) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 5.1e+154) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else if (beta <= 5.1d+154) then
tmp = (1.0d0 / beta) / beta
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else if (beta <= 5.1e+154) {
tmp = (1.0 / beta) / beta;
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) elif beta <= 5.1e+154: tmp = (1.0 / beta) / beta else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); elseif (beta <= 5.1e+154) tmp = Float64(Float64(1.0 / beta) / beta); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
elseif (beta <= 5.1e+154)
tmp = (1.0 / beta) / beta;
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5.1e+154], N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 5.1 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.7999999999999998 < beta < 5.0999999999999999e154Initial program 93.7%
associate-/l/91.9%
associate-/r*71.9%
+-commutative71.9%
associate-+r+71.9%
+-commutative71.9%
associate-+r+71.9%
associate-+r+71.9%
distribute-rgt1-in71.9%
+-commutative71.9%
*-commutative71.9%
distribute-rgt1-in71.8%
+-commutative71.8%
times-frac97.7%
Simplified97.7%
Taylor expanded in beta around inf 76.5%
unpow276.5%
Simplified76.5%
Taylor expanded in alpha around 0 66.6%
unpow266.6%
associate-/r*66.6%
Simplified66.6%
if 5.0999999999999999e154 < beta Initial program 79.8%
Taylor expanded in beta around -inf 92.8%
associate-*r/92.8%
mul-1-neg92.8%
sub-neg92.8%
mul-1-neg92.8%
distribute-neg-in92.8%
+-commutative92.8%
mul-1-neg92.8%
distribute-lft-in92.8%
metadata-eval92.8%
mul-1-neg92.8%
unsub-neg92.8%
Simplified92.8%
Taylor expanded in beta around inf 92.7%
Taylor expanded in alpha around inf 92.7%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((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 <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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 <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(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 <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $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 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.7999999999999998 < beta Initial program 87.7%
Taylor expanded in beta around -inf 83.7%
associate-*r/83.7%
mul-1-neg83.7%
sub-neg83.7%
mul-1-neg83.7%
distribute-neg-in83.7%
+-commutative83.7%
mul-1-neg83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
Simplified83.7%
Taylor expanded in beta around inf 83.5%
Taylor expanded in beta around 0 83.5%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.4) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.4d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.4) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.4)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.4], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.39999999999999991 < beta Initial program 87.7%
associate-/l/83.5%
associate-+l+83.5%
+-commutative83.5%
*-commutative83.5%
associate-+l+83.5%
+-commutative83.5%
+-commutative83.5%
+-commutative83.5%
Simplified83.5%
Taylor expanded in beta around 0 44.1%
Taylor expanded in beta around 0 14.7%
+-commutative14.7%
+-commutative14.7%
Simplified14.7%
Taylor expanded in alpha around 0 6.8%
+-commutative6.8%
Simplified6.8%
Taylor expanded in beta around inf 6.8%
Final simplification46.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.7999999999999998 < beta Initial program 87.7%
Taylor expanded in beta around -inf 83.7%
associate-*r/83.7%
mul-1-neg83.7%
sub-neg83.7%
mul-1-neg83.7%
distribute-neg-in83.7%
+-commutative83.7%
mul-1-neg83.7%
distribute-lft-in83.7%
metadata-eval83.7%
mul-1-neg83.7%
unsub-neg83.7%
Simplified83.7%
Taylor expanded in beta around inf 83.5%
Taylor expanded in alpha around 0 74.6%
unpow274.6%
Simplified74.6%
Final simplification70.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ 1.0 beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = (1.0 / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(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 <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = (1.0 / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.5%
if 2.7999999999999998 < beta Initial program 87.7%
associate-/l/83.5%
associate-/r*72.2%
+-commutative72.2%
associate-+r+72.2%
+-commutative72.2%
associate-+r+72.2%
associate-+r+72.2%
distribute-rgt1-in72.1%
+-commutative72.1%
*-commutative72.1%
distribute-rgt1-in72.1%
+-commutative72.1%
times-frac92.3%
Simplified92.3%
Taylor expanded in beta around inf 80.2%
unpow280.2%
Simplified80.2%
Taylor expanded in alpha around 0 74.6%
unpow274.6%
associate-/r*74.6%
Simplified74.6%
Final simplification70.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
associate-/l/99.9%
associate-+l+99.9%
+-commutative99.9%
*-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 85.9%
Taylor expanded in alpha around 0 68.6%
+-commutative68.6%
+-commutative68.6%
Simplified68.6%
Taylor expanded in beta around 0 68.0%
if 2 < beta Initial program 87.7%
associate-/l/83.5%
associate-+l+83.5%
+-commutative83.5%
*-commutative83.5%
associate-+l+83.5%
+-commutative83.5%
+-commutative83.5%
+-commutative83.5%
Simplified83.5%
Taylor expanded in beta around 0 44.1%
Taylor expanded in beta around 0 14.7%
+-commutative14.7%
+-commutative14.7%
Simplified14.7%
Taylor expanded in alpha around 0 6.8%
+-commutative6.8%
Simplified6.8%
Taylor expanded in beta around inf 6.8%
Final simplification46.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 95.6%
associate-/l/94.1%
associate-+l+94.1%
+-commutative94.1%
*-commutative94.1%
associate-+l+94.1%
+-commutative94.1%
+-commutative94.1%
+-commutative94.1%
Simplified94.1%
Taylor expanded in beta around 0 79.5%
Taylor expanded in beta around 0 69.2%
+-commutative69.2%
+-commutative69.2%
Simplified69.2%
Taylor expanded in alpha around 0 46.5%
+-commutative46.5%
Simplified46.5%
Final simplification46.5%
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 95.6%
associate-/l/94.1%
associate-+l+94.1%
+-commutative94.1%
*-commutative94.1%
associate-+l+94.1%
+-commutative94.1%
+-commutative94.1%
+-commutative94.1%
Simplified94.1%
Taylor expanded in alpha around 0 83.6%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
+-commutative71.2%
Simplified71.2%
Taylor expanded in beta around 0 45.6%
Final simplification45.6%
herbie shell --seed 2023293
(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)))