
(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 20 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 (+ 2.0 (+ beta alpha))))
(/
(/ (* (+ 1.0 beta) (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))) t_0)
(+ 1.0 t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
return (((1.0 + beta) * ((1.0 + alpha) / (alpha + (beta + 2.0)))) / t_0) / (1.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 = 2.0d0 + (beta + alpha)
code = (((1.0d0 + beta) * ((1.0d0 + alpha) / (alpha + (beta + 2.0d0)))) / t_0) / (1.0d0 + t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
return (((1.0 + beta) * ((1.0 + alpha) / (alpha + (beta + 2.0)))) / t_0) / (1.0 + t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) return (((1.0 + beta) * ((1.0 + alpha) / (alpha + (beta + 2.0)))) / t_0) / (1.0 + t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) return Float64(Float64(Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0)))) / t_0) / Float64(1.0 + t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = (((1.0 + beta) * ((1.0 + alpha) / (alpha + (beta + 2.0)))) / t_0) / (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\frac{\frac{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{\alpha + \left(\beta + 2\right)}}{t\_0}}{1 + t\_0}
\end{array}
\end{array}
Initial program 96.4%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.5)
(/
(/ 1.0 (+ (+ beta alpha) 3.0))
(/ (* (+ alpha 2.0) (+ alpha 2.0)) (+ 1.0 alpha)))
(/
(/ (+ (+ 1.0 alpha) (* (/ (+ alpha 3.0) beta) (- -1.0 alpha))) beta)
(+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = (1.0 / ((beta + alpha) + 3.0)) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha));
} else {
tmp = (((1.0 + alpha) + (((alpha + 3.0) / beta) * (-1.0 - alpha))) / beta) / (alpha + (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 <= 6.5d0) then
tmp = (1.0d0 / ((beta + alpha) + 3.0d0)) / (((alpha + 2.0d0) * (alpha + 2.0d0)) / (1.0d0 + alpha))
else
tmp = (((1.0d0 + alpha) + (((alpha + 3.0d0) / beta) * ((-1.0d0) - alpha))) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = (1.0 / ((beta + alpha) + 3.0)) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha));
} else {
tmp = (((1.0 + alpha) + (((alpha + 3.0) / beta) * (-1.0 - alpha))) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = (1.0 / ((beta + alpha) + 3.0)) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha)) else: tmp = (((1.0 + alpha) + (((alpha + 3.0) / beta) * (-1.0 - alpha))) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(Float64(1.0 / Float64(Float64(beta + alpha) + 3.0)) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) / Float64(1.0 + alpha))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) + Float64(Float64(Float64(alpha + 3.0) / beta) * Float64(-1.0 - alpha))) / beta) / Float64(alpha + 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 <= 6.5)
tmp = (1.0 / ((beta + alpha) + 3.0)) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha));
else
tmp = (((1.0 + alpha) + (((alpha + 3.0) / beta) * (-1.0 - alpha))) / beta) / (alpha + (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, 6.5], N[(N[(1.0 / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(N[(N[(alpha + 3.0), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{\frac{1}{\left(\beta + \alpha\right) + 3}}{\frac{\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)}{1 + \alpha}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \alpha\right) + \frac{\alpha + 3}{\beta} \cdot \left(-1 - \alpha\right)}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Applied egg-rr99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6498.1%
Simplified98.1%
if 6.5 < beta Initial program 89.5%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
+-lowering-+.f6484.1%
Simplified84.1%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
associate-+r+N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
+-lowering-+.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6483.1%
Simplified83.1%
Final simplification93.0%
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 (+ 1.0 alpha))) (+ (+ beta alpha) 3.0)) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / (t_0 / (1.0 + alpha))) / ((beta + alpha) + 3.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 = (((1.0d0 + beta) / (t_0 / (1.0d0 + alpha))) / ((beta + alpha) + 3.0d0)) / 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 / (1.0 + alpha))) / ((beta + alpha) + 3.0)) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / (t_0 / (1.0 + alpha))) / ((beta + alpha) + 3.0)) / 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) / Float64(t_0 / Float64(1.0 + alpha))) / Float64(Float64(beta + alpha) + 3.0)) / 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 / (1.0 + alpha))) / ((beta + alpha) + 3.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[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\frac{1 + \beta}{\frac{t\_0}{1 + \alpha}}}{\left(\beta + \alpha\right) + 3}}{t\_0}
\end{array}
\end{array}
Initial program 96.4%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (* (/ (/ (+ 1.0 alpha) t_0) (+ (+ beta alpha) 3.0)) (/ (+ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) / t_0) / ((beta + alpha) + 3.0)) * ((1.0 + beta) / 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 + alpha) / t_0) / ((beta + alpha) + 3.0d0)) * ((1.0d0 + beta) / 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 + alpha) / t_0) / ((beta + alpha) + 3.0)) * ((1.0 + beta) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + alpha) / t_0) / ((beta + alpha) + 3.0)) * ((1.0 + beta) / 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 + alpha) / t_0) / Float64(Float64(beta + alpha) + 3.0)) * Float64(Float64(1.0 + beta) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + alpha) / t_0) / ((beta + alpha) + 3.0)) * ((1.0 + beta) / 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 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $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 + \alpha}{t\_0}}{\left(\beta + \alpha\right) + 3} \cdot \frac{1 + \beta}{t\_0}
\end{array}
\end{array}
Initial program 96.4%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (* (/ (+ 1.0 alpha) (* t_0 t_0)) (/ (+ 1.0 beta) (+ (+ beta alpha) 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / (t_0 * t_0)) * ((1.0 + beta) / ((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
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = ((1.0d0 + alpha) / (t_0 * t_0)) * ((1.0d0 + beta) / ((beta + alpha) + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / (t_0 * t_0)) * ((1.0 + beta) / ((beta + alpha) + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((1.0 + alpha) / (t_0 * t_0)) * ((1.0 + beta) / ((beta + alpha) + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0)) * Float64(Float64(1.0 + beta) / Float64(Float64(beta + alpha) + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((1.0 + alpha) / (t_0 * t_0)) * ((1.0 + beta) / ((beta + alpha) + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{1 + \alpha}{t\_0 \cdot t\_0} \cdot \frac{1 + \beta}{\left(\beta + \alpha\right) + 3}
\end{array}
\end{array}
Initial program 96.4%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified85.6%
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
Applied egg-rr98.2%
Final simplification98.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 3.0)))
(if (<= beta 19.0)
(/ (/ 1.0 t_0) (/ (* (+ alpha 2.0) (+ alpha 2.0)) (+ 1.0 alpha)))
(/ (/ (+ 1.0 alpha) t_0) (+ alpha (+ beta 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 3.0;
double tmp;
if (beta <= 19.0) {
tmp = (1.0 / t_0) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha));
} else {
tmp = ((1.0 + alpha) / t_0) / (alpha + (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) :: t_0
real(8) :: tmp
t_0 = (beta + alpha) + 3.0d0
if (beta <= 19.0d0) then
tmp = (1.0d0 / t_0) / (((alpha + 2.0d0) * (alpha + 2.0d0)) / (1.0d0 + alpha))
else
tmp = ((1.0d0 + alpha) / t_0) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 3.0;
double tmp;
if (beta <= 19.0) {
tmp = (1.0 / t_0) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha));
} else {
tmp = ((1.0 + alpha) / t_0) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + alpha) + 3.0 tmp = 0 if beta <= 19.0: tmp = (1.0 / t_0) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha)) else: tmp = ((1.0 + alpha) / t_0) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 3.0) tmp = 0.0 if (beta <= 19.0) tmp = Float64(Float64(1.0 / t_0) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) / Float64(1.0 + alpha))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + alpha) + 3.0;
tmp = 0.0;
if (beta <= 19.0)
tmp = (1.0 / t_0) / (((alpha + 2.0) * (alpha + 2.0)) / (1.0 + alpha));
else
tmp = ((1.0 + alpha) / t_0) / (alpha + (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_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]}, If[LessEqual[beta, 19.0], N[(N[(1.0 / t$95$0), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 3\\
\mathbf{if}\;\beta \leq 19:\\
\;\;\;\;\frac{\frac{1}{t\_0}}{\frac{\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)}{1 + \alpha}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 19Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Applied egg-rr99.9%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f6498.1%
Simplified98.1%
if 19 < beta Initial program 89.3%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
+-lowering-+.f6485.0%
Simplified85.0%
Final simplification93.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 0.98) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) (+ (+ beta alpha) 3.0)) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 0.98) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / (alpha + (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 <= 0.98d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (alpha + 2.0d0)) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / ((beta + alpha) + 3.0d0)) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 0.98) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 0.98: tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 0.98) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(beta + alpha) + 3.0)) / Float64(alpha + 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 <= 0.98)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / (alpha + (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, 0.98], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 0.98:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\beta + \alpha\right) + 3}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 0.97999999999999998Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.4%
Simplified92.4%
if 0.97999999999999998 < beta Initial program 89.5%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
+-lowering-+.f6484.1%
Simplified84.1%
Final simplification89.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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 <= 3.5d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (alpha + 2.0d0)) * (alpha + 3.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 <= 3.5) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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 <= 3.5: tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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 <= 3.5) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) * Float64(alpha + 3.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 <= 3.5)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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, 3.5], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $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 3.5:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.4%
Simplified92.4%
if 3.5 < beta Initial program 89.5%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6483.6%
Simplified83.6%
Final simplification89.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) (+ (+ beta alpha) 3.0)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.3d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (alpha + 2.0d0)) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / ((beta + alpha) + 3.0d0)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(beta + alpha) + 3.0)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\beta + \alpha\right) + 3}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Taylor expanded in beta around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f6492.4%
Simplified92.4%
if 3.2999999999999998 < beta Initial program 89.5%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
+-lowering-+.f6484.1%
Simplified84.1%
Taylor expanded in beta around inf
Simplified83.6%
Final simplification89.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ 0.25 (+ 1.0 (+ 2.0 (+ beta alpha)))) (/ (/ (+ 1.0 alpha) (+ (+ beta alpha) 3.0)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.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 <= 4.0d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / ((beta + alpha) + 3.0d0)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.25 / (1.0 + (2.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / ((beta + alpha) + 3.0)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(beta + alpha) + 3.0)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / ((beta + alpha) + 3.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, 4.0], N[(0.25 / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\beta + \alpha\right) + 3}}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
if 4 < beta Initial program 89.5%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
+-lowering-+.f6484.1%
Simplified84.1%
Taylor expanded in beta around inf
Simplified83.6%
Final simplification68.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8) (/ 0.25 (+ 1.0 (+ 2.0 (+ beta alpha)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (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 <= 4.8d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8: tmp = 0.25 / (1.0 + (2.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + 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 <= 4.8)
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (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, 4.8], N[(0.25 / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 4.79999999999999982Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
if 4.79999999999999982 < beta Initial program 89.5%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6483.6%
Simplified83.6%
Final simplification68.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 0.25 (+ 1.0 (+ 2.0 (+ beta alpha)))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
} 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 <= 6.5d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (beta + alpha)))
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 <= 6.5) {
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = 0.25 / (1.0 + (2.0 + (beta + alpha))) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5)
tmp = 0.25 / (1.0 + (2.0 + (beta + alpha)));
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, 6.5], N[(0.25 / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
if 6.5 < beta Initial program 89.5%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified67.7%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6483.1%
Simplified83.1%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6483.4%
Applied egg-rr83.4%
Final simplification68.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
Taylor expanded in beta around 0
+-commutativeN/A
+-lowering-+.f6460.1%
Simplified60.1%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6457.8%
Simplified57.8%
if 2.2000000000000002 < beta Initial program 89.5%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified67.7%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6483.1%
Simplified83.1%
associate-/r*N/A
/-lowering-/.f64N/A
+-commutativeN/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f6483.4%
Applied egg-rr83.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.3d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(0.08333333333333333 + Float64(alpha * -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 <= 3.3)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = (1.0 + alpha) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.3], N[(0.08333333333333333 + N[(alpha * -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 3.3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
Taylor expanded in beta around 0
+-commutativeN/A
+-lowering-+.f6460.1%
Simplified60.1%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6457.8%
Simplified57.8%
if 3.2999999999999998 < beta Initial program 89.5%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified67.7%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6483.1%
Simplified83.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 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 <= 2.2d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 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 <= 2.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(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 <= 2.2)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 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, 2.2], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
Taylor expanded in beta around 0
+-commutativeN/A
+-lowering-+.f6460.1%
Simplified60.1%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6457.8%
Simplified57.8%
if 2.2000000000000002 < beta Initial program 89.5%
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
*-rgt-identityN/A
distribute-lft-inN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
*-lft-identityN/A
distribute-rgt-inN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-+l+N/A
+-lowering-+.f64N/A
+-lowering-+.f6499.8%
Applied egg-rr99.8%
associate-/l/N/A
div-invN/A
associate-*r*N/A
*-commutativeN/A
div-invN/A
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr99.8%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f6483.6%
Simplified83.6%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f6475.8%
Simplified75.8%
Final simplification63.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.2) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.2d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.2)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.2], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
Taylor expanded in beta around 0
+-commutativeN/A
+-lowering-+.f6460.1%
Simplified60.1%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6457.8%
Simplified57.8%
if 3.2000000000000002 < beta Initial program 89.5%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified67.7%
Taylor expanded in beta around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6483.1%
Simplified83.1%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
unpow2N/A
*-lowering-*.f6475.8%
Simplified75.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.6) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.25 / 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.6d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.6: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.6) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.6)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 0.25 / 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.6], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 1.6000000000000001Initial program 99.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.1%
Simplified62.1%
Taylor expanded in beta around 0
Simplified60.9%
Taylor expanded in beta around 0
+-commutativeN/A
+-lowering-+.f6460.1%
Simplified60.1%
Taylor expanded in alpha around 0
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6457.8%
Simplified57.8%
if 1.6000000000000001 < beta Initial program 89.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6478.2%
Simplified78.2%
Taylor expanded in beta around 0
Simplified7.1%
Taylor expanded in beta around inf
/-lowering-/.f646.6%
Simplified6.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) 0.08333333333333333 (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = 0.08333333333333333; else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.08333333333333333;
else
tmp = 0.25 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.0], 0.08333333333333333, N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.8%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified94.7%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6460.5%
Simplified60.5%
Taylor expanded in beta around 0
Simplified58.5%
if 3 < beta Initial program 89.5%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6478.2%
Simplified78.2%
Taylor expanded in beta around 0
Simplified7.1%
Taylor expanded in beta around inf
/-lowering-/.f646.6%
Simplified6.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 96.4%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6467.5%
Simplified67.5%
Taylor expanded in beta around 0
Simplified42.8%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f6441.6%
Simplified41.6%
Final simplification41.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 96.4%
associate-/l/N/A
associate-/l/N/A
/-lowering-/.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-+l+N/A
associate-+r+N/A
distribute-lft1-inN/A
*-commutativeN/A
distribute-lft1-inN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
Simplified85.6%
Taylor expanded in alpha around 0
/-lowering-/.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f6462.7%
Simplified62.7%
Taylor expanded in beta around 0
Simplified40.1%
herbie shell --seed 2024155
(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)))