
(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
(if (<= beta 8e+117)
(/
(/ (* (+ beta 1.0) (+ 1.0 alpha)) (+ 2.0 (+ beta alpha)))
(* (+ alpha (+ beta 2.0)) (+ (+ beta alpha) 3.0)))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8e+117) {
tmp = (((beta + 1.0) * (1.0 + alpha)) / (2.0 + (beta + alpha))) / ((alpha + (beta + 2.0)) * ((beta + 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 <= 8d+117) then
tmp = (((beta + 1.0d0) * (1.0d0 + alpha)) / (2.0d0 + (beta + alpha))) / ((alpha + (beta + 2.0d0)) * ((beta + 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 <= 8e+117) {
tmp = (((beta + 1.0) * (1.0 + alpha)) / (2.0 + (beta + alpha))) / ((alpha + (beta + 2.0)) * ((beta + 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 <= 8e+117: tmp = (((beta + 1.0) * (1.0 + alpha)) / (2.0 + (beta + alpha))) / ((alpha + (beta + 2.0)) * ((beta + 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 <= 8e+117) tmp = Float64(Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(2.0 + Float64(beta + alpha))) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 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 <= 8e+117)
tmp = (((beta + 1.0) * (1.0 + alpha)) / (2.0 + (beta + alpha))) / ((alpha + (beta + 2.0)) * ((beta + 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, 8e+117], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $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 8 \cdot 10^{+117}:\\
\;\;\;\;\frac{\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{2 + \left(\beta + \alpha\right)}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 8.0000000000000004e117Initial program 99.3%
associate-/l/98.7%
+-commutative98.7%
associate-+l+98.7%
*-commutative98.7%
metadata-eval98.7%
associate-+l+98.7%
metadata-eval98.7%
+-commutative98.7%
+-commutative98.7%
+-commutative98.7%
metadata-eval98.7%
metadata-eval98.7%
associate-+l+98.7%
Simplified98.7%
*-commutative98.7%
associate-+l+98.7%
+-commutative98.7%
associate-+r+98.7%
metadata-eval98.7%
*-un-lft-identity98.7%
+-commutative98.7%
associate-+l+98.7%
*-commutative98.7%
+-commutative98.7%
distribute-rgt1-in98.7%
fma-define98.7%
metadata-eval98.7%
associate-+r+98.7%
Applied egg-rr98.7%
*-lft-identity98.7%
+-commutative98.7%
fma-undefine98.7%
*-commutative98.7%
+-commutative98.7%
associate-+r+98.7%
+-commutative98.7%
*-rgt-identity98.7%
*-commutative98.7%
+-commutative98.7%
distribute-lft-in98.7%
+-commutative98.7%
*-commutative98.7%
associate-+r+98.7%
+-commutative98.7%
+-commutative98.7%
Simplified98.7%
if 8.0000000000000004e117 < beta Initial program 74.3%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.6%
+-commutative87.6%
Simplified87.6%
Final simplification96.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.12e+74)
(/ (* (+ beta 1.0) (+ 1.0 alpha)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/ (* (/ (+ 1.0 alpha) t_0) (- 1.0 (* 2.0 (/ alpha beta)))) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.12e+74) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.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 = alpha + (beta + 2.0d0)
if (beta <= 1.12d+74) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = (((1.0d0 + alpha) / t_0) * (1.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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.12e+74) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = (((1.0 + alpha) / t_0) * (1.0 - (2.0 * (alpha / beta)))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.12e+74: tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = (((1.0 + alpha) / t_0) * (1.0 - (2.0 * (alpha / beta)))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.12e+74) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 - Float64(2.0 * Float64(alpha / beta)))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.12e+74)
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = (((1.0 + alpha) / t_0) * (1.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.12e+74], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.12 \cdot 10^{+74}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0} \cdot \left(1 - 2 \cdot \frac{\alpha}{\beta}\right)}{\beta}\\
\end{array}
\end{array}
if beta < 1.12000000000000003e74Initial program 99.8%
Simplified93.6%
if 1.12000000000000003e74 < beta Initial program 76.6%
Simplified64.7%
times-frac92.2%
+-commutative92.2%
Applied egg-rr92.2%
Taylor expanded in beta around inf 84.2%
mul-1-neg84.2%
Simplified84.2%
Taylor expanded in alpha around inf 84.2%
associate-*r/84.2%
Simplified84.2%
associate-*r/84.2%
+-commutative84.2%
unsub-neg84.2%
associate-/l*84.2%
Applied egg-rr84.2%
Final simplification91.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 9.2e+21)
(* (+ 1.0 alpha) (/ (/ (+ beta 1.0) (* t_0 (+ (+ beta alpha) 3.0))) t_0))
(/
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(- 1.0 (* 2.0 (/ alpha beta))))
beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 9.2e+21) {
tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * ((beta + alpha) + 3.0))) / t_0);
} else {
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.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 = 2.0d0 + (beta + alpha)
if (beta <= 9.2d+21) then
tmp = (1.0d0 + alpha) * (((beta + 1.0d0) / (t_0 * ((beta + alpha) + 3.0d0))) / t_0)
else
tmp = (((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.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 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 9.2e+21) {
tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * ((beta + alpha) + 3.0))) / t_0);
} else {
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 - (2.0 * (alpha / beta)))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 9.2e+21: tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * ((beta + alpha) + 3.0))) / t_0) else: tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 - (2.0 * (alpha / beta)))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 9.2e+21) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))) / t_0)); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 - Float64(2.0 * Float64(alpha / beta)))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 9.2e+21)
tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * ((beta + alpha) + 3.0))) / t_0);
else
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 9.2e+21], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 9.2 \cdot 10^{+21}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{\beta + 1}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \left(1 - 2 \cdot \frac{\alpha}{\beta}\right)}{\beta}\\
\end{array}
\end{array}
if beta < 9.2e21Initial program 99.9%
Simplified94.1%
times-frac99.6%
+-commutative99.6%
Applied egg-rr99.6%
associate-*l/99.6%
Applied egg-rr99.6%
associate-/l*94.5%
+-commutative94.5%
associate-+r+94.5%
+-commutative94.5%
+-commutative94.5%
associate-+r+94.5%
+-commutative94.5%
associate-+r+94.5%
+-commutative94.5%
+-commutative94.5%
Simplified94.5%
if 9.2e21 < beta Initial program 81.5%
Simplified69.4%
times-frac92.3%
+-commutative92.3%
Applied egg-rr92.3%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around inf 83.2%
associate-*r/83.2%
Simplified83.2%
associate-*r/83.3%
+-commutative83.3%
unsub-neg83.3%
associate-/l*83.3%
Applied egg-rr83.3%
Final simplification91.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.02e+18)
(/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ (+ beta alpha) 3.0))))
(/
(* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (- 1.0 (* 2.0 (/ alpha beta))))
beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.02e+18) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0)));
} else {
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.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) :: tmp
if (beta <= 1.02d+18) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * ((beta + alpha) + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.0d0 - (2.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 <= 1.02e+18) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0)));
} else {
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 - (2.0 * (alpha / beta)))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.02e+18: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0))) else: tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 - (2.0 * (alpha / beta)))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.02e+18) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(Float64(beta + alpha) + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 - Float64(2.0 * 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 <= 1.02e+18)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0)));
else
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.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_] := If[LessEqual[beta, 1.02e+18], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.02 \cdot 10^{+18}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \left(1 - 2 \cdot \frac{\alpha}{\beta}\right)}{\beta}\\
\end{array}
\end{array}
if beta < 1.02e18Initial 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 alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
*-un-lft-identity86.0%
*-commutative86.0%
associate-+r+86.0%
Applied egg-rr86.0%
*-lft-identity86.0%
associate-/l/86.0%
associate-*l*86.0%
associate-+r+86.0%
+-commutative86.0%
+-commutative86.0%
+-commutative86.0%
*-commutative86.0%
+-commutative86.0%
associate-+r+86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in alpha around 0 65.8%
+-commutative65.8%
Simplified65.8%
if 1.02e18 < beta Initial program 81.5%
Simplified69.4%
times-frac92.3%
+-commutative92.3%
Applied egg-rr92.3%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around inf 83.2%
associate-*r/83.2%
Simplified83.2%
associate-*r/83.3%
+-commutative83.3%
unsub-neg83.3%
associate-/l*83.3%
Applied egg-rr83.3%
Final simplification70.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (* (+ 1.0 alpha) (/ (+ beta 1.0) t_0)) (+ beta 3.0)) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) * ((beta + 1.0) / t_0)) / (beta + 3.0)) / t_0;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + alpha) * ((beta + 1.0d0) / t_0)) / (beta + 3.0d0)) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) * ((beta + 1.0) / t_0)) / (beta + 3.0)) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + alpha) * ((beta + 1.0) / t_0)) / (beta + 3.0)) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(beta + 1.0) / t_0)) / Float64(beta + 3.0)) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + alpha) * ((beta + 1.0) / t_0)) / (beta + 3.0)) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\left(1 + \alpha\right) \cdot \frac{\beta + 1}{t\_0}}{\beta + 3}}{t\_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified87.4%
times-frac97.6%
+-commutative97.6%
Applied egg-rr97.6%
associate-*l/97.6%
Applied egg-rr97.6%
associate-/l*93.5%
+-commutative93.5%
associate-+r+93.5%
+-commutative93.5%
+-commutative93.5%
associate-+r+93.5%
+-commutative93.5%
associate-+r+93.5%
+-commutative93.5%
+-commutative93.5%
Simplified93.5%
Taylor expanded in alpha around 0 85.7%
+-commutative85.7%
Simplified85.7%
associate-*r/70.9%
associate-/r*70.1%
associate-+r+70.1%
+-commutative70.1%
+-commutative70.1%
associate-+r+70.1%
+-commutative70.1%
+-commutative70.1%
Applied egg-rr70.1%
associate-*r/70.1%
+-commutative70.1%
+-commutative70.1%
+-commutative70.1%
+-commutative70.1%
+-commutative70.1%
+-commutative70.1%
Simplified70.1%
Final simplification70.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2e+18) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ (+ beta alpha) 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+18) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2d+18) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * ((beta + alpha) + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2e+18) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2e+18: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2e+18) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(Float64(beta + alpha) + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2e+18)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * ((beta + alpha) + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2e+18], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2 \cdot 10^{+18}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 2e18Initial 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 alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
*-un-lft-identity86.0%
*-commutative86.0%
associate-+r+86.0%
Applied egg-rr86.0%
*-lft-identity86.0%
associate-/l/86.0%
associate-*l*86.0%
associate-+r+86.0%
+-commutative86.0%
+-commutative86.0%
+-commutative86.0%
*-commutative86.0%
+-commutative86.0%
associate-+r+86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in alpha around 0 65.8%
+-commutative65.8%
Simplified65.8%
if 2e18 < beta Initial program 81.5%
Taylor expanded in beta around inf 83.6%
Final simplification70.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.4e+15) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.4d+15) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4e+15) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.4e+15: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.4e+15) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.4e+15)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.4e+15], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.4 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 5.4e15Initial 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 alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in alpha around 0 63.7%
+-commutative63.7%
+-commutative63.7%
Simplified63.7%
if 5.4e15 < beta Initial program 81.5%
Taylor expanded in beta around inf 83.6%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ (+ beta alpha) 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
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 alpha around 0 86.5%
+-commutative86.5%
Simplified86.5%
Taylor expanded in beta around 0 86.0%
*-commutative86.0%
Simplified86.0%
Taylor expanded in alpha around 0 65.6%
+-commutative65.6%
Simplified65.6%
if 4.5 < beta Initial program 82.9%
Taylor expanded in beta around inf 79.5%
Final simplification69.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 (* beta 0.25)) (* (+ beta 2.0) (+ (+ beta alpha) 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + 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 <= 4.0d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * ((beta + 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 <= 4.0) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + 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 <= 4.0: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + 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 <= 4.0) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 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 <= 4.0)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + 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, 4.0], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $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 4:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4Initial program 99.8%
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 alpha around 0 86.5%
+-commutative86.5%
Simplified86.5%
Taylor expanded in beta around 0 86.0%
*-commutative86.0%
Simplified86.0%
Taylor expanded in alpha around 0 65.6%
+-commutative65.6%
Simplified65.6%
if 4 < beta Initial program 82.9%
Taylor expanded in beta around inf 79.5%
Taylor expanded in alpha around 0 79.3%
+-commutative79.3%
Simplified79.3%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 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 <= 4.2d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * (beta + 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 <= 4.2) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 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 <= 4.2: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 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 <= 4.2) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(beta + 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 <= 4.2)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 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, 4.2], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $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 4.2:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.8%
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 alpha around 0 86.5%
+-commutative86.5%
Simplified86.5%
Taylor expanded in beta around 0 86.0%
*-commutative86.0%
Simplified86.0%
Taylor expanded in alpha around 0 63.5%
+-commutative64.1%
+-commutative64.1%
Simplified63.5%
if 4.20000000000000018 < beta Initial program 82.9%
Taylor expanded in beta around inf 79.5%
Taylor expanded in alpha around 0 79.3%
+-commutative79.3%
Simplified79.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.15) (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.15) {
tmp = 0.5 / ((alpha + 2.0) * (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 <= 3.15d0) then
tmp = 0.5d0 / ((alpha + 2.0d0) * (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 <= 3.15) {
tmp = 0.5 / ((alpha + 2.0) * (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 <= 3.15: tmp = 0.5 / ((alpha + 2.0) * (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 <= 3.15) tmp = Float64(0.5 / Float64(Float64(alpha + 2.0) * 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 <= 3.15)
tmp = 0.5 / ((alpha + 2.0) * (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, 3.15], N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $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 3.15:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3.14999999999999991Initial program 99.8%
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 alpha around 0 86.5%
+-commutative86.5%
Simplified86.5%
Taylor expanded in beta around 0 85.3%
if 3.14999999999999991 < beta Initial program 82.9%
Taylor expanded in beta around inf 79.5%
Taylor expanded in alpha around 0 79.3%
+-commutative79.3%
Simplified79.3%
Final simplification83.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.05) (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))) (/ (+ 1.0 alpha) (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.05) {
tmp = 0.5 / ((alpha + 2.0) * (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 <= 3.05d0) then
tmp = 0.5d0 / ((alpha + 2.0d0) * (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 <= 3.05) {
tmp = 0.5 / ((alpha + 2.0) * (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 <= 3.05: tmp = 0.5 / ((alpha + 2.0) * (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 <= 3.05) tmp = Float64(0.5 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(1.0 + alpha) / 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 <= 3.05)
tmp = 0.5 / ((alpha + 2.0) * (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, 3.05], N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / 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 3.05:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.0499999999999998Initial program 99.8%
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 alpha around 0 86.5%
+-commutative86.5%
Simplified86.5%
Taylor expanded in beta around 0 85.3%
if 3.0499999999999998 < beta Initial program 82.9%
Taylor expanded in beta around inf 79.5%
*-un-lft-identity79.5%
associate-/l/82.6%
+-commutative82.6%
metadata-eval82.6%
associate-+l+82.6%
metadata-eval82.6%
associate-+r+82.6%
Applied egg-rr82.6%
*-lft-identity82.6%
+-commutative82.6%
*-commutative82.6%
associate-+r+82.6%
+-commutative82.6%
Simplified82.6%
Taylor expanded in alpha around 0 78.7%
+-commutative88.0%
Simplified78.7%
Final simplification83.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.5 / ((alpha + 2.0) * (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.6d0) then
tmp = 0.5d0 / ((alpha + 2.0d0) * (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.6) {
tmp = 0.5 / ((alpha + 2.0) * (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.6: tmp = 0.5 / ((alpha + 2.0) * (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.6) tmp = Float64(0.5 / Float64(Float64(alpha + 2.0) * 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.6)
tmp = 0.5 / ((alpha + 2.0) * (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.6], N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $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.6:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.8%
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 alpha around 0 86.5%
+-commutative86.5%
Simplified86.5%
Taylor expanded in beta around 0 85.3%
if 2.60000000000000009 < beta Initial program 82.9%
Taylor expanded in beta around inf 79.5%
Taylor expanded in alpha around 0 75.1%
associate-/r*76.2%
+-commutative76.2%
Simplified76.2%
Final simplification82.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ 1.0 beta) (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 / beta) / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (1.0d0 / beta) / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 / beta) / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 / beta) / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 / beta) / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 / beta) / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1}{\beta}}{\beta + 3}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 25.6%
Taylor expanded in alpha around 0 24.3%
associate-/r*24.7%
+-commutative24.7%
Simplified24.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / (beta * (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \left(\beta + 3\right)}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 25.6%
Taylor expanded in alpha around 0 24.3%
Final simplification24.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * 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 = 1.0d0 / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \beta}
\end{array}
Initial program 94.8%
Taylor expanded in beta around inf 25.6%
clear-num25.3%
inv-pow25.3%
metadata-eval25.3%
associate-+l+25.3%
metadata-eval25.3%
associate-+r+25.3%
+-commutative25.3%
Applied egg-rr25.3%
unpow-125.3%
associate-+r+25.3%
+-commutative25.3%
+-commutative25.3%
Simplified25.3%
Taylor expanded in alpha around 0 24.3%
+-commutative24.3%
Simplified24.3%
Taylor expanded in beta around inf 24.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / 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.25d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta}
\end{array}
Initial program 94.8%
associate-/l/93.6%
+-commutative93.6%
associate-+l+93.6%
*-commutative93.6%
metadata-eval93.6%
associate-+l+93.6%
metadata-eval93.6%
+-commutative93.6%
+-commutative93.6%
+-commutative93.6%
metadata-eval93.6%
metadata-eval93.6%
associate-+l+93.6%
Simplified93.6%
Taylor expanded in alpha around 0 85.9%
+-commutative85.9%
Simplified85.9%
Taylor expanded in beta around 0 77.8%
*-commutative77.8%
Simplified77.8%
Taylor expanded in beta around inf 4.0%
herbie shell --seed 2024136
(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)))