
(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
(if (<= beta 3.4e+118)
(/
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (+ 2.0 (+ alpha beta)))
(* (+ (+ alpha beta) 3.0) (+ alpha (+ 2.0 beta))))
(*
(/ (- -1.0 alpha) (* beta (+ (/ (- -2.0 alpha) beta) -1.0)))
(/ (- 1.0 (/ (* 2.0 (+ 2.0 alpha)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.4e+118) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * (alpha + (2.0 + beta)));
} else {
tmp = ((-1.0 - alpha) / (beta * (((-2.0 - alpha) / beta) + -1.0))) * ((1.0 - ((2.0 * (2.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 <= 3.4d+118) then
tmp = (((1.0d0 + beta) * (1.0d0 + alpha)) / (2.0d0 + (alpha + beta))) / (((alpha + beta) + 3.0d0) * (alpha + (2.0d0 + beta)))
else
tmp = (((-1.0d0) - alpha) / (beta * ((((-2.0d0) - alpha) / beta) + (-1.0d0)))) * ((1.0d0 - ((2.0d0 * (2.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 <= 3.4e+118) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * (alpha + (2.0 + beta)));
} else {
tmp = ((-1.0 - alpha) / (beta * (((-2.0 - alpha) / beta) + -1.0))) * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.4e+118: tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * (alpha + (2.0 + beta))) else: tmp = ((-1.0 - alpha) / (beta * (((-2.0 - alpha) / beta) + -1.0))) * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.4e+118) tmp = Float64(Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(2.0 + Float64(alpha + beta))) / Float64(Float64(Float64(alpha + beta) + 3.0) * Float64(alpha + Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(-1.0 - alpha) / Float64(beta * Float64(Float64(Float64(-2.0 - alpha) / beta) + -1.0))) * Float64(Float64(1.0 - Float64(Float64(2.0 * Float64(2.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 <= 3.4e+118)
tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * (alpha + (2.0 + beta)));
else
tmp = ((-1.0 - alpha) / (beta * (((-2.0 - alpha) / beta) + -1.0))) * ((1.0 - ((2.0 * (2.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, 3.4e+118], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / N[(beta * N[(N[(N[(-2.0 - alpha), $MachinePrecision] / beta), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(2.0 * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.4 \cdot 10^{+118}:\\
\;\;\;\;\frac{\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{2 + \left(\alpha + \beta\right)}}{\left(\left(\alpha + \beta\right) + 3\right) \cdot \left(\alpha + \left(2 + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1 - \alpha}{\beta \cdot \left(\frac{-2 - \alpha}{\beta} + -1\right)} \cdot \frac{1 - \frac{2 \cdot \left(2 + \alpha\right)}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.39999999999999986e118Initial program 99.4%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
+-commutative99.2%
associate-+r+99.2%
*-commutative99.2%
associate-+r+99.2%
metadata-eval99.2%
*-un-lft-identity99.2%
+-commutative99.2%
*-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
distribute-rgt1-in99.3%
fma-define99.3%
metadata-eval99.3%
associate-+r+99.2%
Applied egg-rr99.2%
*-lft-identity99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
associate-+r+99.3%
+-commutative99.3%
+-commutative99.3%
Simplified99.3%
if 3.39999999999999986e118 < beta Initial program 64.0%
Simplified51.4%
times-frac86.0%
+-commutative86.0%
Applied egg-rr86.0%
Taylor expanded in beta around inf 94.4%
mul-1-neg94.4%
metadata-eval94.4%
distribute-lft-in94.4%
Simplified94.4%
Taylor expanded in beta around -inf 94.4%
associate-*r*94.4%
mul-1-neg94.4%
sub-neg94.4%
associate-*r/94.4%
distribute-lft-in94.4%
metadata-eval94.4%
mul-1-neg94.4%
unsub-neg94.4%
metadata-eval94.4%
Simplified94.4%
Final simplification98.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))))
(if (<= beta 2e+118)
(/
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (+ 2.0 (+ alpha beta)))
(* (+ (+ alpha beta) 3.0) t_0))
(* (/ (+ 1.0 alpha) t_0) (/ (- 1.0 (/ (* 2.0 alpha) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 2e+118) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.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) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 2d+118) then
tmp = (((1.0d0 + beta) * (1.0d0 + alpha)) / (2.0d0 + (alpha + beta))) / (((alpha + beta) + 3.0d0) * t_0)
else
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 - ((2.0d0 * alpha) / beta)) / beta)
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 <= 2e+118) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * alpha) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 2e+118: tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * t_0) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * alpha) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 2e+118) tmp = Float64(Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(2.0 + Float64(alpha + beta))) / Float64(Float64(Float64(alpha + beta) + 3.0) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 - Float64(Float64(2.0 * alpha) / beta)) / beta)); 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 <= 2e+118)
tmp = (((1.0 + beta) * (1.0 + alpha)) / (2.0 + (alpha + beta))) / (((alpha + beta) + 3.0) * t_0);
else
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.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_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+118], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $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[(N[(1.0 - N[(N[(2.0 * alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $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 2 \cdot 10^{+118}:\\
\;\;\;\;\frac{\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{2 + \left(\alpha + \beta\right)}}{\left(\left(\alpha + \beta\right) + 3\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.99999999999999993e118Initial program 99.4%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
+-commutative99.2%
+-commutative99.2%
+-commutative99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
+-commutative99.2%
associate-+r+99.2%
*-commutative99.2%
associate-+r+99.2%
metadata-eval99.2%
*-un-lft-identity99.2%
+-commutative99.2%
*-commutative99.2%
associate-+r+99.2%
+-commutative99.2%
distribute-rgt1-in99.3%
fma-define99.3%
metadata-eval99.3%
associate-+r+99.2%
Applied egg-rr99.2%
*-lft-identity99.2%
+-commutative99.2%
fma-undefine99.2%
+-commutative99.2%
*-commutative99.2%
+-commutative99.2%
associate-+r+99.2%
distribute-lft1-in99.2%
+-commutative99.2%
+-commutative99.2%
associate-+r+99.3%
+-commutative99.3%
+-commutative99.3%
Simplified99.3%
if 1.99999999999999993e118 < beta Initial program 64.0%
Simplified51.4%
times-frac86.0%
+-commutative86.0%
Applied egg-rr86.0%
Taylor expanded in beta around inf 94.4%
mul-1-neg94.4%
metadata-eval94.4%
distribute-lft-in94.4%
Simplified94.4%
Taylor expanded in alpha around inf 94.4%
Final simplification98.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))) (t_1 (/ (+ 1.0 alpha) t_0)))
(if (<= beta 1.15e+96)
(* t_1 (/ (+ 1.0 beta) (* t_0 (+ alpha (+ beta 3.0)))))
(* t_1 (/ (- 1.0 (/ (* 2.0 alpha) beta)) beta)))))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 <= 1.15e+96) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((2.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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 1.15d+96) then
tmp = t_1 * ((1.0d0 + beta) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = t_1 * ((1.0d0 - ((2.0d0 * alpha) / beta)) / beta)
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 <= 1.15e+96) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((2.0 * alpha) / beta)) / beta);
}
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 <= 1.15e+96: tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = t_1 * ((1.0 - ((2.0 * alpha) / beta)) / beta) 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 <= 1.15e+96) tmp = Float64(t_1 * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(t_1 * Float64(Float64(1.0 - Float64(Float64(2.0 * alpha) / beta)) / beta)); 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 <= 1.15e+96)
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = t_1 * ((1.0 - ((2.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_] := 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, 1.15e+96], N[(t$95$1 * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 - N[(N[(2.0 * alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $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 1.15 \cdot 10^{+96}:\\
\;\;\;\;t\_1 \cdot \frac{1 + \beta}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - \frac{2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.15000000000000008e96Initial program 99.4%
Simplified94.1%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
if 1.15000000000000008e96 < beta Initial program 67.7%
Simplified48.3%
times-frac87.3%
+-commutative87.3%
Applied egg-rr87.3%
Taylor expanded in beta around inf 94.8%
mul-1-neg94.8%
metadata-eval94.8%
distribute-lft-in94.8%
Simplified94.8%
Taylor expanded in alpha around inf 94.8%
Final simplification98.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(/
1.0
(*
t_0
(/ (+ (+ alpha beta) 3.0) (* (+ 1.0 beta) (/ (+ 1.0 alpha) t_0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return 1.0 / (t_0 * (((alpha + beta) + 3.0) / ((1.0 + beta) * ((1.0 + alpha) / 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 = 2.0d0 + (alpha + beta)
code = 1.0d0 / (t_0 * (((alpha + beta) + 3.0d0) / ((1.0d0 + beta) * ((1.0d0 + alpha) / t_0))))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return 1.0 / (t_0 * (((alpha + beta) + 3.0) / ((1.0 + beta) * ((1.0 + alpha) / t_0))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return 1.0 / (t_0 * (((alpha + beta) + 3.0) / ((1.0 + beta) * ((1.0 + alpha) / t_0))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(1.0 / Float64(t_0 * Float64(Float64(Float64(alpha + beta) + 3.0) / Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / t_0))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 1.0 / (t_0 * (((alpha + beta) + 3.0) / ((1.0 + beta) * ((1.0 + alpha) / 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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{1}{t\_0 \cdot \frac{\left(\alpha + \beta\right) + 3}{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{t\_0}}}
\end{array}
\end{array}
Initial program 92.2%
associate-/l/91.7%
+-commutative91.7%
associate-+l+91.7%
*-commutative91.7%
metadata-eval91.7%
associate-+l+91.7%
metadata-eval91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
metadata-eval91.7%
metadata-eval91.7%
associate-+l+91.7%
Simplified91.7%
+-commutative91.7%
associate-+r+91.7%
*-commutative91.7%
associate-+r+91.7%
metadata-eval91.7%
*-un-lft-identity91.7%
+-commutative91.7%
*-commutative91.7%
associate-+r+91.7%
+-commutative91.7%
distribute-rgt1-in91.7%
fma-define91.7%
metadata-eval91.7%
associate-+r+91.7%
Applied egg-rr91.7%
*-lft-identity91.7%
+-commutative91.7%
fma-undefine91.7%
+-commutative91.7%
*-commutative91.7%
+-commutative91.7%
associate-+r+91.7%
distribute-lft1-in91.7%
+-commutative91.7%
+-commutative91.7%
associate-+r+91.7%
+-commutative91.7%
+-commutative91.7%
Simplified91.7%
clear-num91.7%
inv-pow91.7%
*-commutative91.7%
associate-+r+91.7%
associate-/l*96.9%
associate-+r+96.9%
+-commutative96.9%
+-commutative96.9%
Applied egg-rr96.9%
unpow-196.9%
associate-/l*99.4%
associate-+r+99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
associate-+r+99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
Simplified99.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.8e+62)
(/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ (+ alpha beta) 3.0) (+ 2.0 beta)))
(/
(* (+ 1.0 alpha) (/ (- 1.0 (/ (+ (* 2.0 alpha) 4.0) beta)) beta))
(+ alpha (+ 2.0 beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) * ((1.0 - (((2.0 * alpha) + 4.0) / beta)) / beta)) / (alpha + (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 <= 3.8d+62) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / (((alpha + beta) + 3.0d0) * (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) * ((1.0d0 - (((2.0d0 * alpha) + 4.0d0) / beta)) / beta)) / (alpha + (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) * ((1.0 - (((2.0 * alpha) + 4.0) / beta)) / beta)) / (alpha + (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.8e+62: tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta)) else: tmp = ((1.0 + alpha) * ((1.0 - (((2.0 * alpha) + 4.0) / beta)) / beta)) / (alpha + (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.8e+62) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(Float64(alpha + beta) + 3.0) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 - Float64(Float64(Float64(2.0 * alpha) + 4.0) / beta)) / beta)) / Float64(alpha + 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 <= 3.8e+62)
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
else
tmp = ((1.0 + alpha) * ((1.0 - (((2.0 * alpha) + 4.0) / beta)) / beta)) / (alpha + (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, 3.8e+62], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 - N[(N[(N[(2.0 * alpha), $MachinePrecision] + 4.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+62}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\left(\alpha + \beta\right) + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1 - \frac{2 \cdot \alpha + 4}{\beta}}{\beta}}{\alpha + \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 3.79999999999999984e62Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.7%
Simplified99.8%
Taylor expanded in alpha around 0 88.1%
+-commutative88.1%
Simplified88.1%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 3.79999999999999984e62 < beta Initial program 70.1%
Simplified50.1%
times-frac88.8%
+-commutative88.8%
Applied egg-rr88.8%
Taylor expanded in beta around inf 90.6%
mul-1-neg90.6%
metadata-eval90.6%
distribute-lft-in90.6%
Simplified90.6%
associate-*l/90.6%
unsub-neg90.6%
distribute-lft-in90.6%
metadata-eval90.6%
Applied egg-rr90.6%
Final simplification76.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2e+70)
(/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ (+ alpha beta) 3.0) (+ 2.0 beta)))
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(/ (- 1.0 (/ (* 2.0 alpha) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+70) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((2.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 <= 2d+70) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / (((alpha + beta) + 3.0d0) * (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * ((1.0d0 - ((2.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 <= 2e+70) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((2.0 * alpha) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+70: tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((2.0 * alpha) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+70) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(Float64(alpha + beta) + 3.0) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(Float64(1.0 - Float64(Float64(2.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 <= 2e+70)
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * ((1.0 - ((2.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, 2e+70], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(2.0 * alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+70}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\left(\alpha + \beta\right) + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \frac{1 - \frac{2 \cdot \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.00000000000000015e70Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.7%
Simplified99.8%
Taylor expanded in alpha around 0 87.7%
+-commutative87.7%
Simplified87.7%
Taylor expanded in alpha around 0 70.9%
+-commutative70.9%
Simplified70.9%
if 2.00000000000000015e70 < beta Initial program 69.6%
Simplified50.8%
times-frac88.6%
+-commutative88.6%
Applied egg-rr88.6%
Taylor expanded in beta around inf 91.9%
mul-1-neg91.9%
metadata-eval91.9%
distribute-lft-in91.9%
Simplified91.9%
Taylor expanded in alpha around inf 91.9%
Final simplification76.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5e+62) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ (+ alpha beta) 3.0) (+ 2.0 beta))) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) (+ beta (+ 2.0 alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha));
}
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+62) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / (((alpha + beta) + 3.0d0) * (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / (beta + (2.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5e+62: tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5e+62) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(Float64(alpha + beta) + 3.0) * Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / Float64(beta + Float64(2.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5e+62)
tmp = ((1.0 + beta) / (2.0 + beta)) / (((alpha + beta) + 3.0) * (2.0 + beta));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha));
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+62], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+62}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\left(\alpha + \beta\right) + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta + \left(2 + \alpha\right)}\\
\end{array}
\end{array}
if beta < 4.49999999999999999e62Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.7%
Simplified99.8%
Taylor expanded in alpha around 0 88.1%
+-commutative88.1%
Simplified88.1%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 4.49999999999999999e62 < beta Initial program 70.1%
associate-/l/68.5%
+-commutative68.5%
associate-+l+68.5%
*-commutative68.5%
metadata-eval68.5%
associate-+l+68.5%
metadata-eval68.5%
+-commutative68.5%
+-commutative68.5%
+-commutative68.5%
metadata-eval68.5%
metadata-eval68.5%
associate-+l+68.5%
Simplified68.5%
+-commutative68.5%
associate-+r+68.5%
*-commutative68.5%
associate-+r+68.5%
metadata-eval68.5%
*-un-lft-identity68.5%
+-commutative68.5%
*-commutative68.5%
associate-+r+68.5%
+-commutative68.5%
distribute-rgt1-in68.5%
fma-define68.5%
metadata-eval68.5%
associate-+r+68.5%
Applied egg-rr68.5%
*-lft-identity68.5%
+-commutative68.5%
fma-undefine68.5%
+-commutative68.5%
*-commutative68.5%
+-commutative68.5%
associate-+r+68.5%
distribute-lft1-in68.5%
+-commutative68.5%
+-commutative68.5%
associate-+r+68.5%
+-commutative68.5%
+-commutative68.5%
Simplified68.5%
Taylor expanded in beta around inf 85.3%
*-un-lft-identity85.3%
associate-/r*90.7%
associate-+l+90.7%
associate-+r+90.7%
+-commutative90.7%
associate-+r+90.7%
Applied egg-rr90.7%
Final simplification76.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5e+62) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) (+ alpha (+ beta 3.0))) (+ beta (+ 2.0 alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha));
}
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 <= 5d+62) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 3.0d0))) / (beta + (2.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+62: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+62) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 3.0))) / Float64(beta + Float64(2.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5e+62)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 3.0))) / (beta + (2.0 + alpha));
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, 5e+62], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+62}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 3\right)}}{\beta + \left(2 + \alpha\right)}\\
\end{array}
\end{array}
if beta < 5.00000000000000029e62Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.7%
Simplified99.8%
Taylor expanded in alpha around 0 88.1%
+-commutative88.1%
Simplified88.1%
Taylor expanded in alpha around 0 69.9%
if 5.00000000000000029e62 < beta Initial program 70.1%
associate-/l/68.5%
+-commutative68.5%
associate-+l+68.5%
*-commutative68.5%
metadata-eval68.5%
associate-+l+68.5%
metadata-eval68.5%
+-commutative68.5%
+-commutative68.5%
+-commutative68.5%
metadata-eval68.5%
metadata-eval68.5%
associate-+l+68.5%
Simplified68.5%
+-commutative68.5%
associate-+r+68.5%
*-commutative68.5%
associate-+r+68.5%
metadata-eval68.5%
*-un-lft-identity68.5%
+-commutative68.5%
*-commutative68.5%
associate-+r+68.5%
+-commutative68.5%
distribute-rgt1-in68.5%
fma-define68.5%
metadata-eval68.5%
associate-+r+68.5%
Applied egg-rr68.5%
*-lft-identity68.5%
+-commutative68.5%
fma-undefine68.5%
+-commutative68.5%
*-commutative68.5%
+-commutative68.5%
associate-+r+68.5%
distribute-lft1-in68.5%
+-commutative68.5%
+-commutative68.5%
associate-+r+68.5%
+-commutative68.5%
+-commutative68.5%
Simplified68.5%
Taylor expanded in beta around inf 85.3%
*-un-lft-identity85.3%
associate-/r*90.7%
associate-+l+90.7%
associate-+r+90.7%
+-commutative90.7%
associate-+r+90.7%
Applied egg-rr90.7%
Final simplification75.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6e+62) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (* beta (- (/ (- alpha -3.0) beta) -1.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta * (((alpha - -3.0) / beta) - -1.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.6d+62) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta * (((alpha - (-3.0d0)) / beta) - (-1.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta * (((alpha - -3.0) / beta) - -1.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6e+62: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (beta * (((alpha - -3.0) / beta) - -1.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6e+62) tmp = Float64(Float64(Float64(1.0 + beta) / 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(Float64(Float64(alpha - -3.0) / beta) - -1.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6e+62)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (beta * (((alpha - -3.0) / beta) - -1.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.6e+62], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta * N[(N[(N[(alpha - -3.0), $MachinePrecision] / beta), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6 \cdot 10^{+62}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta \cdot \left(\frac{\alpha - -3}{\beta} - -1\right)}\\
\end{array}
\end{array}
if beta < 3.6e62Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.7%
Simplified99.8%
Taylor expanded in alpha around 0 88.1%
+-commutative88.1%
Simplified88.1%
Taylor expanded in alpha around 0 69.9%
if 3.6e62 < beta Initial program 70.1%
Taylor expanded in beta around inf 90.5%
Taylor expanded in beta around -inf 90.5%
associate-*r*90.5%
mul-1-neg90.5%
sub-neg90.5%
associate-*r/90.5%
distribute-lft-in90.5%
metadata-eval90.5%
metadata-eval90.5%
mul-1-neg90.5%
unsub-neg90.5%
metadata-eval90.5%
metadata-eval90.5%
Simplified90.5%
Final simplification75.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.4e+62) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ (+ alpha beta) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.4d+62) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / ((alpha + beta) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4e+62) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.4e+62: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.4e+62) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.4e+62)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.4e+62], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.4 \cdot 10^{+62}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 6.39999999999999968e62Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.7%
Simplified99.8%
Taylor expanded in alpha around 0 88.1%
+-commutative88.1%
Simplified88.1%
Taylor expanded in alpha around 0 69.9%
if 6.39999999999999968e62 < beta Initial program 70.1%
Taylor expanded in beta around inf 90.5%
*-un-lft-identity90.5%
metadata-eval90.5%
associate-+l+90.5%
metadata-eval90.5%
associate-+r+90.5%
Applied egg-rr90.5%
*-lft-identity90.5%
associate-+r+90.5%
Simplified90.5%
Final simplification75.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.1)
(+
0.08333333333333333
(*
alpha
(-
(* alpha (- (* alpha 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ (+ alpha beta) 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * ((alpha * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / ((alpha + beta) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * Float64(Float64(alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * ((alpha * ((alpha * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * N[(N[(alpha * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot \left(\alpha \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.9%
if 2.10000000000000009 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
*-un-lft-identity84.5%
metadata-eval84.5%
associate-+l+84.5%
metadata-eval84.5%
associate-+r+84.5%
Applied egg-rr84.5%
*-lft-identity84.5%
associate-+r+84.5%
Simplified84.5%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.9)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ (+ alpha beta) 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.9d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / ((alpha + beta) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.9: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.9) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(alpha + beta) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.9)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / ((alpha + beta) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.9], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.9:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\alpha + \beta\right) + 3}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.4%
if 1.8999999999999999 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
*-un-lft-identity84.5%
metadata-eval84.5%
associate-+l+84.5%
metadata-eval84.5%
associate-+r+84.5%
Applied egg-rr84.5%
*-lft-identity84.5%
associate-+r+84.5%
Simplified84.5%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.4%
if 2.2000000000000002 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 84.4%
+-commutative84.4%
Simplified84.4%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.1)
(+
0.08333333333333333
(* alpha (- (* alpha -0.011574074074074073) 0.027777777777777776)))
(/ (/ 1.0 beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * ((alpha * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776)) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * Float64(Float64(alpha * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * ((alpha * -0.011574074074074073) - 0.027777777777777776));
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * N[(N[(alpha * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot \left(\alpha \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.4%
if 2.10000000000000009 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 77.4%
*-un-lft-identity77.4%
associate-/r*78.2%
+-commutative78.2%
Applied egg-rr78.2%
*-lft-identity78.2%
Simplified78.2%
Final simplification71.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.3%
*-commutative68.3%
Simplified68.3%
if 2.10000000000000009 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 77.4%
*-un-lft-identity77.4%
associate-/r*78.2%
+-commutative78.2%
Applied egg-rr78.2%
*-lft-identity78.2%
Simplified78.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.95) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.95) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.95d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.95) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.95: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.95) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.95)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.95], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.95:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.94999999999999996Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.3%
*-commutative68.3%
Simplified68.3%
if 1.94999999999999996 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 77.4%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.3%
*-commutative68.3%
Simplified68.3%
if 2.89999999999999991 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 77.4%
Taylor expanded in beta around inf 77.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.5d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.5)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.5], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.3%
*-commutative68.3%
Simplified68.3%
if 3.5 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 77.4%
Taylor expanded in beta around 0 7.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
Simplified95.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in beta around 0 98.0%
Taylor expanded in alpha around 0 68.5%
if 4 < beta Initial program 75.5%
Taylor expanded in beta around inf 84.5%
Taylor expanded in alpha around 0 77.4%
Taylor expanded in beta around 0 7.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.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 92.2%
Simplified83.7%
times-frac96.9%
+-commutative96.9%
Applied egg-rr96.9%
Taylor expanded in beta around 0 75.2%
+-commutative75.2%
Simplified75.2%
Taylor expanded in alpha around 0 49.1%
+-commutative49.1%
Simplified49.1%
Final simplification49.1%
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 92.2%
Simplified83.7%
times-frac96.9%
+-commutative96.9%
Applied egg-rr96.9%
Taylor expanded in beta around 0 75.2%
+-commutative75.2%
Simplified75.2%
Taylor expanded in beta around 0 72.6%
Taylor expanded in alpha around 0 48.1%
herbie shell --seed 2024135
(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)))