
(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 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(*
(/ (+ 1.0 alpha) t_0)
(/ (log (exp (/ (+ 1.0 beta) t_0))) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / t_0) * (log(exp(((1.0 + beta) / t_0))) / (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 + (beta + 2.0d0)
code = ((1.0d0 + alpha) / t_0) * (log(exp(((1.0d0 + beta) / t_0))) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / t_0) * (Math.log(Math.exp(((1.0 + beta) / t_0))) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((1.0 + alpha) / t_0) * (math.log(math.exp(((1.0 + beta) / t_0))) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(log(exp(Float64(Float64(1.0 + beta) / t_0))) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((1.0 + alpha) / t_0) * (log(exp(((1.0 + beta) / t_0))) / (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[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[Log[N[Exp[N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]], $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(\beta + 2\right)\\
\frac{1 + \alpha}{t\_0} \cdot \frac{\log \left(e^{\frac{1 + \beta}{t\_0}}\right)}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 91.4%
Simplified82.9%
times-frac95.9%
+-commutative95.9%
Applied egg-rr95.9%
+-commutative95.9%
+-commutative95.9%
+-commutative95.9%
+-commutative95.9%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
add-log-exp89.5%
+-commutative89.5%
Applied egg-rr89.5%
Final simplification89.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.2)
(/ (* (+ 1.0 alpha) (/ 1.0 (+ alpha 2.0))) (* (+ alpha 2.0) (+ alpha 3.0)))
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-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 <= 3.2d0) then
tmp = ((1.0d0 + alpha) * (1.0d0 / (alpha + 2.0d0))) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * ((1.0d0 + (((-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 <= 3.2) {
tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(alpha + 2.0))) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / 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 <= 3.2)
tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-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, 3.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
div-inv98.6%
+-commutative98.6%
Applied egg-rr98.6%
if 3.2000000000000002 < beta Initial program 78.4%
Simplified65.1%
times-frac89.7%
+-commutative89.7%
Applied egg-rr89.7%
+-commutative89.7%
+-commutative89.7%
+-commutative89.7%
+-commutative89.7%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 81.3%
associate-*r/81.3%
mul-1-neg81.3%
Simplified81.3%
Final simplification91.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (* (/ (+ 1.0 alpha) t_0) (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / t_0) * (((1.0 + beta) / t_0) / (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 + (beta + 2.0d0)
code = ((1.0d0 + alpha) / t_0) * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / t_0) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((1.0 + alpha) / t_0) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((1.0 + alpha) / t_0) * (((1.0 + beta) / t_0) / (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[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $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(\beta + 2\right)\\
\frac{1 + \alpha}{t\_0} \cdot \frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 91.4%
Simplified82.9%
times-frac95.9%
+-commutative95.9%
Applied egg-rr95.9%
+-commutative95.9%
+-commutative95.9%
+-commutative95.9%
+-commutative95.9%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.6) (/ (* (+ 1.0 alpha) (/ 1.0 (+ alpha 2.0))) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6) {
tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 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 <= 5.6d0) then
tmp = ((1.0d0 + alpha) * (1.0d0 / (alpha + 2.0d0))) / ((alpha + 2.0d0) * (alpha + 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 <= 5.6) {
tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 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 <= 5.6: tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 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 <= 5.6) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(alpha + 2.0))) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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.6)
tmp = ((1.0 + alpha) * (1.0 / (alpha + 2.0))) / ((alpha + 2.0) * (alpha + 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, 5.6], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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.6:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.5999999999999996Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
div-inv98.6%
+-commutative98.6%
Applied egg-rr98.6%
if 5.5999999999999996 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
+-commutative81.5%
associate-+r+81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Final simplification91.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 25.0) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 25.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 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 <= 25.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 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 <= 25.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 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 <= 25.0: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 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 <= 25.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 25.0)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 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, 25.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 25:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 25Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
if 25 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
+-commutative81.5%
associate-+r+81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Final simplification91.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (+ 6.0 (* alpha 5.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.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 <= 2.2d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / (6.0d0 + (alpha * 5.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 <= 2.2) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.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 <= 2.2: tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.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 <= 2.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(6.0 + Float64(alpha * 5.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 2.2)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.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, 2.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 2.2:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{6 + \alpha \cdot 5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 70.2%
*-commutative70.2%
Simplified70.2%
if 2.2000000000000002 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
+-commutative81.5%
associate-+r+81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Final simplification74.7%
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 -0.027777777777777776))
(if (<= beta 1.4e+154)
(/ 1.0 (* beta (+ beta 3.0)))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 1.4e+154) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.9d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else if (beta <= 1.4d+154) then
tmp = 1.0d0 / (beta * (beta + 3.0d0))
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 1.4e+154) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.9: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) elif beta <= 1.4e+154: tmp = 1.0 / (beta * (beta + 3.0)) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.9) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); elseif (beta <= 1.4e+154) tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.9)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
elseif (beta <= 1.4e+154)
tmp = 1.0 / (beta * (beta + 3.0));
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.9], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.4e+154], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.9:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 1.4 \cdot 10^{+154}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 1.8999999999999999 < beta < 1.4e154Initial program 86.8%
Taylor expanded in beta around inf 63.4%
Taylor expanded in alpha around 0 57.1%
+-commutative57.1%
Simplified57.1%
if 1.4e154 < beta Initial program 71.4%
Taylor expanded in beta around inf 96.7%
Taylor expanded in beta around inf 96.7%
Taylor expanded in alpha around inf 95.4%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.85)
(+ 0.08333333333333333 (* alpha -0.027777777777777776))
(if (<= beta 7.5e+154)
(/ (/ 1.0 beta) (+ beta 3.0))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 7.5e+154) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.85d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else if (beta <= 7.5d+154) then
tmp = (1.0d0 / beta) / (beta + 3.0d0)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else if (beta <= 7.5e+154) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.85: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) elif beta <= 7.5e+154: tmp = (1.0 / beta) / (beta + 3.0) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.85) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); elseif (beta <= 7.5e+154) tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.85)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
elseif (beta <= 7.5e+154)
tmp = (1.0 / beta) / (beta + 3.0);
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.85], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 7.5e+154], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.85:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{elif}\;\beta \leq 7.5 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.8500000000000001Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 1.8500000000000001 < beta < 7.5000000000000004e154Initial program 86.8%
Taylor expanded in beta around inf 63.4%
Taylor expanded in alpha around 0 57.1%
associate-/r*57.2%
+-commutative57.2%
Simplified57.2%
if 7.5000000000000004e154 < beta Initial program 71.4%
Taylor expanded in beta around inf 96.7%
Taylor expanded in beta around inf 96.7%
Taylor expanded in alpha around inf 95.4%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.85) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = 0.08333333333333333 + (alpha * -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.85d0) then
tmp = 0.08333333333333333d0 + (alpha * (-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.85) {
tmp = 0.08333333333333333 + (alpha * -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.85: tmp = 0.08333333333333333 + (alpha * -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.85) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 1.85)
tmp = 0.08333333333333333 + (alpha * -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.85], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 1.85:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.8500000000000001Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 1.8500000000000001 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 81.5%
+-commutative81.5%
associate-+r+81.5%
+-commutative81.5%
+-commutative81.5%
+-commutative81.5%
Simplified81.5%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (+ (/ 1.0 beta) (/ alpha beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 / beta) + (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.0d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = ((1.0d0 / beta) + (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.0) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((1.0 / beta) + (alpha / beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = ((1.0 / beta) + (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.0], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 3 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in beta around inf 81.3%
Taylor expanded in alpha around 0 81.3%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 3.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 3.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 3.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 3.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $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 3.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 3.10000000000000009 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in beta around inf 81.3%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.8) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8) {
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.8d0) 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.8) {
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.8: 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.8) 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.8)
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.8], 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.8:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 3.7999999999999998Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in beta around 0 98.7%
Taylor expanded in alpha around 0 68.7%
*-commutative68.7%
Simplified68.7%
if 3.7999999999999998 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 74.3%
+-commutative74.3%
Simplified74.3%
Taylor expanded in beta around 0 6.7%
Final simplification44.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5e+32) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ alpha beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5e+32) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.5d+32) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5e+32) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5e+32: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5e+32) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5e+32)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = (alpha / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.5e+32], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5 \cdot 10^{+32}:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.4999999999999994e32Initial program 99.3%
associate-/l/99.2%
+-commutative99.2%
associate-+l+99.2%
*-commutative99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
associate-+l+99.2%
metadata-eval99.2%
metadata-eval99.2%
associate-+l+99.2%
Simplified99.2%
Taylor expanded in beta around 0 95.4%
Taylor expanded in beta around 0 95.4%
Taylor expanded in alpha around 0 65.9%
*-commutative65.9%
Simplified65.9%
if 6.4999999999999994e32 < beta Initial program 77.9%
Taylor expanded in beta around inf 86.2%
Taylor expanded in beta around inf 86.0%
Taylor expanded in alpha around inf 61.0%
Final simplification64.1%
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%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.6%
Taylor expanded in alpha around 0 68.7%
+-commutative68.7%
+-commutative68.7%
Simplified68.7%
Taylor expanded in beta around 0 68.7%
if 4 < beta Initial program 78.4%
Taylor expanded in beta around inf 81.5%
Taylor expanded in alpha around 0 74.3%
+-commutative74.3%
Simplified74.3%
Taylor expanded in beta around 0 6.7%
Final simplification44.3%
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 91.4%
associate-/l/89.8%
+-commutative89.8%
associate-+l+89.8%
*-commutative89.8%
metadata-eval89.8%
associate-+l+89.8%
metadata-eval89.8%
associate-+l+89.8%
metadata-eval89.8%
metadata-eval89.8%
associate-+l+89.8%
Simplified89.8%
Taylor expanded in beta around 0 83.7%
Taylor expanded in alpha around 0 63.0%
+-commutative63.0%
+-commutative63.0%
Simplified63.0%
Taylor expanded in beta around 0 43.1%
Final simplification43.1%
herbie shell --seed 2024044
(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)))