
(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 18 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
(/
(/
(+ 1.0 alpha)
(*
(+ (+ (/ 2.0 (+ 1.0 beta)) (/ alpha (+ 1.0 beta))) (/ beta (+ 1.0 beta)))
(+ alpha (+ 2.0 beta))))
(+ alpha (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / ((((2.0 / (1.0 + beta)) + (alpha / (1.0 + beta))) + (beta / (1.0 + beta))) * (alpha + (2.0 + beta)))) / (alpha + (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) / ((((2.0d0 / (1.0d0 + beta)) + (alpha / (1.0d0 + beta))) + (beta / (1.0d0 + beta))) * (alpha + (2.0d0 + beta)))) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / ((((2.0 / (1.0 + beta)) + (alpha / (1.0 + beta))) + (beta / (1.0 + beta))) * (alpha + (2.0 + beta)))) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / ((((2.0 / (1.0 + beta)) + (alpha / (1.0 + beta))) + (beta / (1.0 + beta))) * (alpha + (2.0 + beta)))) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(Float64(2.0 / Float64(1.0 + beta)) + Float64(alpha / Float64(1.0 + beta))) + Float64(beta / Float64(1.0 + beta))) * Float64(alpha + Float64(2.0 + beta)))) / Float64(alpha + Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / ((((2.0 / (1.0 + beta)) + (alpha / (1.0 + beta))) + (beta / (1.0 + beta))) * (alpha + (2.0 + beta)))) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(N[(2.0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] + N[(alpha / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(beta / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1 + \alpha}{\left(\left(\frac{2}{1 + \beta} + \frac{\alpha}{1 + \beta}\right) + \frac{\beta}{1 + \beta}\right) \cdot \left(\alpha + \left(2 + \beta\right)\right)}}{\alpha + \left(\beta + 3\right)}
\end{array}
Initial program 94.0%
Simplified97.3%
clear-num97.3%
associate-+r+97.3%
*-commutative97.3%
frac-times92.7%
*-un-lft-identity92.7%
+-commutative92.7%
*-commutative92.7%
associate-+r+92.7%
Applied egg-rr92.7%
associate-/r*97.3%
associate-/l*92.6%
associate-*l/97.3%
*-commutative97.3%
times-frac99.8%
associate-/r*97.3%
*-commutative97.3%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
clear-num99.7%
inv-pow99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
unpow-199.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
frac-times99.6%
*-un-lft-identity99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in alpha around 0 99.6%
associate-+r+99.6%
associate-*r/99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification99.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ 2.0 beta))))
(if (<= beta 36000000000.0)
(* (/ (- -1.0 alpha) t_1) (/ (- -1.0 beta) (* t_1 t_0)))
(/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta (* alpha 2.0)))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 36000000000.0) {
tmp = ((-1.0 - alpha) / t_1) * ((-1.0 - beta) / (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (2.0d0 + beta)
if (beta <= 36000000000.0d0) then
tmp = (((-1.0d0) - alpha) / t_1) * (((-1.0d0) - beta) / (t_1 * t_0))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + (alpha * 2.0d0)))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (2.0 + beta);
double tmp;
if (beta <= 36000000000.0) {
tmp = ((-1.0 - alpha) / t_1) * ((-1.0 - beta) / (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (2.0 + beta) tmp = 0 if beta <= 36000000000.0: tmp = ((-1.0 - alpha) / t_1) * ((-1.0 - beta) / (t_1 * t_0)) else: tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(2.0 + beta)) tmp = 0.0 if (beta <= 36000000000.0) tmp = Float64(Float64(Float64(-1.0 - alpha) / t_1) * Float64(Float64(-1.0 - beta) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + Float64(alpha * 2.0)))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (2.0 + beta);
tmp = 0.0;
if (beta <= 36000000000.0)
tmp = ((-1.0 - alpha) / t_1) * ((-1.0 - beta) / (t_1 * t_0));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 36000000000.0], N[(N[(N[(-1.0 - alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(-1.0 - beta), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(2 + \beta\right)\\
\mathbf{if}\;\beta \leq 36000000000:\\
\;\;\;\;\frac{-1 - \alpha}{t_1} \cdot \frac{-1 - \beta}{t_1 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha \cdot 2\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 3.6e10Initial program 99.8%
Simplified99.7%
if 3.6e10 < beta Initial program 81.3%
Simplified92.0%
clear-num92.0%
associate-+r+92.0%
*-commutative92.0%
frac-times77.3%
*-un-lft-identity77.3%
+-commutative77.3%
*-commutative77.3%
associate-+r+77.3%
Applied egg-rr77.3%
associate-/r*92.1%
associate-/l*77.0%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*92.0%
*-commutative92.0%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
clear-num99.5%
inv-pow99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
unpow-199.5%
+-commutative99.5%
Simplified99.5%
associate-*l/99.7%
+-commutative99.7%
frac-times99.5%
*-un-lft-identity99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 87.1%
Final simplification95.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ 2.0 beta)))) (* (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 alpha) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (2.0d0 + beta)
code = (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + alpha) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + alpha) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = (((1.0 + beta) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + alpha) / t_0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \beta}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \alpha}{t_0}
\end{array}
\end{array}
Initial program 94.0%
Simplified97.3%
clear-num97.3%
associate-+r+97.3%
*-commutative97.3%
frac-times92.7%
*-un-lft-identity92.7%
+-commutative92.7%
*-commutative92.7%
associate-+r+92.7%
Applied egg-rr92.7%
associate-/r*97.3%
associate-/l*92.6%
associate-*l/97.3%
*-commutative97.3%
times-frac99.8%
associate-/r*97.3%
*-commutative97.3%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ 2.0 beta)))) (/ (/ (+ 1.0 alpha) (* t_0 (/ t_0 (+ 1.0 beta)))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return ((1.0 + alpha) / (t_0 * (t_0 / (1.0 + beta)))) / (alpha + (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (2.0d0 + beta)
code = ((1.0d0 + alpha) / (t_0 * (t_0 / (1.0d0 + beta)))) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return ((1.0 + alpha) / (t_0 * (t_0 / (1.0 + beta)))) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return ((1.0 + alpha) / (t_0 * (t_0 / (1.0 + beta)))) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(t_0 / Float64(1.0 + beta)))) / Float64(alpha + Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = ((1.0 + alpha) / (t_0 * (t_0 / (1.0 + beta)))) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t_0 \cdot \frac{t_0}{1 + \beta}}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.0%
Simplified97.3%
clear-num97.3%
associate-+r+97.3%
*-commutative97.3%
frac-times92.7%
*-un-lft-identity92.7%
+-commutative92.7%
*-commutative92.7%
associate-+r+92.7%
Applied egg-rr92.7%
associate-/r*97.3%
associate-/l*92.6%
associate-*l/97.3%
*-commutative97.3%
times-frac99.8%
associate-/r*97.3%
*-commutative97.3%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
clear-num99.7%
inv-pow99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
unpow-199.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
frac-times99.6%
*-un-lft-identity99.6%
associate-+r+99.6%
+-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
Final simplification99.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))))
(if (<= beta 2000000000.0)
(* (/ (/ (+ 1.0 beta) (+ alpha (+ 2.0 beta))) t_0) (/ 1.0 (+ 2.0 beta)))
(/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta (* alpha 2.0)))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 2000000000.0) {
tmp = (((1.0 + beta) / (alpha + (2.0 + beta))) / t_0) * (1.0 / (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 2000000000.0d0) then
tmp = (((1.0d0 + beta) / (alpha + (2.0d0 + beta))) / t_0) * (1.0d0 / (2.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + (alpha * 2.0d0)))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 2000000000.0) {
tmp = (((1.0 + beta) / (alpha + (2.0 + beta))) / t_0) * (1.0 / (2.0 + beta));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 2000000000.0: tmp = (((1.0 + beta) / (alpha + (2.0 + beta))) / t_0) * (1.0 / (2.0 + beta)) else: tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 2000000000.0) tmp = Float64(Float64(Float64(Float64(1.0 + beta) / Float64(alpha + Float64(2.0 + beta))) / t_0) * Float64(1.0 / Float64(2.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + Float64(alpha * 2.0)))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 2000000000.0)
tmp = (((1.0 + beta) / (alpha + (2.0 + beta))) / t_0) * (1.0 / (2.0 + beta));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2000000000.0], N[(N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 2000000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\alpha + \left(2 + \beta\right)}}{t_0} \cdot \frac{1}{2 + \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha \cdot 2\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 2e9Initial program 99.8%
Simplified99.7%
clear-num99.7%
associate-+r+99.7%
*-commutative99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
associate-/r*99.7%
associate-/l*99.7%
associate-*l/99.7%
*-commutative99.7%
times-frac99.8%
associate-/r*99.7%
*-commutative99.7%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 82.6%
if 2e9 < beta Initial program 81.3%
Simplified92.0%
clear-num92.0%
associate-+r+92.0%
*-commutative92.0%
frac-times77.3%
*-un-lft-identity77.3%
+-commutative77.3%
*-commutative77.3%
associate-+r+77.3%
Applied egg-rr77.3%
associate-/r*92.1%
associate-/l*77.0%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*92.0%
*-commutative92.0%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
clear-num99.5%
inv-pow99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
unpow-199.5%
+-commutative99.5%
Simplified99.5%
associate-*l/99.7%
+-commutative99.7%
frac-times99.5%
*-un-lft-identity99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 87.1%
Final simplification84.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))))
(if (<= beta 34000000.0)
(/ (+ 1.0 beta) (* (+ 2.0 beta) (* (+ alpha (+ 2.0 beta)) t_0)))
(/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta (* alpha 2.0)))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 34000000.0) {
tmp = (1.0 + beta) / ((2.0 + beta) * ((alpha + (2.0 + beta)) * t_0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 34000000.0d0) then
tmp = (1.0d0 + beta) / ((2.0d0 + beta) * ((alpha + (2.0d0 + beta)) * t_0))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + (alpha * 2.0d0)))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 34000000.0) {
tmp = (1.0 + beta) / ((2.0 + beta) * ((alpha + (2.0 + beta)) * t_0));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 34000000.0: tmp = (1.0 + beta) / ((2.0 + beta) * ((alpha + (2.0 + beta)) * t_0)) else: tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 34000000.0) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + beta) * Float64(Float64(alpha + Float64(2.0 + beta)) * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + Float64(alpha * 2.0)))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 34000000.0)
tmp = (1.0 + beta) / ((2.0 + beta) * ((alpha + (2.0 + beta)) * t_0));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 34000000.0], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] * N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 34000000:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \beta\right) \cdot \left(\left(\alpha + \left(2 + \beta\right)\right) \cdot t_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha \cdot 2\right)}}{t_0}\\
\end{array}
\end{array}
if beta < 3.4e7Initial program 99.8%
Simplified99.7%
clear-num99.7%
associate-+r+99.7%
*-commutative99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
*-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 82.6%
if 3.4e7 < beta Initial program 81.3%
Simplified92.0%
clear-num92.0%
associate-+r+92.0%
*-commutative92.0%
frac-times77.3%
*-un-lft-identity77.3%
+-commutative77.3%
*-commutative77.3%
associate-+r+77.3%
Applied egg-rr77.3%
associate-/r*92.1%
associate-/l*77.0%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*92.0%
*-commutative92.0%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
clear-num99.5%
inv-pow99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
unpow-199.5%
+-commutative99.5%
Simplified99.5%
associate-*l/99.7%
+-commutative99.7%
frac-times99.5%
*-un-lft-identity99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 87.1%
Final simplification84.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 100000000.0)
(/
(/ (+ 1.0 beta) (+ 2.0 beta))
(* (+ alpha (+ 2.0 beta)) (+ 3.0 (+ alpha beta))))
(/
(/ (+ 1.0 alpha) (+ 3.0 (+ beta (* alpha 2.0))))
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 100000000.0) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (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 <= 100000000.0d0) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((alpha + (2.0d0 + beta)) * (3.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + (alpha * 2.0d0)))) / (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 <= 100000000.0) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (3.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 100000000.0: tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (3.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 100000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + Float64(alpha * 2.0)))) / 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 <= 100000000.0)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (3.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (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, 100000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 100000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha \cdot 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1e8Initial program 99.8%
associate-/l/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 82.6%
if 1e8 < beta Initial program 81.3%
Simplified92.0%
clear-num92.0%
associate-+r+92.0%
*-commutative92.0%
frac-times77.3%
*-un-lft-identity77.3%
+-commutative77.3%
*-commutative77.3%
associate-+r+77.3%
Applied egg-rr77.3%
associate-/r*92.1%
associate-/l*77.0%
associate-*l/92.1%
*-commutative92.1%
times-frac99.6%
associate-/r*92.0%
*-commutative92.0%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
clear-num99.5%
inv-pow99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
unpow-199.5%
+-commutative99.5%
Simplified99.5%
associate-*l/99.7%
+-commutative99.7%
frac-times99.5%
*-un-lft-identity99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 87.1%
Final simplification84.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.0)
(/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta))))
(/
(/ (+ 1.0 alpha) (+ 3.0 (+ beta (* alpha 2.0))))
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.0) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (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.0d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / (3.0d0 + (beta + (alpha * 2.0d0)))) / (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.0) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.0: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.0) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + Float64(alpha * 2.0)))) / 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.0)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / (3.0 + (beta + (alpha * 2.0)))) / (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.0], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha \cdot 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 68.0%
if 1 < beta Initial program 81.8%
Simplified92.2%
clear-num92.2%
associate-+r+92.2%
*-commutative92.2%
frac-times77.8%
*-un-lft-identity77.8%
+-commutative77.8%
*-commutative77.8%
associate-+r+77.8%
Applied egg-rr77.8%
associate-/r*92.3%
associate-/l*77.6%
associate-*l/92.3%
*-commutative92.3%
times-frac99.6%
associate-/r*92.2%
*-commutative92.2%
associate-/r*99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
clear-num99.5%
inv-pow99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
unpow-199.5%
+-commutative99.5%
Simplified99.5%
associate-*l/99.7%
+-commutative99.7%
frac-times99.5%
*-un-lft-identity99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 85.1%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 2.0 (+ alpha beta)))) (if (<= beta 5.0) (/ 0.25 (+ 1.0 t_0)) (/ (/ (+ 1.0 alpha) t_0) beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 5.0) {
tmp = 0.25 / (1.0 + t_0);
} else {
tmp = ((1.0 + alpha) / t_0) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 5.0d0) then
tmp = 0.25d0 / (1.0d0 + t_0)
else
tmp = ((1.0d0 + alpha) / t_0) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 5.0) {
tmp = 0.25 / (1.0 + t_0);
} else {
tmp = ((1.0 + alpha) / t_0) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 5.0: tmp = 0.25 / (1.0 + t_0) else: tmp = ((1.0 + alpha) / t_0) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 5.0) tmp = Float64(0.25 / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 5.0)
tmp = 0.25 / (1.0 + t_0);
else
tmp = ((1.0 + alpha) / t_0) / 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[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.0], N[(0.25 / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 5:\\
\;\;\;\;\frac{0.25}{1 + t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta}\\
\end{array}
\end{array}
if beta < 5Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 68.0%
if 5 < beta Initial program 81.8%
Simplified92.2%
Taylor expanded in beta around inf 84.0%
un-div-inv84.2%
+-commutative84.2%
associate-+r+84.2%
+-commutative84.2%
+-commutative84.2%
Applied egg-rr84.2%
Final simplification73.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 66.1%
+-commutative66.1%
Simplified66.1%
Taylor expanded in beta around 0 66.1%
*-commutative66.1%
Simplified66.1%
if 2.7999999999999998 < beta Initial program 81.8%
Simplified92.2%
Taylor expanded in beta around inf 84.0%
Taylor expanded in beta around inf 83.9%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.6) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (* (/ (+ 1.0 alpha) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.6d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((1.0d0 + alpha) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.6: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((1.0 + alpha) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.6) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.6)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((1.0 + alpha) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.6], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.6:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 7.5999999999999996Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 68.0%
if 7.5999999999999996 < beta Initial program 81.8%
Simplified92.2%
Taylor expanded in beta around inf 84.0%
Taylor expanded in beta around inf 83.9%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.3) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} 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.3d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
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.3) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} 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.3: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) 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.3) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); 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.3)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
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.3], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $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.3:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.29999999999999982Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 68.0%
if 4.29999999999999982 < beta Initial program 81.8%
Taylor expanded in beta around -inf 84.2%
Taylor expanded in alpha around 0 84.1%
Final simplification73.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} 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.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
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.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) 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.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
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.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 66.1%
+-commutative66.1%
Simplified66.1%
Taylor expanded in beta around 0 66.1%
*-commutative66.1%
Simplified66.1%
if 2.5 < beta Initial program 81.8%
Taylor expanded in beta around -inf 84.2%
Taylor expanded in alpha around 0 76.5%
Final simplification69.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.25 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.7d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.25 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.7], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 66.1%
+-commutative66.1%
Simplified66.1%
Taylor expanded in beta around 0 66.1%
*-commutative66.1%
Simplified66.1%
if 2.7000000000000002 < beta Initial program 81.8%
Taylor expanded in beta around 0 22.7%
Taylor expanded in alpha around 0 6.9%
+-commutative6.9%
Simplified6.9%
Taylor expanded in beta around inf 6.9%
Final simplification47.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) 0.08333333333333333 (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / 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.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = 0.08333333333333333; else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.08333333333333333;
else
tmp = 0.25 / 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.0], 0.08333333333333333, N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.8%
Taylor expanded in beta around 0 99.1%
Taylor expanded in alpha around 0 66.1%
+-commutative66.1%
Simplified66.1%
Taylor expanded in beta around 0 65.7%
if 3 < beta Initial program 81.8%
Taylor expanded in beta around 0 22.7%
Taylor expanded in alpha around 0 6.9%
+-commutative6.9%
Simplified6.9%
Taylor expanded in beta around inf 6.9%
Final simplification46.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ 2.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (2.0d0 + beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (2.0 + beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (2.0 + beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(2.0 + beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (2.0 + beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{2 + \beta}
\end{array}
Initial program 94.0%
Simplified84.3%
Taylor expanded in beta around 0 79.8%
Taylor expanded in beta around 0 71.5%
+-commutative71.5%
Simplified71.5%
Taylor expanded in alpha around 0 46.9%
+-commutative46.9%
Simplified46.9%
Final simplification46.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (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 = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 94.0%
Taylor expanded in beta around 0 74.7%
Taylor expanded in alpha around 0 47.1%
+-commutative47.1%
Simplified47.1%
Final simplification47.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.0%
Taylor expanded in beta around 0 74.7%
Taylor expanded in alpha around 0 47.1%
+-commutative47.1%
Simplified47.1%
Taylor expanded in beta around 0 46.0%
Final simplification46.0%
herbie shell --seed 2023333
(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)))