
(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 16 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 (+ (+ beta 2.0) alpha)))
(if (<= beta 1.3e+154)
(/ (/ (* (+ 1.0 beta) (+ 1.0 alpha)) t_0) (* t_0 (+ alpha (+ beta 3.0))))
(*
(/ (+ 1.0 alpha) t_0)
(/ (- 1.0 (/ (* 2.0 (+ 2.0 alpha)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1.3e+154) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / (t_0 * (alpha + (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.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) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1.3d+154) then
tmp = (((1.0d0 + beta) * (1.0d0 + alpha)) / t_0) / (t_0 * (alpha + (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 - ((2.0d0 * (2.0d0 + alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1.3e+154) {
tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / (t_0 * (alpha + (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1.3e+154: tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / (t_0 * (alpha + (beta + 3.0))) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1.3e+154) tmp = Float64(Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 - Float64(Float64(2.0 * Float64(2.0 + alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1.3e+154)
tmp = (((1.0 + beta) * (1.0 + alpha)) / t_0) / (t_0 * (alpha + (beta + 3.0)));
else
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1.3e+154], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(N[(2.0 * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+154}:\\
\;\;\;\;\frac{\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_0}}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{2 \cdot \left(2 + \alpha\right)}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.29999999999999994e154Initial program 96.2%
associate-/l/95.8%
+-commutative95.8%
associate-+l+95.8%
*-commutative95.8%
metadata-eval95.8%
associate-+l+95.8%
metadata-eval95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
metadata-eval95.8%
metadata-eval95.8%
associate-+l+95.8%
Simplified95.8%
div-inv95.9%
+-commutative95.9%
distribute-rgt1-in95.9%
fma-define95.9%
*-commutative95.9%
associate-+r+95.9%
Applied egg-rr95.9%
associate-*r/95.8%
*-rgt-identity95.8%
+-commutative95.8%
fma-undefine95.8%
+-commutative95.8%
*-commutative95.8%
+-commutative95.8%
associate-+r+95.8%
distribute-lft1-in95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
+-commutative95.8%
Simplified95.8%
if 1.29999999999999994e154 < beta Initial program 74.2%
Simplified70.5%
times-frac85.8%
+-commutative85.8%
Applied egg-rr85.8%
Taylor expanded in beta around inf 96.2%
mul-1-neg96.2%
metadata-eval96.2%
distribute-lft-in96.2%
Simplified96.2%
Final simplification95.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)) (t_1 (/ (+ 1.0 alpha) t_0)))
(if (<= beta 1e+153)
(* t_1 (/ (+ 1.0 beta) (* t_0 (+ alpha (+ beta 3.0)))))
(* t_1 (/ (- 1.0 (/ (* 2.0 (+ 2.0 alpha)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 1e+153) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((2.0 * (2.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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 1d+153) then
tmp = t_1 * ((1.0d0 + beta) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = t_1 * ((1.0d0 - ((2.0d0 * (2.0d0 + alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 1e+153) {
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha t_1 = (1.0 + alpha) / t_0 tmp = 0 if beta <= 1e+153: tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = t_1 * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) t_1 = Float64(Float64(1.0 + alpha) / t_0) tmp = 0.0 if (beta <= 1e+153) tmp = Float64(t_1 * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(t_1 * Float64(Float64(1.0 - Float64(Float64(2.0 * Float64(2.0 + alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
t_1 = (1.0 + alpha) / t_0;
tmp = 0.0;
if (beta <= 1e+153)
tmp = t_1 * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = t_1 * ((1.0 - ((2.0 * (2.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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 1e+153], N[(t$95$1 * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(N[(1.0 - N[(N[(2.0 * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
t_1 := \frac{1 + \alpha}{t\_0}\\
\mathbf{if}\;\beta \leq 10^{+153}:\\
\;\;\;\;t\_1 \cdot \frac{1 + \beta}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - \frac{2 \cdot \left(2 + \alpha\right)}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1e153Initial program 96.2%
Simplified85.6%
times-frac98.8%
+-commutative98.8%
Applied egg-rr98.8%
if 1e153 < beta Initial program 74.2%
Simplified70.5%
times-frac85.8%
+-commutative85.8%
Applied egg-rr85.8%
Taylor expanded in beta around inf 96.2%
mul-1-neg96.2%
metadata-eval96.2%
distribute-lft-in96.2%
Simplified96.2%
Final simplification98.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(/
1.0
(*
(+ (+ beta 2.0) alpha)
(/
(+ alpha (+ beta 3.0))
(* (+ 1.0 beta) (/ (+ 1.0 alpha) (+ beta (+ 2.0 alpha))))))))assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.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
code = 1.0d0 / (((beta + 2.0d0) + alpha) * ((alpha + (beta + 3.0d0)) / ((1.0d0 + beta) * ((1.0d0 + alpha) / (beta + (2.0d0 + alpha))))))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / Float64(beta + Float64(2.0 + alpha))))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (beta + (2.0 + alpha))))));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \frac{\alpha + \left(\beta + 3\right)}{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{\beta + \left(2 + \alpha\right)}}}
\end{array}
Initial program 92.6%
associate-/l/91.7%
+-commutative91.7%
associate-+l+91.7%
*-commutative91.7%
metadata-eval91.7%
associate-+l+91.7%
metadata-eval91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
metadata-eval91.7%
metadata-eval91.7%
associate-+l+91.7%
Simplified91.7%
clear-num91.7%
inv-pow91.7%
*-commutative91.7%
associate-+r+91.7%
+-commutative91.7%
distribute-rgt1-in91.7%
fma-define91.7%
Applied egg-rr91.7%
unpow-191.7%
associate-/l*91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
fma-undefine91.8%
+-commutative91.8%
*-commutative91.8%
+-commutative91.8%
associate-+r+91.8%
distribute-lft1-in91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
+-commutative91.8%
Simplified91.8%
associate-/l*99.1%
associate-+l+99.1%
+-commutative99.1%
Applied egg-rr99.1%
Final simplification99.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 300000000000.0)
(/ 1.0 (* t_0 (/ (+ beta 3.0) (/ (+ 1.0 beta) (+ beta 2.0)))))
(*
(/ (+ 1.0 alpha) t_0)
(/ (- 1.0 (/ (* 2.0 (+ 2.0 alpha)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 300000000000.0) {
tmp = 1.0 / (t_0 * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0))));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.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) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 300000000000.0d0) then
tmp = 1.0d0 / (t_0 * ((beta + 3.0d0) / ((1.0d0 + beta) / (beta + 2.0d0))))
else
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 - ((2.0d0 * (2.0d0 + alpha)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 300000000000.0) {
tmp = 1.0 / (t_0 * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0))));
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 300000000000.0: tmp = 1.0 / (t_0 * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0)))) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.0 + alpha)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 300000000000.0) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(beta + 3.0) / Float64(Float64(1.0 + beta) / Float64(beta + 2.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 - Float64(Float64(2.0 * Float64(2.0 + alpha)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 300000000000.0)
tmp = 1.0 / (t_0 * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0))));
else
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((2.0 * (2.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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 300000000000.0], N[(1.0 / N[(t$95$0 * N[(N[(beta + 3.0), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(N[(2.0 * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 300000000000:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{\beta + 3}{\frac{1 + \beta}{\beta + 2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{2 \cdot \left(2 + \alpha\right)}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3e11Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/l*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in alpha around 0 84.1%
Taylor expanded in alpha around 0 67.0%
+-commutative67.0%
Simplified67.0%
if 3e11 < beta Initial program 76.6%
Simplified58.3%
times-frac90.2%
+-commutative90.2%
Applied egg-rr90.2%
Taylor expanded in beta around inf 77.6%
mul-1-neg77.6%
metadata-eval77.6%
distribute-lft-in77.6%
Simplified77.6%
Final simplification70.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.3e+16)
(/
1.0
(* (+ (+ beta 2.0) alpha) (/ (+ beta 3.0) (/ (+ 1.0 beta) (+ beta 2.0)))))
(/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3e+16) {
tmp = 1.0 / (((beta + 2.0) + alpha) * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.3d+16) then
tmp = 1.0d0 / (((beta + 2.0d0) + alpha) * ((beta + 3.0d0) / ((1.0d0 + beta) / (beta + 2.0d0))))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3e+16) {
tmp = 1.0 / (((beta + 2.0) + alpha) * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0))));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.3e+16: tmp = 1.0 / (((beta + 2.0) + alpha) * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0)))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.3e+16) tmp = Float64(1.0 / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(beta + 3.0) / Float64(Float64(1.0 + beta) / Float64(beta + 2.0))))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.3e+16)
tmp = 1.0 / (((beta + 2.0) + alpha) * ((beta + 3.0) / ((1.0 + beta) / (beta + 2.0))));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.3e+16], N[(1.0 / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+16}:\\
\;\;\;\;\frac{1}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \frac{\beta + 3}{\frac{1 + \beta}{\beta + 2}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.3e16Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/l*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in alpha around 0 84.1%
Taylor expanded in alpha around 0 67.0%
+-commutative67.0%
Simplified67.0%
if 1.3e16 < beta Initial program 76.6%
Taylor expanded in beta around inf 77.9%
Taylor expanded in alpha around 0 77.9%
Final simplification70.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8e+14) (* (/ 1.0 (+ beta 2.0)) (/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 3.0)))) (/ (+ (/ 1.0 beta) (/ alpha beta)) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8e+14) {
tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.8d+14) then
tmp = (1.0d0 / (beta + 2.0d0)) * ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8e+14) {
tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8e+14: tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8e+14) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) * Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.8e+14)
tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 / beta) + (alpha / beta)) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.8e+14], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8 \cdot 10^{+14}:\\
\;\;\;\;\frac{1}{\beta + 2} \cdot \frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.8e14Initial program 99.9%
Simplified94.4%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in alpha around 0 66.0%
+-commutative66.0%
+-commutative66.0%
Simplified66.0%
Taylor expanded in alpha around 0 66.0%
if 4.8e14 < beta Initial program 76.6%
Taylor expanded in beta around inf 77.9%
Taylor expanded in alpha around 0 77.9%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.6e+16) (* (/ 1.0 (+ beta 2.0)) (/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6e+16) {
tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.6d+16) then
tmp = (1.0d0 / (beta + 2.0d0)) * ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6e+16) {
tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.6e+16: tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.6e+16) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) * Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.6e+16)
tmp = (1.0 / (beta + 2.0)) * ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.6e+16], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6 \cdot 10^{+16}:\\
\;\;\;\;\frac{1}{\beta + 2} \cdot \frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.6e16Initial program 99.9%
Simplified94.4%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in alpha around 0 66.0%
+-commutative66.0%
+-commutative66.0%
Simplified66.0%
Taylor expanded in alpha around 0 66.0%
if 1.6e16 < beta Initial program 76.6%
Taylor expanded in beta around inf 77.9%
Taylor expanded in alpha around 0 77.9%
+-commutative77.9%
associate-+r+77.9%
+-commutative77.9%
+-commutative77.9%
+-commutative77.9%
Simplified77.9%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.2) (/ (/ (+ 1.0 alpha) (+ 2.0 alpha)) (* (+ 2.0 alpha) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.2d0) then
tmp = ((1.0d0 + alpha) / (2.0d0 + alpha)) / ((2.0d0 + alpha) * (alpha + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + alpha)) / Float64(Float64(2.0 + alpha) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.2)
tmp = ((1.0 + alpha) / (2.0 + alpha)) / ((2.0 + alpha) * (alpha + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + alpha), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \alpha}}{\left(2 + \alpha\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in beta around 0 98.3%
+-commutative98.3%
Simplified98.3%
if 3.2000000000000002 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 77.4%
+-commutative77.4%
associate-+r+77.4%
+-commutative77.4%
+-commutative77.4%
+-commutative77.4%
Simplified77.4%
Final simplification91.7%
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 (* 2.0 (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.5 / (2.0 * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.5d0 / (2.0d0 * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.5 / (2.0 * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.5 / (2.0 * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(0.5 / Float64(2.0 * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.5 / (2.0 * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], N[(0.5 / N[(2.0 * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.5}{2 \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.9%
if 4 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 77.4%
+-commutative77.4%
associate-+r+77.4%
+-commutative77.4%
+-commutative77.4%
+-commutative77.4%
Simplified77.4%
Final simplification68.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 0.5 (* 2.0 (+ beta 3.0))) (/ (+ (/ 1.0 beta) (/ alpha beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.5 / (2.0 * (beta + 3.0));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.5d0) then
tmp = 0.5d0 / (2.0d0 * (beta + 3.0d0))
else
tmp = ((1.0d0 / beta) + (alpha / beta)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.5 / (2.0 * (beta + 3.0));
} else {
tmp = ((1.0 / beta) + (alpha / beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = 0.5 / (2.0 * (beta + 3.0)) else: tmp = ((1.0 / beta) + (alpha / beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(0.5 / Float64(2.0 * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(alpha / beta)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5)
tmp = 0.5 / (2.0 * (beta + 3.0));
else
tmp = ((1.0 / beta) + (alpha / beta)) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.5], N[(0.5 / N[(2.0 * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{0.5}{2 \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.9%
if 6.5 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 77.5%
Taylor expanded in beta around inf 77.2%
Final simplification68.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (/ 0.5 (* 2.0 (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.5 / (2.0 * (beta + 3.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 <= 6.2d0) then
tmp = 0.5d0 / (2.0d0 * (beta + 3.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 <= 6.2) {
tmp = 0.5 / (2.0 * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = 0.5 / (2.0 * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(0.5 / Float64(2.0 * Float64(beta + 3.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 <= 6.2)
tmp = 0.5 / (2.0 * (beta + 3.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, 6.2], N[(0.5 / N[(2.0 * N[(beta + 3.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 6.2:\\
\;\;\;\;\frac{0.5}{2 \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.9%
if 6.20000000000000018 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in beta around inf 77.2%
Final simplification68.8%
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 (* 2.0 (+ beta 3.0))) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.5 / (2.0 * (beta + 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 <= 4.0d0) then
tmp = 0.5d0 / (2.0d0 * (beta + 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 <= 4.0) {
tmp = 0.5 / (2.0 * (beta + 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 <= 4.0: tmp = 0.5 / (2.0 * (beta + 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 <= 4.0) tmp = Float64(0.5 / Float64(2.0 * Float64(beta + 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 <= 4.0)
tmp = 0.5 / (2.0 * (beta + 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, 4.0], N[(0.5 / N[(2.0 * N[(beta + 3.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 4:\\
\;\;\;\;\frac{0.5}{2 \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.9%
if 4 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 69.8%
Final simplification66.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 0.5 (* 2.0 (+ beta 3.0))) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.5 / (2.0 * (beta + 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 <= 6.0d0) then
tmp = 0.5d0 / (2.0d0 * (beta + 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 <= 6.0) {
tmp = 0.5 / (2.0 * (beta + 3.0));
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.5 / (2.0 * (beta + 3.0)) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.5 / Float64(2.0 * Float64(beta + 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 <= 6.0)
tmp = 0.5 / (2.0 * (beta + 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, 6.0], N[(0.5 / N[(2.0 * N[(beta + 3.0), $MachinePrecision]), $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 6:\\
\;\;\;\;\frac{0.5}{2 \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.9%
if 6 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 69.8%
Taylor expanded in beta around inf 69.8%
Final simplification66.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) 0.08333333333333333 (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333;
} 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.5d0) then
tmp = 0.08333333333333333d0
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.5) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5: tmp = 0.08333333333333333 else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = 0.08333333333333333; 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.5)
tmp = 0.08333333333333333;
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.5], 0.08333333333333333, 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.5:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.7%
if 3.5 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 69.8%
Taylor expanded in beta around inf 69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} 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 <= 4.0d0) then
tmp = 0.08333333333333333d0
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 <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; 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 <= 4.0)
tmp = 0.08333333333333333;
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, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.6%
Taylor expanded in beta around 0 64.7%
if 4 < beta Initial program 76.8%
Taylor expanded in beta around inf 77.4%
Taylor expanded in alpha around 0 69.8%
Taylor expanded in beta around 0 6.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 92.6%
associate-/l/91.7%
+-commutative91.7%
associate-+l+91.7%
*-commutative91.7%
metadata-eval91.7%
associate-+l+91.7%
metadata-eval91.7%
+-commutative91.7%
+-commutative91.7%
+-commutative91.7%
metadata-eval91.7%
metadata-eval91.7%
associate-+l+91.7%
Simplified91.7%
Taylor expanded in beta around 0 87.0%
Taylor expanded in alpha around 0 60.3%
Taylor expanded in beta around 0 45.4%
herbie shell --seed 2024119
(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)))