
(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 11 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)))) (* (/ (+ beta 1.0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) (* t_0 t_0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = ((beta + 1.0d0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / (t_0 * t_0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((beta + 1.0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / (t_0 * t_0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\beta + 1}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0 \cdot t_0}
\end{array}
\end{array}
Initial program 94.8%
associate-/l/94.4%
associate-/l/88.3%
associate-+l+88.3%
+-commutative88.3%
associate-+r+88.3%
associate-+l+88.3%
distribute-rgt1-in88.3%
*-rgt-identity88.3%
distribute-lft-out88.3%
+-commutative88.3%
times-frac98.1%
Simplified98.1%
Final simplification98.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= alpha -2.5e-15)
(/
(+ 1.0 alpha)
(* (+ (* alpha (+ alpha 2.0)) (* 2.0 (+ alpha 2.0))) (+ alpha 3.0)))
(* (/ (+ 1.0 alpha) (* t_0 t_0)) (/ (+ beta 1.0) (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (alpha <= -2.5e-15) {
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (alpha <= (-2.5d-15)) then
tmp = (1.0d0 + alpha) / (((alpha * (alpha + 2.0d0)) + (2.0d0 * (alpha + 2.0d0))) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (t_0 * t_0)) * ((beta + 1.0d0) / (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (alpha <= -2.5e-15) {
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if alpha <= -2.5e-15: tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (alpha <= -2.5e-15) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha * Float64(alpha + 2.0)) + Float64(2.0 * Float64(alpha + 2.0))) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0)) * Float64(Float64(beta + 1.0) / Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (alpha <= -2.5e-15)
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((beta + 1.0) / (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, -2.5e-15], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\alpha \leq -2.5 \cdot 10^{-15}:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha \cdot \left(\alpha + 2\right) + 2 \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot t_0} \cdot \frac{\beta + 1}{\beta + 3}\\
\end{array}
\end{array}
if alpha < -2.5e-15Initial program 99.2%
associate-/l/99.0%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
times-frac99.2%
Simplified99.5%
distribute-lft-in99.5%
Applied egg-rr99.5%
Taylor expanded in beta around 0 95.6%
if -2.5e-15 < alpha Initial program 94.7%
associate-/l/94.3%
associate-/l/88.1%
associate-+l+88.1%
+-commutative88.1%
associate-+r+88.1%
associate-+l+88.1%
distribute-rgt1-in88.1%
*-rgt-identity88.1%
distribute-lft-out88.1%
+-commutative88.1%
times-frac98.1%
Simplified98.1%
Taylor expanded in alpha around 0 83.2%
Final simplification83.4%
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)))) (* (/ (/ (+ beta 1.0) t_0) (* (+ alpha (+ beta 3.0)) t_0)) (+ 1.0 alpha))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0)) * (1.0 + alpha);
}
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 = (((beta + 1.0d0) / t_0) / ((alpha + (beta + 3.0d0)) * t_0)) * (1.0d0 + alpha)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0)) * (1.0 + alpha);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0)) * (1.0 + alpha)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(beta + 1.0) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0)) * Float64(1.0 + alpha)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((beta + 1.0) / t_0) / ((alpha + (beta + 3.0)) * t_0)) * (1.0 + alpha);
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[(beta + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\beta + 1}{t_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0} \cdot \left(1 + \alpha\right)
\end{array}
\end{array}
Initial program 94.8%
associate-/l/94.5%
associate-+l+94.5%
+-commutative94.5%
associate-+r+94.5%
associate-+l+94.5%
distribute-rgt1-in94.5%
*-rgt-identity94.5%
distribute-lft-out94.5%
+-commutative94.5%
associate-*l/98.1%
*-commutative98.1%
associate-*r/95.2%
Simplified95.2%
Final simplification95.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= alpha -2.5e-15)
(/
(+ 1.0 alpha)
(* (+ (* alpha (+ alpha 2.0)) (* 2.0 (+ alpha 2.0))) (+ alpha 3.0)))
(*
(+ 1.0 alpha)
(/
(/ (+ beta 1.0) (+ alpha (+ beta 2.0)))
(* (+ beta 3.0) (+ beta 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= -2.5e-15) {
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
} else {
tmp = (1.0 + alpha) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (alpha <= (-2.5d-15)) then
tmp = (1.0d0 + alpha) / (((alpha * (alpha + 2.0d0)) + (2.0d0 * (alpha + 2.0d0))) * (alpha + 3.0d0))
else
tmp = (1.0d0 + alpha) * (((beta + 1.0d0) / (alpha + (beta + 2.0d0))) / ((beta + 3.0d0) * (beta + 2.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= -2.5e-15) {
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
} else {
tmp = (1.0 + alpha) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= -2.5e-15: tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0)) else: tmp = (1.0 + alpha) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= -2.5e-15) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha * Float64(alpha + 2.0)) + Float64(2.0 * Float64(alpha + 2.0))) * Float64(alpha + 3.0))); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= -2.5e-15)
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
else
tmp = (1.0 + alpha) * (((beta + 1.0) / (alpha + (beta + 2.0))) / ((beta + 3.0) * (beta + 2.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, -2.5e-15], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq -2.5 \cdot 10^{-15}:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha \cdot \left(\alpha + 2\right) + 2 \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{\beta + 1}{\alpha + \left(\beta + 2\right)}}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if alpha < -2.5e-15Initial program 99.2%
associate-/l/99.0%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
times-frac99.2%
Simplified99.5%
distribute-lft-in99.5%
Applied egg-rr99.5%
Taylor expanded in beta around 0 95.6%
if -2.5e-15 < alpha Initial program 94.7%
associate-/l/94.4%
associate-+l+94.4%
+-commutative94.4%
associate-+r+94.4%
associate-+l+94.4%
distribute-rgt1-in94.4%
*-rgt-identity94.4%
distribute-lft-out94.4%
+-commutative94.4%
associate-*l/98.1%
*-commutative98.1%
associate-*r/95.2%
Simplified95.2%
Taylor expanded in alpha around 0 73.6%
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.5e+65)
(/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0))))
(*
(/ (+ 1.0 alpha) beta)
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+65) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / beta) * ((1.0 + ((-1.0 - alpha) / beta)) / (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+65) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (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+65) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / beta) * ((1.0 + ((-1.0 - alpha) / beta)) / (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5e+65: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / beta) * ((1.0 + ((-1.0 - alpha) / beta)) / (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5e+65) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / 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+65)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / beta) * ((1.0 + ((-1.0 - alpha) / beta)) / (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+65], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / 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^{+65}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 2.49999999999999986e65Initial program 98.8%
associate-/l/98.8%
associate-+l+98.8%
+-commutative98.8%
associate-+r+98.8%
associate-+l+98.8%
distribute-rgt1-in98.8%
*-rgt-identity98.8%
distribute-lft-out98.8%
+-commutative98.8%
associate-*r/99.8%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in alpha around 0 82.0%
expm1-log1p-u82.0%
expm1-udef73.9%
+-commutative73.9%
associate-/l/73.9%
Applied egg-rr73.9%
expm1-def82.0%
expm1-log1p82.0%
associate-*r/82.0%
+-commutative82.0%
*-rgt-identity82.0%
+-commutative82.0%
*-commutative82.0%
associate-+r+82.0%
associate-+r+82.0%
Simplified82.0%
Taylor expanded in alpha around 0 67.4%
if 2.49999999999999986e65 < beta Initial program 81.9%
associate-/l/80.5%
associate-+l+80.5%
+-commutative80.5%
associate-+r+80.5%
associate-+l+80.5%
distribute-rgt1-in80.5%
*-rgt-identity80.5%
distribute-lft-out80.5%
+-commutative80.5%
associate-*l/92.8%
*-commutative92.8%
associate-*r/92.8%
Simplified92.8%
Taylor expanded in beta around inf 91.2%
associate-*r/91.2%
distribute-lft-in91.2%
metadata-eval91.2%
mul-1-neg91.2%
unsub-neg91.2%
Simplified91.2%
associate-*r/89.5%
*-commutative89.5%
Applied egg-rr89.5%
times-frac92.0%
+-commutative92.0%
associate-+r+92.0%
+-commutative92.0%
associate-+r+92.0%
+-commutative92.0%
Simplified92.0%
Taylor expanded in beta around inf 92.0%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.0)
(/
(+ 1.0 alpha)
(* (+ (* alpha (+ alpha 2.0)) (* 2.0 (+ alpha 2.0))) (+ alpha 3.0)))
(*
(/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha)))
(/ (+ 1.0 (/ -1.0 beta)) (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * ((1.0 + (-1.0 / beta)) / (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.0d0) then
tmp = (1.0d0 + alpha) / (((alpha * (alpha + 2.0d0)) + (2.0d0 * (alpha + 2.0d0))) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + alpha))) * ((1.0d0 + ((-1.0d0) / beta)) / (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * ((1.0 + (-1.0 / beta)) / (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * ((1.0 + (-1.0 / beta)) / (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha * Float64(alpha + 2.0)) + Float64(2.0 * Float64(alpha + 2.0))) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) * Float64(Float64(1.0 + Float64(-1.0 / beta)) / Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = (1.0 + alpha) / (((alpha * (alpha + 2.0)) + (2.0 * (alpha + 2.0))) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * ((1.0 + (-1.0 / beta)) / (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha \cdot \left(\alpha + 2\right) + 2 \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)} \cdot \frac{1 + \frac{-1}{\beta}}{\beta + 2}\\
\end{array}
\end{array}
if beta < 3Initial program 99.8%
associate-/l/99.7%
associate-/l/95.3%
associate-+l+95.3%
+-commutative95.3%
associate-+r+95.3%
associate-+l+95.3%
distribute-rgt1-in95.2%
*-rgt-identity95.2%
distribute-lft-out95.3%
+-commutative95.3%
times-frac99.7%
Simplified99.7%
distribute-lft-in99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 93.1%
if 3 < beta Initial program 82.1%
associate-/l/80.9%
associate-+l+80.9%
+-commutative80.9%
associate-+r+80.9%
associate-+l+80.9%
distribute-rgt1-in80.9%
*-rgt-identity80.9%
distribute-lft-out80.9%
+-commutative80.9%
associate-*l/93.9%
*-commutative93.9%
associate-*r/93.9%
Simplified93.9%
Taylor expanded in beta around inf 89.7%
associate-*r/89.7%
distribute-lft-in89.7%
metadata-eval89.7%
mul-1-neg89.7%
unsub-neg89.7%
Simplified89.7%
associate-*r/85.6%
*-commutative85.6%
Applied egg-rr85.6%
times-frac87.7%
+-commutative87.7%
associate-+r+87.7%
+-commutative87.7%
associate-+r+87.7%
+-commutative87.7%
Simplified87.7%
Taylor expanded in alpha around 0 87.7%
Final simplification91.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3e+65) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0)))) (* (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+65) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (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 <= 3d+65) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + alpha))) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+65) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3e+65: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+65) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) * 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 <= 3e+65)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (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, 3e+65], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $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 3 \cdot 10^{+65}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 3.0000000000000002e65Initial program 98.8%
associate-/l/98.8%
associate-+l+98.8%
+-commutative98.8%
associate-+r+98.8%
associate-+l+98.8%
distribute-rgt1-in98.8%
*-rgt-identity98.8%
distribute-lft-out98.8%
+-commutative98.8%
associate-*r/99.8%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in alpha around 0 82.0%
expm1-log1p-u82.0%
expm1-udef73.9%
+-commutative73.9%
associate-/l/73.9%
Applied egg-rr73.9%
expm1-def82.0%
expm1-log1p82.0%
associate-*r/82.0%
+-commutative82.0%
*-rgt-identity82.0%
+-commutative82.0%
*-commutative82.0%
associate-+r+82.0%
associate-+r+82.0%
Simplified82.0%
Taylor expanded in alpha around 0 67.4%
if 3.0000000000000002e65 < beta Initial program 81.9%
associate-/l/80.5%
associate-+l+80.5%
+-commutative80.5%
associate-+r+80.5%
associate-+l+80.5%
distribute-rgt1-in80.5%
*-rgt-identity80.5%
distribute-lft-out80.5%
+-commutative80.5%
associate-*l/92.8%
*-commutative92.8%
associate-*r/92.8%
Simplified92.8%
Taylor expanded in beta around inf 91.2%
associate-*r/91.2%
distribute-lft-in91.2%
metadata-eval91.2%
mul-1-neg91.2%
unsub-neg91.2%
Simplified91.2%
associate-*r/89.5%
*-commutative89.5%
Applied egg-rr89.5%
times-frac92.0%
+-commutative92.0%
associate-+r+92.0%
+-commutative92.0%
associate-+r+92.0%
+-commutative92.0%
Simplified92.0%
Taylor expanded in beta around inf 92.2%
Final simplification73.2%
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)) (* (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (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.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + alpha))) * (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.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (1.0 / 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 = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (1.0 / 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(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) * 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.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) * (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.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $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.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*r/99.8%
associate-*r/99.8%
Simplified99.8%
Taylor expanded in alpha around 0 81.8%
Taylor expanded in alpha around 0 67.2%
Taylor expanded in beta around 0 66.3%
*-commutative66.3%
Simplified66.3%
if 2.5 < beta Initial program 82.1%
associate-/l/80.9%
associate-+l+80.9%
+-commutative80.9%
associate-+r+80.9%
associate-+l+80.9%
distribute-rgt1-in80.9%
*-rgt-identity80.9%
distribute-lft-out80.9%
+-commutative80.9%
associate-*l/93.9%
*-commutative93.9%
associate-*r/93.9%
Simplified93.9%
Taylor expanded in beta around inf 89.7%
associate-*r/89.7%
distribute-lft-in89.7%
metadata-eval89.7%
mul-1-neg89.7%
unsub-neg89.7%
Simplified89.7%
associate-*r/85.6%
*-commutative85.6%
Applied egg-rr85.6%
times-frac87.7%
+-commutative87.7%
associate-+r+87.7%
+-commutative87.7%
associate-+r+87.7%
+-commutative87.7%
Simplified87.7%
Taylor expanded in beta around inf 86.9%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.75) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.75) {
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.75d0) 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.75) {
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.75: 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.75) 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.75)
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.75], 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.75:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.75Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*r/99.8%
associate-*r/99.8%
Simplified99.8%
Taylor expanded in alpha around 0 81.8%
Taylor expanded in alpha around 0 67.2%
Taylor expanded in beta around 0 66.3%
*-commutative66.3%
Simplified66.3%
if 2.75 < beta Initial program 82.1%
associate-/l/80.9%
associate-+l+80.9%
+-commutative80.9%
associate-+r+80.9%
associate-+l+80.9%
distribute-rgt1-in80.9%
*-rgt-identity80.9%
distribute-lft-out80.9%
+-commutative80.9%
associate-*l/93.9%
*-commutative93.9%
associate-*r/93.9%
Simplified93.9%
Taylor expanded in beta around inf 89.7%
associate-*r/89.7%
distribute-lft-in89.7%
metadata-eval89.7%
mul-1-neg89.7%
unsub-neg89.7%
Simplified89.7%
Taylor expanded in beta around inf 86.0%
unpow286.0%
Simplified86.0%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.75) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.75) {
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.75d0) 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.75) {
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.75: 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.75) 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.75)
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.75], 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.75:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.75Initial program 99.8%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*r/99.8%
associate-*r/99.8%
Simplified99.8%
Taylor expanded in alpha around 0 81.8%
Taylor expanded in alpha around 0 67.2%
Taylor expanded in beta around 0 66.3%
*-commutative66.3%
Simplified66.3%
if 2.75 < beta Initial program 82.1%
associate-/l/80.9%
associate-+l+80.9%
+-commutative80.9%
associate-+r+80.9%
associate-+l+80.9%
distribute-rgt1-in80.9%
*-rgt-identity80.9%
distribute-lft-out80.9%
+-commutative80.9%
associate-*r/93.9%
associate-*r/84.9%
Simplified84.9%
Taylor expanded in alpha around 0 80.1%
Taylor expanded in beta around inf 85.0%
unpow285.0%
Simplified85.0%
Final simplification71.6%
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 94.8%
associate-/l/94.5%
associate-+l+94.5%
+-commutative94.5%
associate-+r+94.5%
associate-+l+94.5%
distribute-rgt1-in94.5%
*-rgt-identity94.5%
distribute-lft-out94.5%
+-commutative94.5%
associate-*r/98.1%
associate-*r/95.6%
Simplified95.6%
Taylor expanded in alpha around 0 81.3%
Taylor expanded in alpha around 0 70.1%
Taylor expanded in beta around 0 48.2%
Final simplification48.2%
herbie shell --seed 2023238
(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)))