
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ 2.0 beta)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (2.0d0 + beta)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \frac{1 + \beta}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 93.7%
Simplified95.2%
associate-*r/95.3%
+-commutative95.3%
Applied egg-rr95.3%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.7%
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 600000000.0)
(* t_1 (/ (+ 1.0 beta) (* (+ alpha (+ beta 3.0)) t_0)))
(* (/ t_1 t_0) (- 1.0 (/ (+ alpha 2.0) 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 <= 600000000.0) {
tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (t_1 / t_0) * (1.0 - ((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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 600000000.0d0) then
tmp = t_1 * ((1.0d0 + beta) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = (t_1 / t_0) * (1.0d0 - ((alpha + 2.0d0) / 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 <= 600000000.0) {
tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (t_1 / t_0) * (1.0 - ((alpha + 2.0) / 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 <= 600000000.0: tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = (t_1 / t_0) * (1.0 - ((alpha + 2.0) / 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 <= 600000000.0) tmp = Float64(t_1 * Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(t_1 / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / 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 <= 600000000.0)
tmp = t_1 * ((1.0 + beta) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = (t_1 / t_0) * (1.0 - ((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_] := 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, 600000000.0], N[(t$95$1 * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
t_1 := \frac{1 + \alpha}{t_0}\\
\mathbf{if}\;\beta \leq 600000000:\\
\;\;\;\;t_1 \cdot \frac{1 + \beta}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 6e8Initial program 99.9%
Simplified99.2%
if 6e8 < beta Initial program 82.0%
Simplified87.7%
associate-*r/87.8%
+-commutative87.8%
Applied egg-rr87.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 88.0%
mul-1-neg88.0%
unsub-neg88.0%
Simplified88.0%
Final simplification95.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 100000000.0)
(/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ 2.0 beta) (+ beta (+ alpha 2.0)))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (- 1.0 (/ (+ alpha 2.0) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double tmp;
if (beta <= 100000000.0) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0))));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((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) :: t_0
real(8) :: tmp
t_0 = alpha + (2.0d0 + beta)
if (beta <= 100000000.0d0) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((2.0d0 + beta) * (beta + (alpha + 2.0d0))))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 - ((alpha + 2.0d0) / 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 <= 100000000.0) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0))));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) tmp = 0 if beta <= 100000000.0: tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0)))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / 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 <= 100000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(Float64(2.0 + beta) * Float64(beta + Float64(alpha + 2.0))))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / 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 <= 100000000.0)
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0))));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((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_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 100000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 100000000:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + \left(\alpha + 2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1e8Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 80.3%
Taylor expanded in alpha around 0 65.2%
add-log-exp80.1%
associate-*r*80.1%
+-commutative80.1%
exp-prod80.1%
+-commutative80.1%
associate-+r+80.1%
+-commutative80.1%
+-commutative80.1%
Applied egg-rr80.1%
log-pow80.1%
+-commutative80.1%
rem-log-exp65.2%
+-commutative65.2%
*-commutative65.2%
+-commutative65.2%
+-commutative65.2%
+-commutative65.2%
Simplified65.2%
if 1e8 < beta Initial program 82.0%
Simplified87.7%
associate-*r/87.8%
+-commutative87.8%
Applied egg-rr87.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 88.0%
mul-1-neg88.0%
unsub-neg88.0%
Simplified88.0%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.5e+23) (/ (+ 1.0 beta) (* (+ beta 3.0) (* (+ 2.0 beta) (+ beta (+ alpha 2.0))))) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5e+23) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0))));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.5d+23) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * ((2.0d0 + beta) * (beta + (alpha + 2.0d0))))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5e+23) {
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0))));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.5e+23: tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0)))) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.5e+23) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(Float64(2.0 + beta) * Float64(beta + Float64(alpha + 2.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(alpha + 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 <= 5.5e+23)
tmp = (1.0 + beta) / ((beta + 3.0) * ((2.0 + beta) * (beta + (alpha + 2.0))));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.5e+23], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+23}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(\left(2 + \beta\right) \cdot \left(\beta + \left(\alpha + 2\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.50000000000000004e23Initial program 99.9%
Simplified92.2%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 66.0%
add-log-exp78.3%
associate-*r*78.3%
+-commutative78.3%
exp-prod78.3%
+-commutative78.3%
associate-+r+78.3%
+-commutative78.3%
+-commutative78.3%
Applied egg-rr78.3%
log-pow78.3%
+-commutative78.3%
rem-log-exp66.0%
+-commutative66.0%
*-commutative66.0%
+-commutative66.0%
+-commutative66.0%
+-commutative66.0%
Simplified66.0%
if 5.50000000000000004e23 < beta Initial program 81.2%
div-inv81.2%
+-commutative81.2%
*-commutative81.2%
associate-+r+81.2%
+-commutative81.2%
associate-+r+81.2%
+-commutative81.2%
+-commutative81.2%
*-commutative81.2%
fma-def81.2%
metadata-eval81.2%
associate-+r+81.2%
metadata-eval81.2%
associate-+r+81.2%
Applied egg-rr81.2%
associate-*l/81.2%
associate-*r/81.2%
*-rgt-identity81.2%
+-commutative81.2%
fma-udef81.2%
distribute-lft1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
+-commutative81.2%
associate-*l/99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 88.1%
Taylor expanded in alpha around 0 88.1%
associate-+r+88.1%
+-commutative88.1%
associate-+r+88.1%
Simplified88.1%
Final simplification73.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.5)
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / (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 <= 5.5d0) then
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((1.0d0 + alpha) / (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 <= 5.5) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.5: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.5)
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((1.0 + alpha) / (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, 5.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.5:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.9%
Simplified99.2%
Taylor expanded in beta around 0 97.5%
+-commutative97.5%
Simplified97.5%
Taylor expanded in alpha around 0 63.4%
*-commutative63.4%
Simplified63.4%
if 5.5 < beta Initial program 82.2%
Simplified87.8%
Taylor expanded in beta around inf 86.2%
un-div-inv86.3%
+-commutative86.3%
+-commutative86.3%
associate-+r+86.3%
Applied egg-rr86.3%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.9)
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.9) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.9d0) then
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.9) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.9: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.9) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.9)
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (alpha + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.9], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.9:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 4.9000000000000004Initial program 99.9%
Simplified99.2%
Taylor expanded in beta around 0 97.5%
+-commutative97.5%
Simplified97.5%
Taylor expanded in alpha around 0 63.4%
*-commutative63.4%
Simplified63.4%
if 4.9000000000000004 < beta Initial program 82.2%
div-inv82.2%
+-commutative82.2%
*-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
+-commutative82.2%
*-commutative82.2%
fma-def82.2%
metadata-eval82.2%
associate-+r+82.2%
metadata-eval82.2%
associate-+r+82.2%
Applied egg-rr82.2%
associate-*l/82.1%
associate-*r/82.2%
*-rgt-identity82.2%
+-commutative82.2%
fma-udef82.2%
distribute-lft1-in82.2%
+-commutative82.2%
*-commutative82.2%
distribute-rgt1-in82.2%
+-commutative82.2%
+-commutative82.2%
associate-*l/99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 86.3%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))))
(if (<= beta 2.8)
(* t_0 (+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ t_0 (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (1.0 + alpha) / (alpha + (2.0 + beta));
double tmp;
if (beta <= 2.8) {
tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = t_0 / (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) :: t_0
real(8) :: tmp
t_0 = (1.0d0 + alpha) / (alpha + (2.0d0 + beta))
if (beta <= 2.8d0) then
tmp = t_0 * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = t_0 / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (1.0 + alpha) / (alpha + (2.0 + beta));
double tmp;
if (beta <= 2.8) {
tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = t_0 / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (1.0 + alpha) / (alpha + (2.0 + beta)) tmp = 0 if beta <= 2.8: tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = t_0 / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) tmp = 0.0 if (beta <= 2.8) tmp = Float64(t_0 * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(t_0 / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (1.0 + alpha) / (alpha + (2.0 + beta));
tmp = 0.0;
if (beta <= 2.8)
tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = t_0 / (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_] := Block[{t$95$0 = N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.8], N[(t$95$0 * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}\\
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;t_0 \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t_0}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
Simplified99.2%
Taylor expanded in beta around 0 97.5%
+-commutative97.5%
Simplified97.5%
Taylor expanded in alpha around 0 63.4%
*-commutative63.4%
Simplified63.4%
if 2.7999999999999998 < beta Initial program 82.2%
div-inv82.2%
+-commutative82.2%
*-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
+-commutative82.2%
*-commutative82.2%
fma-def82.2%
metadata-eval82.2%
associate-+r+82.2%
metadata-eval82.2%
associate-+r+82.2%
Applied egg-rr82.2%
associate-*l/82.1%
associate-*r/82.2%
*-rgt-identity82.2%
+-commutative82.2%
fma-udef82.2%
distribute-lft1-in82.2%
+-commutative82.2%
*-commutative82.2%
distribute-rgt1-in82.2%
+-commutative82.2%
+-commutative82.2%
associate-*l/99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 86.9%
Taylor expanded in alpha around 0 86.9%
associate-+r+86.9%
+-commutative86.9%
associate-+r+86.9%
Simplified86.9%
Final simplification71.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2e+23) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (+ 6.0 (* beta (+ beta 5.0)))) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+23) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (6.0 + (beta * (beta + 5.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.2d+23) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / (6.0d0 + (beta * (beta + 5.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2e+23) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (6.0 + (beta * (beta + 5.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2e+23: tmp = ((1.0 + beta) / (2.0 + beta)) / (6.0 + (beta * (beta + 5.0))) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2e+23) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(6.0 + Float64(beta * Float64(beta + 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(alpha + 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 <= 5.2e+23)
tmp = ((1.0 + beta) / (2.0 + beta)) / (6.0 + (beta * (beta + 5.0)));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.2e+23], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2 \cdot 10^{+23}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{6 + \beta \cdot \left(\beta + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.19999999999999983e23Initial program 99.9%
Simplified99.2%
Taylor expanded in beta around 0 99.3%
Taylor expanded in alpha around 0 65.1%
associate-/r*65.1%
+-commutative65.1%
unpow265.1%
distribute-rgt-out65.1%
Simplified65.1%
if 5.19999999999999983e23 < beta Initial program 81.2%
div-inv81.2%
+-commutative81.2%
*-commutative81.2%
associate-+r+81.2%
+-commutative81.2%
associate-+r+81.2%
+-commutative81.2%
+-commutative81.2%
*-commutative81.2%
fma-def81.2%
metadata-eval81.2%
associate-+r+81.2%
metadata-eval81.2%
associate-+r+81.2%
Applied egg-rr81.2%
associate-*l/81.2%
associate-*r/81.2%
*-rgt-identity81.2%
+-commutative81.2%
fma-udef81.2%
distribute-lft1-in81.2%
+-commutative81.2%
*-commutative81.2%
distribute-rgt1-in81.2%
+-commutative81.2%
+-commutative81.2%
associate-*l/99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 88.1%
Taylor expanded in alpha around 0 88.1%
associate-+r+88.1%
+-commutative88.1%
associate-+r+88.1%
Simplified88.1%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ (+ 1.0 beta) (* (+ 2.0 beta) (+ 6.0 (* beta 5.0)))) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / (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 <= 5.2d0) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((1.0d0 + alpha) / (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 <= 5.2) {
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * 5.0))) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = (1.0 + beta) / ((2.0 + beta) * (6.0 + (beta * 5.0)));
else
tmp = ((1.0 + alpha) / (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, 5.2], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.9%
Simplified92.0%
Taylor expanded in beta around 0 91.3%
Taylor expanded in alpha around 0 63.9%
*-commutative63.9%
Simplified63.9%
if 5.20000000000000018 < beta Initial program 82.2%
Simplified87.8%
Taylor expanded in beta around inf 86.2%
un-div-inv86.3%
+-commutative86.3%
+-commutative86.3%
associate-+r+86.3%
Applied egg-rr86.3%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.2) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / (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.2d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (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.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 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.2)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((1.0 + alpha) / (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.2], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 65.6%
Taylor expanded in beta around 0 64.3%
+-commutative64.3%
Simplified64.3%
if 3.2000000000000002 < beta Initial program 82.2%
Simplified87.8%
Taylor expanded in beta around inf 86.2%
un-div-inv86.3%
+-commutative86.3%
+-commutative86.3%
associate-+r+86.3%
Applied egg-rr86.3%
Final simplification72.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (beta * (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.0 / (beta * (2.0 + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 65.6%
Taylor expanded in beta around 0 64.3%
+-commutative64.3%
Simplified64.3%
if 2.7999999999999998 < beta Initial program 82.2%
Simplified87.8%
Taylor expanded in beta around inf 86.2%
Taylor expanded in alpha around 0 77.0%
Final simplification68.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.45) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.45) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.45d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.45) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.45: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.45) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.45)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.45], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.45:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.4500000000000002Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 65.6%
Taylor expanded in beta around 0 64.3%
+-commutative64.3%
Simplified64.3%
if 2.4500000000000002 < beta Initial program 82.2%
div-inv82.2%
+-commutative82.2%
*-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
+-commutative82.2%
*-commutative82.2%
fma-def82.2%
metadata-eval82.2%
associate-+r+82.2%
metadata-eval82.2%
associate-+r+82.2%
Applied egg-rr82.2%
associate-*l/82.1%
associate-*r/82.2%
*-rgt-identity82.2%
+-commutative82.2%
fma-udef82.2%
distribute-lft1-in82.2%
+-commutative82.2%
*-commutative82.2%
distribute-rgt1-in82.2%
+-commutative82.2%
+-commutative82.2%
associate-*l/99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 86.3%
Taylor expanded in alpha around 0 77.0%
Final simplification68.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ 1.0 (+ 2.0 beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / (2.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.6d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = (1.0d0 / (2.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.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = (1.0 / (2.0 + beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = (1.0 / (2.0 + beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = (1.0 / (2.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.6], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{2 + \beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 65.6%
Taylor expanded in beta around 0 64.3%
+-commutative64.3%
Simplified64.3%
if 2.60000000000000009 < beta Initial program 82.2%
Simplified87.8%
Taylor expanded in beta around inf 86.2%
un-div-inv86.3%
+-commutative86.3%
+-commutative86.3%
associate-+r+86.3%
Applied egg-rr86.3%
Taylor expanded in alpha around 0 77.7%
Final simplification69.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.16666666666666666 / (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 <= 4.2d0) then
tmp = 0.16666666666666666d0 / (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 <= 4.2) {
tmp = 0.16666666666666666 / (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 <= 4.2: tmp = 0.16666666666666666 / (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 <= 4.2) tmp = Float64(0.16666666666666666 / 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 <= 4.2)
tmp = 0.16666666666666666 / (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, 4.2], N[(0.16666666666666666 / N[(alpha + 2.0), $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 4.2:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 65.6%
Taylor expanded in beta around 0 64.3%
+-commutative64.3%
Simplified64.3%
if 4.20000000000000018 < beta Initial program 82.2%
div-inv82.2%
+-commutative82.2%
*-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
associate-+r+82.2%
+-commutative82.2%
+-commutative82.2%
*-commutative82.2%
fma-def82.2%
metadata-eval82.2%
associate-+r+82.2%
metadata-eval82.2%
associate-+r+82.2%
Applied egg-rr82.2%
associate-*l/82.1%
associate-*r/82.2%
*-rgt-identity82.2%
+-commutative82.2%
fma-udef82.2%
distribute-lft1-in82.2%
+-commutative82.2%
*-commutative82.2%
distribute-rgt1-in82.2%
+-commutative82.2%
+-commutative82.2%
associate-*l/99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 86.3%
Taylor expanded in beta around inf 86.1%
Final simplification71.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* 0.16666666666666666 (/ 1.0 (+ 2.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 * (1.0 / (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 * (1.0d0 / (2.0d0 + beta))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 * (1.0 / (2.0 + beta));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 * (1.0 / (2.0 + beta))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 * Float64(1.0 / Float64(2.0 + beta))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 * (1.0 / (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[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666 \cdot \frac{1}{2 + \beta}
\end{array}
Initial program 93.7%
Simplified95.2%
Taylor expanded in beta around 0 70.5%
+-commutative70.5%
Simplified70.5%
Taylor expanded in alpha around 0 43.1%
Taylor expanded in alpha around 0 43.5%
Final simplification43.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
Simplified99.2%
Taylor expanded in beta around 0 97.5%
+-commutative97.5%
Simplified97.5%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in beta around 0 63.3%
if 2 < beta Initial program 82.2%
Simplified87.8%
Taylor expanded in beta around 0 20.7%
+-commutative20.7%
Simplified20.7%
Taylor expanded in alpha around 0 6.9%
Taylor expanded in beta around inf 6.9%
Final simplification43.5%
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 93.7%
Simplified95.2%
Taylor expanded in beta around 0 70.5%
+-commutative70.5%
Simplified70.5%
Taylor expanded in alpha around 0 43.5%
Final simplification43.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 93.7%
Simplified95.2%
Taylor expanded in beta around 0 70.5%
+-commutative70.5%
Simplified70.5%
Taylor expanded in alpha around 0 43.5%
Taylor expanded in beta around 0 42.4%
Final simplification42.4%
herbie shell --seed 2023332
(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)))