
(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 beta) t_0) (+ beta (+ alpha 3.0))) (/ (+ 1.0 alpha) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / (beta + (alpha + 3.0d0))) * ((1.0d0 + alpha) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + alpha) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + alpha) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \alpha}{t_0}
\end{array}
\end{array}
Initial program 92.9%
associate-/l/91.6%
associate-/r*83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+r+83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
*-commutative83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
times-frac94.3%
Simplified94.3%
expm1-log1p-u94.3%
expm1-udef72.6%
*-commutative72.6%
+-commutative72.6%
Applied egg-rr72.6%
expm1-def94.3%
expm1-log1p94.3%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.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
(if (<= beta 3.8e+47)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ beta alpha))))
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8e+47) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 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.8d+47) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.8e+47) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.8e+47: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.8e+47) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(beta + alpha)))); 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(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.8e+47)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((1.0 + ((-1.0 - alpha) / beta)) / (beta + (alpha + 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.8e+47], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $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[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.8 \cdot 10^{+47}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 3.8000000000000003e47Initial program 99.3%
associate-/l/98.6%
associate-+l+98.6%
+-commutative98.6%
*-commutative98.6%
associate-+l+98.6%
+-commutative98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 90.7%
Taylor expanded in alpha around 0 77.1%
if 3.8000000000000003e47 < beta Initial program 79.2%
associate-/l/76.6%
associate-/r*58.3%
+-commutative58.3%
associate-+r+58.3%
+-commutative58.3%
associate-+r+58.3%
associate-+r+58.3%
distribute-rgt1-in58.3%
+-commutative58.3%
*-commutative58.3%
distribute-rgt1-in58.3%
+-commutative58.3%
times-frac83.9%
Simplified83.9%
expm1-log1p-u83.9%
expm1-udef50.6%
*-commutative50.6%
+-commutative50.6%
Applied egg-rr50.6%
expm1-def83.9%
expm1-log1p83.9%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 90.2%
mul-1-neg90.2%
unsub-neg90.2%
Simplified90.2%
Final simplification81.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + (alpha + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (((1.0d0 + beta) / (beta + 2.0d0)) / (beta + (alpha + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + (alpha + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + (alpha + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(beta + Float64(alpha + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (((1.0 + beta) / (beta + 2.0)) / (beta + (alpha + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{\frac{1 + \beta}{\beta + 2}}{\beta + \left(\alpha + 3\right)}
\end{array}
Initial program 92.9%
associate-/l/91.6%
associate-/r*83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+r+83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
*-commutative83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
times-frac94.3%
Simplified94.3%
expm1-log1p-u94.3%
expm1-udef72.6%
*-commutative72.6%
+-commutative72.6%
Applied egg-rr72.6%
expm1-def94.3%
expm1-log1p94.3%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 80.3%
Final simplification80.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5e+17) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ beta alpha)))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+17) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d+17) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+17) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5e+17: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5e+17) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5e+17)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5e+17], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5 \cdot 10^{+17}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 2.5e17Initial program 99.3%
associate-/l/98.5%
associate-+l+98.5%
+-commutative98.5%
*-commutative98.5%
associate-+l+98.5%
+-commutative98.5%
+-commutative98.5%
+-commutative98.5%
Simplified98.5%
Taylor expanded in alpha around 0 90.3%
Taylor expanded in alpha around 0 77.2%
if 2.5e17 < beta Initial program 81.0%
Taylor expanded in beta around -inf 88.3%
associate-*r/88.3%
mul-1-neg88.3%
sub-neg88.3%
mul-1-neg88.3%
distribute-neg-in88.3%
+-commutative88.3%
mul-1-neg88.3%
distribute-lft-in88.3%
metadata-eval88.3%
mul-1-neg88.3%
unsub-neg88.3%
Simplified88.3%
Final simplification81.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.5) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (+ 6.0 (* alpha (+ alpha 5.0)))) (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * (alpha + 5.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.5d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / (6.0d0 + (alpha * (alpha + 5.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * (alpha + 5.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.5: tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * (alpha + 5.0))) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(6.0 + Float64(alpha * Float64(alpha + 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.5)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * (alpha + 5.0)));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{6 + \alpha \cdot \left(\alpha + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 7.5Initial program 99.9%
associate-/l/99.1%
associate-/r*95.6%
+-commutative95.6%
associate-+r+95.6%
+-commutative95.6%
associate-+r+95.6%
associate-+r+95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
*-commutative95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
metadata-eval95.6%
associate-+l+95.6%
*-commutative95.6%
metadata-eval95.6%
Simplified95.6%
Taylor expanded in alpha around 0 95.6%
fma-def95.6%
+-commutative95.6%
+-commutative95.6%
+-commutative95.6%
unpow295.6%
distribute-rgt-out95.6%
Simplified95.6%
Taylor expanded in beta around 0 94.6%
associate-/r*98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 7.5 < beta Initial program 81.7%
associate-/l/79.6%
associate-/r*64.5%
+-commutative64.5%
associate-+r+64.5%
+-commutative64.5%
associate-+r+64.5%
associate-+r+64.5%
distribute-rgt1-in64.5%
+-commutative64.5%
*-commutative64.5%
distribute-rgt1-in64.4%
+-commutative64.4%
times-frac86.6%
Simplified86.6%
Taylor expanded in beta around inf 84.1%
Final simplification92.8%
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)) (+ 6.0 (* alpha (+ alpha 5.0)))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * (alpha + 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.5d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / (6.0d0 + (alpha * (alpha + 5.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
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)) / (6.0 + (alpha * (alpha + 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.5: tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * (alpha + 5.0))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) 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 + 2.0)) / Float64(6.0 + Float64(alpha * Float64(alpha + 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); 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)) / (6.0 + (alpha * (alpha + 5.0)));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{6 + \alpha \cdot \left(\alpha + 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.9%
associate-/l/99.1%
associate-/r*95.6%
+-commutative95.6%
associate-+r+95.6%
+-commutative95.6%
associate-+r+95.6%
associate-+r+95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
*-commutative95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
metadata-eval95.6%
associate-+l+95.6%
*-commutative95.6%
metadata-eval95.6%
Simplified95.6%
Taylor expanded in alpha around 0 95.6%
fma-def95.6%
+-commutative95.6%
+-commutative95.6%
+-commutative95.6%
unpow295.6%
distribute-rgt-out95.6%
Simplified95.6%
Taylor expanded in beta around 0 94.6%
associate-/r*98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 5.5 < beta Initial program 81.7%
Taylor expanded in beta around -inf 84.2%
associate-*r/84.2%
mul-1-neg84.2%
sub-neg84.2%
mul-1-neg84.2%
distribute-neg-in84.2%
+-commutative84.2%
mul-1-neg84.2%
distribute-lft-in84.2%
metadata-eval84.2%
mul-1-neg84.2%
unsub-neg84.2%
Simplified84.2%
Final simplification92.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.6d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.0d0 / 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.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.6], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.9%
associate-/l/99.1%
associate-/r*95.5%
+-commutative95.5%
associate-+r+95.5%
+-commutative95.5%
associate-+r+95.5%
associate-+r+95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.1%
Simplified99.1%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 74.9%
Taylor expanded in beta around 0 74.9%
*-commutative74.9%
Simplified74.9%
if 2.60000000000000009 < beta Initial program 81.9%
associate-/l/79.8%
associate-/r*64.8%
+-commutative64.8%
associate-+r+64.8%
+-commutative64.8%
associate-+r+64.8%
associate-+r+64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
*-commutative64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
times-frac86.7%
Simplified86.7%
Taylor expanded in beta around inf 83.3%
Final simplification78.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-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 <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -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 <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -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, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.1%
associate-/r*95.5%
+-commutative95.5%
associate-+r+95.5%
+-commutative95.5%
associate-+r+95.5%
associate-+r+95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.1%
Simplified99.1%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 74.9%
Taylor expanded in beta around 0 74.9%
*-commutative74.9%
Simplified74.9%
if 2.7999999999999998 < beta Initial program 81.9%
associate-/l/79.8%
associate-/r*64.8%
+-commutative64.8%
associate-+r+64.8%
+-commutative64.8%
associate-+r+64.8%
associate-+r+64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
*-commutative64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
times-frac86.7%
Simplified86.7%
Taylor expanded in beta around inf 76.7%
unpow276.7%
Simplified76.7%
Final simplification75.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.25) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.25) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 1.25d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 1.25) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.25: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.25) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 1.25)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 1.25], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.25:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 1.25Initial program 99.9%
associate-/l/99.1%
associate-/r*95.5%
+-commutative95.5%
associate-+r+95.5%
+-commutative95.5%
associate-+r+95.5%
associate-+r+95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
metadata-eval95.5%
associate-+l+95.5%
*-commutative95.5%
metadata-eval95.5%
Simplified95.5%
Taylor expanded in alpha around 0 95.5%
fma-def95.5%
+-commutative95.5%
+-commutative95.5%
+-commutative95.5%
unpow295.5%
distribute-rgt-out95.5%
Simplified95.5%
Taylor expanded in beta around 0 94.6%
associate-/r*98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
Taylor expanded in alpha around 0 74.7%
*-commutative74.7%
Simplified74.7%
if 1.25 < beta Initial program 81.9%
associate-/l/79.8%
associate-/r*64.8%
+-commutative64.8%
associate-+r+64.8%
+-commutative64.8%
associate-+r+64.8%
associate-+r+64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
*-commutative64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
times-frac86.7%
Simplified86.7%
Taylor expanded in beta around 0 17.7%
associate-/r*17.7%
+-commutative17.7%
Simplified17.7%
Taylor expanded in alpha around 0 7.1%
Taylor expanded in beta around inf 7.1%
Final simplification48.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} 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.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); 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.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.1%
associate-/r*95.5%
+-commutative95.5%
associate-+r+95.5%
+-commutative95.5%
associate-+r+95.5%
associate-+r+95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.1%
Simplified99.1%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 74.9%
Taylor expanded in beta around 0 74.9%
*-commutative74.9%
Simplified74.9%
if 2.5 < beta Initial program 81.9%
associate-/l/79.8%
associate-/r*64.8%
+-commutative64.8%
associate-+r+64.8%
+-commutative64.8%
associate-+r+64.8%
associate-+r+64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
*-commutative64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
times-frac86.7%
Simplified86.7%
Taylor expanded in beta around 0 17.7%
associate-/r*17.7%
+-commutative17.7%
Simplified17.7%
Taylor expanded in alpha around 0 7.1%
Taylor expanded in beta around inf 7.1%
Final simplification48.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.1%
associate-/r*95.5%
+-commutative95.5%
associate-+r+95.5%
+-commutative95.5%
associate-+r+95.5%
associate-+r+95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.1%
Simplified99.1%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 74.9%
Taylor expanded in beta around 0 74.9%
*-commutative74.9%
Simplified74.9%
if 2.7999999999999998 < beta Initial program 81.9%
associate-/l/79.8%
associate-/r*64.8%
+-commutative64.8%
associate-+r+64.8%
+-commutative64.8%
associate-+r+64.8%
associate-+r+64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
*-commutative64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
times-frac86.7%
Simplified86.7%
Taylor expanded in beta around inf 76.7%
unpow276.7%
Simplified76.7%
Taylor expanded in alpha around 0 72.8%
unpow272.8%
Simplified72.8%
Final simplification74.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
associate-/l/99.1%
associate-/r*95.5%
+-commutative95.5%
associate-+r+95.5%
+-commutative95.5%
associate-+r+95.5%
associate-+r+95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.1%
Simplified99.1%
Taylor expanded in beta around 0 98.1%
associate-/r*98.9%
+-commutative98.9%
Simplified98.9%
Taylor expanded in alpha around 0 74.6%
Taylor expanded in beta around 0 74.6%
if 2 < beta Initial program 81.9%
associate-/l/79.8%
associate-/r*64.8%
+-commutative64.8%
associate-+r+64.8%
+-commutative64.8%
associate-+r+64.8%
associate-+r+64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
*-commutative64.8%
distribute-rgt1-in64.8%
+-commutative64.8%
times-frac86.7%
Simplified86.7%
Taylor expanded in beta around 0 17.7%
associate-/r*17.7%
+-commutative17.7%
Simplified17.7%
Taylor expanded in alpha around 0 7.1%
Taylor expanded in beta around inf 7.1%
Final simplification48.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 92.9%
associate-/l/91.6%
associate-/r*83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+r+83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
*-commutative83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
times-frac94.3%
Simplified94.3%
Taylor expanded in beta around 0 67.0%
associate-/r*67.5%
+-commutative67.5%
Simplified67.5%
Taylor expanded in alpha around 0 48.5%
Final simplification48.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.0625)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.0625;
}
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.0625d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.0625;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.0625
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.0625 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.0625;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.0625
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.0625
\end{array}
Initial program 92.9%
associate-/l/91.6%
associate-/r*83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+r+83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
*-commutative83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
times-frac94.3%
Simplified94.3%
Taylor expanded in beta around 0 67.1%
Taylor expanded in alpha around 0 61.7%
Taylor expanded in beta around 0 47.9%
*-commutative47.9%
Simplified47.9%
Taylor expanded in beta around inf 12.1%
Final simplification12.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 92.9%
associate-/l/91.6%
associate-/r*83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
associate-+r+83.6%
associate-+r+83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
*-commutative83.6%
distribute-rgt1-in83.6%
+-commutative83.6%
times-frac94.3%
Simplified94.3%
Taylor expanded in beta around 0 67.0%
associate-/r*67.5%
+-commutative67.5%
Simplified67.5%
Taylor expanded in alpha around 0 48.5%
Taylor expanded in beta around 0 47.4%
Final simplification47.4%
herbie shell --seed 2023264
(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)))