
(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 20 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 (+ 2.0 beta)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ (+ alpha beta) 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / ((alpha + beta) + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (2.0d0 + beta)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / ((alpha + beta) + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / ((alpha + beta) + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / ((alpha + beta) + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(Float64(alpha + beta) + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / ((alpha + beta) + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \frac{1 + \beta}{\left(\alpha + \beta\right) + 3}
\end{array}
\end{array}
Initial program 95.6%
associate-/l/92.8%
associate-/r*86.7%
+-commutative86.7%
associate-+r+86.7%
+-commutative86.7%
associate-+r+86.7%
associate-+r+86.7%
distribute-rgt1-in86.7%
+-commutative86.7%
*-commutative86.7%
distribute-rgt1-in86.7%
+-commutative86.7%
times-frac96.7%
Simplified96.7%
expm1-log1p-u96.7%
expm1-udef69.3%
*-commutative69.3%
+-commutative69.3%
Applied egg-rr69.3%
expm1-def96.7%
expm1-log1p96.7%
*-commutative96.7%
associate-*r/96.8%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))) (t_1 (/ (+ 1.0 alpha) t_0)))
(if (<= beta 32000000000.0)
(* t_1 (/ (+ 1.0 beta) (* t_0 (+ beta (+ alpha 3.0)))))
(/ t_1 (+ beta (+ (* alpha 2.0) 4.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 32000000000.0) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = t_1 / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 32000000000.0d0) then
tmp = t_1 * ((1.0d0 + beta) / (t_0 * (beta + (alpha + 3.0d0))))
else
tmp = t_1 / (beta + ((alpha * 2.0d0) + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 32000000000.0) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (beta + (alpha + 3.0))));
} else {
tmp = t_1 / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) t_1 = (1.0 + alpha) / t_0 tmp = 0 if beta <= 32000000000.0: tmp = t_1 * ((1.0 + beta) / (t_0 * (beta + (alpha + 3.0)))) else: tmp = t_1 / (beta + ((alpha * 2.0) + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) t_1 = Float64(Float64(1.0 + alpha) / t_0) tmp = 0.0 if (beta <= 32000000000.0) tmp = Float64(t_1 * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(beta + Float64(alpha + 3.0))))); else tmp = Float64(t_1 / Float64(beta + Float64(Float64(alpha * 2.0) + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
t_1 = (1.0 + alpha) / t_0;
tmp = 0.0;
if (beta <= 32000000000.0)
tmp = t_1 * ((1.0 + beta) / (t_0 * (beta + (alpha + 3.0))));
else
tmp = t_1 / (beta + ((alpha * 2.0) + 4.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 32000000000.0], N[(t$95$1 * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / N[(beta + N[(N[(alpha * 2.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
t_1 := \frac{1 + \alpha}{t_0}\\
\mathbf{if}\;\beta \leq 32000000000:\\
\;\;\;\;t_1 \cdot \frac{1 + \beta}{t_0 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{\beta + \left(\alpha \cdot 2 + 4\right)}\\
\end{array}
\end{array}
if beta < 3.2e10Initial program 99.9%
associate-/l/98.6%
associate-/r*94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+r+94.4%
distribute-rgt1-in94.4%
+-commutative94.4%
*-commutative94.4%
distribute-rgt1-in94.4%
+-commutative94.4%
times-frac98.6%
Simplified98.6%
if 3.2e10 < beta Initial program 86.3%
associate-/l/80.1%
associate-/r*69.8%
+-commutative69.8%
associate-+r+69.8%
+-commutative69.8%
associate-+r+69.8%
associate-+r+69.8%
distribute-rgt1-in69.8%
+-commutative69.8%
*-commutative69.8%
distribute-rgt1-in69.8%
+-commutative69.8%
times-frac92.6%
Simplified92.6%
expm1-log1p-u92.6%
expm1-udef52.6%
*-commutative52.6%
+-commutative52.6%
Applied egg-rr52.6%
expm1-def92.6%
expm1-log1p92.6%
*-commutative92.6%
associate-*r/92.7%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
expm1-log1p-u99.8%
expm1-udef52.6%
frac-times52.6%
+-commutative52.6%
+-commutative52.6%
associate-+r+52.6%
*-commutative52.6%
+-commutative52.6%
Applied egg-rr52.6%
expm1-def92.7%
expm1-log1p92.7%
associate-/l*92.7%
+-commutative92.7%
+-commutative92.7%
*-commutative92.7%
+-commutative92.7%
+-commutative92.7%
Simplified92.7%
Taylor expanded in beta around inf 84.7%
+-commutative84.7%
Simplified84.7%
Final simplification94.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 6.5e+31)
(/ (/ (+ 1.0 (+ alpha beta)) t_0) (* (+ (+ alpha beta) 3.0) t_0))
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ (* alpha 2.0) 4.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 6.5e+31) {
tmp = ((1.0 + (alpha + beta)) / t_0) / (((alpha + beta) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 6.5d+31) then
tmp = ((1.0d0 + (alpha + beta)) / t_0) / (((alpha + beta) + 3.0d0) * t_0)
else
tmp = ((1.0d0 + alpha) / t_0) / (beta + ((alpha * 2.0d0) + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 6.5e+31) {
tmp = ((1.0 + (alpha + beta)) / t_0) / (((alpha + beta) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 6.5e+31: tmp = ((1.0 + (alpha + beta)) / t_0) / (((alpha + beta) + 3.0) * t_0) else: tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 6.5e+31) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + beta)) / t_0) / Float64(Float64(Float64(alpha + beta) + 3.0) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(Float64(alpha * 2.0) + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 6.5e+31)
tmp = ((1.0 + (alpha + beta)) / t_0) / (((alpha + beta) + 3.0) * t_0);
else
tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.5e+31], N[(N[(N[(1.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(N[(alpha * 2.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 6.5 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \beta\right)}{t_0}}{\left(\left(\alpha + \beta\right) + 3\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha \cdot 2 + 4\right)}\\
\end{array}
\end{array}
if beta < 6.5000000000000004e31Initial program 99.8%
associate-/l/98.6%
associate-+l+98.6%
+-commutative98.6%
*-commutative98.6%
associate-+l+98.6%
+-commutative98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.7%
Taylor expanded in beta around 0 97.4%
if 6.5000000000000004e31 < beta Initial program 84.4%
associate-/l/77.3%
associate-/r*66.8%
+-commutative66.8%
associate-+r+66.8%
+-commutative66.8%
associate-+r+66.8%
associate-+r+66.8%
distribute-rgt1-in66.8%
+-commutative66.8%
*-commutative66.8%
distribute-rgt1-in66.8%
+-commutative66.8%
times-frac91.6%
Simplified91.6%
expm1-log1p-u91.6%
expm1-udef58.2%
*-commutative58.2%
+-commutative58.2%
Applied egg-rr58.2%
expm1-def91.6%
expm1-log1p91.6%
*-commutative91.6%
associate-*r/91.7%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
expm1-log1p-u99.8%
expm1-udef58.2%
frac-times58.2%
+-commutative58.2%
+-commutative58.2%
associate-+r+58.2%
*-commutative58.2%
+-commutative58.2%
Applied egg-rr58.2%
expm1-def91.7%
expm1-log1p91.7%
associate-/l*91.8%
+-commutative91.8%
+-commutative91.8%
*-commutative91.8%
+-commutative91.8%
+-commutative91.8%
Simplified91.8%
Taylor expanded in beta around inf 86.6%
+-commutative86.6%
Simplified86.6%
Final simplification94.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))))
(if (<= beta 5.6)
(* t_0 (/ (/ 1.0 (+ alpha 2.0)) (+ alpha 3.0)))
(/ t_0 (+ beta (+ (* alpha 2.0) 4.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (1.0 + alpha) / (alpha + (2.0 + beta));
double tmp;
if (beta <= 5.6) {
tmp = t_0 * ((1.0 / (alpha + 2.0)) / (alpha + 3.0));
} else {
tmp = t_0 / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (1.0d0 + alpha) / (alpha + (2.0d0 + beta))
if (beta <= 5.6d0) then
tmp = t_0 * ((1.0d0 / (alpha + 2.0d0)) / (alpha + 3.0d0))
else
tmp = t_0 / (beta + ((alpha * 2.0d0) + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (1.0 + alpha) / (alpha + (2.0 + beta));
double tmp;
if (beta <= 5.6) {
tmp = t_0 * ((1.0 / (alpha + 2.0)) / (alpha + 3.0));
} else {
tmp = t_0 / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (1.0 + alpha) / (alpha + (2.0 + beta)) tmp = 0 if beta <= 5.6: tmp = t_0 * ((1.0 / (alpha + 2.0)) / (alpha + 3.0)) else: tmp = t_0 / (beta + ((alpha * 2.0) + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) tmp = 0.0 if (beta <= 5.6) tmp = Float64(t_0 * Float64(Float64(1.0 / Float64(alpha + 2.0)) / Float64(alpha + 3.0))); else tmp = Float64(t_0 / Float64(beta + Float64(Float64(alpha * 2.0) + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (1.0 + alpha) / (alpha + (2.0 + beta));
tmp = 0.0;
if (beta <= 5.6)
tmp = t_0 * ((1.0 / (alpha + 2.0)) / (alpha + 3.0));
else
tmp = t_0 / (beta + ((alpha * 2.0) + 4.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.6], N[(t$95$0 * N[(N[(1.0 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(beta + N[(N[(alpha * 2.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}\\
\mathbf{if}\;\beta \leq 5.6:\\
\;\;\;\;t_0 \cdot \frac{\frac{1}{\alpha + 2}}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{\beta + \left(\alpha \cdot 2 + 4\right)}\\
\end{array}
\end{array}
if beta < 5.5999999999999996Initial program 99.9%
associate-/l/98.6%
associate-/r*94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
associate-+r+94.3%
associate-+r+94.4%
distribute-rgt1-in94.4%
+-commutative94.4%
*-commutative94.4%
distribute-rgt1-in94.3%
+-commutative94.3%
times-frac98.6%
Simplified98.6%
Taylor expanded in beta around 0 97.6%
associate-/r*98.9%
+-commutative98.9%
Simplified98.9%
if 5.5999999999999996 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
expm1-log1p-u92.8%
expm1-udef52.3%
*-commutative52.3%
+-commutative52.3%
Applied egg-rr52.3%
expm1-def92.8%
expm1-log1p92.8%
*-commutative92.8%
associate-*r/92.8%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
expm1-log1p-u99.8%
expm1-udef52.3%
frac-times52.3%
+-commutative52.3%
+-commutative52.3%
associate-+r+52.3%
*-commutative52.3%
+-commutative52.3%
Applied egg-rr52.3%
expm1-def92.8%
expm1-log1p92.8%
associate-/l*92.9%
+-commutative92.9%
+-commutative92.9%
*-commutative92.9%
+-commutative92.9%
+-commutative92.9%
Simplified92.9%
Taylor expanded in beta around inf 84.3%
+-commutative84.3%
Simplified84.3%
Final simplification94.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 1.9)
(/ (/ (+ 1.0 alpha) (+ 4.0 (* alpha (+ alpha 4.0)))) (+ 1.0 t_0))
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ (* alpha 2.0) 4.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1.9) {
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (1.0 + t_0);
} else {
tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 1.9d0) then
tmp = ((1.0d0 + alpha) / (4.0d0 + (alpha * (alpha + 4.0d0)))) / (1.0d0 + t_0)
else
tmp = ((1.0d0 + alpha) / t_0) / (beta + ((alpha * 2.0d0) + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1.9) {
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (1.0 + t_0);
} else {
tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 1.9: tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (1.0 + t_0) else: tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 1.9) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(4.0 + Float64(alpha * Float64(alpha + 4.0)))) / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(Float64(alpha * 2.0) + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 1.9)
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (1.0 + t_0);
else
tmp = ((1.0 + alpha) / t_0) / (beta + ((alpha * 2.0) + 4.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.9], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(4.0 + N[(alpha * N[(alpha + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(N[(alpha * 2.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 1.9:\\
\;\;\;\;\frac{\frac{1 + \alpha}{4 + \alpha \cdot \left(\alpha + 4\right)}}{1 + t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha \cdot 2 + 4\right)}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 98.3%
unpow298.3%
distribute-rgt-out98.3%
Simplified98.3%
metadata-eval98.3%
associate-+r+98.3%
*-un-lft-identity98.3%
fma-def98.3%
Applied egg-rr98.3%
fma-udef98.3%
*-lft-identity98.3%
+-commutative98.3%
Simplified98.3%
if 1.8999999999999999 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
expm1-log1p-u92.8%
expm1-udef52.3%
*-commutative52.3%
+-commutative52.3%
Applied egg-rr52.3%
expm1-def92.8%
expm1-log1p92.8%
*-commutative92.8%
associate-*r/92.8%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
expm1-log1p-u99.8%
expm1-udef52.3%
frac-times52.3%
+-commutative52.3%
+-commutative52.3%
associate-+r+52.3%
*-commutative52.3%
+-commutative52.3%
Applied egg-rr52.3%
expm1-def92.8%
expm1-log1p92.8%
associate-/l*92.9%
+-commutative92.9%
+-commutative92.9%
*-commutative92.9%
+-commutative92.9%
+-commutative92.9%
Simplified92.9%
Taylor expanded in beta around inf 84.3%
+-commutative84.3%
Simplified84.3%
Final simplification93.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2e+16) (/ (+ 1.0 beta) (* (+ alpha (+ 2.0 beta)) (* (+ 2.0 beta) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+16) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.2d+16) then
tmp = (1.0d0 + beta) / ((alpha + (2.0d0 + beta)) * ((2.0d0 + beta) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2e+16) {
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2e+16: tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(Float64(2.0 + beta) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2e+16)
tmp = (1.0 + beta) / ((alpha + (2.0 + beta)) * ((2.0 + beta) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.2e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 1.2e16Initial program 99.8%
associate-/l/98.6%
associate-/r*94.6%
+-commutative94.6%
associate-+r+94.6%
+-commutative94.6%
associate-+r+94.6%
associate-+r+94.6%
distribute-rgt1-in94.6%
+-commutative94.6%
*-commutative94.6%
distribute-rgt1-in94.6%
+-commutative94.6%
metadata-eval94.6%
associate-+l+94.6%
*-commutative94.6%
metadata-eval94.6%
Simplified94.6%
Taylor expanded in alpha around 0 78.6%
Taylor expanded in alpha around 0 62.4%
if 1.2e16 < beta Initial program 85.4%
associate-/l/78.8%
associate-/r*67.8%
+-commutative67.8%
associate-+r+67.8%
+-commutative67.8%
associate-+r+67.8%
associate-+r+67.8%
distribute-rgt1-in67.8%
+-commutative67.8%
*-commutative67.8%
distribute-rgt1-in67.8%
+-commutative67.8%
times-frac92.2%
Simplified92.2%
Taylor expanded in beta around inf 83.0%
associate-*l/83.1%
+-commutative83.1%
+-commutative83.1%
Applied egg-rr83.1%
associate-*r/83.1%
*-rgt-identity83.1%
associate-+r+83.1%
+-commutative83.1%
Simplified83.1%
Final simplification68.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.6)
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (* (+ alpha 3.0) (+ alpha 2.0)))
(/
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ beta (+ (* alpha 2.0) 4.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6) {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.6d0) then
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (beta + ((alpha * 2.0d0) + 4.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6) {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + ((alpha * 2.0) + 4.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.6: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + ((alpha * 2.0) + 4.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.6) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(beta + Float64(Float64(alpha * 2.0) + 4.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.6)
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + ((alpha * 2.0) + 4.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.6], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(N[(alpha * 2.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.6:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta + \left(\alpha \cdot 2 + 4\right)}\\
\end{array}
\end{array}
if beta < 5.5999999999999996Initial program 99.9%
associate-/l/98.6%
associate-/r*94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
associate-+r+94.3%
associate-+r+94.4%
distribute-rgt1-in94.4%
+-commutative94.4%
*-commutative94.4%
distribute-rgt1-in94.3%
+-commutative94.3%
times-frac98.6%
Simplified98.6%
Taylor expanded in beta around 0 97.6%
associate-/r*98.9%
+-commutative98.9%
Simplified98.9%
expm1-log1p-u98.9%
expm1-udef76.6%
+-commutative76.6%
+-commutative76.6%
associate-/l/76.6%
+-commutative76.6%
Applied egg-rr76.6%
expm1-def97.6%
expm1-log1p97.6%
associate-*r/97.6%
*-rgt-identity97.6%
+-commutative97.6%
+-commutative97.6%
*-commutative97.6%
associate-+r+97.6%
+-commutative97.6%
+-commutative97.6%
Simplified97.6%
if 5.5999999999999996 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
expm1-log1p-u92.8%
expm1-udef52.3%
*-commutative52.3%
+-commutative52.3%
Applied egg-rr52.3%
expm1-def92.8%
expm1-log1p92.8%
*-commutative92.8%
associate-*r/92.8%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
expm1-log1p-u99.8%
expm1-udef52.3%
frac-times52.3%
+-commutative52.3%
+-commutative52.3%
associate-+r+52.3%
*-commutative52.3%
+-commutative52.3%
Applied egg-rr52.3%
expm1-def92.8%
expm1-log1p92.8%
associate-/l*92.9%
+-commutative92.9%
+-commutative92.9%
*-commutative92.9%
+-commutative92.9%
+-commutative92.9%
Simplified92.9%
Taylor expanded in beta around inf 84.3%
+-commutative84.3%
Simplified84.3%
Final simplification93.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (/ (/ (+ 1.0 alpha) (+ 4.0 (* alpha (+ alpha 4.0)))) (+ alpha 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d0) then
tmp = ((1.0d0 + alpha) / (4.0d0 + (alpha * (alpha + 4.0d0)))) / (alpha + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 2.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 = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(4.0 + Float64(alpha * Float64(alpha + 4.0)))) / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 2.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 = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(4.0 + N[(alpha * N[(alpha + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\frac{\frac{1 + \alpha}{4 + \alpha \cdot \left(\alpha + 4\right)}}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 98.3%
unpow298.3%
distribute-rgt-out98.3%
Simplified98.3%
Taylor expanded in beta around 0 97.5%
+-commutative97.5%
Simplified97.5%
if 2.89999999999999991 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 81.6%
associate-*l/81.7%
+-commutative81.7%
+-commutative81.7%
Applied egg-rr81.7%
associate-*r/81.7%
*-rgt-identity81.7%
associate-+r+81.7%
+-commutative81.7%
Simplified81.7%
Final simplification92.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (/ (+ 1.0 alpha) (+ 4.0 (* alpha (+ alpha 4.0)))) (+ alpha 3.0)) (/ (/ (- alpha -1.0) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0);
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (alpha + 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.5d0) then
tmp = ((1.0d0 + alpha) / (4.0d0 + (alpha * (alpha + 4.0d0)))) / (alpha + 3.0d0)
else
tmp = ((alpha - (-1.0d0)) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0);
} else {
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0) else: tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(4.0 + Float64(alpha * Float64(alpha + 4.0)))) / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = ((1.0 + alpha) / (4.0 + (alpha * (alpha + 4.0)))) / (alpha + 3.0);
else
tmp = ((alpha - -1.0) / beta) / (1.0 + (2.0 + (alpha + 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.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(4.0 + N[(alpha * N[(alpha + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{4 + \alpha \cdot \left(\alpha + 4\right)}}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 98.3%
unpow298.3%
distribute-rgt-out98.3%
Simplified98.3%
Taylor expanded in beta around 0 97.5%
+-commutative97.5%
Simplified97.5%
if 4.5 < beta Initial program 86.6%
Taylor expanded in beta around -inf 81.7%
associate-*r/81.7%
mul-1-neg81.7%
sub-neg81.7%
mul-1-neg81.7%
distribute-neg-in81.7%
+-commutative81.7%
mul-1-neg81.7%
distribute-lft-in81.7%
metadata-eval81.7%
mul-1-neg81.7%
unsub-neg81.7%
Simplified81.7%
Final simplification92.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.9) (/ (+ 0.25 (* (* alpha alpha) -0.0625)) (+ (+ alpha beta) 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9) {
tmp = (0.25 + ((alpha * alpha) * -0.0625)) / ((alpha + beta) + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.9d0) then
tmp = (0.25d0 + ((alpha * alpha) * (-0.0625d0))) / ((alpha + beta) + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9) {
tmp = (0.25 + ((alpha * alpha) * -0.0625)) / ((alpha + beta) + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.9: tmp = (0.25 + ((alpha * alpha) * -0.0625)) / ((alpha + beta) + 3.0) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.9) tmp = Float64(Float64(0.25 + Float64(Float64(alpha * alpha) * -0.0625)) / Float64(Float64(alpha + beta) + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.9)
tmp = (0.25 + ((alpha * alpha) * -0.0625)) / ((alpha + beta) + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.9], N[(N[(0.25 + N[(N[(alpha * alpha), $MachinePrecision] * -0.0625), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.9:\\
\;\;\;\;\frac{0.25 + \left(\alpha \cdot \alpha\right) \cdot -0.0625}{\left(\alpha + \beta\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 3.89999999999999991Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 59.5%
*-commutative59.5%
unpow259.5%
Simplified59.5%
Taylor expanded in alpha around 0 59.5%
+-commutative61.4%
associate-+r+61.4%
+-commutative61.4%
Simplified59.5%
if 3.89999999999999991 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 81.6%
associate-*l/81.7%
+-commutative81.7%
+-commutative81.7%
Applied egg-rr81.7%
associate-*r/81.7%
*-rgt-identity81.7%
associate-+r+81.7%
+-commutative81.7%
Simplified81.7%
Final simplification66.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.6) (/ 0.25 (+ (+ alpha beta) 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.6d0) then
tmp = 0.25d0 / ((alpha + beta) + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.6: tmp = 0.25 / ((alpha + beta) + 3.0) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.6) tmp = Float64(0.25 / Float64(Float64(alpha + beta) + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.6)
tmp = 0.25 / ((alpha + beta) + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.6], N[(0.25 / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.6:\\
\;\;\;\;\frac{0.25}{\left(\alpha + \beta\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 4.5999999999999996Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 61.4%
Taylor expanded in alpha around 0 61.4%
+-commutative61.4%
associate-+r+61.4%
+-commutative61.4%
Simplified61.4%
if 4.5999999999999996 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 81.6%
associate-*l/81.7%
+-commutative81.7%
+-commutative81.7%
Applied egg-rr81.7%
associate-*r/81.7%
*-rgt-identity81.7%
associate-+r+81.7%
+-commutative81.7%
Simplified81.7%
Final simplification67.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.2) (/ 0.25 (+ (+ alpha beta) 3.0)) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.2) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = ((1.0 + alpha) / 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) :: tmp
if (beta <= 7.2d0) then
tmp = 0.25d0 / ((alpha + beta) + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.2) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.2: tmp = 0.25 / ((alpha + beta) + 3.0) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.2) tmp = Float64(0.25 / Float64(Float64(alpha + beta) + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.2)
tmp = 0.25 / ((alpha + beta) + 3.0);
else
tmp = ((1.0 + alpha) / 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_] := If[LessEqual[beta, 7.2], N[(0.25 / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.2:\\
\;\;\;\;\frac{0.25}{\left(\alpha + \beta\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 7.20000000000000018Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 61.4%
Taylor expanded in alpha around 0 61.4%
+-commutative61.4%
associate-+r+61.4%
+-commutative61.4%
Simplified61.4%
if 7.20000000000000018 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 81.6%
Taylor expanded in beta around inf 81.3%
Final simplification67.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6) (/ 0.25 (+ (+ alpha beta) 3.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = 0.25 / ((alpha + beta) + 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 <= 6.6d0) then
tmp = 0.25d0 / ((alpha + beta) + 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 <= 6.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6: tmp = 0.25 / ((alpha + beta) + 3.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6) tmp = Float64(0.25 / Float64(Float64(alpha + beta) + 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 <= 6.6)
tmp = 0.25 / ((alpha + beta) + 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, 6.6], N[(0.25 / N[(N[(alpha + beta), $MachinePrecision] + 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 6.6:\\
\;\;\;\;\frac{0.25}{\left(\alpha + \beta\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.5999999999999996Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 61.4%
Taylor expanded in alpha around 0 61.4%
+-commutative61.4%
associate-+r+61.4%
+-commutative61.4%
Simplified61.4%
if 6.5999999999999996 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 78.6%
unpow278.6%
Simplified78.6%
Taylor expanded in alpha around 0 77.2%
unpow277.2%
Simplified77.2%
Final simplification66.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.6) (/ 0.25 (+ (+ alpha beta) 3.0)) (/ 1.0 (* beta (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = 1.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 <= 4.6d0) then
tmp = 0.25d0 / ((alpha + beta) + 3.0d0)
else
tmp = 1.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 <= 4.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.6: tmp = 0.25 / ((alpha + beta) + 3.0) else: tmp = 1.0 / (beta * (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.6) tmp = Float64(0.25 / Float64(Float64(alpha + beta) + 3.0)); else tmp = Float64(1.0 / Float64(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 <= 4.6)
tmp = 0.25 / ((alpha + beta) + 3.0);
else
tmp = 1.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, 4.6], N[(0.25 / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.6:\\
\;\;\;\;\frac{0.25}{\left(\alpha + \beta\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.5999999999999996Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 61.4%
Taylor expanded in alpha around 0 61.4%
+-commutative61.4%
associate-+r+61.4%
+-commutative61.4%
Simplified61.4%
if 4.5999999999999996 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 81.6%
Taylor expanded in alpha around 0 77.3%
Final simplification66.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6) (/ 0.25 (+ (+ alpha beta) 3.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.6d0) then
tmp = 0.25d0 / ((alpha + beta) + 3.0d0)
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = 0.25 / ((alpha + beta) + 3.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6: tmp = 0.25 / ((alpha + beta) + 3.0) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6) tmp = Float64(0.25 / Float64(Float64(alpha + beta) + 3.0)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.6)
tmp = 0.25 / ((alpha + beta) + 3.0);
else
tmp = (1.0 + alpha) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.6], N[(0.25 / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6:\\
\;\;\;\;\frac{0.25}{\left(\alpha + \beta\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.5999999999999996Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 61.4%
Taylor expanded in alpha around 0 61.4%
+-commutative61.4%
associate-+r+61.4%
+-commutative61.4%
Simplified61.4%
if 6.5999999999999996 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 78.6%
unpow278.6%
Simplified78.6%
Final simplification66.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.9) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.9) {
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.9d0) 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.9) {
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.9: 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.9) 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.9)
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.9], 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.9:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.89999999999999991Initial program 99.9%
Taylor expanded in beta around 0 98.2%
Taylor expanded in alpha around 0 61.4%
Taylor expanded in beta around 0 60.7%
+-commutative60.7%
Simplified60.7%
if 3.89999999999999991 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around inf 78.6%
unpow278.6%
Simplified78.6%
Taylor expanded in alpha around 0 77.2%
unpow277.2%
Simplified77.2%
Final simplification66.0%
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/98.6%
associate-/r*94.4%
+-commutative94.4%
associate-+r+94.4%
+-commutative94.4%
associate-+r+94.3%
associate-+r+94.4%
distribute-rgt1-in94.4%
+-commutative94.4%
*-commutative94.4%
distribute-rgt1-in94.3%
+-commutative94.3%
times-frac98.6%
Simplified98.6%
Taylor expanded in beta around 0 97.6%
associate-/r*98.9%
+-commutative98.9%
Simplified98.9%
Taylor expanded in alpha around 0 59.3%
Taylor expanded in beta around 0 59.2%
if 2 < beta Initial program 86.6%
associate-/l/80.6%
associate-/r*70.5%
+-commutative70.5%
associate-+r+70.5%
+-commutative70.5%
associate-+r+70.5%
associate-+r+70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
*-commutative70.5%
distribute-rgt1-in70.5%
+-commutative70.5%
times-frac92.8%
Simplified92.8%
Taylor expanded in beta around 0 21.1%
associate-/r*21.1%
+-commutative21.1%
Simplified21.1%
Taylor expanded in alpha around 0 6.6%
Taylor expanded in beta around inf 6.6%
Final simplification42.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ 2.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (2.0d0 + beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (2.0 + beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(2.0 + beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (2.0 + beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{2 + \beta}
\end{array}
Initial program 95.6%
associate-/l/92.8%
associate-/r*86.7%
+-commutative86.7%
associate-+r+86.7%
+-commutative86.7%
associate-+r+86.7%
associate-+r+86.7%
distribute-rgt1-in86.7%
+-commutative86.7%
*-commutative86.7%
distribute-rgt1-in86.7%
+-commutative86.7%
times-frac96.7%
Simplified96.7%
Taylor expanded in beta around 0 73.1%
associate-/r*73.9%
+-commutative73.9%
Simplified73.9%
Taylor expanded in alpha around 0 42.4%
Final simplification42.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 95.6%
Taylor expanded in beta around 0 73.5%
Taylor expanded in alpha around 0 42.8%
Final simplification42.8%
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/92.8%
associate-/r*86.7%
+-commutative86.7%
associate-+r+86.7%
+-commutative86.7%
associate-+r+86.7%
associate-+r+86.7%
distribute-rgt1-in86.7%
+-commutative86.7%
*-commutative86.7%
distribute-rgt1-in86.7%
+-commutative86.7%
times-frac96.7%
Simplified96.7%
Taylor expanded in beta around 0 73.1%
associate-/r*73.9%
+-commutative73.9%
Simplified73.9%
Taylor expanded in alpha around 0 42.4%
Taylor expanded in beta around 0 41.6%
Final simplification41.6%
herbie shell --seed 2023275
(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)))