
(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 17 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 (+ 2.0 beta)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ 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) / t_0) * ((1.0 + beta) / (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) / t_0) * ((1.0d0 + beta) / (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) / t_0) * ((1.0 + beta) / (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) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / 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) / t_0) * ((1.0 + beta) / (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[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.1%
Simplified85.0%
times-frac97.7%
+-commutative97.7%
Applied egg-rr97.7%
associate-*r/97.7%
+-commutative97.7%
associate-+r+97.7%
+-commutative97.7%
+-commutative97.7%
associate-+r+97.7%
+-commutative97.7%
+-commutative97.7%
associate-+r+97.7%
+-commutative97.7%
associate-+r+97.7%
Simplified97.7%
times-frac99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+l+99.8%
Applied egg-rr99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 2e+19)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(* (/ (+ 1.0 beta) t_0) (/ (/ (+ 1.0 alpha) beta) t_1)))))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 <= 2e+19) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((1.0 + beta) / t_0) * (((1.0 + alpha) / beta) / t_1);
}
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 <= 2d+19) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = ((1.0d0 + beta) / t_0) * (((1.0d0 + alpha) / beta) / t_1)
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 <= 2e+19) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((1.0 + beta) / t_0) * (((1.0 + alpha) / beta) / t_1);
}
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 <= 2e+19: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = ((1.0 + beta) / t_0) * (((1.0 + alpha) / beta) / t_1) 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 <= 2e+19) 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 + beta) / t_0) * Float64(Float64(Float64(1.0 + alpha) / beta) / t_1)); 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 <= 2e+19)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = ((1.0 + beta) / t_0) * (((1.0 + alpha) / beta) / t_1);
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, 2e+19], 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 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$1), $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(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+19}:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{t\_0 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \beta}{t\_0} \cdot \frac{\frac{1 + \alpha}{\beta}}{t\_1}\\
\end{array}
\end{array}
if beta < 2e19Initial program 99.9%
Simplified93.8%
times-frac99.4%
+-commutative99.4%
Applied egg-rr99.4%
if 2e19 < beta Initial program 83.6%
Simplified69.0%
times-frac94.7%
+-commutative94.7%
Applied egg-rr94.7%
associate-*r/94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
associate-+r+94.7%
Simplified94.7%
times-frac99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+l+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 89.5%
Final simplification95.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.8e+15)
(/
(* (+ 1.0 beta) (/ 1.0 (+ 2.0 beta)))
(* (+ 2.0 beta) (+ 3.0 (+ alpha beta))))
(*
(/ (+ 1.0 beta) (+ alpha (+ beta 3.0)))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ 2.0 beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8e+15) {
tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + beta) / (alpha + (beta + 3.0))) * (((1.0 + alpha) / beta) / (alpha + (2.0 + beta)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.8d+15) then
tmp = ((1.0d0 + beta) * (1.0d0 / (2.0d0 + beta))) / ((2.0d0 + beta) * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + beta) / (alpha + (beta + 3.0d0))) * (((1.0d0 + alpha) / beta) / (alpha + (2.0d0 + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.8e+15) {
tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + beta) / (alpha + (beta + 3.0))) * (((1.0 + alpha) / beta) / (alpha + (2.0 + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.8e+15: tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta))) else: tmp = ((1.0 + beta) / (alpha + (beta + 3.0))) * (((1.0 + alpha) / beta) / (alpha + (2.0 + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 / Float64(2.0 + beta))) / Float64(Float64(2.0 + beta) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(2.0 + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.8e+15)
tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + beta) / (alpha + (beta + 3.0))) * (((1.0 + alpha) / beta) / (alpha + (2.0 + beta)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.8e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \frac{1}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \beta}{\alpha + \left(\beta + 3\right)} \cdot \frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 6.8e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 67.3%
+-commutative67.3%
Simplified67.3%
div-inv67.3%
+-commutative67.3%
Applied egg-rr67.3%
if 6.8e15 < beta Initial program 83.8%
Simplified69.3%
times-frac94.7%
+-commutative94.7%
Applied egg-rr94.7%
associate-*r/94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
+-commutative94.7%
associate-+r+94.7%
+-commutative94.7%
associate-+r+94.7%
Simplified94.7%
times-frac99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+l+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 88.6%
Final simplification74.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5e+16)
(/
(* (+ 1.0 beta) (/ 1.0 (+ 2.0 beta)))
(* (+ 2.0 beta) (+ 3.0 (+ alpha beta))))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+16) {
tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5d+16) then
tmp = ((1.0d0 + beta) * (1.0d0 / (2.0d0 + beta))) / ((2.0d0 + beta) * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+16) {
tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+16: tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+16) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 / Float64(2.0 + beta))) / Float64(Float64(2.0 + beta) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5e+16)
tmp = ((1.0 + beta) * (1.0 / (2.0 + beta))) / ((2.0 + beta) * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \frac{1}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5e16Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 67.3%
+-commutative67.3%
Simplified67.3%
div-inv67.3%
+-commutative67.3%
Applied egg-rr67.3%
if 5e16 < beta Initial program 83.8%
Taylor expanded in beta around inf 88.2%
Taylor expanded in alpha around 0 88.2%
associate-+r+88.2%
Simplified88.2%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 3.0))))
(if (<= beta 1e+17)
(/ (/ (+ 1.0 beta) (* (+ 2.0 beta) t_0)) (+ 2.0 beta))
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double tmp;
if (beta <= 1e+17) {
tmp = ((1.0 + beta) / ((2.0 + beta) * t_0)) / (2.0 + beta);
} else {
tmp = ((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 = beta + (alpha + 3.0d0)
if (beta <= 1d+17) then
tmp = ((1.0d0 + beta) / ((2.0d0 + beta) * t_0)) / (2.0d0 + beta)
else
tmp = ((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 = beta + (alpha + 3.0);
double tmp;
if (beta <= 1e+17) {
tmp = ((1.0 + beta) / ((2.0 + beta) * t_0)) / (2.0 + beta);
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 3.0) tmp = 0 if beta <= 1e+17: tmp = ((1.0 + beta) / ((2.0 + beta) * t_0)) / (2.0 + beta) else: tmp = ((1.0 + alpha) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 3.0)) tmp = 0.0 if (beta <= 1e+17) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * t_0)) / Float64(2.0 + beta)); else tmp = Float64(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 = beta + (alpha + 3.0);
tmp = 0.0;
if (beta <= 1e+17)
tmp = ((1.0 + beta) / ((2.0 + beta) * t_0)) / (2.0 + beta);
else
tmp = ((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[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+17], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 3\right)\\
\mathbf{if}\;\beta \leq 10^{+17}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(2 + \beta\right) \cdot t\_0}}{2 + \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1e17Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 67.3%
+-commutative67.3%
Simplified67.3%
*-un-lft-identity67.3%
associate-/l/67.3%
*-commutative67.3%
+-commutative67.3%
associate-+r+67.3%
Applied egg-rr67.3%
*-lft-identity67.3%
associate-/r*67.3%
+-commutative67.3%
+-commutative67.3%
+-commutative67.3%
Simplified67.3%
if 1e17 < beta Initial program 83.8%
Taylor expanded in beta around inf 88.2%
Taylor expanded in alpha around 0 88.2%
associate-+r+88.2%
Simplified88.2%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.8e+15) (/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* (+ 2.0 beta) (+ 3.0 (+ alpha beta)))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.8d+15) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((2.0d0 + beta) * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.8e+15: tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (3.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.8e+15)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((2.0 + beta) * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.8e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(2 + \beta\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5.8e15Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 67.3%
+-commutative67.3%
Simplified67.3%
if 5.8e15 < beta Initial program 83.8%
Taylor expanded in beta around inf 88.2%
Taylor expanded in alpha around 0 88.2%
associate-+r+88.2%
Simplified88.2%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.35) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.35) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.35d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.35) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.35: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.35) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.35)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.35], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.35:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 3.35000000000000009Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 98.4%
Taylor expanded in beta around 0 98.4%
*-commutative98.4%
+-commutative98.4%
Simplified98.4%
if 3.35000000000000009 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.7%
associate-+r+87.7%
Simplified87.7%
Final simplification94.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5e+25) (/ (+ 1.0 beta) (* (+ 2.0 beta) (* (+ beta 3.0) (+ 2.0 beta)))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+25) {
tmp = (1.0 + beta) / ((2.0 + beta) * ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d+25) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * ((beta + 3.0d0) * (2.0d0 + beta)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5e+25) {
tmp = (1.0 + beta) / ((2.0 + beta) * ((beta + 3.0) * (2.0 + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5e+25: tmp = (1.0 + beta) / ((2.0 + beta) * ((beta + 3.0) * (2.0 + beta))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5e+25) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(Float64(beta + 3.0) * Float64(2.0 + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5e+25)
tmp = (1.0 + beta) / ((2.0 + beta) * ((beta + 3.0) * (2.0 + beta)));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5e+25], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5 \cdot 10^{+25}:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(\left(\beta + 3\right) \cdot \left(2 + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.50000000000000012e25Initial program 99.8%
associate-/l/99.4%
+-commutative99.4%
associate-+l+99.4%
*-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 82.8%
+-commutative82.8%
Simplified82.8%
*-un-lft-identity82.8%
+-commutative82.8%
associate-+l+82.8%
+-commutative82.8%
Applied egg-rr82.8%
*-lft-identity82.8%
associate-/l/82.8%
*-commutative82.8%
+-commutative82.8%
*-commutative82.8%
associate-+r+82.8%
+-commutative82.8%
associate-+r+82.8%
+-commutative82.8%
associate-+r+82.8%
+-commutative82.8%
+-commutative82.8%
Simplified82.8%
Taylor expanded in alpha around 0 65.7%
+-commutative65.7%
+-commutative65.7%
Simplified65.7%
if 2.50000000000000012e25 < beta Initial program 83.5%
Taylor expanded in beta around inf 89.0%
Taylor expanded in alpha around 0 89.0%
associate-+r+89.0%
Simplified89.0%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ (+ 0.5 (* beta 0.25)) (* (+ 2.0 beta) (+ 3.0 (+ alpha beta)))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = (0.5 + (beta * 0.25)) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((2.0d0 + beta) * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = (0.5 + (beta * 0.25)) / ((2.0 + beta) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = (0.5 + (beta * 0.25)) / ((2.0 + beta) * (3.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(2.0 + beta) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = (0.5 + (beta * 0.25)) / ((2.0 + beta) * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(2 + \beta\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.4%
*-commutative66.4%
Simplified66.4%
if 4 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.7%
associate-+r+87.7%
Simplified87.7%
Final simplification74.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.35) (/ 0.25 (+ alpha 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.35) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.35d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.35) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.35: tmp = 0.25 / (alpha + 3.0) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.35) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.35)
tmp = 0.25 / (alpha + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.35], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.35:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.35000000000000009Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 2.35000000000000009 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.7%
associate-+r+87.7%
Simplified87.7%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (/ 0.25 (+ alpha 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / 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 <= 2.8d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = ((1.0d0 + alpha) / 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 <= 2.8) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.25 / (alpha + 3.0) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 2.8)
tmp = 0.25 / (alpha + 3.0);
else
tmp = ((1.0 + alpha) / 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, 2.8], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 2.7999999999999998 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.5%
+-commutative87.5%
Simplified87.5%
Final simplification73.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.7) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (/ beta (+ 1.0 alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.7) {
tmp = 0.25 / (alpha + 3.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 <= 3.7d0) then
tmp = 0.25d0 / (alpha + 3.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 <= 3.7) {
tmp = 0.25 / (alpha + 3.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 <= 3.7: tmp = 0.25 / (alpha + 3.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 <= 3.7) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(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 <= 3.7)
tmp = 0.25 / (alpha + 3.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, 3.7], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.7:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \frac{\beta}{1 + \alpha}}\\
\end{array}
\end{array}
if beta < 3.7000000000000002Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 3.7000000000000002 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
clear-num87.4%
inv-pow87.4%
metadata-eval87.4%
associate-+l+87.4%
metadata-eval87.4%
associate-+l+87.4%
Applied egg-rr87.4%
unpow-187.4%
associate-/r/87.4%
associate-+r+87.4%
+-commutative87.4%
+-commutative87.4%
Simplified87.4%
Taylor expanded in beta around inf 87.2%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.4) (/ 0.25 (+ alpha 3.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = 0.25 / (alpha + 3.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 <= 2.4d0) then
tmp = 0.25d0 / (alpha + 3.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 <= 2.4) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4: tmp = 0.25 / (alpha + 3.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 <= 2.4) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(1.0 / 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 <= 2.4)
tmp = 0.25 / (alpha + 3.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, 2.4], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.4:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 2.39999999999999991 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
clear-num87.4%
inv-pow87.4%
metadata-eval87.4%
associate-+l+87.4%
metadata-eval87.4%
associate-+l+87.4%
Applied egg-rr87.4%
unpow-187.4%
associate-/r/87.4%
associate-+r+87.4%
+-commutative87.4%
+-commutative87.4%
Simplified87.4%
Taylor expanded in alpha around 0 83.6%
associate-/r*83.7%
+-commutative83.7%
Simplified83.7%
Final simplification72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.35) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.35) {
tmp = 0.25 / (alpha + 3.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 <= 2.35d0) then
tmp = 0.25d0 / (alpha + 3.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 <= 2.35) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.35: tmp = 0.25 / (alpha + 3.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 <= 2.35) tmp = Float64(0.25 / Float64(alpha + 3.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 <= 2.35)
tmp = 0.25 / (alpha + 3.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, 2.35], N[(0.25 / N[(alpha + 3.0), $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 2.35:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.35000000000000009Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 2.35000000000000009 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.7) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.7) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.7d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.7) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.7: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.7) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.7)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.7], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.7:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.7000000000000002Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 3.7000000000000002 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
clear-num87.4%
inv-pow87.4%
metadata-eval87.4%
associate-+l+87.4%
metadata-eval87.4%
associate-+l+87.4%
Applied egg-rr87.4%
unpow-187.4%
associate-/r/87.4%
associate-+r+87.4%
+-commutative87.4%
+-commutative87.4%
Simplified87.4%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Taylor expanded in beta around inf 83.6%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.8) (/ 0.25 (+ alpha 3.0)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 0.3333333333333333 / 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 <= 5.8d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.8: tmp = 0.25 / (alpha + 3.0) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.8) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.8)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 0.3333333333333333 / 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, 5.8], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 5.79999999999999982Initial program 99.9%
associate-/l/99.5%
+-commutative99.5%
associate-+l+99.5%
*-commutative99.5%
metadata-eval99.5%
associate-+l+99.5%
metadata-eval99.5%
associate-+l+99.4%
metadata-eval99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in alpha around 0 83.0%
+-commutative83.0%
Simplified83.0%
Taylor expanded in alpha around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in beta around 0 66.0%
if 5.79999999999999982 < beta Initial program 84.0%
Taylor expanded in beta around inf 87.7%
clear-num87.4%
inv-pow87.4%
metadata-eval87.4%
associate-+l+87.4%
metadata-eval87.4%
associate-+l+87.4%
Applied egg-rr87.4%
unpow-187.4%
associate-/r/87.4%
associate-+r+87.4%
+-commutative87.4%
+-commutative87.4%
Simplified87.4%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Taylor expanded in beta around 0 6.8%
Final simplification44.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / 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.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 33.7%
clear-num33.5%
inv-pow33.5%
metadata-eval33.5%
associate-+l+33.5%
metadata-eval33.5%
associate-+l+33.5%
Applied egg-rr33.5%
unpow-133.5%
associate-/r/33.6%
associate-+r+33.6%
+-commutative33.6%
+-commutative33.6%
Simplified33.6%
Taylor expanded in alpha around 0 32.2%
+-commutative32.2%
Simplified32.2%
Taylor expanded in beta around 0 4.3%
herbie shell --seed 2024149
(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)))