
(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 23 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) t_0) (+ alpha (+ beta 3.0))) (/ t_0 (+ 1.0 alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) / (t_0 / (1.0 + alpha));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = 2.0d0 + (beta + alpha)
code = (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0))) / (t_0 / (1.0d0 + alpha))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) / (t_0 / (1.0 + alpha));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) / (t_0 / (1.0 + alpha))
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) / t_0) / Float64(alpha + Float64(beta + 3.0))) / Float64(t_0 / Float64(1.0 + alpha))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) / (t_0 / (1.0 + alpha));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\frac{\frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{\frac{t\_0}{1 + \alpha}}
\end{array}
\end{array}
Initial program 94.8%
Simplified97.1%
clear-num97.1%
associate-+r+97.1%
*-commutative97.1%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
*-commutative92.5%
associate-+r+92.5%
Applied egg-rr92.5%
associate-/r*97.2%
associate-/l*93.1%
associate-*l/97.1%
*-commutative97.1%
times-frac99.8%
associate-/r*97.1%
*-commutative97.1%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
clear-num99.8%
+-commutative99.8%
times-frac98.9%
associate-/r*99.9%
Applied egg-rr99.9%
Final simplification99.9%
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 (+ beta 2.0))))
(if (<= beta 1.8e+25)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(/
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) t_0)
(/ (+ 2.0 (+ beta alpha)) (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.8e+25) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / ((2.0 + (beta + alpha)) / (1.0 + 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 1.8d+25) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = ((1.0d0 + (((-1.0d0) - alpha) / beta)) / t_0) / ((2.0d0 + (beta + alpha)) / (1.0d0 + alpha))
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 + (beta + 2.0);
double tmp;
if (beta <= 1.8e+25) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / ((2.0 + (beta + alpha)) / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.8e+25: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / ((2.0 + (beta + alpha)) / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.8e+25) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / t_0) / Float64(Float64(2.0 + Float64(beta + alpha)) / Float64(1.0 + alpha))); 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 + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.8e+25)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / ((2.0 + (beta + alpha)) / (1.0 + alpha));
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[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.8e+25], 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[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{+25}:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{t\_0 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \frac{-1 - \alpha}{\beta}}{t\_0}}{\frac{2 + \left(\beta + \alpha\right)}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 1.80000000000000008e25Initial program 99.9%
Simplified99.4%
if 1.80000000000000008e25 < beta Initial program 83.6%
Simplified92.0%
clear-num92.0%
associate-+r+92.0%
*-commutative92.0%
frac-times77.0%
*-un-lft-identity77.0%
+-commutative77.0%
*-commutative77.0%
associate-+r+77.0%
Applied egg-rr77.0%
associate-/r*92.1%
associate-/l*79.1%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*92.0%
*-commutative92.0%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.7%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 85.4%
associate-*r/84.9%
neg-mul-184.9%
distribute-neg-in84.9%
metadata-eval84.9%
unsub-neg84.9%
Simplified85.4%
Final simplification95.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))))
(if (<= beta 5e+14)
(/ (/ (/ (+ 1.0 beta) (+ 2.0 (+ beta alpha))) t_0) (+ beta 2.0))
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(/ (+ 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 tmp;
if (beta <= 5e+14) {
tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((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) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 5d+14) then
tmp = (((1.0d0 + beta) / (2.0d0 + (beta + alpha))) / t_0) / (beta + 2.0d0)
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * ((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 tmp;
if (beta <= 5e+14) {
tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((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) tmp = 0 if beta <= 5e+14: tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((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)) tmp = 0.0 if (beta <= 5e+14) tmp = Float64(Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + Float64(beta + alpha))) / t_0) / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 5e+14)
tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0);
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * ((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]}, If[LessEqual[beta, 5e+14], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\frac{1 + \beta}{2 + \left(\beta + \alpha\right)}}{t\_0}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 5e14Initial program 99.9%
Simplified99.4%
clear-num99.4%
associate-+r+99.4%
*-commutative99.4%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
associate-/r*99.4%
associate-/l*99.4%
associate-*l/99.4%
*-commutative99.4%
times-frac99.9%
associate-/r*99.4%
*-commutative99.4%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
clear-num99.9%
+-commutative99.9%
times-frac99.9%
associate-/r*99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 81.2%
if 5e14 < beta Initial program 84.4%
Simplified92.3%
clear-num92.3%
associate-+r+92.3%
*-commutative92.3%
frac-times78.0%
*-un-lft-identity78.0%
+-commutative78.0%
*-commutative78.0%
associate-+r+78.0%
Applied egg-rr78.0%
associate-/r*92.5%
associate-/l*80.1%
associate-*l/92.4%
*-commutative92.4%
times-frac99.6%
associate-/r*92.3%
*-commutative92.3%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around inf 82.2%
associate-*r/82.2%
distribute-lft-in82.2%
metadata-eval82.2%
neg-mul-182.2%
unsub-neg82.2%
Simplified82.2%
Final simplification81.5%
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))) (t_1 (+ alpha (+ beta 3.0))))
(if (<= beta 1750000000000.0)
(/ (/ (/ (+ 1.0 beta) t_0) t_1) (+ beta 2.0))
(/ (/ (+ 1.0 (/ (- -1.0 alpha) beta)) t_1) (/ t_0 (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 3.0);
double tmp;
if (beta <= 1750000000000.0) {
tmp = (((1.0 + beta) / t_0) / t_1) / (beta + 2.0);
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_1) / (t_0 / (1.0 + 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = 2.0d0 + (beta + alpha)
t_1 = alpha + (beta + 3.0d0)
if (beta <= 1750000000000.0d0) then
tmp = (((1.0d0 + beta) / t_0) / t_1) / (beta + 2.0d0)
else
tmp = ((1.0d0 + (((-1.0d0) - alpha) / beta)) / t_1) / (t_0 / (1.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = alpha + (beta + 3.0);
double tmp;
if (beta <= 1750000000000.0) {
tmp = (((1.0 + beta) / t_0) / t_1) / (beta + 2.0);
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_1) / (t_0 / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) t_1 = alpha + (beta + 3.0) tmp = 0 if beta <= 1750000000000.0: tmp = (((1.0 + beta) / t_0) / t_1) / (beta + 2.0) else: tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_1) / (t_0 / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 1750000000000.0) tmp = Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / t_1) / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / t_1) / Float64(t_0 / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
t_1 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 1750000000000.0)
tmp = (((1.0 + beta) / t_0) / t_1) / (beta + 2.0);
else
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_1) / (t_0 / (1.0 + alpha));
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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1750000000000.0], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / N[(t$95$0 / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 1750000000000:\\
\;\;\;\;\frac{\frac{\frac{1 + \beta}{t\_0}}{t\_1}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \frac{-1 - \alpha}{\beta}}{t\_1}}{\frac{t\_0}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 1.75e12Initial program 99.9%
Simplified99.4%
clear-num99.4%
associate-+r+99.4%
*-commutative99.4%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
associate-/r*99.4%
associate-/l*99.4%
associate-*l/99.4%
*-commutative99.4%
times-frac99.9%
associate-/r*99.4%
*-commutative99.4%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
clear-num99.9%
+-commutative99.9%
times-frac99.9%
associate-/r*99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 80.9%
if 1.75e12 < beta Initial program 84.7%
Simplified92.5%
clear-num92.5%
associate-+r+92.5%
*-commutative92.5%
frac-times78.5%
*-un-lft-identity78.5%
+-commutative78.5%
*-commutative78.5%
associate-+r+78.5%
Applied egg-rr78.5%
associate-/r*92.6%
associate-/l*80.5%
associate-*l/92.6%
*-commutative92.6%
times-frac99.6%
associate-/r*92.5%
*-commutative92.5%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.9%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 81.7%
associate-*r/80.6%
neg-mul-180.6%
distribute-neg-in80.6%
metadata-eval80.6%
unsub-neg80.6%
Simplified81.7%
Final simplification81.2%
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) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t\_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified97.1%
clear-num97.1%
associate-+r+97.1%
*-commutative97.1%
frac-times92.5%
*-un-lft-identity92.5%
+-commutative92.5%
*-commutative92.5%
associate-+r+92.5%
Applied egg-rr92.5%
associate-/r*97.2%
associate-/l*93.1%
associate-*l/97.1%
*-commutative97.1%
times-frac99.8%
associate-/r*97.1%
*-commutative97.1%
associate-/r*99.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 2.5e+17)
(/
(/ (+ 1.0 beta) (+ beta 2.0))
(* (+ alpha (+ beta 2.0)) (+ 3.0 (+ beta alpha))))
(/
(/ 1.0 (+ alpha (+ beta 3.0)))
(/ (+ 2.0 (+ beta alpha)) (+ 1.0 alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+17) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d+17) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((alpha + (beta + 2.0d0)) * (3.0d0 + (beta + alpha)))
else
tmp = (1.0d0 / (alpha + (beta + 3.0d0))) / ((2.0d0 + (beta + alpha)) / (1.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+17) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5e+17: tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha))) else: tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5e+17) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(1.0 / Float64(alpha + Float64(beta + 3.0))) / Float64(Float64(2.0 + Float64(beta + alpha)) / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5e+17)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
else
tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5e+17], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5 \cdot 10^{+17}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\alpha + \left(\beta + 3\right)}}{\frac{2 + \left(\beta + \alpha\right)}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 2.5e17Initial program 99.9%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 80.3%
if 2.5e17 < beta Initial program 84.0%
Simplified92.2%
clear-num92.2%
associate-+r+92.2%
*-commutative92.2%
frac-times77.5%
*-un-lft-identity77.5%
+-commutative77.5%
*-commutative77.5%
associate-+r+77.5%
Applied egg-rr77.5%
associate-/r*92.3%
associate-/l*79.6%
associate-*l/92.3%
*-commutative92.3%
times-frac99.6%
associate-/r*92.2%
*-commutative92.2%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.7%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.4%
Final simplification81.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.7e+20)
(/
(/ (+ 1.0 beta) (+ beta 2.0))
(* (+ alpha (+ beta 2.0)) (+ 3.0 (+ beta alpha))))
(/
(/ (+ 1.0 (/ (- -1.0 alpha) beta)) (+ alpha (+ beta 3.0)))
(/ beta (+ 1.0 alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7e+20) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0))) / (beta / (1.0 + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.7d+20) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((alpha + (beta + 2.0d0)) * (3.0d0 + (beta + alpha)))
else
tmp = ((1.0d0 + (((-1.0d0) - alpha) / beta)) / (alpha + (beta + 3.0d0))) / (beta / (1.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7e+20) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0))) / (beta / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7e+20: tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha))) else: tmp = ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0))) / (beta / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7e+20) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / Float64(alpha + Float64(beta + 3.0))) / Float64(beta / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7e+20)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * (3.0 + (beta + alpha)));
else
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / (alpha + (beta + 3.0))) / (beta / (1.0 + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.7e+20], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7 \cdot 10^{+20}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \frac{-1 - \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}}{\frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 2.7e20Initial program 99.9%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 80.3%
if 2.7e20 < beta Initial program 84.0%
Simplified92.2%
clear-num92.2%
associate-+r+92.2%
*-commutative92.2%
frac-times77.5%
*-un-lft-identity77.5%
+-commutative77.5%
*-commutative77.5%
associate-+r+77.5%
Applied egg-rr77.5%
associate-/r*92.3%
associate-/l*79.6%
associate-*l/92.3%
*-commutative92.3%
times-frac99.6%
associate-/r*92.2%
*-commutative92.2%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.7%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 93.3%
Taylor expanded in beta around inf 83.5%
associate-*r/83.5%
neg-mul-183.5%
distribute-neg-in83.5%
metadata-eval83.5%
unsub-neg83.5%
Simplified83.5%
Final simplification81.3%
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))))
(if (<= beta 2.9e+21)
(/ (/ (/ (+ 1.0 beta) (+ 2.0 (+ beta alpha))) t_0) (+ beta 2.0))
(/ (/ (+ 1.0 (/ (- -1.0 alpha) beta)) t_0) (/ beta (+ 1.0 alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 2.9e+21) {
tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0);
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / (beta / (1.0 + 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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 2.9d+21) then
tmp = (((1.0d0 + beta) / (2.0d0 + (beta + alpha))) / t_0) / (beta + 2.0d0)
else
tmp = ((1.0d0 + (((-1.0d0) - alpha) / beta)) / t_0) / (beta / (1.0d0 + alpha))
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 tmp;
if (beta <= 2.9e+21) {
tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0);
} else {
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / (beta / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 2.9e+21: tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0) else: tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / (beta / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 2.9e+21) tmp = Float64(Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + Float64(beta + alpha))) / t_0) / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / t_0) / Float64(beta / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 2.9e+21)
tmp = (((1.0 + beta) / (2.0 + (beta + alpha))) / t_0) / (beta + 2.0);
else
tmp = ((1.0 + ((-1.0 - alpha) / beta)) / t_0) / (beta / (1.0 + alpha));
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]}, If[LessEqual[beta, 2.9e+21], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 2.9 \cdot 10^{+21}:\\
\;\;\;\;\frac{\frac{\frac{1 + \beta}{2 + \left(\beta + \alpha\right)}}{t\_0}}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \frac{-1 - \alpha}{\beta}}{t\_0}}{\frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 2.9e21Initial program 99.9%
Simplified99.4%
clear-num99.4%
associate-+r+99.4%
*-commutative99.4%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
*-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
associate-/r*99.4%
associate-/l*99.4%
associate-*l/99.4%
*-commutative99.4%
times-frac99.9%
associate-/r*99.4%
*-commutative99.4%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
clear-num99.9%
+-commutative99.9%
times-frac99.9%
associate-/r*99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 80.5%
if 2.9e21 < beta Initial program 83.8%
Simplified92.1%
clear-num92.1%
associate-+r+92.1%
*-commutative92.1%
frac-times77.2%
*-un-lft-identity77.2%
+-commutative77.2%
*-commutative77.2%
associate-+r+77.2%
Applied egg-rr77.2%
associate-/r*92.2%
associate-/l*79.3%
associate-*l/92.2%
*-commutative92.2%
times-frac99.6%
associate-/r*92.1%
*-commutative92.1%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.7%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 93.3%
Taylor expanded in beta around inf 84.5%
associate-*r/84.5%
neg-mul-184.5%
distribute-neg-in84.5%
metadata-eval84.5%
unsub-neg84.5%
Simplified84.5%
Final simplification81.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3e+16) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ 1.0 (/ (+ 2.0 (+ beta alpha)) (+ 1.0 alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3e+16) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 / ((2.0 + (beta + alpha)) / (1.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.3d+16) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (1.0d0 / ((2.0d0 + (beta + alpha)) / (1.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.3e+16) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 / ((2.0 + (beta + alpha)) / (1.0 + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3e+16: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0))) else: tmp = (1.0 / ((2.0 + (beta + alpha)) / (1.0 + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 / Float64(Float64(2.0 + Float64(beta + alpha)) / Float64(1.0 + alpha))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.3e+16)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = (1.0 / ((2.0 + (beta + alpha)) / (1.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.3e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\frac{2 + \left(\beta + \alpha\right)}{1 + \alpha}}}{\beta}\\
\end{array}
\end{array}
if beta < 2.3e16Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 78.1%
Taylor expanded in alpha around 0 64.7%
if 2.3e16 < beta Initial program 84.0%
Simplified92.2%
Taylor expanded in beta around inf 83.6%
un-div-inv83.7%
+-commutative83.7%
associate-+r+83.7%
+-commutative83.7%
+-commutative83.7%
Applied egg-rr83.7%
clear-num83.7%
inv-pow83.7%
Applied egg-rr83.7%
unpow-183.7%
+-commutative83.7%
Simplified83.7%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.36e+16)
(/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))))
(/
(/ 1.0 (+ alpha (+ beta 3.0)))
(/ (+ 2.0 (+ beta alpha)) (+ 1.0 alpha)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.36e+16) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + 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 <= 1.36d+16) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (1.0d0 / (alpha + (beta + 3.0d0))) / ((2.0d0 + (beta + alpha)) / (1.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.36e+16) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.36e+16: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0))) else: tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.36e+16) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 / Float64(alpha + Float64(beta + 3.0))) / Float64(Float64(2.0 + Float64(beta + alpha)) / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.36e+16)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = (1.0 / (alpha + (beta + 3.0))) / ((2.0 + (beta + alpha)) / (1.0 + 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, 1.36e+16], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.36 \cdot 10^{+16}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\alpha + \left(\beta + 3\right)}}{\frac{2 + \left(\beta + \alpha\right)}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 1.36e16Initial program 99.9%
Simplified92.0%
Taylor expanded in alpha around 0 78.1%
Taylor expanded in alpha around 0 64.7%
if 1.36e16 < beta Initial program 84.0%
Simplified92.2%
clear-num92.2%
associate-+r+92.2%
*-commutative92.2%
frac-times77.5%
*-un-lft-identity77.5%
+-commutative77.5%
*-commutative77.5%
associate-+r+77.5%
Applied egg-rr77.5%
associate-/r*92.3%
associate-/l*79.6%
associate-*l/92.3%
*-commutative92.3%
times-frac99.6%
associate-/r*92.2%
*-commutative92.2%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.7%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 84.4%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.6)
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.6) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha - -1.0) / 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 <= 4.6d0) then
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((alpha - (-1.0d0)) / 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 <= 4.6) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.6: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.6) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 <= 4.6)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((alpha - -1.0) / 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, 4.6], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $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 4.6:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5999999999999996Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 4.5999999999999996 < beta Initial program 84.7%
Taylor expanded in beta around -inf 80.9%
expm1-log1p-u80.9%
expm1-udef51.7%
mul-1-neg51.7%
*-commutative51.7%
fma-neg51.7%
metadata-eval51.7%
metadata-eval51.7%
associate-+l+51.7%
metadata-eval51.7%
associate-+r+51.7%
Applied egg-rr51.7%
expm1-def80.9%
expm1-log1p80.9%
distribute-neg-frac80.9%
fma-udef80.9%
*-commutative80.9%
neg-mul-180.9%
metadata-eval80.9%
distribute-neg-in80.9%
+-commutative80.9%
mul-1-neg80.9%
distribute-lft-in80.9%
metadata-eval80.9%
neg-mul-180.9%
unsub-neg80.9%
+-commutative80.9%
Simplified80.9%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.15)
(/
(* (+ 1.0 alpha) (+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(+ 2.0 alpha))
(/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.15) {
tmp = ((1.0 + alpha) * (0.16666666666666666 + (alpha * -0.1388888888888889))) / (2.0 + alpha);
} else {
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.15d0) then
tmp = ((1.0d0 + alpha) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))) / (2.0d0 + alpha)
else
tmp = ((alpha - (-1.0d0)) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.15) {
tmp = ((1.0 + alpha) * (0.16666666666666666 + (alpha * -0.1388888888888889))) / (2.0 + alpha);
} else {
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.15: tmp = ((1.0 + alpha) * (0.16666666666666666 + (alpha * -0.1388888888888889))) / (2.0 + alpha) else: tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.15) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))) / Float64(2.0 + alpha)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.15)
tmp = ((1.0 + alpha) * (0.16666666666666666 + (alpha * -0.1388888888888889))) / (2.0 + alpha);
else
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.15], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.15:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)}{2 + \alpha}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.14999999999999991Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.3%
*-commutative63.3%
Simplified63.3%
Taylor expanded in beta around 0 63.2%
if 2.14999999999999991 < beta Initial program 84.7%
Taylor expanded in beta around -inf 80.9%
expm1-log1p-u80.9%
expm1-udef51.7%
mul-1-neg51.7%
*-commutative51.7%
fma-neg51.7%
metadata-eval51.7%
metadata-eval51.7%
associate-+l+51.7%
metadata-eval51.7%
associate-+r+51.7%
Applied egg-rr51.7%
expm1-def80.9%
expm1-log1p80.9%
distribute-neg-frac80.9%
fma-udef80.9%
*-commutative80.9%
neg-mul-180.9%
metadata-eval80.9%
distribute-neg-in80.9%
+-commutative80.9%
mul-1-neg80.9%
distribute-lft-in80.9%
metadata-eval80.9%
neg-mul-180.9%
unsub-neg80.9%
+-commutative80.9%
Simplified80.9%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ 2.0 (+ beta alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (2.0d0 + (beta + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(2.0 + Float64(beta + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = ((1.0 + alpha) / beta) / (2.0 + (beta + alpha));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{2 + \left(\beta + \alpha\right)}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
div-inv63.5%
+-commutative63.5%
Applied egg-rr63.5%
if 6 < beta Initial program 84.7%
Simplified92.5%
Taylor expanded in beta around inf 80.8%
associate-*l/80.9%
+-commutative80.9%
associate-+r+80.9%
+-commutative80.9%
+-commutative80.9%
Applied egg-rr80.9%
associate-*r/80.9%
*-rgt-identity80.9%
+-commutative80.9%
Simplified80.9%
Final simplification69.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + 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 <= 6.0d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / 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 = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + 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, 6.0], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
div-inv63.5%
+-commutative63.5%
Applied egg-rr63.5%
if 6 < beta Initial program 84.7%
Simplified92.5%
Taylor expanded in beta around inf 80.8%
un-div-inv80.9%
+-commutative80.9%
associate-+r+80.9%
+-commutative80.9%
+-commutative80.9%
Applied egg-rr80.9%
Final simplification69.3%
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 (/ 1.0 (+ beta 2.0))) (/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((alpha - -1.0) / 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 = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = ((alpha - (-1.0d0)) / 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 = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((alpha - -1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.3: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((alpha - -1.0) / 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(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / 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 = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = ((alpha - -1.0) / 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[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $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:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
div-inv63.5%
+-commutative63.5%
Applied egg-rr63.5%
if 5.29999999999999982 < beta Initial program 84.7%
Taylor expanded in beta around -inf 80.9%
expm1-log1p-u80.9%
expm1-udef51.7%
mul-1-neg51.7%
*-commutative51.7%
fma-neg51.7%
metadata-eval51.7%
metadata-eval51.7%
associate-+l+51.7%
metadata-eval51.7%
associate-+r+51.7%
Applied egg-rr51.7%
expm1-def80.9%
expm1-log1p80.9%
distribute-neg-frac80.9%
fma-udef80.9%
*-commutative80.9%
neg-mul-180.9%
metadata-eval80.9%
distribute-neg-in80.9%
+-commutative80.9%
mul-1-neg80.9%
distribute-lft-in80.9%
metadata-eval80.9%
neg-mul-180.9%
unsub-neg80.9%
+-commutative80.9%
Simplified80.9%
Final simplification69.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.7) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ 1.0 beta) (/ beta (+ 1.0 alpha)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.7) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = (1.0 / beta) / (beta / (1.0 + 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 <= 7.7d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = (1.0d0 / beta) / (beta / (1.0d0 + alpha))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.7) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = (1.0 / beta) / (beta / (1.0 + alpha));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.7: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = (1.0 / beta) / (beta / (1.0 + alpha)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.7) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta / Float64(1.0 + alpha))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.7)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = (1.0 / beta) / (beta / (1.0 + 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, 7.7], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.7:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 7.70000000000000018Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
div-inv63.5%
+-commutative63.5%
Applied egg-rr63.5%
if 7.70000000000000018 < beta Initial program 84.7%
Simplified92.5%
clear-num92.5%
associate-+r+92.5%
*-commutative92.5%
frac-times78.5%
*-un-lft-identity78.5%
+-commutative78.5%
*-commutative78.5%
associate-+r+78.5%
Applied egg-rr78.5%
associate-/r*92.6%
associate-/l*80.5%
associate-*l/92.6%
*-commutative92.6%
times-frac99.6%
associate-/r*92.5%
*-commutative92.5%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
clear-num99.6%
+-commutative99.6%
times-frac96.9%
associate-/r*99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 91.3%
Taylor expanded in beta around inf 80.7%
Final simplification69.2%
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 (/ 1.0 (+ beta 2.0))) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} 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 * (1.0d0 / (beta + 2.0d0))
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 * (1.0 / (beta + 2.0));
} 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 * (1.0 / (beta + 2.0)) 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(1.0 / Float64(beta + 2.0))); 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 * (1.0 / (beta + 2.0));
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[(1.0 / N[(beta + 2.0), $MachinePrecision]), $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:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
div-inv63.5%
+-commutative63.5%
Applied egg-rr63.5%
if 5.29999999999999982 < beta Initial program 84.7%
Taylor expanded in beta around -inf 80.9%
Taylor expanded in alpha around 0 72.1%
Final simplification66.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.0) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} 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.0d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
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.0) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); 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.0)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
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.0], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $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 8:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
div-inv63.5%
+-commutative63.5%
Applied egg-rr63.5%
if 8 < beta Initial program 84.7%
Simplified92.5%
Taylor expanded in beta around inf 80.8%
un-div-inv80.9%
+-commutative80.9%
associate-+r+80.9%
+-commutative80.9%
+-commutative80.9%
Applied egg-rr80.9%
Taylor expanded in beta around inf 80.7%
Final simplification69.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.58) (+ 0.08333333333333333 (* beta -0.041666666666666664)) (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.58) {
tmp = 0.08333333333333333 + (beta * -0.041666666666666664);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.58d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.041666666666666664d0))
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.58) {
tmp = 0.08333333333333333 + (beta * -0.041666666666666664);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.58: tmp = 0.08333333333333333 + (beta * -0.041666666666666664) else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.58) tmp = Float64(0.08333333333333333 + Float64(beta * -0.041666666666666664)); else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.58)
tmp = 0.08333333333333333 + (beta * -0.041666666666666664);
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.58], N[(0.08333333333333333 + N[(beta * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.58:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 1.5800000000000001Initial program 99.9%
Simplified99.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
Taylor expanded in beta around 0 63.5%
*-commutative63.5%
Simplified63.5%
if 1.5800000000000001 < beta Initial program 84.7%
Simplified92.5%
Taylor expanded in beta around 0 21.4%
+-commutative21.4%
Simplified21.4%
Taylor expanded in alpha around 0 6.8%
Taylor expanded in beta around inf 6.8%
Final simplification44.7%
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.4%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.5%
Taylor expanded in beta around 0 63.5%
if 2 < beta Initial program 84.7%
Simplified92.5%
Taylor expanded in beta around 0 21.4%
+-commutative21.4%
Simplified21.4%
Taylor expanded in alpha around 0 6.8%
Taylor expanded in beta around inf 6.8%
Final simplification44.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 * (1.0 / (beta + 2.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 * (1.0 / (beta + 2.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 * (1.0 / (beta + 2.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666 \cdot \frac{1}{\beta + 2}
\end{array}
Initial program 94.8%
Simplified97.1%
Taylor expanded in beta around 0 73.0%
+-commutative73.0%
Simplified73.0%
Taylor expanded in alpha around 0 44.7%
div-inv44.7%
+-commutative44.7%
Applied egg-rr44.7%
Final simplification44.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 94.8%
Simplified97.1%
Taylor expanded in beta around 0 73.0%
+-commutative73.0%
Simplified73.0%
Taylor expanded in alpha around 0 44.7%
Final simplification44.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.8%
Simplified97.1%
Taylor expanded in beta around 0 73.0%
+-commutative73.0%
Simplified73.0%
Taylor expanded in alpha around 0 44.7%
Taylor expanded in beta around 0 43.7%
Final simplification43.7%
herbie shell --seed 2024033
(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)))