
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 1.35e+15)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(/
(*
(/ (+ 1.0 alpha) (+ (+ alpha 2.0) beta))
(+ 1.0 (/ (- -1.0 alpha) beta)))
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1.35e+15) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / t_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) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 1.35d+15) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = (((1.0d0 + alpha) / ((alpha + 2.0d0) + beta)) * (1.0d0 + (((-1.0d0) - alpha) / beta))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 1.35e+15) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 1.35e+15: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 1.35e+15) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) + beta)) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 1.35e+15)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / t_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 + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.35e+15], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 1.35 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{t\_0 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\alpha + 2\right) + \beta} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)}{t\_0}\\
\end{array}
\end{array}
if beta < 1.35e15Initial program 99.9%
Simplified99.9%
if 1.35e15 < beta Initial program 80.2%
Simplified85.7%
associate-*l/85.7%
+-commutative85.7%
associate-+r+85.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 89.0%
mul-1-neg89.0%
unsub-neg89.0%
Simplified89.0%
Final simplification96.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.15e+14)
(* (/ 1.0 (+ 2.0 beta)) (/ (+ 1.0 beta) (* (+ beta 3.0) (+ 2.0 beta))))
(/
(*
(/ (+ 1.0 alpha) (+ (+ alpha 2.0) beta))
(+ 1.0 (/ (- -1.0 alpha) beta)))
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+14) {
tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.15d+14) then
tmp = (1.0d0 / (2.0d0 + beta)) * ((1.0d0 + beta) / ((beta + 3.0d0) * (2.0d0 + beta)))
else
tmp = (((1.0d0 + alpha) / ((alpha + 2.0d0) + beta)) * (1.0d0 + (((-1.0d0) - alpha) / beta))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.15e+14) {
tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.15e+14: tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) else: tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.15e+14) tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) * Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) + beta)) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.15e+14)
tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta)));
else
tmp = (((1.0 + alpha) / ((alpha + 2.0) + beta)) * (1.0 + ((-1.0 - alpha) / beta))) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.15e+14], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.15 \cdot 10^{+14}:\\
\;\;\;\;\frac{1}{2 + \beta} \cdot \frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\alpha + 2\right) + \beta} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.15e14Initial program 99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.4%
Taylor expanded in alpha around 0 63.5%
if 1.15e14 < beta Initial program 80.2%
Simplified85.7%
associate-*l/85.7%
+-commutative85.7%
associate-+r+85.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 89.0%
mul-1-neg89.0%
unsub-neg89.0%
Simplified89.0%
Final simplification71.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha 2.0) beta))) (/ (* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) t_0)) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return (((1.0 + alpha) / t_0) * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + 2.0d0) + beta
code = (((1.0d0 + alpha) / t_0) * ((1.0d0 + beta) / t_0)) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 2.0) + beta;
return (((1.0 + alpha) / t_0) * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 2.0) + beta return (((1.0 + alpha) / t_0) * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 2.0) + beta) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / t_0)) / Float64(alpha + Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + 2.0) + beta;
tmp = (((1.0 + alpha) / t_0) * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + 2.0), $MachinePrecision] + beta), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + 2\right) + \beta\\
\frac{\frac{1 + \alpha}{t\_0} \cdot \frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 93.7%
Simplified95.4%
associate-*l/95.4%
+-commutative95.4%
associate-+r+95.4%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*l/99.8%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.05e+16) (* (/ 1.0 (+ 2.0 beta)) (/ (+ 1.0 beta) (* (+ beta 3.0) (+ 2.0 beta)))) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 3.0))) (+ 2.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.05e+16) {
tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.05d+16) then
tmp = (1.0d0 / (2.0d0 + beta)) * ((1.0d0 + beta) / ((beta + 3.0d0) * (2.0d0 + beta)))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 3.0d0))) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.05e+16) {
tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.05e+16: tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta))) else: tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.05e+16) tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) * Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 3.0))) / Float64(2.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.05e+16)
tmp = (1.0 / (2.0 + beta)) * ((1.0 + beta) / ((beta + 3.0) * (2.0 + beta)));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.05e+16], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.05 \cdot 10^{+16}:\\
\;\;\;\;\frac{1}{2 + \beta} \cdot \frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(2 + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 3\right)}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 1.05e16Initial program 99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.6%
Taylor expanded in alpha around 0 63.7%
if 1.05e16 < beta Initial program 79.9%
associate-/l/74.3%
+-commutative74.3%
associate-+l+74.3%
*-commutative74.3%
metadata-eval74.3%
associate-+l+74.3%
metadata-eval74.3%
+-commutative74.3%
metadata-eval74.3%
metadata-eval74.3%
associate-+l+74.3%
Simplified74.3%
Taylor expanded in beta around -inf 84.4%
mul-1-neg84.4%
sub-neg84.4%
mul-1-neg84.4%
distribute-neg-in84.4%
+-commutative84.4%
mul-1-neg84.4%
distribute-lft-in84.4%
metadata-eval84.4%
mul-1-neg84.4%
unsub-neg84.4%
Simplified84.4%
distribute-frac-neg84.4%
add-sqr-sqrt0.0%
sqrt-unprod36.6%
sqr-neg36.6%
sqrt-unprod43.0%
add-sqr-sqrt43.0%
associate-/r*38.1%
add-sqr-sqrt38.1%
sqrt-unprod36.7%
sqr-neg36.7%
sqrt-unprod0.0%
add-sqr-sqrt89.3%
+-commutative89.3%
+-commutative89.3%
Applied egg-rr89.3%
distribute-neg-frac89.3%
sub-neg89.3%
metadata-eval89.3%
distribute-neg-in89.3%
distribute-neg-frac89.3%
distribute-neg-in89.3%
metadata-eval89.3%
sub-neg89.3%
associate-+r+89.3%
+-commutative89.3%
associate-+l+89.3%
+-commutative89.3%
+-commutative89.3%
associate-+l+89.3%
Simplified89.3%
Final simplification71.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.25)
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ 0.16666666666666666 (* beta 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.25) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (beta * 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.25d0) then
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * (0.16666666666666666d0 + (beta * 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.25) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (beta * 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.25: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (beta * 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.25) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(0.16666666666666666 + Float64(beta * 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.25)
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (beta * 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.25], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(beta * 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.25:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \left(0.16666666666666666 + \beta \cdot 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.25Initial program 99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
Taylor expanded in beta around 0 63.2%
if 3.25 < beta Initial program 81.5%
Simplified86.7%
associate-*l/86.7%
+-commutative86.7%
associate-+r+86.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 85.8%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.0)
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.0: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.0)
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 5 < beta Initial program 81.5%
Simplified86.7%
associate-*l/86.7%
+-commutative86.7%
associate-+r+86.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 85.8%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.7)
(*
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ 1.0 alpha) (+ beta (+ alpha 3.0))) (+ 2.0 (+ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.7d0) then
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 3.0d0))) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 3.0))) / Float64(2.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 3.0))) / (2.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.7], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 3\right)}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 2.7000000000000002 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
associate-+l+76.4%
*-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
metadata-eval76.4%
+-commutative76.4%
metadata-eval76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
Taylor expanded in beta around -inf 83.2%
mul-1-neg83.2%
sub-neg83.2%
mul-1-neg83.2%
distribute-neg-in83.2%
+-commutative83.2%
mul-1-neg83.2%
distribute-lft-in83.2%
metadata-eval83.2%
mul-1-neg83.2%
unsub-neg83.2%
Simplified83.2%
distribute-frac-neg83.2%
add-sqr-sqrt0.0%
sqrt-unprod33.8%
sqr-neg33.8%
sqrt-unprod40.8%
add-sqr-sqrt40.8%
associate-/r*35.3%
add-sqr-sqrt35.3%
sqrt-unprod33.9%
sqr-neg33.9%
sqrt-unprod0.0%
add-sqr-sqrt86.6%
+-commutative86.6%
+-commutative86.6%
Applied egg-rr86.6%
distribute-neg-frac86.6%
sub-neg86.6%
metadata-eval86.6%
distribute-neg-in86.6%
distribute-neg-frac86.6%
distribute-neg-in86.6%
metadata-eval86.6%
sub-neg86.6%
associate-+r+86.6%
+-commutative86.6%
associate-+l+86.6%
+-commutative86.6%
+-commutative86.6%
associate-+l+86.6%
Simplified86.6%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.3) (/ 1.0 (/ (+ 2.0 beta) 0.16666666666666666)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.3d0) then
tmp = 1.0d0 / ((2.0d0 + beta) / 0.16666666666666666d0)
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.3: tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.3) tmp = Float64(1.0 / Float64(Float64(2.0 + beta) / 0.16666666666666666)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.3)
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.3], N[(1.0 / N[(N[(2.0 + beta), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.3:\\
\;\;\;\;\frac{1}{\frac{2 + \beta}{0.16666666666666666}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
clear-num63.2%
inv-pow63.2%
Applied egg-rr63.2%
unpow-163.2%
Simplified63.2%
if 5.29999999999999982 < beta Initial program 81.5%
Simplified86.7%
associate-*l/86.7%
+-commutative86.7%
associate-+r+86.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 85.8%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.3) (/ 0.16666666666666666 (+ 2.0 beta)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 / (2.0 + beta);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.3d0) then
tmp = 0.16666666666666666d0 / (2.0d0 + beta)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 / (2.0 + beta);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.3: tmp = 0.16666666666666666 / (2.0 + beta) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.3) tmp = Float64(0.16666666666666666 / Float64(2.0 + beta)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.3)
tmp = 0.16666666666666666 / (2.0 + beta);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.3], N[(0.16666666666666666 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.3:\\
\;\;\;\;\frac{0.16666666666666666}{2 + \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
if 5.29999999999999982 < beta Initial program 81.5%
Simplified86.7%
associate-*l/86.7%
+-commutative86.7%
associate-+r+86.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 85.8%
Taylor expanded in alpha around 0 73.5%
Final simplification66.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.3) (/ 1.0 (/ (+ 2.0 beta) 0.16666666666666666)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.3d0) then
tmp = 1.0d0 / ((2.0d0 + beta) / 0.16666666666666666d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.3: tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.3) tmp = Float64(1.0 / Float64(Float64(2.0 + beta) / 0.16666666666666666)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.3)
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.3], N[(1.0 / N[(N[(2.0 + beta), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.3:\\
\;\;\;\;\frac{1}{\frac{2 + \beta}{0.16666666666666666}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
clear-num63.2%
inv-pow63.2%
Applied egg-rr63.2%
unpow-163.2%
Simplified63.2%
if 5.29999999999999982 < beta Initial program 81.5%
Simplified86.7%
associate-*l/86.7%
+-commutative86.7%
associate-+r+86.7%
associate-/r*99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
associate-+r+99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
Applied egg-rr99.6%
associate-*l/99.5%
associate-*r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 85.8%
Taylor expanded in alpha around 0 73.5%
Final simplification66.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 1.0 (/ (+ 2.0 beta) 0.16666666666666666)) (/ (/ 1.0 (+ 2.0 beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = (1.0 / (2.0 + beta)) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = 1.0d0 / ((2.0d0 + beta) / 0.16666666666666666d0)
else
tmp = (1.0d0 / (2.0d0 + beta)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = (1.0 / (2.0 + beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666) else: tmp = (1.0 / (2.0 + beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(1.0 / Float64(Float64(2.0 + beta) / 0.16666666666666666)); else tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
else
tmp = (1.0 / (2.0 + beta)) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(1.0 / N[(N[(2.0 + beta), $MachinePrecision] / 0.16666666666666666), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{1}{\frac{2 + \beta}{0.16666666666666666}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{2 + \beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
clear-num63.2%
inv-pow63.2%
Applied egg-rr63.2%
unpow-163.2%
Simplified63.2%
if 6 < beta Initial program 81.5%
Simplified86.7%
Taylor expanded in beta around inf 85.7%
un-div-inv85.8%
+-commutative85.8%
+-commutative85.8%
Applied egg-rr85.8%
Taylor expanded in alpha around 0 74.3%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.2) (/ 1.0 (/ (+ 2.0 beta) 0.16666666666666666)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.2) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} 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 <= 8.2d0) then
tmp = 1.0d0 / ((2.0d0 + beta) / 0.16666666666666666d0)
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 <= 8.2) {
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.2: tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.2) tmp = Float64(1.0 / Float64(Float64(2.0 + beta) / 0.16666666666666666)); 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 <= 8.2)
tmp = 1.0 / ((2.0 + beta) / 0.16666666666666666);
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, 8.2], N[(1.0 / N[(N[(2.0 + beta), $MachinePrecision] / 0.16666666666666666), $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 8.2:\\
\;\;\;\;\frac{1}{\frac{2 + \beta}{0.16666666666666666}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8.1999999999999993Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
clear-num63.2%
inv-pow63.2%
Applied egg-rr63.2%
unpow-163.2%
Simplified63.2%
if 8.1999999999999993 < beta Initial program 81.5%
Simplified86.7%
Taylor expanded in beta around inf 85.7%
un-div-inv85.8%
+-commutative85.8%
+-commutative85.8%
Applied egg-rr85.8%
Taylor expanded in beta around inf 85.6%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
Taylor expanded in beta around 0 63.2%
if 2 < beta Initial program 81.5%
Simplified86.7%
Taylor expanded in beta around 0 17.2%
+-commutative17.2%
Simplified17.2%
Taylor expanded in alpha around 0 7.1%
+-commutative7.1%
Simplified7.1%
Taylor expanded in beta around inf 7.1%
Final simplification44.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ 2.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (2.0d0 + beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (2.0 + beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(2.0 + beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (2.0 + beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{2 + \beta}
\end{array}
Initial program 93.7%
Simplified95.4%
Taylor expanded in beta around 0 71.8%
+-commutative71.8%
Simplified71.8%
Taylor expanded in alpha around 0 44.2%
+-commutative44.2%
Simplified44.2%
Final simplification44.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 93.7%
Simplified95.4%
Taylor expanded in beta around 0 71.8%
+-commutative71.8%
Simplified71.8%
Taylor expanded in alpha around 0 44.2%
+-commutative44.2%
Simplified44.2%
Taylor expanded in beta around 0 43.2%
Final simplification43.2%
herbie shell --seed 2024096
(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)))