
(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 21 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2.15e+51)
(* (+ 1.0 beta) (/ (+ 1.0 alpha) (* (+ alpha (+ beta 3.0)) (* t_0 t_0))))
(/
(* (+ 1.0 alpha) (/ 1.0 (+ 4.0 (+ beta (* alpha 2.0)))))
(+ beta (+ alpha 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.15e+51) {
tmp = (1.0 + beta) * ((1.0 + alpha) / ((alpha + (beta + 3.0)) * (t_0 * t_0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2.15d+51) then
tmp = (1.0d0 + beta) * ((1.0d0 + alpha) / ((alpha + (beta + 3.0d0)) * (t_0 * t_0)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / (4.0d0 + (beta + (alpha * 2.0d0))))) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.15e+51) {
tmp = (1.0 + beta) * ((1.0 + alpha) / ((alpha + (beta + 3.0)) * (t_0 * t_0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2.15e+51: tmp = (1.0 + beta) * ((1.0 + alpha) / ((alpha + (beta + 3.0)) * (t_0 * t_0))) else: tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2.15e+51) tmp = Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(t_0 * t_0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(4.0 + Float64(beta + Float64(alpha * 2.0))))) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2.15e+51)
tmp = (1.0 + beta) * ((1.0 + alpha) / ((alpha + (beta + 3.0)) * (t_0 * t_0)));
else
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.15e+51], N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(4.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2.15 \cdot 10^{+51}:\\
\;\;\;\;\left(1 + \beta\right) \cdot \frac{1 + \alpha}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(t\_0 \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{4 + \left(\beta + \alpha \cdot 2\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 2.1499999999999999e51Initial program 99.8%
Simplified99.4%
expm1-log1p-u99.4%
expm1-udef77.2%
Applied egg-rr77.2%
expm1-def94.6%
expm1-log1p94.6%
associate-/r/94.6%
+-commutative94.6%
+-commutative94.6%
+-commutative94.6%
+-commutative94.6%
Simplified94.6%
+-commutative94.6%
+-commutative94.6%
pow294.6%
associate-+r+94.6%
+-commutative94.6%
associate-+r+94.6%
+-commutative94.6%
associate-+r+94.6%
associate-+r+94.6%
Applied egg-rr94.6%
if 2.1499999999999999e51 < beta Initial program 87.0%
Simplified92.2%
associate-*l/92.4%
+-commutative92.4%
associate-+r+92.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
clear-num99.9%
inv-pow99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
unpow-199.9%
associate-/r/99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 87.8%
Final simplification92.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 49000000.0)
(/ (/ (+ 1.0 (+ alpha beta)) t_0) (* t_0 (+ 3.0 (+ alpha beta))))
(/
(* (+ 1.0 alpha) (/ 1.0 (+ 4.0 (+ beta (* alpha 2.0)))))
(+ beta (+ alpha 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 49000000.0) {
tmp = ((1.0 + (alpha + beta)) / t_0) / (t_0 * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 49000000.0d0) then
tmp = ((1.0d0 + (alpha + beta)) / t_0) / (t_0 * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / (4.0d0 + (beta + (alpha * 2.0d0))))) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 49000000.0) {
tmp = ((1.0 + (alpha + beta)) / t_0) / (t_0 * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 49000000.0: tmp = ((1.0 + (alpha + beta)) / t_0) / (t_0 * (3.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 49000000.0) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + beta)) / t_0) / Float64(t_0 * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(4.0 + Float64(beta + Float64(alpha * 2.0))))) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 49000000.0)
tmp = ((1.0 + (alpha + beta)) / t_0) / (t_0 * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 49000000.0], N[(N[(N[(1.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(4.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 49000000:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \beta\right)}{t\_0}}{t\_0 \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{4 + \left(\beta + \alpha \cdot 2\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 4.9e7Initial program 99.9%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 98.6%
if 4.9e7 < beta Initial program 88.7%
Simplified93.2%
associate-*l/93.4%
+-commutative93.4%
associate-+r+93.4%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
clear-num99.8%
inv-pow99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.8%
Final simplification94.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (* (+ 1.0 alpha) (/ 1.0 (* (/ (+ alpha (+ beta 3.0)) (+ 1.0 beta)) (+ alpha (+ beta 2.0))))) (+ beta (+ alpha 2.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) * (1.0 / (((alpha + (beta + 3.0)) / (1.0 + beta)) * (alpha + (beta + 2.0))))) / (beta + (alpha + 2.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) * (1.0d0 / (((alpha + (beta + 3.0d0)) / (1.0d0 + beta)) * (alpha + (beta + 2.0d0))))) / (beta + (alpha + 2.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) * (1.0 / (((alpha + (beta + 3.0)) / (1.0 + beta)) * (alpha + (beta + 2.0))))) / (beta + (alpha + 2.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) * (1.0 / (((alpha + (beta + 3.0)) / (1.0 + beta)) * (alpha + (beta + 2.0))))) / (beta + (alpha + 2.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(1.0 + beta)) * Float64(alpha + Float64(beta + 2.0))))) / Float64(beta + Float64(alpha + 2.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) * (1.0 / (((alpha + (beta + 3.0)) / (1.0 + beta)) * (alpha + (beta + 2.0))))) / (beta + (alpha + 2.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\left(1 + \alpha\right) \cdot \frac{1}{\frac{\alpha + \left(\beta + 3\right)}{1 + \beta} \cdot \left(\alpha + \left(\beta + 2\right)\right)}}{\beta + \left(\alpha + 2\right)}
\end{array}
Initial program 96.4%
Simplified97.5%
associate-*l/97.5%
+-commutative97.5%
associate-+r+97.5%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
clear-num99.5%
inv-pow99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
Applied egg-rr99.5%
unpow-199.5%
associate-/r/99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
Final simplification99.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (* (/ (/ (+ 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 = beta + (alpha + 2.0);
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 = beta + (alpha + 2.0d0)
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 = beta + (alpha + 2.0);
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 = beta + (alpha + 2.0) 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(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
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[(beta + N[(alpha + 2.0), $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[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 96.4%
Simplified97.5%
associate-*r/97.5%
+-commutative97.5%
associate-+r+97.5%
+-commutative97.5%
associate-+r+97.5%
associate-+r+97.5%
+-commutative97.5%
associate-+r+97.5%
Applied egg-rr97.5%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.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 (+ beta (+ alpha 2.0)))) (/ (* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0)))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_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 = beta + (alpha + 2.0d0)
code = ((1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}
\end{array}
\end{array}
Initial program 96.4%
Simplified97.5%
associate-*l/97.5%
+-commutative97.5%
associate-+r+97.5%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Final simplification99.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.5e+29)
(/
1.0
(* (/ (+ alpha (+ beta 2.0)) (+ 1.0 beta)) (* (+ beta 3.0) (+ beta 2.0))))
(/ (* (+ 1.0 alpha) (/ 1.0 beta)) (+ beta (+ alpha 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5e+29) {
tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / 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.5d+29) then
tmp = 1.0d0 / (((alpha + (beta + 2.0d0)) / (1.0d0 + beta)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / 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.5e+29) {
tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5e+29: tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) * (1.0 / beta)) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5e+29) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 2.0)) / Float64(1.0 + beta)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / 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.5e+29)
tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) * (1.0 / 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.5e+29], N[(1.0 / N[(N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $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.5 \cdot 10^{+29}:\\
\;\;\;\;\frac{1}{\frac{\alpha + \left(\beta + 2\right)}{1 + \beta} \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 4.5000000000000002e29Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.6%
+-commutative72.6%
+-commutative72.6%
Simplified72.6%
clear-num72.6%
inv-pow72.6%
+-commutative72.6%
associate-+l+72.6%
+-commutative72.6%
*-commutative72.6%
Applied egg-rr72.6%
unpow-172.6%
associate-/r/72.6%
+-commutative72.6%
+-commutative72.6%
+-commutative72.6%
+-commutative72.6%
+-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
Simplified72.6%
if 4.5000000000000002e29 < beta Initial program 88.5%
Simplified93.0%
associate-*l/93.2%
+-commutative93.2%
associate-+r+93.2%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.2%
Final simplification76.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 75000000.0)
(/
1.0
(* (/ (+ alpha (+ beta 2.0)) (+ 1.0 beta)) (* (+ beta 3.0) (+ beta 2.0))))
(/
(* (+ 1.0 alpha) (/ 1.0 (+ 4.0 (+ beta (* alpha 2.0)))))
(+ beta (+ alpha 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 75000000.0) {
tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (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 <= 75000000.0d0) then
tmp = 1.0d0 / (((alpha + (beta + 2.0d0)) / (1.0d0 + beta)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / (4.0d0 + (beta + (alpha * 2.0d0))))) / (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 <= 75000000.0) {
tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 75000000.0: tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 75000000.0) tmp = Float64(1.0 / Float64(Float64(Float64(alpha + Float64(beta + 2.0)) / Float64(1.0 + beta)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(4.0 + Float64(beta + Float64(alpha * 2.0))))) / 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 <= 75000000.0)
tmp = 1.0 / (((alpha + (beta + 2.0)) / (1.0 + beta)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) * (1.0 / (4.0 + (beta + (alpha * 2.0))))) / (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, 75000000.0], N[(1.0 / N[(N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(4.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 75000000:\\
\;\;\;\;\frac{1}{\frac{\alpha + \left(\beta + 2\right)}{1 + \beta} \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{4 + \left(\beta + \alpha \cdot 2\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 7.5e7Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.8%
+-commutative72.8%
+-commutative72.8%
Simplified72.8%
clear-num72.8%
inv-pow72.8%
+-commutative72.8%
associate-+l+72.8%
+-commutative72.8%
*-commutative72.8%
Applied egg-rr72.8%
unpow-172.8%
associate-/r/72.8%
+-commutative72.8%
+-commutative72.8%
+-commutative72.8%
+-commutative72.8%
+-commutative72.8%
*-commutative72.8%
+-commutative72.8%
+-commutative72.8%
Simplified72.8%
if 7.5e7 < beta Initial program 88.7%
Simplified93.2%
associate-*l/93.4%
+-commutative93.4%
associate-+r+93.4%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
clear-num99.8%
inv-pow99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.8%
Final simplification76.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2e+29) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0)))) (/ (* (+ 1.0 alpha) (/ 1.0 beta)) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2e+29) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / 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.2d+29) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / 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.2e+29) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2e+29: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) * (1.0 / beta)) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2e+29) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / 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.2e+29)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) * (1.0 / 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.2e+29], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $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.2 \cdot 10^{+29}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 4.2000000000000003e29Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.6%
+-commutative72.6%
+-commutative72.6%
Simplified72.6%
expm1-log1p-u72.6%
expm1-udef78.3%
*-commutative78.3%
+-commutative78.3%
associate-+l+78.3%
+-commutative78.3%
Applied egg-rr78.3%
expm1-def72.6%
expm1-log1p72.6%
associate-/l/72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
*-commutative72.6%
+-commutative72.6%
+-commutative72.6%
+-commutative72.6%
+-commutative72.6%
+-commutative72.6%
Simplified72.6%
if 4.2000000000000003e29 < beta Initial program 88.5%
Simplified93.0%
associate-*l/93.2%
+-commutative93.2%
associate-+r+93.2%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.2%
Final simplification76.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))))
(if (<= beta 5e+28)
(/ (/ (+ 1.0 beta) (* (+ beta 3.0) (+ beta 2.0))) t_0)
(/ (* (+ 1.0 alpha) (/ 1.0 beta)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 5e+28) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (beta + 2.0))) / t_0;
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 5d+28) then
tmp = ((1.0d0 + beta) / ((beta + 3.0d0) * (beta + 2.0d0))) / t_0
else
tmp = ((1.0d0 + alpha) * (1.0d0 / beta)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 5e+28) {
tmp = ((1.0 + beta) / ((beta + 3.0) * (beta + 2.0))) / t_0;
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 5e+28: tmp = ((1.0 + beta) / ((beta + 3.0) * (beta + 2.0))) / t_0 else: tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 5e+28) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0))) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / beta)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 5e+28)
tmp = ((1.0 + beta) / ((beta + 3.0) * (beta + 2.0))) / t_0;
else
tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+28], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+28}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 4.99999999999999957e28Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.6%
+-commutative72.6%
+-commutative72.6%
Simplified72.6%
if 4.99999999999999957e28 < beta Initial program 88.5%
Simplified93.0%
associate-*l/93.2%
+-commutative93.2%
associate-+r+93.2%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.2%
Final simplification76.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2e+29) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0))) (/ (* (+ 1.0 alpha) (/ 1.0 beta)) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2e+29) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) * (1.0 / 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.2d+29) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 3.0d0) * (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / 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.2e+29) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2e+29: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.0)) else: tmp = ((1.0 + alpha) * (1.0 / beta)) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2e+29) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / 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.2e+29)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 3.0) * (beta + 2.0));
else
tmp = ((1.0 + alpha) * (1.0 / 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.2e+29], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $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.2 \cdot 10^{+29}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 4.2000000000000003e29Initial program 99.9%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 84.0%
Taylor expanded in alpha around 0 71.9%
+-commutative71.9%
+-commutative71.9%
Simplified71.9%
if 4.2000000000000003e29 < beta Initial program 88.5%
Simplified93.0%
associate-*l/93.2%
+-commutative93.2%
associate-+r+93.2%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.2%
Final simplification75.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))))
(if (<= beta 6.0)
(/ (+ 0.16666666666666666 (* alpha 0.027777777777777776)) t_0)
(/ (* (+ 1.0 alpha) (/ 1.0 beta)) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 6.0) {
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / t_0;
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 6.0d0) then
tmp = (0.16666666666666666d0 + (alpha * 0.027777777777777776d0)) / t_0
else
tmp = ((1.0d0 + alpha) * (1.0d0 / beta)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 6.0) {
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / t_0;
} else {
tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 6.0: tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / t_0 else: tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 6.0) tmp = Float64(Float64(0.16666666666666666 + Float64(alpha * 0.027777777777777776)) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / beta)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 6.0)
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / t_0;
else
tmp = ((1.0 + alpha) * (1.0 / beta)) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.0], N[(N[(0.16666666666666666 + N[(alpha * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.16666666666666666 + \alpha \cdot 0.027777777777777776}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in beta around 0 97.4%
Taylor expanded in alpha around 0 71.3%
*-commutative71.3%
Simplified71.3%
if 6 < beta Initial program 89.1%
Simplified93.4%
associate-*l/93.6%
+-commutative93.6%
associate-+r+93.6%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 81.5%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.2)
(/ 0.16666666666666666 (+ beta (+ alpha 2.0)))
(if (<= beta 1.35e+154)
(/ 1.0 (* beta (+ beta 2.0)))
(* (/ 1.0 beta) (/ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
} else if (beta <= 1.35e+154) {
tmp = 1.0 / (beta * (beta + 2.0));
} else {
tmp = (1.0 / beta) * (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 <= 6.2d0) then
tmp = 0.16666666666666666d0 / (beta + (alpha + 2.0d0))
else if (beta <= 1.35d+154) then
tmp = 1.0d0 / (beta * (beta + 2.0d0))
else
tmp = (1.0d0 / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
} else if (beta <= 1.35e+154) {
tmp = 1.0 / (beta * (beta + 2.0));
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = 0.16666666666666666 / (beta + (alpha + 2.0)) elif beta <= 1.35e+154: tmp = 1.0 / (beta * (beta + 2.0)) else: tmp = (1.0 / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(0.16666666666666666 / Float64(beta + Float64(alpha + 2.0))); elseif (beta <= 1.35e+154) tmp = Float64(1.0 / Float64(beta * Float64(beta + 2.0))); else tmp = Float64(Float64(1.0 / beta) * Float64(alpha / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.2)
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
elseif (beta <= 1.35e+154)
tmp = 1.0 / (beta * (beta + 2.0));
else
tmp = (1.0 / beta) * (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, 6.2], N[(0.16666666666666666 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + \left(\alpha + 2\right)}\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.3%
+-commutative72.3%
+-commutative72.3%
Simplified72.3%
Taylor expanded in beta around 0 71.1%
if 6.20000000000000018 < beta < 1.35000000000000003e154Initial program 92.6%
Simplified94.7%
Taylor expanded in beta around inf 65.5%
Taylor expanded in alpha around 0 63.4%
+-commutative63.4%
Simplified63.4%
if 1.35000000000000003e154 < beta Initial program 85.6%
Simplified92.1%
Taylor expanded in beta around inf 97.6%
Taylor expanded in beta around inf 97.6%
Taylor expanded in alpha around inf 96.4%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.6)
(/ 0.16666666666666666 (+ beta (+ alpha 2.0)))
(if (<= beta 4.5e+159)
(/ (/ 1.0 (+ beta 2.0)) beta)
(* (/ 1.0 beta) (/ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
} else if (beta <= 4.5e+159) {
tmp = (1.0 / (beta + 2.0)) / beta;
} else {
tmp = (1.0 / beta) * (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 <= 6.6d0) then
tmp = 0.16666666666666666d0 / (beta + (alpha + 2.0d0))
else if (beta <= 4.5d+159) then
tmp = (1.0d0 / (beta + 2.0d0)) / beta
else
tmp = (1.0d0 / beta) * (alpha / 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.16666666666666666 / (beta + (alpha + 2.0));
} else if (beta <= 4.5e+159) {
tmp = (1.0 / (beta + 2.0)) / beta;
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6: tmp = 0.16666666666666666 / (beta + (alpha + 2.0)) elif beta <= 4.5e+159: tmp = (1.0 / (beta + 2.0)) / beta else: tmp = (1.0 / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6) tmp = Float64(0.16666666666666666 / Float64(beta + Float64(alpha + 2.0))); elseif (beta <= 4.5e+159) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) / beta); else tmp = Float64(Float64(1.0 / beta) * Float64(alpha / 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.16666666666666666 / (beta + (alpha + 2.0));
elseif (beta <= 4.5e+159)
tmp = (1.0 / (beta + 2.0)) / beta;
else
tmp = (1.0 / beta) * (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, 6.6], N[(0.16666666666666666 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 4.5e+159], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + \left(\alpha + 2\right)}\\
\mathbf{elif}\;\beta \leq 4.5 \cdot 10^{+159}:\\
\;\;\;\;\frac{\frac{1}{\beta + 2}}{\beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.5999999999999996Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.3%
+-commutative72.3%
+-commutative72.3%
Simplified72.3%
Taylor expanded in beta around 0 71.1%
if 6.5999999999999996 < beta < 4.50000000000000026e159Initial program 90.7%
Simplified93.8%
Taylor expanded in beta around inf 64.9%
un-div-inv65.2%
+-commutative65.2%
Applied egg-rr65.2%
Taylor expanded in alpha around 0 64.6%
+-commutative64.6%
Simplified64.6%
if 4.50000000000000026e159 < beta Initial program 87.3%
Simplified93.0%
Taylor expanded in beta around inf 100.0%
Taylor expanded in beta around inf 100.0%
Taylor expanded in alpha around inf 100.0%
Final simplification74.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 7.8)
(/
(+ 0.16666666666666666 (* alpha 0.027777777777777776))
(+ beta (+ alpha 2.0)))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.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 <= 7.8d0) then
tmp = (0.16666666666666666d0 + (alpha * 0.027777777777777776d0)) / (beta + (alpha + 2.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 <= 7.8) {
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.8: tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.8) tmp = Float64(Float64(0.16666666666666666 + Float64(alpha * 0.027777777777777776)) / Float64(beta + Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.8)
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.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, 7.8], N[(N[(0.16666666666666666 + N[(alpha * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8:\\
\;\;\;\;\frac{0.16666666666666666 + \alpha \cdot 0.027777777777777776}{\beta + \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999982Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in beta around 0 97.4%
Taylor expanded in alpha around 0 71.3%
*-commutative71.3%
Simplified71.3%
if 7.79999999999999982 < beta Initial program 89.1%
Simplified93.4%
Taylor expanded in beta around inf 81.4%
un-div-inv81.5%
+-commutative81.5%
Applied egg-rr81.5%
clear-num81.5%
inv-pow81.5%
Applied egg-rr81.5%
unpow-181.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Taylor expanded in beta around inf 81.3%
Final simplification74.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.0)
(/
(+ 0.16666666666666666 (* alpha 0.027777777777777776))
(+ beta (+ alpha 2.0)))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = (0.16666666666666666d0 + (alpha * 0.027777777777777776d0)) / (beta + (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(Float64(0.16666666666666666 + Float64(alpha * 0.027777777777777776)) / Float64(beta + Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = (0.16666666666666666 + (alpha * 0.027777777777777776)) / (beta + (alpha + 2.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(N[(0.16666666666666666 + N[(alpha * 0.027777777777777776), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.16666666666666666 + \alpha \cdot 0.027777777777777776}{\beta + \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in beta around 0 97.4%
Taylor expanded in alpha around 0 71.3%
*-commutative71.3%
Simplified71.3%
if 6 < beta Initial program 89.1%
Simplified93.4%
Taylor expanded in beta around inf 81.4%
associate-*l/81.5%
+-commutative81.5%
Applied egg-rr81.5%
associate-*r/81.5%
*-rgt-identity81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5e+41) (/ 0.16666666666666666 (+ beta 2.0)) (* (/ 1.0 beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5e+41) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) * (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 <= 6.5d+41) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (1.0d0 / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5e+41) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5e+41: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (1.0 / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5e+41) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 / beta) * Float64(alpha / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5e+41)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (1.0 / beta) * (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, 6.5e+41], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5 \cdot 10^{+41}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.49999999999999975e41Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in beta around 0 94.1%
Taylor expanded in alpha around 0 67.4%
+-commutative67.4%
Simplified67.4%
if 6.49999999999999975e41 < beta Initial program 87.8%
Simplified92.7%
Taylor expanded in beta around inf 85.8%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around inf 55.9%
Final simplification64.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.4e+41) (/ 0.16666666666666666 (+ beta (+ alpha 2.0))) (* (/ 1.0 beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4e+41) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
} else {
tmp = (1.0 / beta) * (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 <= 6.4d+41) then
tmp = 0.16666666666666666d0 / (beta + (alpha + 2.0d0))
else
tmp = (1.0d0 / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4e+41) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.4e+41: tmp = 0.16666666666666666 / (beta + (alpha + 2.0)) else: tmp = (1.0 / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.4e+41) tmp = Float64(0.16666666666666666 / Float64(beta + Float64(alpha + 2.0))); else tmp = Float64(Float64(1.0 / beta) * Float64(alpha / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.4e+41)
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
else
tmp = (1.0 / beta) * (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, 6.4e+41], N[(0.16666666666666666 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.4 \cdot 10^{+41}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6.40000000000000019e41Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.0%
+-commutative72.0%
+-commutative72.0%
Simplified72.0%
Taylor expanded in beta around 0 68.1%
if 6.40000000000000019e41 < beta Initial program 87.8%
Simplified92.7%
Taylor expanded in beta around inf 85.8%
Taylor expanded in beta around inf 85.6%
Taylor expanded in alpha around inf 55.9%
Final simplification64.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.0) (/ 0.16666666666666666 (+ beta (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.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 <= 8.0d0) then
tmp = 0.16666666666666666d0 / (beta + (alpha + 2.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 <= 8.0) {
tmp = 0.16666666666666666 / (beta + (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.16666666666666666 / (beta + (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(0.16666666666666666 / Float64(beta + Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.0)
tmp = 0.16666666666666666 / (beta + (alpha + 2.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, 8.0], N[(0.16666666666666666 / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8Initial program 99.9%
Simplified99.4%
associate-*l/99.4%
+-commutative99.4%
associate-+r+99.4%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 72.3%
+-commutative72.3%
+-commutative72.3%
Simplified72.3%
Taylor expanded in beta around 0 71.1%
if 8 < beta Initial program 89.1%
Simplified93.4%
Taylor expanded in beta around inf 81.4%
un-div-inv81.5%
+-commutative81.5%
Applied egg-rr81.5%
clear-num81.5%
inv-pow81.5%
Applied egg-rr81.5%
unpow-181.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Taylor expanded in beta around inf 81.3%
Final simplification74.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ alpha 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (alpha + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (alpha + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(alpha + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (alpha + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\alpha + 2}
\end{array}
Initial program 96.4%
Simplified97.5%
associate-*l/97.5%
+-commutative97.5%
associate-+r+97.5%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 75.6%
+-commutative75.6%
+-commutative75.6%
Simplified75.6%
Taylor expanded in beta around 0 49.7%
Final simplification49.7%
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 96.4%
Simplified97.5%
associate-*l/97.5%
+-commutative97.5%
associate-+r+97.5%
associate-/r*99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in beta around 0 71.0%
Taylor expanded in alpha around 0 49.7%
+-commutative49.7%
Simplified49.7%
Final simplification49.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta}
\end{array}
Initial program 96.4%
Simplified97.5%
Taylor expanded in beta around inf 28.5%
un-div-inv28.6%
+-commutative28.6%
Applied egg-rr28.6%
Taylor expanded in alpha around inf 4.3%
Final simplification4.3%
herbie shell --seed 2024040
(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)))